/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 01:56:26,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 01:56:26,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 01:56:26,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 01:56:26,609 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 01:56:26,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 01:56:26,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 01:56:26,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 01:56:26,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 01:56:26,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 01:56:26,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 01:56:26,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 01:56:26,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 01:56:26,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 01:56:26,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 01:56:26,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 01:56:26,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 01:56:26,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 01:56:26,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 01:56:26,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 01:56:26,640 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 01:56:26,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 01:56:26,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 01:56:26,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 01:56:26,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 01:56:26,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 01:56:26,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 01:56:26,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 01:56:26,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 01:56:26,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 01:56:26,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 01:56:26,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 01:56:26,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 01:56:26,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 01:56:26,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 01:56:26,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 01:56:26,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 01:56:26,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 01:56:26,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 01:56:26,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 01:56:26,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 01:56:26,660 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 01:56:26,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 01:56:26,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 01:56:26,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 01:56:26,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 01:56:26,692 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 01:56:26,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 01:56:26,693 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 01:56:26,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 01:56:26,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 01:56:26,693 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 01:56:26,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 01:56:26,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 01:56:26,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 01:56:26,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 01:56:26,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 01:56:26,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 01:56:26,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 01:56:26,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 01:56:26,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 01:56:26,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 01:56:26,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 01:56:26,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:56:26,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 01:56:26,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 01:56:26,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 01:56:26,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 01:56:26,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 01:56:26,696 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 01:56:26,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 01:56:27,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 01:56:27,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 01:56:27,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 01:56:27,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 01:56:27,029 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 01:56:27,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2022-12-13 01:56:28,044 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 01:56:28,204 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 01:56:28,205 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-figure1-alt.wvr.c [2022-12-13 01:56:28,212 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e52fde17/3e4c04d685964e8bac70a670f3fd1bdb/FLAGf896d33d0 [2022-12-13 01:56:28,233 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e52fde17/3e4c04d685964e8bac70a670f3fd1bdb [2022-12-13 01:56:28,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 01:56:28,237 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 01:56:28,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 01:56:28,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 01:56:28,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 01:56:28,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3cb6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28, skipping insertion in model container [2022-12-13 01:56:28,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 01:56:28,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 01:56:28,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:56:28,407 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:56:28,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:56:28,414 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:56:28,421 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/popl20-figure1-alt.wvr.c[2087,2100] [2022-12-13 01:56:28,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:56:28,434 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 01:56:28,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:56:28,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:56:28,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 01:56:28,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 01:56:28,458 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/popl20-figure1-alt.wvr.c[2087,2100] [2022-12-13 01:56:28,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 01:56:28,471 INFO L208 MainTranslator]: Completed translation [2022-12-13 01:56:28,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28 WrapperNode [2022-12-13 01:56:28,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 01:56:28,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 01:56:28,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 01:56:28,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 01:56:28,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,498 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2022-12-13 01:56:28,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 01:56:28,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 01:56:28,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 01:56:28,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 01:56:28,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,526 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 01:56:28,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 01:56:28,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 01:56:28,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 01:56:28,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (1/1) ... [2022-12-13 01:56:28,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 01:56:28,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 01:56:28,553 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 01:56:28,558 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 01:56:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 01:56:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 01:56:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 01:56:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 01:56:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 01:56:28,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 01:56:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 01:56:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 01:56:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 01:56:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 01:56:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 01:56:28,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 01:56:28,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 01:56:28,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 01:56:28,595 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 01:56:28,668 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 01:56:28,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 01:56:28,860 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 01:56:28,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 01:56:28,888 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 01:56:28,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:56:28 BoogieIcfgContainer [2022-12-13 01:56:28,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 01:56:28,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 01:56:28,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 01:56:28,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 01:56:28,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:56:28" (1/3) ... [2022-12-13 01:56:28,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482750e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:56:28, skipping insertion in model container [2022-12-13 01:56:28,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:56:28" (2/3) ... [2022-12-13 01:56:28,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482750e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:56:28, skipping insertion in model container [2022-12-13 01:56:28,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:56:28" (3/3) ... [2022-12-13 01:56:28,907 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2022-12-13 01:56:28,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 01:56:28,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 01:56:28,935 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 01:56:28,989 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 01:56:29,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 180 flow [2022-12-13 01:56:29,084 INFO L130 PetriNetUnfolder]: 6/80 cut-off events. [2022-12-13 01:56:29,084 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:56:29,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 6/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-13 01:56:29,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 82 transitions, 180 flow [2022-12-13 01:56:29,093 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 72 transitions, 156 flow [2022-12-13 01:56:29,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:29,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 72 transitions, 156 flow [2022-12-13 01:56:29,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 72 transitions, 156 flow [2022-12-13 01:56:29,174 INFO L130 PetriNetUnfolder]: 6/72 cut-off events. [2022-12-13 01:56:29,174 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:56:29,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-13 01:56:29,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 72 transitions, 156 flow [2022-12-13 01:56:29,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-13 01:56:31,128 INFO L241 LiptonReduction]: Total number of compositions: 57 [2022-12-13 01:56:31,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 01:56:31,144 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;@63d88d2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 01:56:31,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 01:56:31,147 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-13 01:56:31,147 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:56:31,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:31,148 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:31,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:31,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:31,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1479609409, now seen corresponding path program 1 times [2022-12-13 01:56:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964929448] [2022-12-13 01:56:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:31,713 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 01:56:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964929448] [2022-12-13 01:56:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964929448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:31,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 01:56:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380289608] [2022-12-13 01:56:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:31,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 01:56:31,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 01:56:31,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-13 01:56:31,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 01:56:31,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:31,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:31,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 01:56:31,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:31,840 INFO L130 PetriNetUnfolder]: 62/126 cut-off events. [2022-12-13 01:56:31,841 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 01:56:31,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 126 events. 62/126 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 359 event pairs, 14 based on Foata normal form. 1/103 useless extension candidates. Maximal degree in co-relation 200. Up to 63 conditions per place. [2022-12-13 01:56:31,843 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 32 selfloop transitions, 8 changer transitions 5/45 dead transitions. [2022-12-13 01:56:31,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 45 transitions, 213 flow [2022-12-13 01:56:31,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 01:56:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 01:56:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-12-13 01:56:31,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2022-12-13 01:56:31,874 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 7 states and 47 transitions. [2022-12-13 01:56:31,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 45 transitions, 213 flow [2022-12-13 01:56:31,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:31,878 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 89 flow [2022-12-13 01:56:31,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=89, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2022-12-13 01:56:31,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 7 predicate places. [2022-12-13 01:56:31,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:31,882 INFO L89 Accepts]: Start accepts. Operand has 27 places, 22 transitions, 89 flow [2022-12-13 01:56:31,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:31,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:31,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 89 flow [2022-12-13 01:56:31,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 89 flow [2022-12-13 01:56:31,890 INFO L130 PetriNetUnfolder]: 6/32 cut-off events. [2022-12-13 01:56:31,890 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 01:56:31,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 32 events. 6/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 58. Up to 8 conditions per place. [2022-12-13 01:56:31,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 89 flow [2022-12-13 01:56:31,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 01:56:31,925 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_1| v_~N2~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N2~0=v_~N2~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N2~0=v_~N2~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [301] L41-4-->L41-4: Formula: (and (= v_~counter~0_104 (+ v_~counter~0_105 1)) (= (+ v_thread1Thread1of1ForFork0_~i~0_36 1) v_thread1Thread1of1ForFork0_~i~0_35) (< v_thread1Thread1of1ForFork0_~i~0_36 v_~N1~0_59)) InVars {~counter~0=v_~counter~0_105, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_36, ~N1~0=v_~N1~0_59} OutVars{~counter~0=v_~counter~0_104, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, ~N1~0=v_~N1~0_59} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:56:31,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [304] L51-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_In_1| v_~N2~0_In_3)) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N2~0=v_~N2~0_In_3} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_In_1|, ~N2~0=v_~N2~0_In_3, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [306] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_39 1) (< v_thread1Thread1of1ForFork0_~i~0_39 (+ v_~N1~0_61 1)) (= v_~counter~0_108 (+ v_~counter~0_109 1))) InVars {~counter~0=v_~counter~0_109, ~N1~0=v_~N1~0_61} OutVars{~counter~0=v_~counter~0_108, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_39, ~N1~0=v_~N1~0_61} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:56:32,062 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [222] $Ultimate##0-->L51-4: Formula: (= |v_thread2Thread1of1ForFork1_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1#1] and [301] L41-4-->L41-4: Formula: (and (= v_~counter~0_104 (+ v_~counter~0_105 1)) (= (+ v_thread1Thread1of1ForFork0_~i~0_36 1) v_thread1Thread1of1ForFork0_~i~0_35) (< v_thread1Thread1of1ForFork0_~i~0_36 v_~N1~0_59)) InVars {~counter~0=v_~counter~0_105, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_36, ~N1~0=v_~N1~0_59} OutVars{~counter~0=v_~counter~0_104, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_35, ~N1~0=v_~N1~0_59} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0] [2022-12-13 01:56:32,151 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 01:56:32,152 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-13 01:56:32,152 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 97 flow [2022-12-13 01:56:32,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:32,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:32,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 01:56:32,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:32,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1808750886, now seen corresponding path program 1 times [2022-12-13 01:56:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:32,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671360489] [2022-12-13 01:56:32,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:32,357 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 01:56:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:32,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671360489] [2022-12-13 01:56:32,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671360489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:32,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:32,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:56:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975891644] [2022-12-13 01:56:32,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:56:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:56:32,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:56:32,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-13 01:56:32,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:32,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:32,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-13 01:56:32,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:32,430 INFO L130 PetriNetUnfolder]: 46/100 cut-off events. [2022-12-13 01:56:32,430 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2022-12-13 01:56:32,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 100 events. 46/100 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 298 event pairs, 1 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 303. Up to 57 conditions per place. [2022-12-13 01:56:32,431 INFO L137 encePairwiseOnDemand]: 10/19 looper letters, 24 selfloop transitions, 7 changer transitions 8/40 dead transitions. [2022-12-13 01:56:32,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 40 transitions, 238 flow [2022-12-13 01:56:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:56:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:56:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 01:56:32,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40350877192982454 [2022-12-13 01:56:32,432 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 97 flow. Second operand 6 states and 46 transitions. [2022-12-13 01:56:32,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 40 transitions, 238 flow [2022-12-13 01:56:32,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 212 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-13 01:56:32,434 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 107 flow [2022-12-13 01:56:32,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2022-12-13 01:56:32,435 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-13 01:56:32,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:32,435 INFO L89 Accepts]: Start accepts. Operand has 29 places, 21 transitions, 107 flow [2022-12-13 01:56:32,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:32,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:32,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 21 transitions, 107 flow [2022-12-13 01:56:32,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 21 transitions, 107 flow [2022-12-13 01:56:32,439 INFO L130 PetriNetUnfolder]: 7/37 cut-off events. [2022-12-13 01:56:32,439 INFO L131 PetriNetUnfolder]: For 27/32 co-relation queries the response was YES. [2022-12-13 01:56:32,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 37 events. 7/37 cut-off events. For 27/32 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 86 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 78. Up to 9 conditions per place. [2022-12-13 01:56:32,440 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 21 transitions, 107 flow [2022-12-13 01:56:32,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 01:56:32,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] and [311] $Ultimate##0-->L41-4: Formula: (and (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_19|) (not (< |v_thread2Thread1of1ForFork1_~i~1#1_43| v_~N2~0_75)) (= |v_thread2Thread1of1ForFork1_#res#1.offset_19| 0) (= v_thread1Thread1of1ForFork0_~i~0_53 (+ v_thread1Thread1of1ForFork0_~i~0_54 1)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_43|) (< v_thread1Thread1of1ForFork0_~i~0_54 v_~N1~0_69) (= v_~counter~0_124 (+ v_~counter~0_125 1))) InVars {~counter~0=v_~counter~0_125, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_54, ~N1~0=v_~N1~0_69, ~N2~0=v_~N2~0_75} OutVars{~counter~0=v_~counter~0_124, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_31|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_53, ~N1~0=v_~N1~0_69, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_43|, ~N2~0=v_~N2~0_75} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:56:32,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [212] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] and [310] $Ultimate##0-->L41-4: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_50 v_~N1~0_67) (= v_~counter~0_120 (+ v_~counter~0_121 1)) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_41|) (= v_thread1Thread1of1ForFork0_~i~0_49 (+ v_thread1Thread1of1ForFork0_~i~0_50 1))) InVars {~counter~0=v_~counter~0_121, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_50, ~N1~0=v_~N1~0_67} OutVars{~counter~0=v_~counter~0_120, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_29|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_25|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_49, ~N1~0=v_~N1~0_67, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_41|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:56:32,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:32,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 01:56:32,526 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 114 flow [2022-12-13 01:56:32,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:32,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:32,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:32,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 01:56:32,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2119806215, now seen corresponding path program 1 times [2022-12-13 01:56:32,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:32,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240521583] [2022-12-13 01:56:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:32,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:32,627 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 01:56:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:32,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240521583] [2022-12-13 01:56:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240521583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:32,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:32,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606561977] [2022-12-13 01:56:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:32,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:32,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:32,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 01:56:32,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:32,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:32,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 01:56:32,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:32,686 INFO L130 PetriNetUnfolder]: 45/101 cut-off events. [2022-12-13 01:56:32,686 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-13 01:56:32,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 101 events. 45/101 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 302 event pairs, 9 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 312. Up to 55 conditions per place. [2022-12-13 01:56:32,687 INFO L137 encePairwiseOnDemand]: 12/20 looper letters, 23 selfloop transitions, 6 changer transitions 5/35 dead transitions. [2022-12-13 01:56:32,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 221 flow [2022-12-13 01:56:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 01:56:32,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 01:56:32,688 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 114 flow. Second operand 5 states and 40 transitions. [2022-12-13 01:56:32,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 221 flow [2022-12-13 01:56:32,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 200 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 01:56:32,690 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 120 flow [2022-12-13 01:56:32,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-13 01:56:32,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:56:32,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:32,691 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 120 flow [2022-12-13 01:56:32,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:32,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:32,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 120 flow [2022-12-13 01:56:32,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 120 flow [2022-12-13 01:56:32,694 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-13 01:56:32,695 INFO L131 PetriNetUnfolder]: For 36/42 co-relation queries the response was YES. [2022-12-13 01:56:32,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 38 events. 7/38 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 87. Up to 9 conditions per place. [2022-12-13 01:56:32,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 120 flow [2022-12-13 01:56:32,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-13 01:56:32,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:32,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:56:32,823 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 115 flow [2022-12-13 01:56:32,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:32,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:32,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:32,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 01:56:32,823 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash -106655702, now seen corresponding path program 2 times [2022-12-13 01:56:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:32,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900571933] [2022-12-13 01:56:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:32,981 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 01:56:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:32,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900571933] [2022-12-13 01:56:32,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900571933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:32,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:32,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:56:32,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668308783] [2022-12-13 01:56:32,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:32,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:56:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:56:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:56:32,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 01:56:32,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:32,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:32,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 01:56:32,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:33,046 INFO L130 PetriNetUnfolder]: 43/91 cut-off events. [2022-12-13 01:56:33,047 INFO L131 PetriNetUnfolder]: For 95/95 co-relation queries the response was YES. [2022-12-13 01:56:33,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 91 events. 43/91 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 259 event pairs, 1 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 302. Up to 57 conditions per place. [2022-12-13 01:56:33,048 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 15 selfloop transitions, 5 changer transitions 15/36 dead transitions. [2022-12-13 01:56:33,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 230 flow [2022-12-13 01:56:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:56:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:56:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-12-13 01:56:33,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-13 01:56:33,050 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 115 flow. Second operand 6 states and 42 transitions. [2022-12-13 01:56:33,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 230 flow [2022-12-13 01:56:33,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 210 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:33,053 INFO L231 Difference]: Finished difference. Result has 31 places, 18 transitions, 87 flow [2022-12-13 01:56:33,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=87, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2022-12-13 01:56:33,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:56:33,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:33,054 INFO L89 Accepts]: Start accepts. Operand has 31 places, 18 transitions, 87 flow [2022-12-13 01:56:33,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:33,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:33,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 18 transitions, 87 flow [2022-12-13 01:56:33,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 87 flow [2022-12-13 01:56:33,058 INFO L130 PetriNetUnfolder]: 7/26 cut-off events. [2022-12-13 01:56:33,058 INFO L131 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-12-13 01:56:33,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 26 events. 7/26 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 55. Up to 8 conditions per place. [2022-12-13 01:56:33,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 87 flow [2022-12-13 01:56:33,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-13 01:56:33,061 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:56:33,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 01:56:33,067 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 87 flow [2022-12-13 01:56:33,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:33,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:33,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 01:56:33,067 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:33,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:33,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2060644477, now seen corresponding path program 1 times [2022-12-13 01:56:33,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:33,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127178374] [2022-12-13 01:56:33,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:33,191 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 01:56:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:33,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127178374] [2022-12-13 01:56:33,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127178374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:33,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:33,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562902921] [2022-12-13 01:56:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:33,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:33,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 01:56:33,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:33,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 01:56:33,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:33,279 INFO L130 PetriNetUnfolder]: 36/72 cut-off events. [2022-12-13 01:56:33,280 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-13 01:56:33,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 72 events. 36/72 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 0 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 214. Up to 55 conditions per place. [2022-12-13 01:56:33,281 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 16 selfloop transitions, 6 changer transitions 5/28 dead transitions. [2022-12-13 01:56:33,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 168 flow [2022-12-13 01:56:33,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:33,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 01:56:33,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 01:56:33,282 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 87 flow. Second operand 5 states and 33 transitions. [2022-12-13 01:56:33,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 168 flow [2022-12-13 01:56:33,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 28 transitions, 130 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 01:56:33,283 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 01:56:33,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-13 01:56:33,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:33,285 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:33,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:33,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 76 flow [2022-12-13 01:56:33,289 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 01:56:33,289 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 01:56:33,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 49. Up to 8 conditions per place. [2022-12-13 01:56:33,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 76 flow [2022-12-13 01:56:33,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 01:56:33,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:33,416 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:56:33,417 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 73 flow [2022-12-13 01:56:33,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:33,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:33,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 01:56:33,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:33,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2003386175, now seen corresponding path program 1 times [2022-12-13 01:56:33,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:33,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506808877] [2022-12-13 01:56:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:33,520 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 01:56:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506808877] [2022-12-13 01:56:33,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506808877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:33,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:33,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177590014] [2022-12-13 01:56:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:33,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:33,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 01:56:33,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:33,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 01:56:33,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:33,562 INFO L130 PetriNetUnfolder]: 36/72 cut-off events. [2022-12-13 01:56:33,562 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 01:56:33,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 72 events. 36/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 197. Up to 55 conditions per place. [2022-12-13 01:56:33,563 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 16 selfloop transitions, 6 changer transitions 5/28 dead transitions. [2022-12-13 01:56:33,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 154 flow [2022-12-13 01:56:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 01:56:33,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 01:56:33,564 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 73 flow. Second operand 5 states and 33 transitions. [2022-12-13 01:56:33,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 154 flow [2022-12-13 01:56:33,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 28 transitions, 130 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:33,566 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,566 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 01:56:33,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-13 01:56:33,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:33,568 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:33,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:33,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 76 flow [2022-12-13 01:56:33,572 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 01:56:33,572 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-13 01:56:33,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 27 events. 7/27 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 49. Up to 8 conditions per place. [2022-12-13 01:56:33,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 76 flow [2022-12-13 01:56:33,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 01:56:33,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:33,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:56:33,700 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 73 flow [2022-12-13 01:56:33,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:33,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:33,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 01:56:33,700 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:33,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1946127873, now seen corresponding path program 1 times [2022-12-13 01:56:33,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:33,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793380536] [2022-12-13 01:56:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:33,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:56:33,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:33,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793380536] [2022-12-13 01:56:33,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793380536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:33,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:33,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724790960] [2022-12-13 01:56:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:33,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:33,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:33,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-13 01:56:33,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:33,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-13 01:56:33,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:33,840 INFO L130 PetriNetUnfolder]: 36/72 cut-off events. [2022-12-13 01:56:33,840 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-13 01:56:33,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 72 events. 36/72 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 4 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 197. Up to 55 conditions per place. [2022-12-13 01:56:33,840 INFO L137 encePairwiseOnDemand]: 10/18 looper letters, 16 selfloop transitions, 6 changer transitions 5/28 dead transitions. [2022-12-13 01:56:33,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 154 flow [2022-12-13 01:56:33,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-12-13 01:56:33,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-13 01:56:33,841 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 73 flow. Second operand 5 states and 33 transitions. [2022-12-13 01:56:33,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 154 flow [2022-12-13 01:56:33,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 28 transitions, 130 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:33,842 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-13 01:56:33,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2022-12-13 01:56:33,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:33,843 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:33,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:33,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 76 flow [2022-12-13 01:56:33,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 76 flow [2022-12-13 01:56:33,845 INFO L130 PetriNetUnfolder]: 7/27 cut-off events. [2022-12-13 01:56:33,845 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 01:56:33,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 27 events. 7/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 49. Up to 8 conditions per place. [2022-12-13 01:56:33,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 76 flow [2022-12-13 01:56:33,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 01:56:33,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:33,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:56:33,983 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 18 transitions, 73 flow [2022-12-13 01:56:33,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:33,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:33,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:33,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 01:56:33,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:33,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -281934934, now seen corresponding path program 1 times [2022-12-13 01:56:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:33,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463503573] [2022-12-13 01:56:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:34,074 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 01:56:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:34,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463503573] [2022-12-13 01:56:34,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463503573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:34,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:34,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:56:34,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799694969] [2022-12-13 01:56:34,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:34,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:56:34,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:34,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:56:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:56:34,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 01:56:34,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 18 transitions, 73 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:34,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:34,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 01:56:34,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:34,173 INFO L130 PetriNetUnfolder]: 53/101 cut-off events. [2022-12-13 01:56:34,173 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 01:56:34,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 101 events. 53/101 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 251 event pairs, 4 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 263. Up to 71 conditions per place. [2022-12-13 01:56:34,174 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 23 selfloop transitions, 9 changer transitions 5/37 dead transitions. [2022-12-13 01:56:34,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 37 transitions, 196 flow [2022-12-13 01:56:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:56:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:56:34,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-12-13 01:56:34,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2022-12-13 01:56:34,175 INFO L175 Difference]: Start difference. First operand has 21 places, 18 transitions, 73 flow. Second operand 6 states and 38 transitions. [2022-12-13 01:56:34,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 37 transitions, 196 flow [2022-12-13 01:56:34,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 37 transitions, 170 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:34,176 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 95 flow [2022-12-13 01:56:34,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=95, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2022-12-13 01:56:34,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 5 predicate places. [2022-12-13 01:56:34,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:34,176 INFO L89 Accepts]: Start accepts. Operand has 25 places, 22 transitions, 95 flow [2022-12-13 01:56:34,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:34,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:34,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 22 transitions, 95 flow [2022-12-13 01:56:34,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 22 transitions, 95 flow [2022-12-13 01:56:34,179 INFO L130 PetriNetUnfolder]: 9/36 cut-off events. [2022-12-13 01:56:34,179 INFO L131 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2022-12-13 01:56:34,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 9/36 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 68. Up to 9 conditions per place. [2022-12-13 01:56:34,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 22 transitions, 95 flow [2022-12-13 01:56:34,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 01:56:34,188 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [305] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N1~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N1~0=v_~N1~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N1~0=v_~N1~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [292] L51-4-->L51-4: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N2~0_53) (= (+ v_~counter~0_86 1) v_~counter~0_87) (= (ite (< 0 v_~counter~0_87) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_87, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N2~0=v_~N2~0_53} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_86, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_21|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N2~0=v_~N2~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:56:34,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [315] $Ultimate##0-->L41-4: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_67 1) (< 0 v_~N1~0_77) (= (+ v_~counter~0_141 1) v_~counter~0_140) (= 0 |v_thread2Thread1of1ForFork1_~i~1#1_49|)) InVars {~counter~0=v_~counter~0_141, ~N1~0=v_~N1~0_77} OutVars{~counter~0=v_~counter~0_140, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_39|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_35|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_67, ~N1~0=v_~N1~0_77, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_49|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread2Thread1of1ForFork1_~i~1#1] and [292] L51-4-->L51-4: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N2~0_53) (= (+ v_~counter~0_86 1) v_~counter~0_87) (= (ite (< 0 v_~counter~0_87) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_87, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N2~0=v_~N2~0_53} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_86, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_21|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N2~0=v_~N2~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:56:34,340 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:56:34,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 01:56:34,341 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 22 transitions, 107 flow [2022-12-13 01:56:34,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:34,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:34,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:34,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 01:56:34,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1888869571, now seen corresponding path program 1 times [2022-12-13 01:56:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:34,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733136705] [2022-12-13 01:56:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:34,416 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 01:56:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:34,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733136705] [2022-12-13 01:56:34,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733136705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:34,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:34,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:34,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982295449] [2022-12-13 01:56:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:34,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:34,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:34,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:34,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:34,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:34,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 22 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:34,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:34,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:34,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:34,484 INFO L130 PetriNetUnfolder]: 54/118 cut-off events. [2022-12-13 01:56:34,485 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 01:56:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 118 events. 54/118 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 8 based on Foata normal form. 7/105 useless extension candidates. Maximal degree in co-relation 341. Up to 79 conditions per place. [2022-12-13 01:56:34,486 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 25 selfloop transitions, 8 changer transitions 5/39 dead transitions. [2022-12-13 01:56:34,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 234 flow [2022-12-13 01:56:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 01:56:34,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2022-12-13 01:56:34,487 INFO L175 Difference]: Start difference. First operand has 24 places, 22 transitions, 107 flow. Second operand 5 states and 44 transitions. [2022-12-13 01:56:34,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 234 flow [2022-12-13 01:56:34,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 219 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 01:56:34,488 INFO L231 Difference]: Finished difference. Result has 29 places, 24 transitions, 136 flow [2022-12-13 01:56:34,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=29, PETRI_TRANSITIONS=24} [2022-12-13 01:56:34,489 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2022-12-13 01:56:34,489 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:34,489 INFO L89 Accepts]: Start accepts. Operand has 29 places, 24 transitions, 136 flow [2022-12-13 01:56:34,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:34,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:34,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 24 transitions, 136 flow [2022-12-13 01:56:34,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 24 transitions, 136 flow [2022-12-13 01:56:34,514 INFO L130 PetriNetUnfolder]: 9/46 cut-off events. [2022-12-13 01:56:34,514 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-13 01:56:34,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 46 events. 9/46 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 131 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 107. Up to 13 conditions per place. [2022-12-13 01:56:34,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 24 transitions, 136 flow [2022-12-13 01:56:34,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 01:56:34,733 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 01:56:34,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 245 [2022-12-13 01:56:34,734 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 139 flow [2022-12-13 01:56:34,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:34,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:34,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 01:56:34,735 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1745723816, now seen corresponding path program 1 times [2022-12-13 01:56:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:34,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944704720] [2022-12-13 01:56:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:34,822 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 01:56:34,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:34,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944704720] [2022-12-13 01:56:34,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944704720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:34,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:34,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013374939] [2022-12-13 01:56:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:34,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:34,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:34,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:34,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:34,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:34,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:34,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:34,878 INFO L130 PetriNetUnfolder]: 56/130 cut-off events. [2022-12-13 01:56:34,878 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-13 01:56:34,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 130 events. 56/130 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 455 event pairs, 12 based on Foata normal form. 5/133 useless extension candidates. Maximal degree in co-relation 439. Up to 77 conditions per place. [2022-12-13 01:56:34,879 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 25 selfloop transitions, 8 changer transitions 5/39 dead transitions. [2022-12-13 01:56:34,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 268 flow [2022-12-13 01:56:34,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 01:56:34,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2022-12-13 01:56:34,880 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 139 flow. Second operand 5 states and 44 transitions. [2022-12-13 01:56:34,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 268 flow [2022-12-13 01:56:34,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 246 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 01:56:34,882 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 163 flow [2022-12-13 01:56:34,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 01:56:34,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 12 predicate places. [2022-12-13 01:56:34,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:34,883 INFO L89 Accepts]: Start accepts. Operand has 32 places, 24 transitions, 163 flow [2022-12-13 01:56:34,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:34,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:34,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 163 flow [2022-12-13 01:56:34,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 163 flow [2022-12-13 01:56:34,887 INFO L130 PetriNetUnfolder]: 8/51 cut-off events. [2022-12-13 01:56:34,887 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-13 01:56:34,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 51 events. 8/51 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 131. Up to 12 conditions per place. [2022-12-13 01:56:34,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 163 flow [2022-12-13 01:56:34,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 01:56:35,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:35,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:56:35,002 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 160 flow [2022-12-13 01:56:35,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:35,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:35,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 01:56:35,002 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:35,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1689389035, now seen corresponding path program 1 times [2022-12-13 01:56:35,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:35,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704774288] [2022-12-13 01:56:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:35,071 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 01:56:35,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:35,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704774288] [2022-12-13 01:56:35,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704774288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:35,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:35,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:35,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840985560] [2022-12-13 01:56:35,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:35,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:35,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:35,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:35,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:35,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 01:56:35,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 160 flow. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:35,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 01:56:35,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:35,122 INFO L130 PetriNetUnfolder]: 58/124 cut-off events. [2022-12-13 01:56:35,123 INFO L131 PetriNetUnfolder]: For 151/151 co-relation queries the response was YES. [2022-12-13 01:56:35,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 124 events. 58/124 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 404 event pairs, 8 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 470. Up to 85 conditions per place. [2022-12-13 01:56:35,123 INFO L137 encePairwiseOnDemand]: 11/21 looper letters, 24 selfloop transitions, 7 changer transitions 9/40 dead transitions. [2022-12-13 01:56:35,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 290 flow [2022-12-13 01:56:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 01:56:35,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-13 01:56:35,124 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 160 flow. Second operand 5 states and 40 transitions. [2022-12-13 01:56:35,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 290 flow [2022-12-13 01:56:35,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 40 transitions, 248 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-13 01:56:35,125 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 132 flow [2022-12-13 01:56:35,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-13 01:56:35,126 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:56:35,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:35,126 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 132 flow [2022-12-13 01:56:35,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:35,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:35,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 132 flow [2022-12-13 01:56:35,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 132 flow [2022-12-13 01:56:35,130 INFO L130 PetriNetUnfolder]: 8/44 cut-off events. [2022-12-13 01:56:35,131 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 01:56:35,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 44 events. 8/44 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 125 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 104. Up to 11 conditions per place. [2022-12-13 01:56:35,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 132 flow [2022-12-13 01:56:35,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 01:56:35,131 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 01:56:35,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 01:56:35,132 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 132 flow [2022-12-13 01:56:35,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:35,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:35,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 01:56:35,132 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1659836363, now seen corresponding path program 1 times [2022-12-13 01:56:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:35,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955327359] [2022-12-13 01:56:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:35,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 01:56:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:35,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955327359] [2022-12-13 01:56:35,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955327359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:35,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:35,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485878392] [2022-12-13 01:56:35,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:35,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:35,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:35,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:35,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:35,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 01:56:35,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:35,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 01:56:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:35,294 INFO L130 PetriNetUnfolder]: 52/116 cut-off events. [2022-12-13 01:56:35,294 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-12-13 01:56:35,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 116 events. 52/116 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 368 event pairs, 8 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 404. Up to 77 conditions per place. [2022-12-13 01:56:35,295 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 24 selfloop transitions, 8 changer transitions 5/38 dead transitions. [2022-12-13 01:56:35,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 257 flow [2022-12-13 01:56:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 01:56:35,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-13 01:56:35,296 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 132 flow. Second operand 5 states and 42 transitions. [2022-12-13 01:56:35,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 257 flow [2022-12-13 01:56:35,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 235 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:35,297 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-12-13 01:56:35,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:56:35,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:35,298 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:35,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:35,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 145 flow [2022-12-13 01:56:35,303 INFO L130 PetriNetUnfolder]: 8/45 cut-off events. [2022-12-13 01:56:35,303 INFO L131 PetriNetUnfolder]: For 25/27 co-relation queries the response was YES. [2022-12-13 01:56:35,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 45 events. 8/45 cut-off events. For 25/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 12 conditions per place. [2022-12-13 01:56:35,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 145 flow [2022-12-13 01:56:35,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 01:56:35,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:35,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:56:35,439 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 142 flow [2022-12-13 01:56:35,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:35,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:35,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 01:56:35,439 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:35,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:35,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1602578061, now seen corresponding path program 1 times [2022-12-13 01:56:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:35,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084713381] [2022-12-13 01:56:35,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:35,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:35,532 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 01:56:35,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:35,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084713381] [2022-12-13 01:56:35,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084713381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:35,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:35,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:35,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947663229] [2022-12-13 01:56:35,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:35,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:35,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:35,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:35,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 01:56:35,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:35,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 01:56:35,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:35,586 INFO L130 PetriNetUnfolder]: 52/116 cut-off events. [2022-12-13 01:56:35,586 INFO L131 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2022-12-13 01:56:35,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 116 events. 52/116 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 361 event pairs, 8 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 422. Up to 77 conditions per place. [2022-12-13 01:56:35,587 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 24 selfloop transitions, 8 changer transitions 5/38 dead transitions. [2022-12-13 01:56:35,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 271 flow [2022-12-13 01:56:35,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 01:56:35,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-13 01:56:35,588 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 142 flow. Second operand 5 states and 42 transitions. [2022-12-13 01:56:35,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 271 flow [2022-12-13 01:56:35,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 235 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:35,590 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-12-13 01:56:35,591 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:56:35,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:35,591 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:35,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:35,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 145 flow [2022-12-13 01:56:35,596 INFO L130 PetriNetUnfolder]: 8/45 cut-off events. [2022-12-13 01:56:35,596 INFO L131 PetriNetUnfolder]: For 25/27 co-relation queries the response was YES. [2022-12-13 01:56:35,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 45 events. 8/45 cut-off events. For 25/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 12 conditions per place. [2022-12-13 01:56:35,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 145 flow [2022-12-13 01:56:35,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 01:56:35,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:35,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:56:35,720 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 142 flow [2022-12-13 01:56:35,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:35,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:35,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 01:56:35,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1545319759, now seen corresponding path program 1 times [2022-12-13 01:56:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:35,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545403305] [2022-12-13 01:56:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:35,809 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 01:56:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545403305] [2022-12-13 01:56:35,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545403305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:35,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737241640] [2022-12-13 01:56:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:35,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-13 01:56:35,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:35,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:35,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-13 01:56:35,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:35,867 INFO L130 PetriNetUnfolder]: 52/116 cut-off events. [2022-12-13 01:56:35,867 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-13 01:56:35,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 116 events. 52/116 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 358 event pairs, 12 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 422. Up to 77 conditions per place. [2022-12-13 01:56:35,868 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 24 selfloop transitions, 8 changer transitions 5/38 dead transitions. [2022-12-13 01:56:35,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 271 flow [2022-12-13 01:56:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:35,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:35,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-13 01:56:35,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42 [2022-12-13 01:56:35,869 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 142 flow. Second operand 5 states and 42 transitions. [2022-12-13 01:56:35,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 271 flow [2022-12-13 01:56:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 235 flow, removed 11 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:35,871 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2022-12-13 01:56:35,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 11 predicate places. [2022-12-13 01:56:35,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:35,872 INFO L89 Accepts]: Start accepts. Operand has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:35,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:35,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 145 flow [2022-12-13 01:56:35,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 145 flow [2022-12-13 01:56:35,876 INFO L130 PetriNetUnfolder]: 8/45 cut-off events. [2022-12-13 01:56:35,876 INFO L131 PetriNetUnfolder]: For 25/27 co-relation queries the response was YES. [2022-12-13 01:56:35,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 45 events. 8/45 cut-off events. For 25/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 124 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 113. Up to 12 conditions per place. [2022-12-13 01:56:35,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 145 flow [2022-12-13 01:56:35,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 66 [2022-12-13 01:56:36,042 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:36,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 01:56:36,043 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 142 flow [2022-12-13 01:56:36,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:36,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:36,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 01:56:36,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash 3167284, now seen corresponding path program 1 times [2022-12-13 01:56:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:36,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725792614] [2022-12-13 01:56:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:36,158 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 01:56:36,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:36,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725792614] [2022-12-13 01:56:36,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725792614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:36,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:36,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 01:56:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646573355] [2022-12-13 01:56:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:36,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 01:56:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:36,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 01:56:36,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 01:56:36,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 01:56:36,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 142 flow. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:36,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:36,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 01:56:36,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:36,255 INFO L130 PetriNetUnfolder]: 69/145 cut-off events. [2022-12-13 01:56:36,256 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-13 01:56:36,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 145 events. 69/145 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 485 event pairs, 12 based on Foata normal form. 1/144 useless extension candidates. Maximal degree in co-relation 512. Up to 71 conditions per place. [2022-12-13 01:56:36,257 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 30 selfloop transitions, 12 changer transitions 5/47 dead transitions. [2022-12-13 01:56:36,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 325 flow [2022-12-13 01:56:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 01:56:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 01:56:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-13 01:56:36,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-13 01:56:36,258 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 142 flow. Second operand 6 states and 47 transitions. [2022-12-13 01:56:36,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 325 flow [2022-12-13 01:56:36,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 47 transitions, 287 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:36,260 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 181 flow [2022-12-13 01:56:36,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2022-12-13 01:56:36,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2022-12-13 01:56:36,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:36,261 INFO L89 Accepts]: Start accepts. Operand has 33 places, 26 transitions, 181 flow [2022-12-13 01:56:36,261 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:36,261 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:36,261 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 181 flow [2022-12-13 01:56:36,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 181 flow [2022-12-13 01:56:36,266 INFO L130 PetriNetUnfolder]: 11/55 cut-off events. [2022-12-13 01:56:36,266 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-13 01:56:36,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 55 events. 11/55 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 177 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 150. Up to 13 conditions per place. [2022-12-13 01:56:36,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 181 flow [2022-12-13 01:56:36,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 01:56:36,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [305] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N1~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N1~0=v_~N1~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N1~0=v_~N1~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [292] L51-4-->L51-4: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N2~0_53) (= (+ v_~counter~0_86 1) v_~counter~0_87) (= (ite (< 0 v_~counter~0_87) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_87, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N2~0=v_~N2~0_53} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_86, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_21|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N2~0=v_~N2~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:56:36,347 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [305] L41-4-->thread1EXIT: Formula: (and (not (< v_thread1Thread1of1ForFork0_~i~0_In_1 v_~N1~0_In_3)) (= |v_thread1Thread1of1ForFork0_#res.offset_Out_2| 0) (= |v_thread1Thread1of1ForFork0_#res.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, ~N1~0=v_~N1~0_In_3} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_In_1, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_Out_2|, ~N1~0=v_~N1~0_In_3, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset] and [292] L51-4-->L51-4: Formula: (and (< |v_thread2Thread1of1ForFork1_~i~1#1_28| v_~N2~0_53) (= (+ v_~counter~0_86 1) v_~counter~0_87) (= (ite (< 0 v_~counter~0_87) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (= (+ 1 |v_thread2Thread1of1ForFork1_~i~1#1_28|) |v_thread2Thread1of1ForFork1_~i~1#1_27|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15| 0))) InVars {~counter~0=v_~counter~0_87, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_28|, ~N2~0=v_~N2~0_53} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_15|, ~counter~0=v_~counter~0_86, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_15|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_15|, thread2Thread1of1ForFork1_#t~post3#1=|v_thread2Thread1of1ForFork1_#t~post3#1_21|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_27|, ~N2~0=v_~N2~0_53} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~counter~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post3#1, thread2Thread1of1ForFork1_~i~1#1] [2022-12-13 01:56:36,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:36,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 01:56:36,423 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 204 flow [2022-12-13 01:56:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:36,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:36,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:36,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 01:56:36,424 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:36,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1488061457, now seen corresponding path program 1 times [2022-12-13 01:56:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:36,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590545541] [2022-12-13 01:56:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:36,546 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 01:56:36,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:36,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590545541] [2022-12-13 01:56:36,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590545541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:36,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:36,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839909313] [2022-12-13 01:56:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:36,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:36,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:36,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 01:56:36,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:36,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:36,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 01:56:36,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:36,598 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:36,598 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2022-12-13 01:56:36,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 143 events. 65/143 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 505 event pairs, 8 based on Foata normal form. 1/136 useless extension candidates. Maximal degree in co-relation 562. Up to 104 conditions per place. [2022-12-13 01:56:36,600 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:36,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:36,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:36,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2022-12-13 01:56:36,601 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 204 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:36,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:36,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 290 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:36,615 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 186 flow [2022-12-13 01:56:36,616 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:36,616 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:36,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:36,616 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 186 flow [2022-12-13 01:56:36,617 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:36,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:36,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 186 flow [2022-12-13 01:56:36,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 186 flow [2022-12-13 01:56:36,620 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:36,620 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-13 01:56:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 57 events. 10/57 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 201 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 145. Up to 14 conditions per place. [2022-12-13 01:56:36,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 186 flow [2022-12-13 01:56:36,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:36,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:36,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 01:56:36,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:36,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:36,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:36,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:36,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 01:56:36,782 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1373544853, now seen corresponding path program 1 times [2022-12-13 01:56:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:36,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046218472] [2022-12-13 01:56:36,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:36,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:36,905 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 01:56:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:36,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046218472] [2022-12-13 01:56:36,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046218472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:36,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:36,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965150757] [2022-12-13 01:56:36,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:36,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:36,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:36,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:36,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:36,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:36,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:36,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:36,967 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:36,968 INFO L131 PetriNetUnfolder]: For 182/182 co-relation queries the response was YES. [2022-12-13 01:56:36,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 143 events. 65/143 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 526. Up to 104 conditions per place. [2022-12-13 01:56:36,969 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:36,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 323 flow [2022-12-13 01:56:36,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:36,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:36,970 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 323 flow [2022-12-13 01:56:36,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:36,971 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:36,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:36,972 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:36,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:36,972 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:36,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:36,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:36,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:36,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:36,978 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:36,978 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:36,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:36,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:36,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:37,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:37,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 01:56:37,139 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:37,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:37,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:37,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:37,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 01:56:37,140 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:37,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1316286551, now seen corresponding path program 1 times [2022-12-13 01:56:37,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:37,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754379176] [2022-12-13 01:56:37,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:37,243 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 01:56:37,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754379176] [2022-12-13 01:56:37,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754379176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:37,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:37,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:37,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251640955] [2022-12-13 01:56:37,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:37,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:37,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:37,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:37,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:37,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:37,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:37,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:37,305 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:37,306 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:37,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:37,306 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:37,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:37,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:37,308 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:37,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:37,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:37,309 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,309 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:37,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:37,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:37,310 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:37,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:37,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:37,314 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:37,314 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:37,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:37,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:37,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:37,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:56:37,458 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:37,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:37,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:37,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:37,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 01:56:37,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:37,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:37,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1259028249, now seen corresponding path program 1 times [2022-12-13 01:56:37,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:37,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656169096] [2022-12-13 01:56:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:37,546 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 01:56:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:37,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656169096] [2022-12-13 01:56:37,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656169096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:37,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:37,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319712593] [2022-12-13 01:56:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:37,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:37,548 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:37,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:37,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:37,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:37,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:37,628 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:37,628 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:37,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:37,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:37,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:37,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:37,630 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:37,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:37,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:37,632 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:37,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:37,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:37,633 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:37,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:37,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:37,639 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:37,639 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:37,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:37,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:37,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:37,802 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:37,803 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 01:56:37,803 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:37,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:37,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:37,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:37,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 01:56:37,803 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1201769947, now seen corresponding path program 1 times [2022-12-13 01:56:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:37,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821406992] [2022-12-13 01:56:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:37,915 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 01:56:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:37,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821406992] [2022-12-13 01:56:37,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821406992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:37,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:37,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:37,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212138197] [2022-12-13 01:56:37,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:37,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:37,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:37,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:37,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:37,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:37,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:37,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:37,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:37,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:37,984 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:37,984 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:37,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:37,986 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:37,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:37,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:37,988 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:37,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:37,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:37,991 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,991 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:37,991 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:37,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:37,991 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:37,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:37,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:37,997 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:37,998 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:37,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:37,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:37,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:38,135 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:38,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:56:38,136 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:38,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:38,137 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:38,137 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:38,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 01:56:38,138 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1144511645, now seen corresponding path program 1 times [2022-12-13 01:56:38,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:38,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546869206] [2022-12-13 01:56:38,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:38,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:38,242 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 01:56:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:38,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546869206] [2022-12-13 01:56:38,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546869206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:38,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:38,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46189048] [2022-12-13 01:56:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:38,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:38,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:38,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:38,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:38,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:38,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:38,305 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:38,305 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:38,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:38,306 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:38,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:38,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:38,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:38,307 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:38,307 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:38,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:38,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:38,311 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:38,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:38,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:38,313 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:38,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:38,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:38,319 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:38,319 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:38,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:38,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:38,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:38,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:38,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 01:56:38,466 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:38,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:38,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:38,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:38,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 01:56:38,466 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:38,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1087253343, now seen corresponding path program 1 times [2022-12-13 01:56:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:38,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714399731] [2022-12-13 01:56:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:38,554 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 01:56:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:38,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714399731] [2022-12-13 01:56:38,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714399731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:38,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:38,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788134793] [2022-12-13 01:56:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:38,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:38,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:38,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:38,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:38,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:38,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:38,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:38,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:38,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:38,618 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:38,618 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:38,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:38,619 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:38,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:38,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:38,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:38,620 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:38,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:38,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:38,621 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:38,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:38,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:38,622 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:38,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:38,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:38,626 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:38,626 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:38,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:38,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:38,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:38,771 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:38,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 01:56:38,772 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:38,772 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:38,772 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:38,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 01:56:38,772 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1029995041, now seen corresponding path program 1 times [2022-12-13 01:56:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:38,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480515955] [2022-12-13 01:56:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:38,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:38,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 01:56:38,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:38,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480515955] [2022-12-13 01:56:38,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480515955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:38,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:38,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:38,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742090439] [2022-12-13 01:56:38,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:38,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:38,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:38,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:38,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:38,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:38,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:38,902 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:38,903 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:38,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:38,904 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:38,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:38,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:38,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:38,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:38,905 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:38,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:38,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:38,907 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:38,907 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:38,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:38,908 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:38,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:38,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:38,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:38,913 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:38,913 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:38,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:38,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:38,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:39,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:39,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 01:56:39,060 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:39,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:39,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 01:56:39,060 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:39,061 INFO L85 PathProgramCache]: Analyzing trace with hash -972736739, now seen corresponding path program 1 times [2022-12-13 01:56:39,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:39,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885567151] [2022-12-13 01:56:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:39,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:39,120 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 01:56:39,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:39,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885567151] [2022-12-13 01:56:39,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885567151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:39,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:39,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738800602] [2022-12-13 01:56:39,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:39,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:39,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:39,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:39,122 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:39,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:39,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:39,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:39,166 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:39,166 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:39,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:39,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:39,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:39,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:39,168 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:39,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:39,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:39,169 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:39,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:39,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:39,170 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,170 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:39,170 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:39,170 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:39,174 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:39,174 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:39,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:39,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:39,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:39,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:39,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:56:39,292 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:39,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:39,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:39,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 01:56:39,292 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -915478437, now seen corresponding path program 1 times [2022-12-13 01:56:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:39,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225000845] [2022-12-13 01:56:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:39,404 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 01:56:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225000845] [2022-12-13 01:56:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225000845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:39,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:39,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:39,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637531789] [2022-12-13 01:56:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:39,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:39,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:39,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:39,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:39,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:39,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:39,469 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:39,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:39,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:39,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:39,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:39,472 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:39,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:39,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:39,473 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:39,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:39,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:39,474 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:39,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:39,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:39,480 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:39,480 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:39,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:39,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:39,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:39,643 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:39,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 01:56:39,645 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:39,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 01:56:39,646 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -858220135, now seen corresponding path program 1 times [2022-12-13 01:56:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:39,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788502182] [2022-12-13 01:56:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:39,726 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 01:56:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:39,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788502182] [2022-12-13 01:56:39,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788502182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:39,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:39,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746240619] [2022-12-13 01:56:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:39,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:39,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:39,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:39,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:39,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:39,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:39,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:39,772 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:39,772 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:39,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:39,773 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:39,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:39,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:39,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:39,774 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:39,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:39,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:39,775 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:39,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:39,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:39,776 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:39,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:39,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:39,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:39,779 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:39,779 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:39,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:39,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:39,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:39,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:39,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:56:39,914 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:39,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:39,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:39,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 01:56:39,914 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:39,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -800961833, now seen corresponding path program 1 times [2022-12-13 01:56:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:39,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042261807] [2022-12-13 01:56:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:39,973 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 01:56:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:39,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042261807] [2022-12-13 01:56:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042261807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742973883] [2022-12-13 01:56:39,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:39,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:39,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:39,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:39,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:39,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:39,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:39,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:39,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:40,022 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:40,022 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:40,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:40,023 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:40,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:40,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:40,024 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:40,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:40,025 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:40,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:40,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:40,026 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:40,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:40,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,029 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:40,029 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:40,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:40,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:40,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:40,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:56:40,169 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:40,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:40,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:40,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 01:56:40,169 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:40,170 INFO L85 PathProgramCache]: Analyzing trace with hash -743703531, now seen corresponding path program 1 times [2022-12-13 01:56:40,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:40,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126482223] [2022-12-13 01:56:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:40,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:40,244 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 01:56:40,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:40,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126482223] [2022-12-13 01:56:40,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126482223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:40,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:40,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683560816] [2022-12-13 01:56:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:40,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:40,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:40,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:40,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:40,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:40,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:40,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:40,307 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:40,307 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:40,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:40,308 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:40,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:40,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:40,309 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:40,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:40,310 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,311 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:40,311 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:40,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:40,311 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:40,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:40,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,315 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:40,315 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:40,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:40,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:40,446 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:40,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:56:40,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:40,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:40,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 01:56:40,447 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -686445229, now seen corresponding path program 1 times [2022-12-13 01:56:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:40,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426967087] [2022-12-13 01:56:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:40,507 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 01:56:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426967087] [2022-12-13 01:56:40,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426967087] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:40,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:40,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643540101] [2022-12-13 01:56:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:40,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:40,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:40,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:40,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:40,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:40,562 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:40,562 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:40,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:40,563 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:40,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:40,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:40,563 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:40,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:40,565 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:40,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:40,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:40,565 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:40,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:40,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,569 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:40,569 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:40,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:40,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:40,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:40,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 01:56:40,719 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:40,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:40,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:40,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 01:56:40,720 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash -629186927, now seen corresponding path program 1 times [2022-12-13 01:56:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:40,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404785181] [2022-12-13 01:56:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:40,786 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 01:56:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:40,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404785181] [2022-12-13 01:56:40,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404785181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:40,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:40,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919189365] [2022-12-13 01:56:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:40,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:40,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:40,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:40,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:40,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:40,837 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:40,837 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:40,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:40,838 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:40,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:40,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:40,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:40,839 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:40,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:40,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:40,840 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:40,841 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:40,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:40,841 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:40,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:40,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:40,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,844 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:40,844 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:40,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:40,845 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:40,845 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:40,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:40,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:56:40,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:40,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:40,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:40,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:40,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 01:56:40,977 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:40,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:40,977 INFO L85 PathProgramCache]: Analyzing trace with hash -571928625, now seen corresponding path program 1 times [2022-12-13 01:56:40,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:40,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852155529] [2022-12-13 01:56:40,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:41,043 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 01:56:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:41,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852155529] [2022-12-13 01:56:41,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852155529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:41,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:41,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:41,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033501718] [2022-12-13 01:56:41,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:41,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:41,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:41,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:41,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:41,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:41,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:41,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:41,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:41,103 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:41,103 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:41,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:41,104 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:41,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:41,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:41,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:41,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:41,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:41,105 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:41,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:41,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:41,108 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:41,108 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:41,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:41,109 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:41,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:41,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:41,114 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:41,114 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:41,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:41,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:41,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:41,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:41,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 01:56:41,267 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:41,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:41,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:41,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 01:56:41,268 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:41,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash -514670323, now seen corresponding path program 1 times [2022-12-13 01:56:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:41,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615475534] [2022-12-13 01:56:41,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:41,348 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 01:56:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:41,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615475534] [2022-12-13 01:56:41,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615475534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:41,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:41,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610387248] [2022-12-13 01:56:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:41,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:41,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:41,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:41,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:41,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:41,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:41,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:41,397 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:41,397 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:41,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:41,398 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:41,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:41,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:41,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:41,400 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:41,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:41,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:41,401 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:41,402 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:41,402 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:41,402 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:41,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:41,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:41,407 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:41,407 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:41,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:41,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:41,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:41,562 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:41,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 01:56:41,563 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:41,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:41,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:41,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 01:56:41,564 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:41,564 INFO L85 PathProgramCache]: Analyzing trace with hash -457412021, now seen corresponding path program 1 times [2022-12-13 01:56:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:41,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820770288] [2022-12-13 01:56:41,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:41,651 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 01:56:41,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:41,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820770288] [2022-12-13 01:56:41,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820770288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:41,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:41,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415239644] [2022-12-13 01:56:41,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:41,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:41,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:41,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:41,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:41,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:41,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:41,704 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:41,704 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:41,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:41,705 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:41,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:41,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:41,705 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:41,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:41,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:41,708 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:41,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:41,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:41,709 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:41,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:41,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:41,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:41,714 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:41,715 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:41,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:41,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:41,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:41,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:41,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:56:41,848 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:41,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:41,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:41,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 01:56:41,849 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -400153719, now seen corresponding path program 1 times [2022-12-13 01:56:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:41,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761597334] [2022-12-13 01:56:41,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:41,938 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 01:56:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:41,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761597334] [2022-12-13 01:56:41,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761597334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:41,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:41,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098642836] [2022-12-13 01:56:41,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:41,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:41,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:41,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:41,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:41,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:41,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:41,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:41,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:42,001 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:42,002 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:42,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:42,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:42,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:42,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:42,004 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:42,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:42,006 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:42,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:42,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:42,006 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:42,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:42,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,011 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:42,012 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:42,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:42,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:42,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:42,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-13 01:56:42,172 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:42,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:42,172 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:42,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 01:56:42,172 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:42,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -342895417, now seen corresponding path program 1 times [2022-12-13 01:56:42,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:42,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243106492] [2022-12-13 01:56:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:42,236 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 01:56:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:42,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243106492] [2022-12-13 01:56:42,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243106492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:42,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:42,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329126447] [2022-12-13 01:56:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:42,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:42,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:42,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:42,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:42,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:42,284 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:42,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:42,285 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:42,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:42,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:42,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:42,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:42,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:42,300 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:42,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:42,300 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:42,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:42,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,307 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:42,307 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:42,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:42,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:42,439 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:42,439 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:56:42,439 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:42,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:42,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:42,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-13 01:56:42,440 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash -285637115, now seen corresponding path program 1 times [2022-12-13 01:56:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:42,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343332218] [2022-12-13 01:56:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:42,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:42,502 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 01:56:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:42,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343332218] [2022-12-13 01:56:42,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343332218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:42,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:42,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832874500] [2022-12-13 01:56:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:42,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:42,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:42,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:42,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:42,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:42,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:42,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:42,558 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:42,559 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:42,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:42,559 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:42,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:42,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:42,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:42,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:42,561 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:42,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:42,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:42,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:42,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:42,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,567 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:42,567 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:42,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:42,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:42,705 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:42,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:56:42,706 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:42,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:42,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:42,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-13 01:56:42,706 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash -228378813, now seen corresponding path program 1 times [2022-12-13 01:56:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:42,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130660349] [2022-12-13 01:56:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:42,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 01:56:42,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130660349] [2022-12-13 01:56:42,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130660349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:42,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:42,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026216538] [2022-12-13 01:56:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:42,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:42,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:42,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:42,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:42,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:42,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:42,820 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:42,821 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:42,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:42,821 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:42,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:42,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:42,822 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:42,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:42,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:42,823 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:42,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:42,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:42,824 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:42,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:42,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:42,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,828 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:42,828 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:42,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:42,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:42,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:42,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:42,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:56:42,960 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:42,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:42,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:42,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:42,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 01:56:42,960 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:42,961 INFO L85 PathProgramCache]: Analyzing trace with hash -171120511, now seen corresponding path program 1 times [2022-12-13 01:56:42,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:42,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784877484] [2022-12-13 01:56:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:42,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:43,041 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 01:56:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:43,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784877484] [2022-12-13 01:56:43,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784877484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:43,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:43,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752421250] [2022-12-13 01:56:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:43,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:43,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:43,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:43,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:43,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:43,090 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:43,090 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:43,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:43,091 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:43,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:43,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:43,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:43,092 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:43,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:43,093 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:43,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:43,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:43,094 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:43,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:43,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:43,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:43,097 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:43,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:43,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:43,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:43,222 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:43,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:56:43,223 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:43,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:43,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:43,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 01:56:43,223 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:43,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash -113862209, now seen corresponding path program 1 times [2022-12-13 01:56:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:43,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673373499] [2022-12-13 01:56:43,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:43,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:43,315 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 01:56:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:43,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673373499] [2022-12-13 01:56:43,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673373499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:43,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:43,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:43,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497203888] [2022-12-13 01:56:43,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:43,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:43,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:43,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:43,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:43,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:43,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:43,396 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:43,396 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:43,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:43,397 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:43,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:43,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:43,399 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:43,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:43,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:43,400 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:43,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:43,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:43,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:43,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:43,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:43,406 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:43,406 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:43,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:43,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:43,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:43,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:43,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 01:56:43,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:43,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:43,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:43,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 01:56:43,559 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -56603907, now seen corresponding path program 1 times [2022-12-13 01:56:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:43,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686223634] [2022-12-13 01:56:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:43,656 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 01:56:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:43,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686223634] [2022-12-13 01:56:43,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686223634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:43,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:43,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727747854] [2022-12-13 01:56:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:43,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:43,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:43,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:43,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:43,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:43,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:43,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:43,752 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:43,752 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:43,754 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:43,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:43,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:43,755 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:43,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:43,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:43,756 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:43,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:43,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:43,757 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:43,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:43,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:43,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:43,762 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:43,763 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:43,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:43,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:43,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:43,904 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:43,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:56:43,905 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:43,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:43,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:43,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-13 01:56:43,905 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:43,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash 654395, now seen corresponding path program 1 times [2022-12-13 01:56:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:43,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853809269] [2022-12-13 01:56:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:43,969 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 01:56:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:43,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853809269] [2022-12-13 01:56:43,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853809269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:43,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:43,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789847357] [2022-12-13 01:56:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:43,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:43,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:43,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:43,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:43,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:43,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:43,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:44,032 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:44,032 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:44,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:44,033 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:44,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:44,034 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:44,034 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:44,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:44,035 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,035 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:44,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:44,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:44,036 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:44,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:44,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,039 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:44,039 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:44,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:44,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:44,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:44,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:56:44,161 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:44,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:44,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:44,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-13 01:56:44,161 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:44,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash 57912697, now seen corresponding path program 1 times [2022-12-13 01:56:44,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:44,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416404924] [2022-12-13 01:56:44,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:44,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:44,218 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 01:56:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416404924] [2022-12-13 01:56:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416404924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:44,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:44,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609660747] [2022-12-13 01:56:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:44,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:44,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:44,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:44,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:44,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:44,264 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:44,264 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:44,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:44,265 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:44,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:44,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:44,266 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:44,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:44,267 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:44,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:44,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:44,268 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:44,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:44,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,271 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:44,271 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:44,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:44,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:44,400 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:44,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:56:44,401 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:44,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:44,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:44,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-13 01:56:44,401 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 115170999, now seen corresponding path program 1 times [2022-12-13 01:56:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:44,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626238171] [2022-12-13 01:56:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:44,468 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 01:56:44,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:44,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626238171] [2022-12-13 01:56:44,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626238171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:44,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:44,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:44,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589136210] [2022-12-13 01:56:44,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:44,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:44,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:44,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:44,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:44,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:44,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:44,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:44,525 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:44,525 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:44,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:44,526 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:44,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:44,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:44,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:44,526 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:44,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:44,528 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:44,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:44,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:44,528 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:44,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:44,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,531 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:44,532 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:44,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:44,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:44,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:44,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:56:44,666 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:44,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:44,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:44,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-13 01:56:44,667 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:44,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 172429301, now seen corresponding path program 1 times [2022-12-13 01:56:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:44,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037774462] [2022-12-13 01:56:44,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:44,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:44,739 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 01:56:44,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:44,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037774462] [2022-12-13 01:56:44,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037774462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:44,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:44,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093634076] [2022-12-13 01:56:44,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:44,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:44,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:44,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:44,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:44,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:44,803 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:44,804 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:44,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:44,805 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:44,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:44,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:44,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:44,806 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:44,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:44,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:44,807 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:44,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:44,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:44,808 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:44,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:44,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:44,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,812 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:44,813 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:44,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:44,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:44,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:44,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:44,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:56:44,953 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:44,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:44,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:44,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-12-13 01:56:44,953 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:44,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash 229687603, now seen corresponding path program 1 times [2022-12-13 01:56:44,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:44,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837940804] [2022-12-13 01:56:44,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:44,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:45,027 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 01:56:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:45,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837940804] [2022-12-13 01:56:45,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837940804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:45,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:45,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364848461] [2022-12-13 01:56:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:45,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:45,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:45,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:45,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:45,091 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:45,092 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:45,093 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:45,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:45,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:45,094 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:45,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:45,095 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,095 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:45,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:45,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:45,096 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:45,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:45,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,100 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:45,100 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:45,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:45,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:45,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:45,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:56:45,243 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:45,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:45,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:45,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 01:56:45,244 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash 286945905, now seen corresponding path program 1 times [2022-12-13 01:56:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:45,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172017609] [2022-12-13 01:56:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:45,316 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 01:56:45,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:45,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172017609] [2022-12-13 01:56:45,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172017609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:45,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:45,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872523730] [2022-12-13 01:56:45,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:45,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:45,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:45,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:45,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:45,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:45,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:45,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:45,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:45,375 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:45,375 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:45,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:45,376 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:45,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:45,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:45,377 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:45,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:45,378 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:45,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:45,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:45,378 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:45,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:45,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,381 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:45,382 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:45,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:45,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:45,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:45,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 01:56:45,528 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:45,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:45,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:45,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-12-13 01:56:45,528 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:45,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash 344204207, now seen corresponding path program 1 times [2022-12-13 01:56:45,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:45,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126216044] [2022-12-13 01:56:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:45,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:45,596 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 01:56:45,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:45,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126216044] [2022-12-13 01:56:45,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126216044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:45,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:45,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579141531] [2022-12-13 01:56:45,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:45,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:45,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:45,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:45,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:45,597 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:45,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:45,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:45,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:45,647 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:45,648 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:45,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:45,648 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:45,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:45,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:45,649 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:45,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:45,651 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:45,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:45,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:45,651 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:45,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:45,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,655 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:45,655 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:45,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:45,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:45,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:45,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:56:45,791 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:45,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:45,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:45,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 01:56:45,792 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:45,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash 401462509, now seen corresponding path program 1 times [2022-12-13 01:56:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:45,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648716843] [2022-12-13 01:56:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:45,851 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 01:56:45,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:45,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648716843] [2022-12-13 01:56:45,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648716843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:45,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:45,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587506876] [2022-12-13 01:56:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:45,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:45,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:45,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:45,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:45,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:45,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:45,907 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:45,908 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:45,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:45,909 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:45,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:45,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:45,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:45,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:45,910 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:45,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:45,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:45,911 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:45,912 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:45,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:45,912 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:45,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:45,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:45,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,917 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:45,917 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:45,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:45,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:45,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:46,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:46,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:56:46,056 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:46,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:46,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:46,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 01:56:46,056 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:46,056 INFO L85 PathProgramCache]: Analyzing trace with hash 458720811, now seen corresponding path program 1 times [2022-12-13 01:56:46,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:46,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402614748] [2022-12-13 01:56:46,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:46,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:46,158 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 01:56:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402614748] [2022-12-13 01:56:46,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402614748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:46,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:46,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489579642] [2022-12-13 01:56:46,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:46,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:46,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:46,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:46,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:46,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:46,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:46,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:46,230 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:46,230 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:46,231 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:46,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:46,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:46,233 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:46,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:46,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:46,236 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:46,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:46,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:46,237 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:46,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:46,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:46,241 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:46,241 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:46,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:46,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:46,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:46,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:46,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:56:46,375 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:46,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:46,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:46,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-13 01:56:46,376 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 515979113, now seen corresponding path program 1 times [2022-12-13 01:56:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:46,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990251212] [2022-12-13 01:56:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:46,430 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 01:56:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:46,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990251212] [2022-12-13 01:56:46,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990251212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:46,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:46,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687579133] [2022-12-13 01:56:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:46,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:46,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:46,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:46,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:46,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:46,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:46,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:46,481 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:46,481 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:46,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:46,483 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:46,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:46,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:46,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:46,487 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:46,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:46,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:46,488 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,488 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:46,488 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:46,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:46,488 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:46,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:46,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:46,492 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:46,492 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:46,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:46,492 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:46,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:46,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:46,611 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:56:46,611 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:46,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:46,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:46,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-13 01:56:46,612 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash 573237415, now seen corresponding path program 1 times [2022-12-13 01:56:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:46,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084439528] [2022-12-13 01:56:46,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:46,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:46,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:46,683 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 01:56:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:46,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084439528] [2022-12-13 01:56:46,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084439528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:46,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:46,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218933320] [2022-12-13 01:56:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:46,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:46,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:46,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:46,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:46,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:46,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:46,741 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:46,742 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:46,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:46,742 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:46,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:46,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:46,743 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:46,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:46,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:46,744 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:46,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:46,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:46,745 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:46,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:46,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:46,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:46,748 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:46,748 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:46,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:46,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:46,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:46,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:46,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:56:46,877 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:46,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:46,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:46,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-13 01:56:46,877 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash 630495717, now seen corresponding path program 1 times [2022-12-13 01:56:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:46,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66417580] [2022-12-13 01:56:46,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:46,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:46,954 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 01:56:46,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:46,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66417580] [2022-12-13 01:56:46,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66417580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:46,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:46,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200332219] [2022-12-13 01:56:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:46,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:46,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:46,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:46,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:46,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:46,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:46,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:46,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:47,017 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:47,017 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:47,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:47,018 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:47,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:47,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:47,019 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:47,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:47,021 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:47,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:47,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:47,021 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,022 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:47,022 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:47,022 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,026 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:47,026 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:47,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:47,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:47,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:47,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 155 [2022-12-13 01:56:47,176 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:47,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:47,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:47,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-13 01:56:47,177 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash 687754019, now seen corresponding path program 1 times [2022-12-13 01:56:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:47,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955514062] [2022-12-13 01:56:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:47,299 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 01:56:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:47,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955514062] [2022-12-13 01:56:47,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955514062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:47,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:47,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433751926] [2022-12-13 01:56:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:47,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:47,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:47,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:47,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:47,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:47,342 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:47,343 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:47,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:47,343 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:47,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:47,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:47,344 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:47,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:47,345 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:47,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:47,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:47,346 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:47,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:47,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,349 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:47,349 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:47,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:47,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:47,479 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:47,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:56:47,479 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:47,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:47,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:47,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-13 01:56:47,480 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:47,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:47,480 INFO L85 PathProgramCache]: Analyzing trace with hash 745012321, now seen corresponding path program 1 times [2022-12-13 01:56:47,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:47,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384764527] [2022-12-13 01:56:47,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:47,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:47,542 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 01:56:47,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:47,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384764527] [2022-12-13 01:56:47,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384764527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:47,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:47,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268618353] [2022-12-13 01:56:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:47,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:47,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:47,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:47,543 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:47,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:47,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:47,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:47,597 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:47,597 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:47,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:47,598 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:47,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:47,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:47,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:47,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:47,599 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:47,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:47,600 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:47,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:47,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:47,601 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,601 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:47,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:47,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,604 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:47,604 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:47,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:47,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:47,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:47,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:56:47,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:47,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:47,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-13 01:56:47,726 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 802270623, now seen corresponding path program 1 times [2022-12-13 01:56:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:47,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217333910] [2022-12-13 01:56:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:47,779 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 01:56:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:47,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217333910] [2022-12-13 01:56:47,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217333910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:47,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:47,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:47,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575002453] [2022-12-13 01:56:47,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:47,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:47,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:47,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:47,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:47,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:47,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:47,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:47,832 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:47,832 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:47,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:47,833 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:47,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:47,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:47,833 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:47,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:47,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:47,835 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:47,835 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:47,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:47,835 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:47,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:47,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:47,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,838 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:47,838 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:47,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:47,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:47,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:47,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:47,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:56:47,968 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:47,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:47,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:47,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:47,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-13 01:56:47,968 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash 859528925, now seen corresponding path program 1 times [2022-12-13 01:56:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:47,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807885590] [2022-12-13 01:56:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:47,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:48,043 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 01:56:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:48,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807885590] [2022-12-13 01:56:48,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807885590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:48,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:48,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431900463] [2022-12-13 01:56:48,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:48,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:48,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:48,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:48,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:48,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:48,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:48,087 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:48,087 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:48,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:48,088 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:48,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:48,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:48,089 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:48,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:48,090 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:48,090 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:48,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:48,090 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:48,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:48,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,094 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:48,094 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:48,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:48,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:48,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:48,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:56:48,235 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:48,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:48,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:48,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-13 01:56:48,235 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 916787227, now seen corresponding path program 1 times [2022-12-13 01:56:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:48,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106037963] [2022-12-13 01:56:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:48,293 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 01:56:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:48,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106037963] [2022-12-13 01:56:48,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106037963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:48,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:48,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313518220] [2022-12-13 01:56:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:48,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:48,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:48,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:48,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:48,348 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:48,349 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:48,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:48,349 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:48,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:48,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:48,350 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:48,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:48,353 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,353 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:48,353 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:48,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:48,354 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:48,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:48,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,357 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:48,357 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:48,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:48,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:48,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:48,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:56:48,481 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:48,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:48,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:48,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-13 01:56:48,481 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 974045529, now seen corresponding path program 1 times [2022-12-13 01:56:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:48,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545432934] [2022-12-13 01:56:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:48,537 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 01:56:48,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:48,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545432934] [2022-12-13 01:56:48,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545432934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:48,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:48,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106556758] [2022-12-13 01:56:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:48,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:48,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:48,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:48,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:48,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:48,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:48,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:48,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:48,592 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:48,592 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:48,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:48,593 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:48,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:48,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:48,593 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:48,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:48,595 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:48,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:48,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:48,596 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:48,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:48,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,599 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:48,599 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:48,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:48,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:48,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:48,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:56:48,722 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:48,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:48,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:48,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-13 01:56:48,722 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:48,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1031303831, now seen corresponding path program 1 times [2022-12-13 01:56:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:48,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654465715] [2022-12-13 01:56:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:48,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:48,778 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 01:56:48,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:48,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654465715] [2022-12-13 01:56:48,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654465715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:48,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:48,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:48,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425768943] [2022-12-13 01:56:48,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:48,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:48,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:48,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:48,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:48,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:48,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:48,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:48,823 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:48,823 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:48,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:48,824 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:48,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:48,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:48,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:48,825 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:48,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:48,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:48,826 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:48,826 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:48,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:48,826 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:48,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:48,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:48,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,829 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:48,830 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:48,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:48,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:48,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:48,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:48,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:56:48,954 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:48,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:48,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:48,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:48,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-13 01:56:48,955 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1088562133, now seen corresponding path program 1 times [2022-12-13 01:56:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:48,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485307567] [2022-12-13 01:56:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:48,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:49,015 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 01:56:49,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:49,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485307567] [2022-12-13 01:56:49,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485307567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:49,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:49,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188174005] [2022-12-13 01:56:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:49,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:49,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:49,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:49,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:49,083 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:49,084 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:49,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:49,084 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:49,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:49,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:49,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:49,085 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:49,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:49,086 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:49,088 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:49,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:49,088 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:49,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:49,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,091 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:49,091 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:49,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:49,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:49,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:49,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:56:49,230 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:49,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:49,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:49,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-13 01:56:49,230 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1145820435, now seen corresponding path program 1 times [2022-12-13 01:56:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:49,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663672190] [2022-12-13 01:56:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:49,291 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 01:56:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:49,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663672190] [2022-12-13 01:56:49,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663672190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:49,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:49,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052378474] [2022-12-13 01:56:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:49,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:49,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:49,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:49,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:49,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:49,343 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:49,343 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:49,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:49,344 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:49,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:49,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:49,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:49,344 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:49,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:49,345 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,345 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:49,346 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:49,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:49,346 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:49,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:49,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,349 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:49,349 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:49,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:49,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:49,467 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:49,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:56:49,468 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:49,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-13 01:56:49,468 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1203078737, now seen corresponding path program 1 times [2022-12-13 01:56:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:49,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648418487] [2022-12-13 01:56:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:49,523 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 01:56:49,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:49,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648418487] [2022-12-13 01:56:49,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648418487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:49,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525617300] [2022-12-13 01:56:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:49,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:49,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:49,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:49,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:49,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:49,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:49,569 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:49,569 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:49,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:49,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:49,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:49,570 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:49,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:49,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:49,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:49,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:49,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:49,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:49,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:49,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,576 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:49,576 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:49,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:49,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:49,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:49,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:56:49,721 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:49,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-13 01:56:49,721 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:49,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1260337039, now seen corresponding path program 1 times [2022-12-13 01:56:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:49,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751474874] [2022-12-13 01:56:49,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:49,805 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 01:56:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:49,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751474874] [2022-12-13 01:56:49,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751474874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:49,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:49,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:49,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770921103] [2022-12-13 01:56:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:49,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:49,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:49,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:49,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:49,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:49,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:49,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:49,863 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:49,864 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:49,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:49,865 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:49,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:49,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:49,866 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:49,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:49,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:49,867 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:49,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:49,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:49,867 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:49,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:49,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:49,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,872 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:49,872 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:49,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:49,872 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:49,872 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:50,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:50,009 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 01:56:50,009 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:50,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:50,009 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:50,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-13 01:56:50,009 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:50,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:50,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1317595341, now seen corresponding path program 1 times [2022-12-13 01:56:50,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:50,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85567531] [2022-12-13 01:56:50,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:50,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:50,084 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 01:56:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:50,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85567531] [2022-12-13 01:56:50,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85567531] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:50,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:50,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032164638] [2022-12-13 01:56:50,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:50,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:50,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:50,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:50,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:50,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:50,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:50,147 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:50,148 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:50,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:50,149 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:50,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:50,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:50,150 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:50,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:50,151 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,151 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:50,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:50,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:50,153 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:50,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:50,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,156 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:50,156 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:50,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:50,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:50,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:56:50,282 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:50,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:50,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-13 01:56:50,283 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1374853643, now seen corresponding path program 1 times [2022-12-13 01:56:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:50,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637735473] [2022-12-13 01:56:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:56:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:50,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637735473] [2022-12-13 01:56:50,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637735473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:50,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:50,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299742049] [2022-12-13 01:56:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:50,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:50,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:50,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:50,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:50,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:50,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:50,459 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:50,459 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:50,460 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:50,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:50,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:50,461 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:50,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:50,463 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:50,463 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:50,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:50,463 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:50,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:50,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,468 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:50,468 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:50,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:50,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:50,615 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:50,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 01:56:50,616 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:50,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-13 01:56:50,616 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1432111945, now seen corresponding path program 1 times [2022-12-13 01:56:50,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401225365] [2022-12-13 01:56:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:50,674 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 01:56:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:50,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401225365] [2022-12-13 01:56:50,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401225365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:50,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:50,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:50,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153649665] [2022-12-13 01:56:50,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:50,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:50,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:50,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:50,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:50,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:50,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:50,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:50,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:50,728 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:50,728 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:50,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:50,729 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:50,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:50,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:50,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:50,729 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:50,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:50,730 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:50,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:50,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:50,731 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:50,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:50,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,734 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:50,734 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:50,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:50,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:50,859 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:50,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:56:50,860 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:50,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:50,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:50,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-13 01:56:50,860 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1489370247, now seen corresponding path program 1 times [2022-12-13 01:56:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:50,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210566047] [2022-12-13 01:56:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:50,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:50,936 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 01:56:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:50,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210566047] [2022-12-13 01:56:50,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210566047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:50,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:50,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113561159] [2022-12-13 01:56:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:50,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:50,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:50,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:50,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:50,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:50,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:50,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:50,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:50,993 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:50,993 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:50,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:50,994 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:50,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:50,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:50,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:50,994 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:50,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:50,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:50,996 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:50,996 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:50,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:50,996 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:50,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:50,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:50,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:50,999 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:50,999 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:50,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:51,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:51,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:51,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 01:56:51,143 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:51,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:51,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:51,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:51,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-13 01:56:51,144 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1546628549, now seen corresponding path program 1 times [2022-12-13 01:56:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:51,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235674925] [2022-12-13 01:56:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:51,226 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 01:56:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:51,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235674925] [2022-12-13 01:56:51,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235674925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:51,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:51,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266644951] [2022-12-13 01:56:51,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:51,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:51,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:51,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:51,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:51,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:51,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:51,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:51,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:51,285 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:51,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:51,286 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:51,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:51,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:51,287 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:51,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:51,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:51,289 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:51,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:51,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:51,290 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:51,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:51,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,294 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:51,295 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:51,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:51,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,295 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:51,455 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:51,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 01:56:51,456 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:51,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:51,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:51,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:51,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-13 01:56:51,457 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1603886851, now seen corresponding path program 1 times [2022-12-13 01:56:51,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22553346] [2022-12-13 01:56:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:51,533 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 01:56:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22553346] [2022-12-13 01:56:51,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22553346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:51,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:51,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747144554] [2022-12-13 01:56:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:51,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:51,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:51,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:51,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:51,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:51,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:51,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:51,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:51,605 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:51,605 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:51,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:51,613 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:51,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:51,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:51,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:51,614 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:51,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:51,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:51,616 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,616 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:51,616 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:51,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:51,616 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:51,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:51,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,621 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:51,621 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:51,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:51,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:51,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:51,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 01:56:51,767 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:51,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:51,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:51,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:51,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-13 01:56:51,768 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:51,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1661145153, now seen corresponding path program 1 times [2022-12-13 01:56:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:51,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719870186] [2022-12-13 01:56:51,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:51,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:51,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 01:56:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719870186] [2022-12-13 01:56:51,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719870186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:51,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:51,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:51,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047518846] [2022-12-13 01:56:51,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:51,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:51,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:51,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:51,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:51,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:51,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:51,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:51,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:51,900 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:51,901 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:51,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:51,902 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:51,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:51,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:51,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:51,903 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:51,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:51,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:51,904 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,905 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:51,905 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:51,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:51,905 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:51,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:51,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:51,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,910 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:51,911 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:51,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:51,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:51,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:52,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:52,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:56:52,046 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:52,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:52,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:52,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-13 01:56:52,046 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:52,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1718403455, now seen corresponding path program 1 times [2022-12-13 01:56:52,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:52,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860438626] [2022-12-13 01:56:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:52,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:52,141 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 01:56:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:52,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860438626] [2022-12-13 01:56:52,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860438626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:52,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:52,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:52,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416374969] [2022-12-13 01:56:52,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:52,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:52,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:52,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:52,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:52,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:52,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:52,211 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:52,211 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:52,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:52,212 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:52,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:52,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:52,213 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:52,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:52,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:52,215 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:52,215 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:52,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:52,216 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:52,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:52,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:52,220 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:52,221 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:52,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:52,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:52,221 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:52,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:52,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 01:56:52,365 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:52,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:52,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:52,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-13 01:56:52,366 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:52,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1775661757, now seen corresponding path program 1 times [2022-12-13 01:56:52,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:52,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106802875] [2022-12-13 01:56:52,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:52,418 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 01:56:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:52,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106802875] [2022-12-13 01:56:52,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106802875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:52,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:52,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586159636] [2022-12-13 01:56:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:52,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:52,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:52,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:52,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:52,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:52,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:52,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:52,463 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:52,463 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:52,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:52,464 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:52,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:52,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:52,465 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:52,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:52,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:52,466 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:52,466 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:52,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:52,466 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:52,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:52,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:52,470 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:52,470 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:52,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:52,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:52,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:52,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:52,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:56:52,598 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:52,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:52,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:52,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-13 01:56:52,598 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1832920059, now seen corresponding path program 1 times [2022-12-13 01:56:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:52,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832727667] [2022-12-13 01:56:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:52,685 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 01:56:52,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:52,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832727667] [2022-12-13 01:56:52,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832727667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:52,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:52,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782038778] [2022-12-13 01:56:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:52,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:52,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:52,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:52,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:52,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:52,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:52,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:52,752 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:52,752 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:52,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:52,753 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:52,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:52,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:52,755 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:52,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:52,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:52,757 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:52,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:52,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:52,757 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:52,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:52,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:52,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:52,762 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:52,762 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:52,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:52,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:52,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:52,922 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:52,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 166 [2022-12-13 01:56:52,923 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:52,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:52,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:52,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:52,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-13 01:56:52,924 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1890178361, now seen corresponding path program 1 times [2022-12-13 01:56:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321583759] [2022-12-13 01:56:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:53,026 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 01:56:53,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:53,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321583759] [2022-12-13 01:56:53,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321583759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:53,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:53,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277717406] [2022-12-13 01:56:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:53,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:53,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:53,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:53,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:53,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:53,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:53,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:53,091 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:53,092 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:53,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:53,093 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:53,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:53,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:53,094 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:53,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:53,095 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,095 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:53,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:53,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:53,095 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:53,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:53,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,099 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:53,099 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:53,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:53,099 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:53,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:53,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 01:56:53,244 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:53,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:53,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:53,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-13 01:56:53,244 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:53,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:53,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1947436663, now seen corresponding path program 1 times [2022-12-13 01:56:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:53,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541998974] [2022-12-13 01:56:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:53,338 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 01:56:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:53,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541998974] [2022-12-13 01:56:53,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541998974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:53,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736651079] [2022-12-13 01:56:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:53,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:53,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:53,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:53,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:53,416 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:53,416 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:53,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:53,417 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:53,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:53,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:53,418 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:53,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:53,420 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:53,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:53,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:53,420 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:53,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:53,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,424 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:53,425 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:53,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:53,425 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,425 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:53,561 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:53,562 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 01:56:53,562 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:53,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,562 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:53,562 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:53,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-13 01:56:53,562 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:53,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2004694965, now seen corresponding path program 1 times [2022-12-13 01:56:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:53,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941765980] [2022-12-13 01:56:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:53,639 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 01:56:53,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941765980] [2022-12-13 01:56:53,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941765980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:53,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:53,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264951103] [2022-12-13 01:56:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:53,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:53,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:53,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:53,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:53,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:53,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:53,705 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:53,706 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:53,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:53,707 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:53,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:53,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:53,708 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:53,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:53,710 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:53,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:53,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:53,710 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:53,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:53,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,715 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:53,715 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:53,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:53,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:53,868 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:53,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 01:56:53,868 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:53,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,869 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:53,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:53,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-12-13 01:56:53,869 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:53,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:53,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2061953267, now seen corresponding path program 1 times [2022-12-13 01:56:53,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:53,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308128488] [2022-12-13 01:56:53,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:53,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:53,922 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 01:56:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:53,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308128488] [2022-12-13 01:56:53,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308128488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:53,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:53,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121699803] [2022-12-13 01:56:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:53,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:53,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:53,923 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:53,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:53,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:53,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:53,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:53,977 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:53,977 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:53,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:53,978 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:53,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:53,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:53,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:53,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:53,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:53,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:53,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:53,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:53,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:53,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:53,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:53,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,984 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:53,984 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:53,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:53,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:53,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:54,115 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:54,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:56:54,116 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:54,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:54,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:54,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-13 01:56:54,116 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:54,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2119211569, now seen corresponding path program 1 times [2022-12-13 01:56:54,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:54,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000319343] [2022-12-13 01:56:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:54,176 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 01:56:54,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:54,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000319343] [2022-12-13 01:56:54,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000319343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:54,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:54,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:54,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977437357] [2022-12-13 01:56:54,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:54,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:54,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:54,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:54,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:54,177 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:54,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:54,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:54,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:54,239 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:54,239 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:54,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:54,240 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:54,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:54,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:54,241 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:54,241 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:54,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:54,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:54,243 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:54,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:54,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:54,245 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:54,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:54,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:54,263 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:54,264 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:54,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:54,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:54,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:54,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:54,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 01:56:54,412 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:54,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:54,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:54,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-13 01:56:54,412 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:54,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2118497425, now seen corresponding path program 1 times [2022-12-13 01:56:54,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:54,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972856874] [2022-12-13 01:56:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:54,493 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 01:56:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:54,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972856874] [2022-12-13 01:56:54,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972856874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:54,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:54,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:54,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831495154] [2022-12-13 01:56:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:54,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:54,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:54,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:54,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:54,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:54,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:54,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:54,551 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:54,551 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:54,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:54,552 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:54,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:54,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:54,553 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:54,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:54,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:54,554 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:54,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:54,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:54,554 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:54,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:54,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:54,558 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:54,558 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:54,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:54,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:54,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:54,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:54,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:56:54,682 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:54,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:54,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:54,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-13 01:56:54,682 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:54,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2061239123, now seen corresponding path program 1 times [2022-12-13 01:56:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:54,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687108676] [2022-12-13 01:56:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:54,737 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 01:56:54,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687108676] [2022-12-13 01:56:54,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687108676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:54,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:54,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047008227] [2022-12-13 01:56:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:54,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:54,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:54,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:54,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:54,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:54,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:54,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:54,790 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:54,790 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:54,791 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:54,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:54,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:54,792 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:54,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:54,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:54,793 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:54,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:54,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:54,793 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:54,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:54,794 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:54,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:54,796 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:54,796 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:54,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:54,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:54,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:54,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:54,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:56:54,936 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:54,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:54,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:54,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-13 01:56:54,937 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:54,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2003980821, now seen corresponding path program 1 times [2022-12-13 01:56:54,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:54,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527002805] [2022-12-13 01:56:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:54,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:54,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 01:56:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:54,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527002805] [2022-12-13 01:56:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527002805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:54,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480743207] [2022-12-13 01:56:54,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:54,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:54,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:54,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:54,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:54,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:54,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:54,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:54,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:55,035 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:55,035 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:55,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:55,036 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:55,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:55,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:55,037 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:55,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:55,038 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:55,038 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:55,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:55,038 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:55,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:55,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,041 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:55,041 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:55,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:55,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:55,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:56:55,161 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:55,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:55,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:55,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-13 01:56:55,161 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:55,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:55,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1946722519, now seen corresponding path program 1 times [2022-12-13 01:56:55,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:55,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864236153] [2022-12-13 01:56:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:55,218 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 01:56:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:55,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864236153] [2022-12-13 01:56:55,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864236153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:55,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:55,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:55,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058467586] [2022-12-13 01:56:55,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:55,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:55,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:55,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:55,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:55,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:55,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:55,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:55,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:55,294 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:55,294 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:55,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:55,295 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:55,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:55,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:55,296 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:55,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:55,297 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:55,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:55,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:55,297 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:55,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:55,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,300 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:55,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:55,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:55,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:55,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:55,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:56:55,433 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:55,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:55,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:55,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-13 01:56:55,434 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:55,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1889464217, now seen corresponding path program 1 times [2022-12-13 01:56:55,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:55,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146262979] [2022-12-13 01:56:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:55,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:55,485 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 01:56:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:55,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146262979] [2022-12-13 01:56:55,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146262979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:55,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:55,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476030533] [2022-12-13 01:56:55,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:55,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:55,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:55,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:55,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:55,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:55,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:55,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:55,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:55,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:55,528 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:55,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:55,529 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:55,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:55,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:55,530 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:55,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:55,531 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:55,532 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:55,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:55,532 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:55,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:55,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,535 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:55,535 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:55,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:55,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:55,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:55,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:56:55,656 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:55,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:55,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:55,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-13 01:56:55,656 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:55,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1832205915, now seen corresponding path program 1 times [2022-12-13 01:56:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:55,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31558858] [2022-12-13 01:56:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:55,726 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 01:56:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31558858] [2022-12-13 01:56:55,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31558858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:55,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:55,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770160889] [2022-12-13 01:56:55,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:55,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:55,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:55,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:55,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:55,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:55,787 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:55,787 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:55,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:55,788 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:55,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:55,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:55,788 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:55,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:55,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:55,789 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:55,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:55,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:55,790 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:55,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:55,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:55,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,793 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:55,793 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:55,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:55,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:55,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:55,920 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:55,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:56:55,920 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:55,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:55,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-13 01:56:55,921 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1774947613, now seen corresponding path program 1 times [2022-12-13 01:56:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141953488] [2022-12-13 01:56:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:55,982 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 01:56:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:55,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141953488] [2022-12-13 01:56:55,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141953488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:55,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:55,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389335562] [2022-12-13 01:56:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:55,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:55,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:55,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:55,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:55,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:55,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:56,036 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:56,036 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:56,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:56,037 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:56,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:56,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:56,037 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:56,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:56,038 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:56,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:56,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:56,039 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:56,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:56,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,042 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:56,042 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:56,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:56,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:56,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:56,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:56:56,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:56,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:56,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-13 01:56:56,169 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1717689311, now seen corresponding path program 1 times [2022-12-13 01:56:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:56,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280531051] [2022-12-13 01:56:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:56:56,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:56,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280531051] [2022-12-13 01:56:56,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280531051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:56,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:56,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367209320] [2022-12-13 01:56:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:56,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:56,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:56,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:56,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:56,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:56,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:56,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:56,284 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:56,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:56,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:56,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:56,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:56,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:56,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:56,286 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:56,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:56,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:56,286 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:56,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:56,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,289 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:56,290 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:56,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:56,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:56,417 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:56,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:56:56,417 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:56,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:56,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:56,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-13 01:56:56,418 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:56,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1660431009, now seen corresponding path program 1 times [2022-12-13 01:56:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:56,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856603513] [2022-12-13 01:56:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:56,470 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 01:56:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:56,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856603513] [2022-12-13 01:56:56,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856603513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:56,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:56,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:56,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670523001] [2022-12-13 01:56:56,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:56,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:56,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:56,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:56,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:56,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:56,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:56,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:56,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:56,530 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:56,530 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:56,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:56,531 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:56,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:56,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:56,531 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:56,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:56,532 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,533 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:56,533 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:56,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:56,533 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:56,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:56,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,536 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:56,536 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:56,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:56,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:56,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:56,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:56:56,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:56,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:56,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:56,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-13 01:56:56,659 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:56,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1603172707, now seen corresponding path program 1 times [2022-12-13 01:56:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:56,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213682549] [2022-12-13 01:56:56,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:56,710 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 01:56:56,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:56,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213682549] [2022-12-13 01:56:56,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213682549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:56,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:56,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513495695] [2022-12-13 01:56:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:56,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:56,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:56,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:56,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:56,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:56,764 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:56,765 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:56,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:56,765 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:56,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:56,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:56,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:56,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:56,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:56,767 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:56,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:56,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:56,767 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:56,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:56,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:56,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,771 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:56,771 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:56,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:56,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:56,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:56,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:56,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:56:56,892 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:56,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:56,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:56,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-13 01:56:56,892 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1545914405, now seen corresponding path program 1 times [2022-12-13 01:56:56,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:56,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985806966] [2022-12-13 01:56:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:56,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:56,946 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 01:56:56,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:56,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985806966] [2022-12-13 01:56:56,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985806966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:56,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:56,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076042820] [2022-12-13 01:56:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:56,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:56,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:56,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:56,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:56,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:56,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:57,008 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:57,008 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:57,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:57,008 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:57,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:57,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:57,009 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:57,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:57,010 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:57,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:57,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:57,010 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:57,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:57,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,014 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:57,014 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:57,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:57,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:57,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:57,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:56:57,128 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:57,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:57,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-13 01:56:57,128 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1488656103, now seen corresponding path program 1 times [2022-12-13 01:56:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:57,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170680746] [2022-12-13 01:56:57,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:57,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:57,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 01:56:57,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:57,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170680746] [2022-12-13 01:56:57,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170680746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:57,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:57,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791785987] [2022-12-13 01:56:57,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:57,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:57,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:57,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:57,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:57,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:57,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:57,224 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:57,224 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:57,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:57,225 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:57,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:57,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:57,227 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:57,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:57,228 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:57,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:57,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:57,229 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:57,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:57,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,232 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:57,232 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:57,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:57,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:57,363 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:57,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:56:57,364 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:57,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:57,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:57,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-13 01:56:57,364 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:57,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:57,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1431397801, now seen corresponding path program 1 times [2022-12-13 01:56:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:57,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448209033] [2022-12-13 01:56:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:57,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:57,413 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 01:56:57,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:57,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448209033] [2022-12-13 01:56:57,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448209033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:57,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:57,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:57,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434618270] [2022-12-13 01:56:57,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:57,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:57,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:57,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:57,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:57,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:57,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:57,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:57,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:57,500 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:57,500 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:57,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:57,501 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:57,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:57,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:57,502 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:57,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:57,503 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:57,503 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:57,503 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:57,503 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:57,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:57,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,506 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:57,506 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:57,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:57,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:57,635 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:57,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:56:57,635 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:57,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:57,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:57,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-13 01:56:57,635 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:57,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:57,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1374139499, now seen corresponding path program 1 times [2022-12-13 01:56:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:57,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526607698] [2022-12-13 01:56:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:57,689 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 01:56:57,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:57,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526607698] [2022-12-13 01:56:57,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526607698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:57,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:57,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339278392] [2022-12-13 01:56:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:57,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:57,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:57,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:57,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:57,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:57,737 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:57,737 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:57,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:57,738 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:57,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:57,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:57,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:57,740 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:57,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:57,741 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,741 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:57,741 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:57,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:57,741 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:57,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:57,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,744 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:57,744 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:57,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:57,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:57,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:57,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:56:57,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:57,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:57,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:57,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-13 01:56:57,864 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1316881197, now seen corresponding path program 1 times [2022-12-13 01:56:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:57,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019624079] [2022-12-13 01:56:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:57,916 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 01:56:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:57,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019624079] [2022-12-13 01:56:57,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019624079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:57,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:57,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:57,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715566235] [2022-12-13 01:56:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:57,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:57,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:57,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:57,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:57,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:57,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:57,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:57,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:57,960 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:57,961 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:57,961 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:57,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:57,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:57,962 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:57,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:57,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:57,963 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:57,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:57,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:57,963 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:57,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:57,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:57,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:57,967 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:57,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:57,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:57,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:58,083 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:58,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:56:58,083 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:58,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:58,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:58,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-13 01:56:58,084 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:58,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1259622895, now seen corresponding path program 1 times [2022-12-13 01:56:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:58,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900517997] [2022-12-13 01:56:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:58,135 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 01:56:58,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:58,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900517997] [2022-12-13 01:56:58,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900517997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:58,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:58,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379984677] [2022-12-13 01:56:58,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:58,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:58,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:58,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:58,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:58,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:58,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:58,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:58,183 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:58,183 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:58,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:58,184 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:58,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:58,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:58,186 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:58,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:58,188 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:58,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:58,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:58,188 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:58,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:58,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,191 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:58,191 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:58,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:58,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:58,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:58,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:56:58,310 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:58,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:58,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:58,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-13 01:56:58,310 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1202364593, now seen corresponding path program 1 times [2022-12-13 01:56:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:58,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615641336] [2022-12-13 01:56:58,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:58,382 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 01:56:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:58,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615641336] [2022-12-13 01:56:58,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615641336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:58,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:58,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726658812] [2022-12-13 01:56:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:58,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:58,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:58,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:58,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:58,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:58,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:58,444 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:58,444 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:58,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:58,444 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:58,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:58,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:58,446 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:58,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:58,447 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:58,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:58,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:58,447 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:58,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:58,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,450 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:58,450 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:58,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:58,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:58,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:58,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:56:58,593 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:58,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:58,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-13 01:56:58,593 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:58,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1145106291, now seen corresponding path program 1 times [2022-12-13 01:56:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:58,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834856468] [2022-12-13 01:56:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:58,644 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 01:56:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:58,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834856468] [2022-12-13 01:56:58,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834856468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:58,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:58,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951944688] [2022-12-13 01:56:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:58,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:58,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:58,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:58,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:58,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:58,688 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:58,689 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:58,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:58,689 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:58,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:58,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:58,691 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:58,691 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:58,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:58,692 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:58,692 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:58,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:58,692 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:58,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:58,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,696 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:58,696 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:58,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:58,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:58,815 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:58,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:56:58,815 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:58,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:58,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:58,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-13 01:56:58,815 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:58,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1087847989, now seen corresponding path program 1 times [2022-12-13 01:56:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993034378] [2022-12-13 01:56:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:58,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:58,869 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 01:56:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:58,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993034378] [2022-12-13 01:56:58,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993034378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:58,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:58,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:58,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866835131] [2022-12-13 01:56:58,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:58,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:58,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:58,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:58,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:58,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:58,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:58,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:58,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:58,922 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:58,922 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:58,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:58,922 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:58,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:58,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:58,924 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:58,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:58,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:58,925 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:58,925 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:58,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:58,925 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:58,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:58,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:58,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,928 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:58,928 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:58,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:58,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:58,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:59,051 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:59,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:56:59,052 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:59,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:59,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:59,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-13 01:56:59,052 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1030589687, now seen corresponding path program 1 times [2022-12-13 01:56:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:59,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564538477] [2022-12-13 01:56:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:59,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:59,115 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 01:56:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:59,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564538477] [2022-12-13 01:56:59,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564538477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:59,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973193440] [2022-12-13 01:56:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:59,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:59,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:59,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:59,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:59,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:59,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:59,167 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:59,168 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:59,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:59,168 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:59,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:59,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:59,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:59,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:59,169 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:59,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:59,170 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:59,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:59,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:59,170 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:59,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:59,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,173 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:59,174 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:59,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:59,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:59,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:59,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:56:59,299 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:59,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:59,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:59,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-13 01:56:59,300 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:59,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:59,300 INFO L85 PathProgramCache]: Analyzing trace with hash -973331385, now seen corresponding path program 1 times [2022-12-13 01:56:59,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:59,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68933333] [2022-12-13 01:56:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:59,352 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 01:56:59,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68933333] [2022-12-13 01:56:59,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68933333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:59,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:59,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258731666] [2022-12-13 01:56:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:59,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:59,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:59,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:59,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:59,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:59,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:59,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:59,398 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:59,398 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:59,399 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:59,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:59,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:59,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:59,400 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:59,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:59,401 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:59,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:59,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:59,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,402 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:59,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:59,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,405 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:59,405 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:59,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:59,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,406 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:59,521 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:59,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:56:59,522 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:59,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:59,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:59,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-13 01:56:59,522 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -916073083, now seen corresponding path program 1 times [2022-12-13 01:56:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:59,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557574690] [2022-12-13 01:56:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:56:59,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:59,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557574690] [2022-12-13 01:56:59,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557574690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:59,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:59,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705679322] [2022-12-13 01:56:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:59,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:59,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:59,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:59,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:59,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:59,634 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:56:59,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:59,634 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:59,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:59,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:59,635 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:59,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:59,636 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:59,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:59,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:59,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:59,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:59,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,640 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:59,640 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:56:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:59,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:56:59,783 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:56:59,783 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:56:59,784 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:56:59,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:56:59,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:56:59,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-13 01:56:59,784 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:56:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:56:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -858814781, now seen corresponding path program 1 times [2022-12-13 01:56:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:56:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179396655] [2022-12-13 01:56:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:56:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:56:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:56:59,837 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 01:56:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:56:59,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179396655] [2022-12-13 01:56:59,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179396655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:56:59,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:56:59,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:56:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919512513] [2022-12-13 01:56:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:56:59,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:56:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:56:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:56:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:56:59,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:56:59,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:56:59,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:56:59,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:56:59,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:56:59,881 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:56:59,881 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:56:59,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:56:59,881 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:56:59,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:56:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:56:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:56:59,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:56:59,882 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:56:59,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:56:59,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:56:59,883 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:56:59,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:56:59,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:56:59,884 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:56:59,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:56:59,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:56:59,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,887 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:56:59,887 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:56:59,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:56:59,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:56:59,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:00,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:00,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:00,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:00,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:00,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:00,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-13 01:57:00,004 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash -801556479, now seen corresponding path program 1 times [2022-12-13 01:57:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776864811] [2022-12-13 01:57:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:00,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:00,054 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 01:57:00,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:00,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776864811] [2022-12-13 01:57:00,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776864811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:00,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:00,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:00,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147694688] [2022-12-13 01:57:00,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:00,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:00,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:00,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:00,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:00,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:00,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:00,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:00,102 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:00,103 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:00,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:00,104 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:00,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:00,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:00,105 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:00,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:00,106 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:00,107 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:00,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:00,107 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:00,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:00,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,111 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:00,111 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:00,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:00,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:00,271 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:00,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 01:57:00,272 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:00,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:00,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:00,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-13 01:57:00,272 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:00,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -744298177, now seen corresponding path program 1 times [2022-12-13 01:57:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:00,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219586982] [2022-12-13 01:57:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:00,357 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 01:57:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:00,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219586982] [2022-12-13 01:57:00,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219586982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:00,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:00,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868257597] [2022-12-13 01:57:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:00,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:00,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:00,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:00,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:00,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:00,419 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:00,419 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:00,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:00,420 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:00,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:00,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:00,421 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:00,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:00,422 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:00,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:00,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:00,423 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:00,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:00,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,428 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:00,428 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:00,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:00,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:00,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:00,572 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 01:57:00,572 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:00,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:00,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:00,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-13 01:57:00,573 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash -687039875, now seen corresponding path program 1 times [2022-12-13 01:57:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:00,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403463617] [2022-12-13 01:57:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:00,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:00,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403463617] [2022-12-13 01:57:00,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403463617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:00,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:00,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:00,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914845252] [2022-12-13 01:57:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:00,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:00,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:00,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:00,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:00,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:00,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:00,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:00,691 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:00,691 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:00,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:00,692 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:00,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:00,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:00,693 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:00,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:00,694 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:00,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:00,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:00,694 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:00,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:00,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,697 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:00,697 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:00,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:00,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:00,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:00,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:00,831 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:00,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:00,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:00,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-13 01:57:00,831 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -629781573, now seen corresponding path program 1 times [2022-12-13 01:57:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:00,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463470867] [2022-12-13 01:57:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:00,883 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 01:57:00,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:00,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463470867] [2022-12-13 01:57:00,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463470867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:00,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:00,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372156254] [2022-12-13 01:57:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:00,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:00,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:00,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:00,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:00,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:00,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:00,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:00,930 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:00,930 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:00,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:00,931 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:00,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:00,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:00,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:00,931 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:00,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:00,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:00,932 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:00,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:00,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:00,933 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:00,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:00,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:00,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,936 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:00,936 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:00,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:00,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:00,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:01,072 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:01,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:01,073 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:01,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:01,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:01,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-13 01:57:01,074 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:01,074 INFO L85 PathProgramCache]: Analyzing trace with hash -572523271, now seen corresponding path program 1 times [2022-12-13 01:57:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:01,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648022229] [2022-12-13 01:57:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:01,139 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 01:57:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:01,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648022229] [2022-12-13 01:57:01,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648022229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:01,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:01,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:01,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290003605] [2022-12-13 01:57:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:01,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:01,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:01,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:01,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:01,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:01,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:01,191 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:01,191 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:01,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:01,192 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:01,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:01,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:01,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:01,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:01,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:01,196 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:01,196 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:01,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:01,196 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:01,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:01,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,199 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:01,199 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:01,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:01,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:01,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:01,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:57:01,339 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:01,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:01,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:01,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-13 01:57:01,340 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:01,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -515264969, now seen corresponding path program 1 times [2022-12-13 01:57:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:01,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263148935] [2022-12-13 01:57:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:01,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:01,392 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 01:57:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263148935] [2022-12-13 01:57:01,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263148935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:01,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:01,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001586643] [2022-12-13 01:57:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:01,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:01,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:01,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:01,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:01,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:01,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:01,443 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:01,443 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:01,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:01,443 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:01,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:01,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:01,444 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:01,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:01,445 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:01,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:01,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:01,445 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:01,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:01,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,448 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:01,449 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:01,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:01,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:01,564 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:01,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:01,565 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:01,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:01,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:01,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-13 01:57:01,565 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash -458006667, now seen corresponding path program 1 times [2022-12-13 01:57:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:01,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257111330] [2022-12-13 01:57:01,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:01,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:01,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 01:57:01,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:01,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257111330] [2022-12-13 01:57:01,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257111330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:01,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:01,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995417572] [2022-12-13 01:57:01,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:01,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:01,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:01,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:01,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:01,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:01,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:01,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:01,674 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:01,675 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:01,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:01,675 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:01,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:01,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:01,676 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:01,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:01,677 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:01,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:01,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:01,677 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:01,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:01,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,680 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:01,681 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:01,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:01,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:01,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:01,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:57:01,810 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:01,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:01,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-13 01:57:01,811 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -400748365, now seen corresponding path program 1 times [2022-12-13 01:57:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:01,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015373107] [2022-12-13 01:57:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:01,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:01,862 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 01:57:01,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015373107] [2022-12-13 01:57:01,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015373107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:01,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:01,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:01,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162212512] [2022-12-13 01:57:01,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:01,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:01,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:01,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:01,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:01,863 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:01,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:01,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:01,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:01,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:01,912 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:01,912 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:01,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:01,913 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:01,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:01,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:01,914 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:01,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:01,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:01,915 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:01,915 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:01,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:01,915 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:01,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:01,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:01,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,918 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:01,918 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:01,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:01,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:01,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:02,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:02,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 01:57:02,068 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:02,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:02,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:02,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-13 01:57:02,069 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -343490063, now seen corresponding path program 1 times [2022-12-13 01:57:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:02,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351207766] [2022-12-13 01:57:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:02,127 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 01:57:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:02,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351207766] [2022-12-13 01:57:02,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351207766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:02,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:02,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:02,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340314646] [2022-12-13 01:57:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:02,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:02,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:02,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:02,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:02,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:02,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:02,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:02,173 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:02,173 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:02,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:02,174 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:02,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:02,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:02,175 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:02,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:02,176 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:02,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:02,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:02,176 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:02,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:02,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:02,179 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:02,179 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:02,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:02,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:02,295 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:02,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:02,296 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:02,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:02,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:02,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-13 01:57:02,296 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash -286231761, now seen corresponding path program 1 times [2022-12-13 01:57:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:02,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537790040] [2022-12-13 01:57:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:02,378 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 01:57:02,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:02,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537790040] [2022-12-13 01:57:02,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537790040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:02,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:02,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812362258] [2022-12-13 01:57:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:02,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:02,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:02,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:02,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:02,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:02,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:02,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:02,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:02,437 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:02,437 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:02,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:02,438 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:02,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:02,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:02,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:02,439 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:02,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:02,439 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,440 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:02,440 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:02,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:02,440 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:02,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:02,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:02,443 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:02,443 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:02,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:02,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:02,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:02,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:02,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:57:02,579 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:02,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:02,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-13 01:57:02,579 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash -228973459, now seen corresponding path program 1 times [2022-12-13 01:57:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:02,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490616099] [2022-12-13 01:57:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:02,651 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 01:57:02,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:02,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490616099] [2022-12-13 01:57:02,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490616099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:02,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:02,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005428634] [2022-12-13 01:57:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:02,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:02,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:02,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:02,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:02,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:02,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:02,708 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:02,708 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:02,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:02,709 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:02,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:02,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:02,709 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:02,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:02,710 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:02,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:02,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:02,711 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:02,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:02,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:02,715 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:02,715 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:02,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:02,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:02,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:02,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:02,848 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:02,848 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:02,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:02,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:02,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-13 01:57:02,848 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:02,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:02,849 INFO L85 PathProgramCache]: Analyzing trace with hash -171715157, now seen corresponding path program 1 times [2022-12-13 01:57:02,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:02,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596179914] [2022-12-13 01:57:02,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:02,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:02,919 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 01:57:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:02,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596179914] [2022-12-13 01:57:02,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596179914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:02,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:02,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706029473] [2022-12-13 01:57:02,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:02,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:02,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:02,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:02,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:02,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:02,995 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:02,995 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:02,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:02,996 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:02,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:02,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:02,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:02,997 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:02,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:02,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:02,998 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:02,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:03,002 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:03,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:03,002 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:03,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:03,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,006 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:03,007 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:03,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:03,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:03,144 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:03,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:57:03,145 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:03,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:03,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:03,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-13 01:57:03,145 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash -114456855, now seen corresponding path program 1 times [2022-12-13 01:57:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:03,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258467875] [2022-12-13 01:57:03,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:03,199 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 01:57:03,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:03,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258467875] [2022-12-13 01:57:03,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258467875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:03,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:03,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304984111] [2022-12-13 01:57:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:03,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:03,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:03,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:03,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:03,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:03,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:03,241 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:03,241 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:03,242 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:03,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:03,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:03,243 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:03,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:03,243 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:03,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:03,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:03,244 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:03,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:03,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,247 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:03,247 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:03,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:03,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:03,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:03,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:03,379 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:03,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:03,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:03,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-13 01:57:03,379 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:03,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash -57198553, now seen corresponding path program 1 times [2022-12-13 01:57:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:03,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392694168] [2022-12-13 01:57:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:03,431 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 01:57:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:03,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392694168] [2022-12-13 01:57:03,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392694168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:03,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:03,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049986470] [2022-12-13 01:57:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:03,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:03,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:03,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:03,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:03,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:03,477 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:03,477 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:03,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:03,477 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:03,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:03,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:03,478 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:03,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:03,479 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:03,479 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:03,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:03,479 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:03,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:03,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,482 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:03,482 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:03,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:03,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:03,598 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:03,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:03,598 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:03,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:03,599 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:03,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-13 01:57:03,599 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:03,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 59749, now seen corresponding path program 1 times [2022-12-13 01:57:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:03,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228613484] [2022-12-13 01:57:03,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:03,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:03,649 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 01:57:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:03,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228613484] [2022-12-13 01:57:03,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228613484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:03,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:03,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:03,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196634053] [2022-12-13 01:57:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:03,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:03,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:03,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:03,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:03,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:03,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:03,709 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:03,709 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:03,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:03,710 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:03,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:03,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:03,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:03,710 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:03,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:03,714 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:03,715 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:03,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:03,715 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,715 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:03,715 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:03,715 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,718 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:03,718 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:03,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:03,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:03,854 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:03,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:57:03,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:03,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:03,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:03,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-13 01:57:03,855 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:03,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash 57318051, now seen corresponding path program 1 times [2022-12-13 01:57:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:03,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037562082] [2022-12-13 01:57:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:03,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:03,904 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 01:57:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037562082] [2022-12-13 01:57:03,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037562082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:03,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:03,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034334416] [2022-12-13 01:57:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:03,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:03,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:03,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:03,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:03,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:03,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:03,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:03,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:03,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:03,949 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:03,949 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:03,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:03,949 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:03,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:03,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:03,950 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:03,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:03,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:03,951 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:03,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:03,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:03,951 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:03,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:03,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:03,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,954 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:03,954 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:03,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:03,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:03,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:04,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:04,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:57:04,079 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:04,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:04,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:04,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-13 01:57:04,080 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 114576353, now seen corresponding path program 1 times [2022-12-13 01:57:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:04,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688638071] [2022-12-13 01:57:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:04,136 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 01:57:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688638071] [2022-12-13 01:57:04,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688638071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:04,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:04,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183861282] [2022-12-13 01:57:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:04,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:04,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:04,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:04,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:04,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:04,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:04,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:04,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:04,181 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:04,181 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:04,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:04,182 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:04,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:04,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:04,182 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:04,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:04,183 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:04,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:04,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:04,184 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:04,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:04,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,187 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:04,187 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:04,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:04,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:04,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:04,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:04,318 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:04,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:04,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:04,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-13 01:57:04,318 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:04,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 171834655, now seen corresponding path program 1 times [2022-12-13 01:57:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:04,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072953603] [2022-12-13 01:57:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:04,367 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 01:57:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:04,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072953603] [2022-12-13 01:57:04,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072953603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:04,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:04,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872979651] [2022-12-13 01:57:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:04,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:04,368 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:04,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:04,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:04,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:04,422 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:04,423 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:04,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:04,423 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:04,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:04,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:04,424 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:04,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:04,427 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:04,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:04,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:04,428 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:04,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:04,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,431 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:04,431 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:04,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:04,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:04,562 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:04,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:04,563 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:04,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,563 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:04,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:04,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-13 01:57:04,563 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:04,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:04,563 INFO L85 PathProgramCache]: Analyzing trace with hash 229092957, now seen corresponding path program 1 times [2022-12-13 01:57:04,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:04,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368517624] [2022-12-13 01:57:04,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:04,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:04,615 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 01:57:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:04,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368517624] [2022-12-13 01:57:04,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368517624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:04,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:04,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475009415] [2022-12-13 01:57:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:04,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:04,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:04,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:04,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:04,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:04,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:04,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:04,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:04,663 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:04,663 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:04,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:04,664 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:04,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:04,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:04,664 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:04,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:04,665 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:04,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:04,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:04,665 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:04,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:04,666 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,668 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:04,669 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:04,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:04,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:04,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:04,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:04,792 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:04,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:04,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:04,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-13 01:57:04,792 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:04,792 INFO L85 PathProgramCache]: Analyzing trace with hash 286351259, now seen corresponding path program 1 times [2022-12-13 01:57:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:04,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625061282] [2022-12-13 01:57:04,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:04,857 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 01:57:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:04,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625061282] [2022-12-13 01:57:04,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625061282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:04,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:04,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985521339] [2022-12-13 01:57:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:04,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:04,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:04,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:04,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:04,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:04,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:04,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:04,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:04,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:04,903 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:04,904 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:04,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:04,904 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:04,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:04,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:04,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:04,907 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:04,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:04,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:04,908 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:04,908 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:04,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:04,908 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:04,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:04,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:04,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,911 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:04,911 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:04,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:04,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:04,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:05,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:05,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:05,028 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:05,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:05,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:05,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-13 01:57:05,029 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:05,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:05,029 INFO L85 PathProgramCache]: Analyzing trace with hash 343609561, now seen corresponding path program 1 times [2022-12-13 01:57:05,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:05,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093689586] [2022-12-13 01:57:05,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:05,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:05,086 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 01:57:05,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:05,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093689586] [2022-12-13 01:57:05,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093689586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:05,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:05,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:05,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828631995] [2022-12-13 01:57:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:05,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:05,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:05,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:05,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:05,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:05,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:05,139 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:05,139 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:05,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:05,140 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:05,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:05,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:05,140 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:05,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:05,141 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:05,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:05,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:05,141 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:05,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:05,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,145 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:05,145 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:05,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:05,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:05,264 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:05,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:05,264 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:05,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:05,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:05,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-13 01:57:05,265 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 400867863, now seen corresponding path program 1 times [2022-12-13 01:57:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:05,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189681744] [2022-12-13 01:57:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:05,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:05,322 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 01:57:05,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:05,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189681744] [2022-12-13 01:57:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189681744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:05,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:05,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614905244] [2022-12-13 01:57:05,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:05,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:05,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:05,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:05,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:05,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:05,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:05,373 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:05,374 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:05,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:05,374 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:05,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:05,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:05,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:05,375 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:05,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:05,376 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:05,376 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:05,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:05,376 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:05,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:05,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,379 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:05,379 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:05,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:05,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:05,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:05,496 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:05,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:05,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:05,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-13 01:57:05,496 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash 458126165, now seen corresponding path program 1 times [2022-12-13 01:57:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:05,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364443024] [2022-12-13 01:57:05,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:05,554 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 01:57:05,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:05,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364443024] [2022-12-13 01:57:05,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364443024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:05,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:05,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:05,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82571778] [2022-12-13 01:57:05,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:05,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:05,555 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:05,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:05,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:05,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:05,603 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:05,603 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:05,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:05,604 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:05,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:05,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:05,605 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:05,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:05,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:05,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:05,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:05,607 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:05,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:05,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,610 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:05,610 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:05,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:05,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:05,814 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:05,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-13 01:57:05,815 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:05,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:05,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:05,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-13 01:57:05,815 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash 515384467, now seen corresponding path program 1 times [2022-12-13 01:57:05,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:05,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129016727] [2022-12-13 01:57:05,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:05,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:05,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:05,873 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 01:57:05,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:05,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129016727] [2022-12-13 01:57:05,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129016727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:05,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:05,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:05,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026825224] [2022-12-13 01:57:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:05,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:05,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:05,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:05,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:05,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:05,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:05,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:05,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:05,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:05,935 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:05,935 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:05,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:05,936 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:05,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:05,943 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:05,943 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:05,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:05,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:05,944 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:05,945 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:05,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:05,945 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:05,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:05,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,948 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:05,948 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:05,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:05,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:05,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:06,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:06,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:06,071 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:06,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:06,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:06,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-13 01:57:06,071 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash 572642769, now seen corresponding path program 1 times [2022-12-13 01:57:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:06,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906527113] [2022-12-13 01:57:06,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:06,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:06,132 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 01:57:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:06,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906527113] [2022-12-13 01:57:06,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906527113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:06,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:06,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:06,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242104686] [2022-12-13 01:57:06,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:06,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:06,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:06,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:06,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:06,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:06,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:06,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:06,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:06,175 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:06,175 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:06,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:06,176 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:06,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:06,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:06,177 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:06,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:06,178 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:06,178 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:06,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:06,178 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:06,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:06,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:06,182 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:06,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:06,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:06,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:06,297 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:06,297 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:06,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:06,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:06,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-13 01:57:06,298 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:06,298 INFO L85 PathProgramCache]: Analyzing trace with hash 629901071, now seen corresponding path program 1 times [2022-12-13 01:57:06,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:06,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921048132] [2022-12-13 01:57:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:06,354 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 01:57:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:06,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921048132] [2022-12-13 01:57:06,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921048132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:06,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:06,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:06,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116485756] [2022-12-13 01:57:06,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:06,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:06,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:06,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:06,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:06,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:06,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:06,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:06,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:06,401 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:06,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:06,401 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:06,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:06,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:06,402 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:06,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:06,403 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:06,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:06,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:06,403 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:06,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:06,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,423 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:06,423 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:06,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:06,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:06,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:06,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:06,540 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:06,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:06,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:06,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-13 01:57:06,541 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:06,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:06,541 INFO L85 PathProgramCache]: Analyzing trace with hash 687159373, now seen corresponding path program 1 times [2022-12-13 01:57:06,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:06,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459454429] [2022-12-13 01:57:06,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:06,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:06,612 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 01:57:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:06,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459454429] [2022-12-13 01:57:06,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459454429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:06,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:06,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140338310] [2022-12-13 01:57:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:06,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:06,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:06,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:06,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:06,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:06,667 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:06,667 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:06,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:06,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:06,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:06,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:06,669 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:06,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:06,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:06,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:06,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:06,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:06,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:06,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,673 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:06,673 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:06,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:06,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:06,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:06,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:06,791 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:06,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:06,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:06,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-13 01:57:06,792 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:06,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:06,792 INFO L85 PathProgramCache]: Analyzing trace with hash 744417675, now seen corresponding path program 1 times [2022-12-13 01:57:06,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:06,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592912132] [2022-12-13 01:57:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:06,842 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 01:57:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:06,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592912132] [2022-12-13 01:57:06,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592912132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:06,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:06,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558686889] [2022-12-13 01:57:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:06,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:06,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:06,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:06,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:06,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:06,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:06,888 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:06,888 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:06,889 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:06,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:06,890 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:06,890 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:06,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:06,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:06,891 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:06,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:06,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:06,891 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:06,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:06,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:06,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,894 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:06,894 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:06,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:06,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:07,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:07,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:07,022 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:07,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:07,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:07,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-13 01:57:07,023 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:07,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:07,023 INFO L85 PathProgramCache]: Analyzing trace with hash 801675977, now seen corresponding path program 1 times [2022-12-13 01:57:07,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:07,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603632641] [2022-12-13 01:57:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:07,070 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 01:57:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:07,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603632641] [2022-12-13 01:57:07,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603632641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:07,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:07,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889128321] [2022-12-13 01:57:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:07,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:07,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:07,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:07,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:07,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:07,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:07,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:07,121 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:07,121 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:07,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:07,122 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:07,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:07,123 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:07,123 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:07,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:07,124 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:07,124 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:07,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:07,124 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:07,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:07,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,129 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:07,129 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:07,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:07,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:07,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:07,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:57:07,268 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:07,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:07,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:07,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-13 01:57:07,268 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 858934279, now seen corresponding path program 1 times [2022-12-13 01:57:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:07,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922198133] [2022-12-13 01:57:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:07,317 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 01:57:07,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:07,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922198133] [2022-12-13 01:57:07,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922198133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:07,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:07,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:07,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589491114] [2022-12-13 01:57:07,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:07,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:07,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:07,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:07,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:07,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:07,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:07,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:07,371 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:07,371 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:07,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:07,372 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:07,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:07,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:07,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:07,372 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:07,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:07,374 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:07,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:07,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:07,374 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:07,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:07,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,379 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:07,379 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:07,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:07,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:07,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:07,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:07,506 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:07,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:07,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:07,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-13 01:57:07,506 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:07,506 INFO L85 PathProgramCache]: Analyzing trace with hash 916192581, now seen corresponding path program 1 times [2022-12-13 01:57:07,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:07,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129403259] [2022-12-13 01:57:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:07,556 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 01:57:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:07,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129403259] [2022-12-13 01:57:07,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129403259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:07,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:07,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351027402] [2022-12-13 01:57:07,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:07,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:07,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:07,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:07,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:07,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:07,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:07,600 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:07,600 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:07,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:07,601 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:07,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:07,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:07,602 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:07,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:07,602 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:07,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:07,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:07,603 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:07,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:07,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,606 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:07,606 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:07,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:07,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:07,724 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:07,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:07,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:07,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:07,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:07,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-13 01:57:07,724 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:07,725 INFO L85 PathProgramCache]: Analyzing trace with hash 973450883, now seen corresponding path program 1 times [2022-12-13 01:57:07,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:07,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063233586] [2022-12-13 01:57:07,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:07,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:07,801 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 01:57:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:07,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063233586] [2022-12-13 01:57:07,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063233586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:07,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:07,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064207272] [2022-12-13 01:57:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:07,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:07,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:07,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:07,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:07,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:07,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:07,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:07,850 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:07,851 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:07,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:07,851 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:07,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:07,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:07,852 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:07,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:07,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:07,853 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:07,853 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:07,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:07,853 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:07,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:07,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:07,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,856 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:07,856 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:07,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:07,856 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:07,856 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:07,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:07,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:57:07,975 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:07,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:07,975 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:07,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:07,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-13 01:57:07,976 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:07,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1030709185, now seen corresponding path program 1 times [2022-12-13 01:57:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:07,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637614623] [2022-12-13 01:57:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:08,024 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 01:57:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:08,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637614623] [2022-12-13 01:57:08,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637614623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:08,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:08,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626272664] [2022-12-13 01:57:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:08,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:08,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:08,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:08,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:08,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:08,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:08,075 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:08,075 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:08,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:08,076 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:08,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:08,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:08,077 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:08,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:08,077 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:08,078 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:08,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:08,078 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:08,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:08,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,081 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:08,081 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:08,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:08,217 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:08,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:08,218 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:08,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:08,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:08,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-13 01:57:08,218 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:08,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1087967487, now seen corresponding path program 1 times [2022-12-13 01:57:08,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:08,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683262607] [2022-12-13 01:57:08,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:08,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:08,280 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 01:57:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:08,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683262607] [2022-12-13 01:57:08,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683262607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:08,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:08,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654188929] [2022-12-13 01:57:08,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:08,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:08,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:08,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:08,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:08,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:08,334 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:08,334 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:08,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:08,335 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:08,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:08,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:08,336 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:08,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:08,336 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,336 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:08,337 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:08,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:08,337 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:08,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:08,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,340 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:08,340 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:08,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:08,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:08,455 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:08,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:08,456 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:08,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:08,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:08,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-13 01:57:08,456 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:08,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1145225789, now seen corresponding path program 1 times [2022-12-13 01:57:08,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:08,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109645233] [2022-12-13 01:57:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:08,512 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 01:57:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:08,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109645233] [2022-12-13 01:57:08,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109645233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:08,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:08,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:08,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041346520] [2022-12-13 01:57:08,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:08,513 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:08,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:08,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:08,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:08,556 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:08,557 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:08,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:08,557 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:08,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:08,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:08,558 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:08,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:08,559 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:08,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:08,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:08,559 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:08,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:08,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,562 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:08,562 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:08,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:08,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,563 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:08,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:08,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:08,679 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:08,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:08,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:08,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-13 01:57:08,679 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:08,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1202484091, now seen corresponding path program 1 times [2022-12-13 01:57:08,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:08,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351818978] [2022-12-13 01:57:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:08,733 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 01:57:08,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351818978] [2022-12-13 01:57:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351818978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:08,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:08,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440804158] [2022-12-13 01:57:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:08,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:08,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:08,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:08,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:08,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:08,786 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:08,786 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:08,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:08,787 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:08,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:08,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:08,787 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:08,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:08,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:08,788 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:08,788 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:08,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:08,789 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:08,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:08,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:08,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,792 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:08,792 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:08,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:08,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:08,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:08,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:08,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:08,912 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:08,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:08,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:08,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-13 01:57:08,912 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:08,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1259742393, now seen corresponding path program 1 times [2022-12-13 01:57:08,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:08,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403623422] [2022-12-13 01:57:08,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:08,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:08,976 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 01:57:08,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:08,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403623422] [2022-12-13 01:57:08,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403623422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:08,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:08,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:08,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519790378] [2022-12-13 01:57:08,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:08,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:08,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:08,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:08,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:08,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:08,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:08,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:08,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:08,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:09,036 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:09,036 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:09,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:09,037 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:09,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:09,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:09,038 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:09,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:09,038 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:09,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:09,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:09,039 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:09,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:09,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,042 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:09,042 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:09,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:09,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:09,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:09,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:09,169 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:09,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:09,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:09,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-13 01:57:09,169 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1317000695, now seen corresponding path program 1 times [2022-12-13 01:57:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:09,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393782646] [2022-12-13 01:57:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:09,217 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 01:57:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:09,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393782646] [2022-12-13 01:57:09,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393782646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:09,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:09,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120381237] [2022-12-13 01:57:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:09,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:09,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:09,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:09,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:09,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:09,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:09,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:09,268 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:09,269 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:09,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:09,269 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:09,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:09,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:09,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:09,270 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:09,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:09,271 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:09,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:09,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:09,271 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:09,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:09,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,274 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:09,274 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:09,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:09,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:09,396 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:09,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:09,397 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:09,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:09,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:09,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-13 01:57:09,397 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1374258997, now seen corresponding path program 1 times [2022-12-13 01:57:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:09,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983239758] [2022-12-13 01:57:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:09,456 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 01:57:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:09,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983239758] [2022-12-13 01:57:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983239758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:09,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:09,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241968890] [2022-12-13 01:57:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:09,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:09,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:09,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:09,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:09,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:09,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:09,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:09,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:09,522 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:09,523 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:09,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:09,523 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:09,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:09,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:09,524 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:09,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:09,525 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:09,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:09,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:09,525 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:09,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:09,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,528 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:09,528 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:09,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:09,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,529 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:09,641 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:09,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:57:09,642 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:09,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:09,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:09,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-13 01:57:09,642 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:09,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1431517299, now seen corresponding path program 1 times [2022-12-13 01:57:09,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:09,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349285084] [2022-12-13 01:57:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:09,702 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 01:57:09,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:09,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349285084] [2022-12-13 01:57:09,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349285084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:09,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:09,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:09,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094186035] [2022-12-13 01:57:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:09,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:09,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:09,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:09,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:09,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:09,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:09,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:09,757 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:09,758 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:09,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:09,758 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:09,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:09,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:09,759 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:09,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:09,760 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:09,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:09,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:09,760 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:09,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:09,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,763 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:09,763 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:09,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:09,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:09,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:09,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:09,883 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:09,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:09,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:09,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-13 01:57:09,883 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:09,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1488775601, now seen corresponding path program 1 times [2022-12-13 01:57:09,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:09,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980889493] [2022-12-13 01:57:09,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:09,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:09,937 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 01:57:09,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:09,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980889493] [2022-12-13 01:57:09,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980889493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:09,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:09,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:09,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062657441] [2022-12-13 01:57:09,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:09,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:09,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:09,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:09,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:09,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:09,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:09,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:09,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:09,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:09,982 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:09,982 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:09,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:09,982 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:09,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:09,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:09,983 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:09,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:09,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:09,984 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:09,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:09,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:09,984 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:09,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:09,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:09,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,987 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:09,987 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:09,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:09,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:09,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:10,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:10,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:10,114 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:10,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:10,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:10,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-13 01:57:10,114 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1546033903, now seen corresponding path program 1 times [2022-12-13 01:57:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:10,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071958101] [2022-12-13 01:57:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:10,187 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 01:57:10,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071958101] [2022-12-13 01:57:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071958101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:10,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:10,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592432575] [2022-12-13 01:57:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:10,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:10,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:10,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:10,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:10,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:10,250 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:10,250 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:10,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:10,251 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:10,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:10,252 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:10,252 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:10,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:10,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:10,253 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,253 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:10,253 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:10,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:10,253 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:10,254 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:10,254 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:10,258 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:10,258 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:10,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:10,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:10,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:10,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:10,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 01:57:10,404 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:10,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:10,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:10,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-13 01:57:10,404 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:10,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1603292205, now seen corresponding path program 1 times [2022-12-13 01:57:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:10,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409583169] [2022-12-13 01:57:10,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:10,466 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 01:57:10,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:10,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409583169] [2022-12-13 01:57:10,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409583169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:10,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:10,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646876033] [2022-12-13 01:57:10,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:10,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:10,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:10,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:10,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:10,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:10,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:10,528 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:10,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:10,530 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:10,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:10,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:10,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:10,531 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:10,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:10,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:10,532 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:10,533 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:10,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:10,533 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:10,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:10,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:10,536 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:10,536 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:10,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:10,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:10,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:10,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:10,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 01:57:10,680 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:10,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:10,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-13 01:57:10,681 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:10,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1660550507, now seen corresponding path program 1 times [2022-12-13 01:57:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:10,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410088490] [2022-12-13 01:57:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:10,754 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 01:57:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:10,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410088490] [2022-12-13 01:57:10,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410088490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:10,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:10,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306030122] [2022-12-13 01:57:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:10,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:10,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:10,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:10,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:10,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:10,827 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:10,828 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:10,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:10,828 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:10,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:10,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:10,829 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:10,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:10,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:10,830 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:10,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:10,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:10,830 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:10,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:10,830 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:10,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:10,833 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:10,833 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:10,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:10,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:10,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:10,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:10,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:57:10,954 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:10,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:10,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:10,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:10,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-13 01:57:10,954 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1717808809, now seen corresponding path program 1 times [2022-12-13 01:57:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:10,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130336051] [2022-12-13 01:57:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:11,002 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 01:57:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:11,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130336051] [2022-12-13 01:57:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130336051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:11,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:11,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299450002] [2022-12-13 01:57:11,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:11,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:11,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:11,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:11,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:11,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:11,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:11,048 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:11,048 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:11,048 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:11,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:11,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:11,049 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:11,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:11,050 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:11,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:11,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:11,050 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:11,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:11,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,053 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:11,053 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:11,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:11,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:11,174 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:11,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:11,177 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:11,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:11,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:11,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-13 01:57:11,177 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1775067111, now seen corresponding path program 1 times [2022-12-13 01:57:11,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:11,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927226871] [2022-12-13 01:57:11,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:11,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:11,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927226871] [2022-12-13 01:57:11,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927226871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:11,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:11,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:11,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022848519] [2022-12-13 01:57:11,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:11,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:11,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:11,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:11,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:11,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:11,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:11,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:11,278 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:11,278 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:11,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:11,279 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:11,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:11,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:11,280 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:11,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:11,282 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:11,283 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:11,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:11,283 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,283 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:11,283 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:11,283 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,286 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:11,286 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:11,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:11,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:11,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:11,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:11,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:11,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:11,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:11,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-13 01:57:11,403 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:11,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1832325413, now seen corresponding path program 1 times [2022-12-13 01:57:11,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:11,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160811902] [2022-12-13 01:57:11,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:11,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:11,453 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 01:57:11,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:11,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160811902] [2022-12-13 01:57:11,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160811902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:11,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:11,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112554806] [2022-12-13 01:57:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:11,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:11,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:11,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:11,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:11,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:11,498 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:11,498 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:11,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:11,499 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:11,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:11,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:11,500 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:11,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:11,500 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:11,501 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:11,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:11,501 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:11,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:11,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,504 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:11,504 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:11,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:11,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:11,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:11,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:57:11,629 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:11,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:11,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:11,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-13 01:57:11,630 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:11,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1889583715, now seen corresponding path program 1 times [2022-12-13 01:57:11,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:11,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937463529] [2022-12-13 01:57:11,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:11,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:11,687 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 01:57:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:11,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937463529] [2022-12-13 01:57:11,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937463529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540218890] [2022-12-13 01:57:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:11,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:11,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:11,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:11,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:11,732 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:11,733 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:11,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:11,733 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:11,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:11,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:11,734 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:11,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:11,735 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:11,735 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:11,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:11,735 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:11,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:11,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,738 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:11,738 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:11,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:11,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:11,852 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:11,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:11,853 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:11,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:11,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:11,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-13 01:57:11,853 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:11,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:11,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1946842017, now seen corresponding path program 1 times [2022-12-13 01:57:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:11,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93195047] [2022-12-13 01:57:11,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:11,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:11,903 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 01:57:11,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93195047] [2022-12-13 01:57:11,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93195047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:11,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:11,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:11,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113912948] [2022-12-13 01:57:11,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:11,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:11,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:11,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:11,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:11,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:11,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:11,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:11,955 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:11,955 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:11,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:11,956 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:11,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:11,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:11,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:11,956 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:11,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:11,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:11,957 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:11,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:11,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:11,958 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:11,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:11,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:11,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,961 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:11,961 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:11,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:11,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:11,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:12,074 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:12,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:57:12,074 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:12,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:12,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:12,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-13 01:57:12,075 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:12,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2004100319, now seen corresponding path program 1 times [2022-12-13 01:57:12,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:12,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28064853] [2022-12-13 01:57:12,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:12,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:12,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:12,132 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 01:57:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:12,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28064853] [2022-12-13 01:57:12,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28064853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:12,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:12,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088980664] [2022-12-13 01:57:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:12,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:12,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:12,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:12,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:12,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:12,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:12,192 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:12,192 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:12,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:12,193 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:12,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:12,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:12,193 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:12,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:12,194 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:12,195 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:12,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:12,195 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,195 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:12,195 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:12,195 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,198 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:12,198 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:12,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:12,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:12,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:12,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:12,329 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:12,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:12,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:12,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-13 01:57:12,329 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2061358621, now seen corresponding path program 1 times [2022-12-13 01:57:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:12,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971865885] [2022-12-13 01:57:12,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:12,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:12,380 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 01:57:12,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:12,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971865885] [2022-12-13 01:57:12,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971865885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:12,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:12,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154796536] [2022-12-13 01:57:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:12,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:12,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:12,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:12,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:12,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:12,430 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:12,431 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:12,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:12,431 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:12,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:12,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:12,432 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:12,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:12,433 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:12,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:12,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:12,433 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:12,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:12,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,436 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:12,436 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:12,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:12,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:12,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:12,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:12,551 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:12,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:12,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:12,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-13 01:57:12,551 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:12,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2118616923, now seen corresponding path program 1 times [2022-12-13 01:57:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:12,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341007059] [2022-12-13 01:57:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:12,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:12,604 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 01:57:12,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:12,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341007059] [2022-12-13 01:57:12,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341007059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:12,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:12,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138084585] [2022-12-13 01:57:12,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:12,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:12,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:12,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:12,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:12,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:12,648 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:12,648 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:12,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:12,649 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:12,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:12,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:12,649 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:12,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:12,650 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:12,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:12,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:12,651 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:12,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:12,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,654 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:12,654 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:12,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:12,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:12,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:12,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:12,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:12,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:12,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:12,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-13 01:57:12,770 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2119092071, now seen corresponding path program 1 times [2022-12-13 01:57:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:12,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954884365] [2022-12-13 01:57:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:12,819 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 01:57:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954884365] [2022-12-13 01:57:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954884365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447463309] [2022-12-13 01:57:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:12,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:12,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:12,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:12,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:12,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:12,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:12,871 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:12,871 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:12,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:12,872 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:12,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:12,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:12,873 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:12,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:12,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:12,874 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:12,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:12,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:12,874 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:12,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:12,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:12,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,877 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:12,877 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:12,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:12,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:12,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:13,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:13,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:13,001 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:13,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:13,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:13,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-13 01:57:13,002 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2061833769, now seen corresponding path program 1 times [2022-12-13 01:57:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:13,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412921598] [2022-12-13 01:57:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:13,056 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 01:57:13,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:13,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412921598] [2022-12-13 01:57:13,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412921598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:13,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:13,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:13,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431560653] [2022-12-13 01:57:13,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:13,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:13,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:13,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:13,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:13,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:13,107 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:13,107 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:13,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:13,108 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:13,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:13,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:13,109 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:13,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:13,109 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:13,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:13,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:13,110 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:13,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:13,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,113 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:13,113 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:13,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:13,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,113 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:13,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:13,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:57:13,238 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:13,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:13,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:13,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-13 01:57:13,238 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:13,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2004575467, now seen corresponding path program 1 times [2022-12-13 01:57:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:13,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654753375] [2022-12-13 01:57:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:13,297 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 01:57:13,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:13,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654753375] [2022-12-13 01:57:13,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654753375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:13,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:13,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:13,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545917018] [2022-12-13 01:57:13,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:13,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:13,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:13,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:13,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:13,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:13,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:13,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:13,347 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:13,347 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:13,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:13,347 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:13,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:13,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:13,364 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:13,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:13,365 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:13,365 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:13,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:13,365 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,365 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:13,365 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:13,365 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,368 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:13,368 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:13,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:13,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:13,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:13,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:57:13,481 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:13,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:13,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:13,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-13 01:57:13,481 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:13,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:13,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1947317165, now seen corresponding path program 1 times [2022-12-13 01:57:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521292018] [2022-12-13 01:57:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:13,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:13,528 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 01:57:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:13,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521292018] [2022-12-13 01:57:13,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521292018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:13,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:13,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114754647] [2022-12-13 01:57:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:13,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:13,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:13,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:13,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:13,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:13,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:13,572 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:13,572 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:13,572 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:13,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:13,573 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:13,573 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:13,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:13,574 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,574 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:13,574 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:13,574 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:13,574 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,574 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:13,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:13,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,577 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:13,577 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:13,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:13,578 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,578 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:13,707 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:13,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:13,708 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:13,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:13,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:13,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-13 01:57:13,708 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:13,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1890058863, now seen corresponding path program 1 times [2022-12-13 01:57:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:13,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451252215] [2022-12-13 01:57:13,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:13,756 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 01:57:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:13,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451252215] [2022-12-13 01:57:13,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451252215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:13,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:13,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:13,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420554715] [2022-12-13 01:57:13,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:13,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:13,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:13,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:13,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:13,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:13,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:13,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:13,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:13,811 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:13,811 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:13,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:13,812 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:13,812 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:13,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:13,812 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:13,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:13,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:13,813 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:13,814 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:13,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:13,814 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:13,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:13,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:13,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,817 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:13,817 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:13,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:13,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:13,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:13,950 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:13,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:13,951 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:13,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:13,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:13,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2022-12-13 01:57:13,951 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:13,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1832800561, now seen corresponding path program 1 times [2022-12-13 01:57:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:13,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076669954] [2022-12-13 01:57:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:14,010 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 01:57:14,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:14,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076669954] [2022-12-13 01:57:14,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076669954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:14,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:14,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611931238] [2022-12-13 01:57:14,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:14,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:14,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:14,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:14,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:14,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:14,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:14,070 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:14,070 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:14,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:14,071 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:14,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:14,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:14,084 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:14,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:14,085 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:14,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:14,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:14,086 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:14,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:14,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,090 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:14,090 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:14,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:14,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:14,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:14,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 01:57:14,238 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:14,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:14,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:14,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-13 01:57:14,239 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1775542259, now seen corresponding path program 1 times [2022-12-13 01:57:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:14,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102316974] [2022-12-13 01:57:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:14,315 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 01:57:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:14,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102316974] [2022-12-13 01:57:14,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102316974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:14,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:14,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:14,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869218065] [2022-12-13 01:57:14,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:14,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:14,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:14,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:14,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:14,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:14,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:14,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:14,375 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:14,375 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:14,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:14,376 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:14,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:14,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:14,376 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:14,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:14,377 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:14,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:14,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:14,378 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:14,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:14,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,389 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:14,389 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:14,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:14,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:14,518 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:14,519 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:14,519 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:14,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:14,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:14,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-13 01:57:14,519 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1718283957, now seen corresponding path program 1 times [2022-12-13 01:57:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:14,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357657126] [2022-12-13 01:57:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:14,576 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 01:57:14,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:14,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357657126] [2022-12-13 01:57:14,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357657126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:14,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:14,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:14,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479085138] [2022-12-13 01:57:14,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:14,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:14,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:14,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:14,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:14,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:14,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:14,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:14,637 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:14,637 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:14,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:14,637 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:14,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:14,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:14,638 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:14,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:14,639 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:14,639 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:14,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:14,639 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:14,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:14,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,642 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:14,642 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:14,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:14,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:14,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:14,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:14,771 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:14,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:14,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:14,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2022-12-13 01:57:14,771 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1661025655, now seen corresponding path program 1 times [2022-12-13 01:57:14,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:14,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880133946] [2022-12-13 01:57:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:14,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:14,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 01:57:14,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880133946] [2022-12-13 01:57:14,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880133946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:14,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063797068] [2022-12-13 01:57:14,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:14,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:14,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:14,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:14,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:14,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:14,887 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:14,887 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:14,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:14,887 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:14,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:14,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:14,888 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:14,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:14,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:14,889 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:14,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:14,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:14,889 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:14,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:14,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:14,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,893 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:14,893 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:14,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:14,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:14,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:15,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:15,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:57:15,033 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:15,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:15,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:15,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-13 01:57:15,033 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1603767353, now seen corresponding path program 1 times [2022-12-13 01:57:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:15,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65131698] [2022-12-13 01:57:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:15,094 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 01:57:15,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:15,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65131698] [2022-12-13 01:57:15,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65131698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:15,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:15,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901292375] [2022-12-13 01:57:15,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:15,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:15,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:15,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:15,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:15,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:15,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:15,148 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:15,148 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:15,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:15,149 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:15,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:15,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:15,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:15,150 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:15,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:15,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:15,152 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:15,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:15,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:15,152 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:15,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:15,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:15,156 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:15,156 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:15,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:15,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:15,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:15,302 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:15,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 01:57:15,303 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:15,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:15,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:15,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-13 01:57:15,303 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1546509051, now seen corresponding path program 1 times [2022-12-13 01:57:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:15,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748792766] [2022-12-13 01:57:15,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:15,378 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 01:57:15,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:15,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748792766] [2022-12-13 01:57:15,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748792766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:15,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:15,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326637176] [2022-12-13 01:57:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:15,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:15,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:15,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:15,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:15,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:15,450 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:15,450 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:15,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:15,451 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:15,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:15,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:15,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:15,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:15,451 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:15,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:15,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:15,452 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:15,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:15,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:15,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:15,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:15,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:15,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:15,456 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:15,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:15,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:15,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:15,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:15,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:15,590 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:15,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:15,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:15,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-13 01:57:15,590 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:15,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1489250749, now seen corresponding path program 1 times [2022-12-13 01:57:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:15,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884556030] [2022-12-13 01:57:15,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:15,682 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 01:57:15,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:15,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884556030] [2022-12-13 01:57:15,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884556030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:15,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:15,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260590482] [2022-12-13 01:57:15,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:15,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:15,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:15,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:15,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:15,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:15,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:15,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:15,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:15,754 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:15,754 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:15,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:15,755 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:15,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:15,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:15,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:15,756 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:15,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:15,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:15,758 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:15,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:15,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:15,758 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:15,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:15,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:15,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:15,764 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:15,765 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:15,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:15,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:15,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:15,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:15,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 01:57:15,915 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:15,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:15,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:15,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-13 01:57:15,916 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1431992447, now seen corresponding path program 1 times [2022-12-13 01:57:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:15,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117603067] [2022-12-13 01:57:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:15,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:15,978 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 01:57:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:15,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117603067] [2022-12-13 01:57:15,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117603067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:15,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:15,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:15,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733754177] [2022-12-13 01:57:15,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:15,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:15,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:15,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:15,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:15,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:15,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:15,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:16,034 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:16,034 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:16,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:16,035 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:16,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:16,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:16,035 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:16,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:16,036 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:16,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:16,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:16,037 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:16,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:16,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,041 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:16,041 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:16,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:16,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:16,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:16,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:57:16,159 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:16,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:16,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:16,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-13 01:57:16,159 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:16,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1374734145, now seen corresponding path program 1 times [2022-12-13 01:57:16,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:16,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144177310] [2022-12-13 01:57:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:16,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:16,208 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 01:57:16,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:16,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144177310] [2022-12-13 01:57:16,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144177310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:16,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:16,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630723388] [2022-12-13 01:57:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:16,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:16,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:16,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:16,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:16,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:16,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:16,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:16,260 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:16,261 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:16,261 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:16,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:16,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:16,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:16,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:16,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:16,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:16,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:16,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:16,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:16,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:16,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:16,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:16,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:16,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:16,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:16,389 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:16,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:16,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:16,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-13 01:57:16,390 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1317475843, now seen corresponding path program 1 times [2022-12-13 01:57:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:16,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129745317] [2022-12-13 01:57:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:16,440 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 01:57:16,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:16,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129745317] [2022-12-13 01:57:16,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129745317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:16,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:16,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:16,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941705860] [2022-12-13 01:57:16,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:16,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:16,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:16,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:16,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:16,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:16,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:16,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:16,485 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:16,485 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:16,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:16,486 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:16,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:16,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:16,486 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:16,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:16,487 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:16,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:16,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:16,488 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:16,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:16,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,491 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:16,491 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:16,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:16,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:16,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:16,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:57:16,632 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:16,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:16,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:16,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167 [2022-12-13 01:57:16,633 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:16,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:16,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1260217541, now seen corresponding path program 1 times [2022-12-13 01:57:16,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:16,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311073321] [2022-12-13 01:57:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:16,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:16,699 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 01:57:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:16,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311073321] [2022-12-13 01:57:16,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311073321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:16,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:16,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411376921] [2022-12-13 01:57:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:16,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:16,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:16,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:16,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:16,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:16,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:16,745 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:16,746 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:16,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:16,746 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:16,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:16,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:16,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:16,747 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:16,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:16,748 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:16,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:16,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:16,748 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:16,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:16,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,751 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:16,751 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:16,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:16,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:16,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:16,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:57:16,876 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:16,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:16,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:16,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2022-12-13 01:57:16,877 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:16,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1202959239, now seen corresponding path program 1 times [2022-12-13 01:57:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:16,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361682358] [2022-12-13 01:57:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:16,925 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 01:57:16,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:16,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361682358] [2022-12-13 01:57:16,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361682358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:16,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:16,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:16,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984040682] [2022-12-13 01:57:16,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:16,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:16,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:16,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:16,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:16,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:16,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:16,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:16,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:16,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:16,980 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:16,981 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:16,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:16,981 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:16,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:16,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:16,982 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:16,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:16,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:16,983 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:16,983 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:16,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:16,983 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:16,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:16,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:16,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,986 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:16,986 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:16,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:16,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:16,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:17,128 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:17,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:57:17,129 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:17,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:17,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:17,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable169 [2022-12-13 01:57:17,129 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1145700937, now seen corresponding path program 1 times [2022-12-13 01:57:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:17,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468721876] [2022-12-13 01:57:17,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:17,196 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 01:57:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:17,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468721876] [2022-12-13 01:57:17,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468721876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:17,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:17,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:17,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320703025] [2022-12-13 01:57:17,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:17,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:17,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:17,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:17,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:17,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:17,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:17,256 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:17,257 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:17,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:17,257 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:17,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:17,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:17,258 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:17,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:17,259 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:17,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:17,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:17,259 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:17,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:17,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,262 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:17,262 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:17,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:17,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:17,387 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:17,388 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:57:17,388 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:17,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:17,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:17,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-13 01:57:17,388 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:17,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1088442635, now seen corresponding path program 1 times [2022-12-13 01:57:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:17,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842162260] [2022-12-13 01:57:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:17,438 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 01:57:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:17,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842162260] [2022-12-13 01:57:17,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842162260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:17,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:17,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267226116] [2022-12-13 01:57:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:17,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:17,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:17,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:17,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:17,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:17,483 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:17,483 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:17,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:17,484 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:17,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:17,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:17,484 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:17,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:17,485 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:17,485 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:17,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:17,486 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:17,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:17,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,489 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:17,489 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:17,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:17,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:17,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:17,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:17,605 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:17,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:17,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:17,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2022-12-13 01:57:17,605 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:17,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1031184333, now seen corresponding path program 1 times [2022-12-13 01:57:17,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:17,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493791289] [2022-12-13 01:57:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:17,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:17,653 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 01:57:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:17,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493791289] [2022-12-13 01:57:17,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493791289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:17,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242945968] [2022-12-13 01:57:17,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:17,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:17,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:17,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:17,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:17,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:17,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:17,715 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:17,715 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:17,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:17,715 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:17,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:17,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:17,716 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:17,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:17,717 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:17,717 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:17,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:17,717 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:17,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:17,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,721 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:17,721 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:17,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:17,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:17,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:17,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:17,836 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:17,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:17,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:17,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172 [2022-12-13 01:57:17,837 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:17,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash -973926031, now seen corresponding path program 1 times [2022-12-13 01:57:17,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:17,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102388712] [2022-12-13 01:57:17,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:17,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 01:57:17,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:17,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102388712] [2022-12-13 01:57:17,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102388712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:17,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:17,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:17,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994187756] [2022-12-13 01:57:17,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:17,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:17,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:17,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:17,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:17,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:17,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:17,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:17,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:17,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:17,955 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:17,955 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:17,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:17,956 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:17,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:17,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:17,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:17,956 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:17,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:17,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:17,957 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:17,958 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:17,958 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:17,958 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:17,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:17,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:17,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,961 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:17,961 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:17,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:17,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:17,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:18,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:18,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:18,088 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:18,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:18,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:18,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173 [2022-12-13 01:57:18,089 INFO L420 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash -916667729, now seen corresponding path program 1 times [2022-12-13 01:57:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:18,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516927130] [2022-12-13 01:57:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:18,139 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 01:57:18,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:18,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516927130] [2022-12-13 01:57:18,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516927130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:18,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:18,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034183053] [2022-12-13 01:57:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:18,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:18,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:18,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:18,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:18,195 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:18,195 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:18,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:18,196 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:18,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:18,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:18,196 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:18,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:18,197 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:18,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:18,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:18,198 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:18,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:18,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,201 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:18,201 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:18,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:18,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:18,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:18,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:18,317 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:18,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:18,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:18,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174 [2022-12-13 01:57:18,317 INFO L420 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash -859409427, now seen corresponding path program 1 times [2022-12-13 01:57:18,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:18,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30144744] [2022-12-13 01:57:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:18,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:18,390 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 01:57:18,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:18,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30144744] [2022-12-13 01:57:18,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30144744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:18,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:18,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718151428] [2022-12-13 01:57:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:18,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:18,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:18,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:18,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:18,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:18,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:18,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:18,445 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:18,445 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:18,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:18,446 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:18,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:18,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:18,446 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:18,447 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:18,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:18,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:18,448 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,448 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:18,448 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:18,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,451 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:18,451 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:18,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:18,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:18,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:18,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:18,588 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:18,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,588 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:18,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:18,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175 [2022-12-13 01:57:18,589 INFO L420 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:18,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:18,589 INFO L85 PathProgramCache]: Analyzing trace with hash -802151125, now seen corresponding path program 1 times [2022-12-13 01:57:18,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:18,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126296158] [2022-12-13 01:57:18,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:18,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:18,666 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 01:57:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:18,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126296158] [2022-12-13 01:57:18,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126296158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:18,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:18,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846666646] [2022-12-13 01:57:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:18,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:18,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:18,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:18,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:18,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:18,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:18,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:18,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:18,729 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:18,730 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:18,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:18,730 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:18,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:18,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:18,731 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:18,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:18,732 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:18,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:18,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:18,733 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:18,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:18,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,736 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:18,736 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:18,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:18,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:18,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:18,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:18,865 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:18,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:18,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:18,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176 [2022-12-13 01:57:18,866 INFO L420 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:18,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:18,866 INFO L85 PathProgramCache]: Analyzing trace with hash -744892823, now seen corresponding path program 1 times [2022-12-13 01:57:18,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:18,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653201365] [2022-12-13 01:57:18,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:18,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:18,924 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 01:57:18,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:18,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653201365] [2022-12-13 01:57:18,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653201365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:18,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:18,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:18,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548584833] [2022-12-13 01:57:18,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:18,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:18,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:18,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:18,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:18,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:18,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:18,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:18,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:18,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:18,981 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:18,981 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:18,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:18,982 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:18,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:18,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:18,983 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:18,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:18,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:18,983 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:18,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:18,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:18,984 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:18,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:18,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:18,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,987 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:18,987 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:18,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:18,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:19,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:19,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:19,114 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:19,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:19,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:19,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable177 [2022-12-13 01:57:19,114 INFO L420 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:19,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash -687634521, now seen corresponding path program 1 times [2022-12-13 01:57:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:19,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503884145] [2022-12-13 01:57:19,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:19,187 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 01:57:19,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:19,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503884145] [2022-12-13 01:57:19,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503884145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:19,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463159002] [2022-12-13 01:57:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:19,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:19,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:19,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:19,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:19,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:19,269 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:19,270 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:19,270 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:19,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:19,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:19,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:19,271 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:19,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:19,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:19,272 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:19,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:19,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:19,272 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:19,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:19,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:19,275 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:19,275 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:19,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:19,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:19,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:19,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:19,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:19,404 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:19,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:19,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:19,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178 [2022-12-13 01:57:19,404 INFO L420 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:19,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash -630376219, now seen corresponding path program 1 times [2022-12-13 01:57:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:19,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89583876] [2022-12-13 01:57:19,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:19,471 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 01:57:19,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:19,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89583876] [2022-12-13 01:57:19,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89583876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:19,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:19,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414986057] [2022-12-13 01:57:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:19,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:19,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:19,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:19,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:19,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:19,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:19,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:19,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:19,527 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:19,528 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:19,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:19,528 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:19,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:19,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:19,529 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:19,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:19,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:19,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:19,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:19,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:19,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:19,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:19,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:19,534 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:19,534 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:19,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:19,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:19,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:19,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:19,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-13 01:57:19,704 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:19,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:19,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:19,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable179 [2022-12-13 01:57:19,705 INFO L420 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:19,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash -573117917, now seen corresponding path program 1 times [2022-12-13 01:57:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:19,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036035398] [2022-12-13 01:57:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:19,755 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 01:57:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:19,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036035398] [2022-12-13 01:57:19,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036035398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:19,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:19,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980959854] [2022-12-13 01:57:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:19,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:19,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:19,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:19,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:19,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:19,808 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:19,809 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:19,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:19,809 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:19,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:19,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:19,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:19,810 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:19,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:19,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:19,811 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:19,811 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:19,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:19,811 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:19,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:19,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:19,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:19,814 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:19,814 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:19,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:19,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:19,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:19,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:19,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:57:19,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:19,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:19,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:19,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180 [2022-12-13 01:57:19,940 INFO L420 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:19,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash -515859615, now seen corresponding path program 1 times [2022-12-13 01:57:19,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:19,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627101773] [2022-12-13 01:57:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:19,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:19,989 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 01:57:19,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:19,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627101773] [2022-12-13 01:57:19,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627101773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:19,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:19,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:19,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654544903] [2022-12-13 01:57:19,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:19,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:19,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:19,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:19,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:19,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:19,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:19,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:19,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:19,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:20,038 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:20,038 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:20,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:20,039 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:20,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:20,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:20,040 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:20,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:20,040 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:20,041 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:20,041 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:20,041 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:20,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:20,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,044 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:20,044 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:20,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:20,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:20,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:20,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:20,162 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:20,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:20,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:20,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181 [2022-12-13 01:57:20,162 INFO L420 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash -458601313, now seen corresponding path program 1 times [2022-12-13 01:57:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:20,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533578677] [2022-12-13 01:57:20,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:20,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:20,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:20,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533578677] [2022-12-13 01:57:20,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533578677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:20,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:20,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:20,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101672462] [2022-12-13 01:57:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:20,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:20,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:20,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:20,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:20,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:20,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:20,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:20,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:20,254 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:20,254 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:20,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:20,254 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:20,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:20,255 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:20,255 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:20,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:20,256 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,256 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:20,256 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:20,256 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:20,256 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:20,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:20,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,259 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:20,259 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:20,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:20,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:20,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:20,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:20,376 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:20,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:20,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:20,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182 [2022-12-13 01:57:20,376 INFO L420 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash -401343011, now seen corresponding path program 1 times [2022-12-13 01:57:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:20,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420159640] [2022-12-13 01:57:20,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:20,424 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 01:57:20,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:20,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420159640] [2022-12-13 01:57:20,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420159640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:20,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:20,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:20,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903697530] [2022-12-13 01:57:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:20,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:20,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:20,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:20,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:20,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:20,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:20,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:20,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:20,470 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:20,470 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:20,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:20,471 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:20,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:20,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:20,471 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:20,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:20,472 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:20,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:20,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:20,473 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:20,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:20,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,476 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:20,476 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:20,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:20,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:20,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:20,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:20,592 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:20,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:20,592 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:20,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183 [2022-12-13 01:57:20,592 INFO L420 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:20,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash -344084709, now seen corresponding path program 1 times [2022-12-13 01:57:20,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:20,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977013376] [2022-12-13 01:57:20,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:20,642 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 01:57:20,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:20,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977013376] [2022-12-13 01:57:20,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977013376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:20,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:20,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178558115] [2022-12-13 01:57:20,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:20,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:20,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:20,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:20,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:20,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:20,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:20,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:20,687 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:20,688 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:20,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:20,688 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:20,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:20,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:20,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:20,689 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:20,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:20,690 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:20,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:20,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:20,690 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:20,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:20,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,693 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:20,693 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:20,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:20,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:20,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:20,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:20,810 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:20,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:20,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:20,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184 [2022-12-13 01:57:20,811 INFO L420 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash -286826407, now seen corresponding path program 1 times [2022-12-13 01:57:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:20,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567274644] [2022-12-13 01:57:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:20,888 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 01:57:20,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:20,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567274644] [2022-12-13 01:57:20,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567274644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:20,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:20,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:20,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217712645] [2022-12-13 01:57:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:20,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:20,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:20,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:20,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:20,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:20,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:20,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:20,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:20,934 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:20,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:20,934 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:20,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:20,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:20,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:20,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:20,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:20,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:20,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:20,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:20,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:20,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:20,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,940 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:20,940 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:20,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:20,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:20,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:21,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:21,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:57:21,061 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:21,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:21,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2022-12-13 01:57:21,061 INFO L420 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:21,062 INFO L85 PathProgramCache]: Analyzing trace with hash -229568105, now seen corresponding path program 1 times [2022-12-13 01:57:21,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:21,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237535850] [2022-12-13 01:57:21,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:21,117 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 01:57:21,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:21,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237535850] [2022-12-13 01:57:21,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237535850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:21,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:21,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:21,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499904185] [2022-12-13 01:57:21,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:21,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:21,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:21,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:21,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:21,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:21,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:21,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:21,161 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:21,161 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:21,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:21,162 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:21,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:21,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:21,163 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:21,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:21,163 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,164 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:21,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:21,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:21,164 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:21,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:21,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,167 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:21,167 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:21,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:21,167 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,167 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:21,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:21,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:21,282 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:21,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:21,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:21,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2022-12-13 01:57:21,282 INFO L420 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:21,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:21,282 INFO L85 PathProgramCache]: Analyzing trace with hash -172309803, now seen corresponding path program 1 times [2022-12-13 01:57:21,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:21,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978164591] [2022-12-13 01:57:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:21,335 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 01:57:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:21,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978164591] [2022-12-13 01:57:21,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978164591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:21,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:21,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117938922] [2022-12-13 01:57:21,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:21,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:21,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:21,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:21,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:21,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:21,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:21,383 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:21,383 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:21,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:21,383 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:21,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:21,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:21,384 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:21,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:21,385 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:21,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:21,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:21,385 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:21,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:21,386 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,389 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:21,389 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:21,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:21,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:21,512 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:21,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:21,512 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:21,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:21,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:21,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2022-12-13 01:57:21,513 INFO L420 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:21,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash -115051501, now seen corresponding path program 1 times [2022-12-13 01:57:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:21,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724385937] [2022-12-13 01:57:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:21,587 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 01:57:21,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:21,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724385937] [2022-12-13 01:57:21,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724385937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:21,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:21,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:21,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173039120] [2022-12-13 01:57:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:21,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:21,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:21,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:21,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:21,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:21,643 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:21,643 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:21,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:21,644 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:21,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:21,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:21,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:21,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:21,645 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:21,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:21,646 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:21,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:21,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:21,646 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:21,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:21,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,649 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:21,649 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:21,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:21,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:21,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:21,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:21,786 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:21,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:21,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:21,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2022-12-13 01:57:21,786 INFO L420 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:21,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:21,786 INFO L85 PathProgramCache]: Analyzing trace with hash -57793199, now seen corresponding path program 1 times [2022-12-13 01:57:21,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:21,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304134824] [2022-12-13 01:57:21,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:21,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:21,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:21,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304134824] [2022-12-13 01:57:21,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304134824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:21,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:21,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:21,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133487294] [2022-12-13 01:57:21,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:21,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:21,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:21,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:21,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:21,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:21,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:21,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:21,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:21,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:21,902 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:21,902 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:21,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:21,903 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:21,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:21,904 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:21,904 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:21,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:21,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:21,904 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,905 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:21,905 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:21,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:21,905 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:21,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:21,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:21,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,908 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:21,908 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:21,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:21,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:21,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:22,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:22,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:22,024 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:22,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:22,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:22,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2022-12-13 01:57:22,024 INFO L420 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:22,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -534897, now seen corresponding path program 1 times [2022-12-13 01:57:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:22,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996135973] [2022-12-13 01:57:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:22,076 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 01:57:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:22,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996135973] [2022-12-13 01:57:22,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996135973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:22,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:22,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63668373] [2022-12-13 01:57:22,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:22,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:22,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:22,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:22,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:22,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:22,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:22,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:22,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:22,124 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:22,124 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:22,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:22,125 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:22,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:22,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:22,125 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:22,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:22,126 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,126 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:22,126 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:22,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:22,127 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:22,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:22,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,130 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:22,130 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:22,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:22,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:22,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:22,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:57:22,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:22,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:22,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:22,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2022-12-13 01:57:22,256 INFO L420 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:22,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 56723405, now seen corresponding path program 1 times [2022-12-13 01:57:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:22,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353911573] [2022-12-13 01:57:22,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:22,368 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 01:57:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:22,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353911573] [2022-12-13 01:57:22,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353911573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:22,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:22,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819267209] [2022-12-13 01:57:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:22,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:22,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:22,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:22,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:22,431 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:22,431 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:22,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:22,432 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:22,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:22,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:22,432 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:22,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:22,433 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:22,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:22,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:22,434 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:22,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:22,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:22,437 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:22,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:22,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:22,571 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:22,572 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:22,572 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:22,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,572 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:22,572 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:22,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2022-12-13 01:57:22,573 INFO L420 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 113981707, now seen corresponding path program 1 times [2022-12-13 01:57:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:22,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259834169] [2022-12-13 01:57:22,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:22,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259834169] [2022-12-13 01:57:22,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259834169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:22,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:22,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630513210] [2022-12-13 01:57:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:22,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:22,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:22,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:22,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:22,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:22,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:22,677 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:22,678 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:22,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:22,678 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:22,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:22,679 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:22,679 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:22,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:22,680 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,680 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:22,680 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:22,680 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:22,680 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,681 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:22,681 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:22,681 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,683 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:22,683 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:22,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:22,684 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,684 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:22,813 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:22,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:22,814 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:22,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:22,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:22,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2022-12-13 01:57:22,814 INFO L420 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash 171240009, now seen corresponding path program 1 times [2022-12-13 01:57:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:22,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411136372] [2022-12-13 01:57:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:22,878 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 01:57:22,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:22,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411136372] [2022-12-13 01:57:22,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411136372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:22,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:22,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961047219] [2022-12-13 01:57:22,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:22,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:22,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:22,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:22,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:22,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:22,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:22,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:22,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:22,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:22,937 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:22,937 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:22,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:22,938 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:22,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:22,939 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:22,939 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:22,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:22,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:22,939 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:22,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:22,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:22,940 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:22,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:22,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:22,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,943 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:22,943 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:22,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:22,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:22,943 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:23,071 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:23,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:23,072 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:23,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:23,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:23,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2022-12-13 01:57:23,072 INFO L420 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:23,072 INFO L85 PathProgramCache]: Analyzing trace with hash 228498311, now seen corresponding path program 1 times [2022-12-13 01:57:23,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:23,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258096190] [2022-12-13 01:57:23,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:23,135 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 01:57:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:23,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258096190] [2022-12-13 01:57:23,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258096190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:23,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:23,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:23,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830246094] [2022-12-13 01:57:23,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:23,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:23,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:23,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:23,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:23,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:23,198 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:23,198 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:23,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:23,199 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:23,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:23,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:23,200 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:23,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:23,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:23,201 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,201 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:23,201 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:23,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:23,201 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:23,202 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:23,202 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:23,205 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:23,205 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:23,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:23,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:23,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:23,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:23,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:23,337 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:23,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:23,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:23,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2022-12-13 01:57:23,338 INFO L420 AbstractCegarLoop]: === Iteration 196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:23,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash 285756613, now seen corresponding path program 1 times [2022-12-13 01:57:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:23,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913425390] [2022-12-13 01:57:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:23,390 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 01:57:23,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:23,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913425390] [2022-12-13 01:57:23,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913425390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:23,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:23,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:23,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086883522] [2022-12-13 01:57:23,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:23,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:23,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:23,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:23,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:23,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:23,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:23,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:23,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:23,474 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:23,474 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:23,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:23,475 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:23,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:23,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:23,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:23,476 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:23,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:23,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:23,477 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:23,477 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:23,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:23,477 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:23,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:23,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:23,480 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:23,480 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:23,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:23,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:23,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:23,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:23,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:57:23,622 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:23,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:23,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:23,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195 [2022-12-13 01:57:23,623 INFO L420 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 343014915, now seen corresponding path program 1 times [2022-12-13 01:57:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:23,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960968516] [2022-12-13 01:57:23,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:23,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:23,687 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 01:57:23,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:23,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960968516] [2022-12-13 01:57:23,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960968516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:23,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:23,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559417600] [2022-12-13 01:57:23,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:23,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:23,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:23,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:23,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:23,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:23,753 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:23,754 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:23,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:23,754 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:23,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:23,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:23,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:23,755 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:23,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:23,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:23,757 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:23,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:23,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:23,757 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:23,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:23,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:23,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:23,761 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:23,761 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:23,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:23,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:23,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:23,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:23,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:23,899 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:23,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:23,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:23,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196 [2022-12-13 01:57:23,899 INFO L420 AbstractCegarLoop]: === Iteration 198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:23,899 INFO L85 PathProgramCache]: Analyzing trace with hash 400273217, now seen corresponding path program 1 times [2022-12-13 01:57:23,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:23,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922286817] [2022-12-13 01:57:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:23,956 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 01:57:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922286817] [2022-12-13 01:57:23,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922286817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:23,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:23,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323138793] [2022-12-13 01:57:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:23,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:23,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:23,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:23,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:23,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:23,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:24,007 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:24,007 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:24,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:24,008 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:24,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:24,008 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:24,009 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:24,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:24,009 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:24,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:24,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:24,010 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:24,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:24,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,013 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:24,013 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:24,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:24,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:24,142 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:24,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:57:24,143 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:24,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:24,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:24,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197 [2022-12-13 01:57:24,144 INFO L420 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:24,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 457531519, now seen corresponding path program 1 times [2022-12-13 01:57:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:24,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579798221] [2022-12-13 01:57:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:24,218 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 01:57:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:24,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579798221] [2022-12-13 01:57:24,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579798221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:24,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:24,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453949668] [2022-12-13 01:57:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:24,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:24,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:24,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:24,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:24,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:24,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:24,273 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:24,273 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:24,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:24,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:24,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:24,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:24,274 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:24,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:24,275 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:24,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:24,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:24,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:24,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:24,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,279 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:24,279 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:24,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:24,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:24,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:24,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:24,413 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:24,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:24,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:24,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198 [2022-12-13 01:57:24,413 INFO L420 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:24,413 INFO L85 PathProgramCache]: Analyzing trace with hash 514789821, now seen corresponding path program 1 times [2022-12-13 01:57:24,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:24,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117220025] [2022-12-13 01:57:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:24,476 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 01:57:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:24,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117220025] [2022-12-13 01:57:24,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117220025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:24,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:24,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:24,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125724930] [2022-12-13 01:57:24,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:24,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:24,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:24,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:24,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:24,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:24,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:24,532 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:24,532 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:24,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:24,533 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:24,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:24,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:24,534 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:24,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:24,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:24,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:24,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:24,536 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:24,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:24,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,540 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:24,540 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:24,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:24,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:24,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:24,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:24,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:24,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:24,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:24,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable199 [2022-12-13 01:57:24,674 INFO L420 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:24,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 572048123, now seen corresponding path program 1 times [2022-12-13 01:57:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:24,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642112566] [2022-12-13 01:57:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:24,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:24,740 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 01:57:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:24,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642112566] [2022-12-13 01:57:24,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642112566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:24,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:24,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:24,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865595061] [2022-12-13 01:57:24,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:24,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:24,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:24,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:24,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:24,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:24,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:24,803 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:24,803 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:24,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:24,803 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:24,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:24,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:24,804 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:24,804 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:24,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:24,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:24,805 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,805 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:24,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:24,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:24,805 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:24,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:24,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:24,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,808 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:24,808 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:24,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:24,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:24,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:24,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:24,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:24,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:24,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:24,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:24,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:24,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable200 [2022-12-13 01:57:24,940 INFO L420 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 629306425, now seen corresponding path program 1 times [2022-12-13 01:57:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:24,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981428163] [2022-12-13 01:57:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:25,008 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 01:57:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:25,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981428163] [2022-12-13 01:57:25,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981428163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:25,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:25,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298162334] [2022-12-13 01:57:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:25,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:25,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:25,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:25,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:25,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:25,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:25,078 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:25,078 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:25,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:25,079 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:25,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:25,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:25,080 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:25,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:25,081 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:25,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:25,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:25,081 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:25,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:25,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,084 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:25,084 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:25,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:25,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:25,215 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:25,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:25,216 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:25,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:25,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:25,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable201 [2022-12-13 01:57:25,216 INFO L420 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:25,217 INFO L85 PathProgramCache]: Analyzing trace with hash 686564727, now seen corresponding path program 1 times [2022-12-13 01:57:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:25,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495830315] [2022-12-13 01:57:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:25,293 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 01:57:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:25,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495830315] [2022-12-13 01:57:25,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495830315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:25,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:25,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126400180] [2022-12-13 01:57:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:25,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:25,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:25,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:25,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:25,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:25,347 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:25,348 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:25,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:25,349 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:25,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:25,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:25,349 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:25,350 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:25,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:25,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:25,351 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:25,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:25,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,354 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:25,354 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:25,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:25,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:25,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:25,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:25,486 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:25,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:25,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:25,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable202 [2022-12-13 01:57:25,487 INFO L420 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:25,487 INFO L85 PathProgramCache]: Analyzing trace with hash 743823029, now seen corresponding path program 1 times [2022-12-13 01:57:25,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:25,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578633796] [2022-12-13 01:57:25,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:25,541 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 01:57:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:25,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578633796] [2022-12-13 01:57:25,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578633796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:25,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985808018] [2022-12-13 01:57:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:25,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:25,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:25,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:25,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:25,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:25,597 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:25,597 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:25,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:25,598 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:25,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:25,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:25,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:25,599 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:25,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:25,599 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:25,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:25,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:25,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:25,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:25,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:25,603 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:25,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:25,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:25,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:25,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:25,741 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:25,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:25,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:25,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable203 [2022-12-13 01:57:25,742 INFO L420 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 801081331, now seen corresponding path program 1 times [2022-12-13 01:57:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:25,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263338576] [2022-12-13 01:57:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:25,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:25,795 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 01:57:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:25,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263338576] [2022-12-13 01:57:25,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263338576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:25,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:25,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261081304] [2022-12-13 01:57:25,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:25,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:25,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:25,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:25,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:25,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:25,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:25,858 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:25,859 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:25,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:25,859 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:25,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:25,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:25,860 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:25,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:25,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:25,861 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:25,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:25,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:25,861 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:25,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:25,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:25,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,864 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:25,864 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:25,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:25,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:25,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:25,998 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:25,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:25,999 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:25,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:25,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:25,999 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:25,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204 [2022-12-13 01:57:25,999 INFO L420 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:26,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash 858339633, now seen corresponding path program 1 times [2022-12-13 01:57:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:26,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135973409] [2022-12-13 01:57:26,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:26,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:26,064 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 01:57:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:26,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135973409] [2022-12-13 01:57:26,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135973409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:26,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:26,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:26,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202649621] [2022-12-13 01:57:26,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:26,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:26,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:26,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:26,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:26,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:26,132 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:26,132 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:26,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:26,133 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:26,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:26,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:26,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:26,134 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:26,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:26,135 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:26,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:26,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:26,135 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:26,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:26,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,138 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:26,138 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:26,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:26,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:26,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:26,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:26,270 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:26,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:26,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:26,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable205 [2022-12-13 01:57:26,270 INFO L420 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 915597935, now seen corresponding path program 1 times [2022-12-13 01:57:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:26,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467911985] [2022-12-13 01:57:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:26,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:26,339 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 01:57:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:26,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467911985] [2022-12-13 01:57:26,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467911985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:26,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:26,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655611098] [2022-12-13 01:57:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:26,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:26,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:26,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:26,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:26,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:26,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:26,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:26,401 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:26,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:26,402 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:26,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:26,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:26,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:26,403 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:26,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:26,404 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:26,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:26,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:26,404 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:26,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:26,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,408 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:26,408 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:26,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:26,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:26,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:26,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:26,539 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:26,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:26,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:26,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable206 [2022-12-13 01:57:26,540 INFO L420 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash 972856237, now seen corresponding path program 1 times [2022-12-13 01:57:26,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:26,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393403047] [2022-12-13 01:57:26,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:26,592 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 01:57:26,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:26,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393403047] [2022-12-13 01:57:26,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393403047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:26,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:26,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083003315] [2022-12-13 01:57:26,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:26,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:26,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:26,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:26,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:26,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:26,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:26,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:26,661 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:26,662 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:26,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:26,662 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:26,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:26,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:26,663 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:26,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:26,664 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,664 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:26,664 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:26,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:26,664 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,664 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:26,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:26,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,667 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:26,667 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:26,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:26,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:26,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:26,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:26,799 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:26,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:26,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:26,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2022-12-13 01:57:26,799 INFO L420 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1030114539, now seen corresponding path program 1 times [2022-12-13 01:57:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:26,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634065856] [2022-12-13 01:57:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:26,862 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 01:57:26,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:26,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634065856] [2022-12-13 01:57:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634065856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:26,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437632483] [2022-12-13 01:57:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:26,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:26,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:26,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:26,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:26,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:26,926 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:26,926 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:26,927 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:26,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:26,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:26,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:26,929 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:26,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:26,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:26,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:26,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:26,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:26,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:26,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:26,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:26,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,936 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:26,936 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:26,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:26,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:26,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:27,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:27,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:27,067 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:27,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:27,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208 [2022-12-13 01:57:27,068 INFO L420 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:27,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1087372841, now seen corresponding path program 1 times [2022-12-13 01:57:27,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:27,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348784365] [2022-12-13 01:57:27,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:27,127 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 01:57:27,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:27,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348784365] [2022-12-13 01:57:27,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348784365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:27,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:27,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799793221] [2022-12-13 01:57:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:27,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:27,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:27,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:27,128 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:27,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:27,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:27,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:27,181 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:27,182 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:27,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:27,182 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:27,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:27,183 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:27,183 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:27,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:27,184 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:27,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:27,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:27,184 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:27,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:27,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,187 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:27,187 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:27,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:27,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:27,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:27,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:27,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:27,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:27,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:27,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable209 [2022-12-13 01:57:27,324 INFO L420 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:27,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1144631143, now seen corresponding path program 1 times [2022-12-13 01:57:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:27,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150599843] [2022-12-13 01:57:27,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:27,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:27,381 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 01:57:27,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:27,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150599843] [2022-12-13 01:57:27,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150599843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:27,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:27,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249355490] [2022-12-13 01:57:27,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:27,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:27,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:27,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:27,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:27,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:27,443 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:27,444 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:27,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:27,444 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:27,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:27,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:27,445 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:27,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:27,447 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:27,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:27,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:27,447 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:27,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:27,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,451 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:27,451 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:27,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:27,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:27,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:27,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:27,585 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:27,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:27,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:27,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable210 [2022-12-13 01:57:27,586 INFO L420 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1201889445, now seen corresponding path program 1 times [2022-12-13 01:57:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:27,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320748761] [2022-12-13 01:57:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:27,636 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 01:57:27,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:27,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320748761] [2022-12-13 01:57:27,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320748761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:27,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:27,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:27,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741111009] [2022-12-13 01:57:27,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:27,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:27,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:27,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:27,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:27,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:27,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:27,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:27,700 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:27,700 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:27,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:27,701 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:27,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:27,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:27,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:27,701 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:27,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:27,702 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:27,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:27,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:27,703 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:27,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:27,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:27,706 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:27,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:27,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:27,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:27,830 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:27,830 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:27,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,830 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:27,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:27,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211 [2022-12-13 01:57:27,831 INFO L420 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:27,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1259147747, now seen corresponding path program 1 times [2022-12-13 01:57:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:27,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264810954] [2022-12-13 01:57:27,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:27,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:27,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 01:57:27,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:27,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264810954] [2022-12-13 01:57:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264810954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:27,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:27,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:27,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193514664] [2022-12-13 01:57:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:27,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:27,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:27,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:27,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:27,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:27,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:27,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:27,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:27,948 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:27,948 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:27,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:27,949 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:27,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:27,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:27,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:27,950 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:27,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:27,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:27,951 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:27,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:27,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:27,951 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:27,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:27,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:27,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,955 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:27,955 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:27,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:27,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:27,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:28,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:28,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:28,093 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:28,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:28,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable212 [2022-12-13 01:57:28,093 INFO L420 AbstractCegarLoop]: === Iteration 214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1316406049, now seen corresponding path program 1 times [2022-12-13 01:57:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:28,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992584167] [2022-12-13 01:57:28,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:28,161 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 01:57:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:28,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992584167] [2022-12-13 01:57:28,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992584167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:28,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:28,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:28,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014115775] [2022-12-13 01:57:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:28,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:28,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:28,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:28,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:28,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:28,219 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:28,220 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:28,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:28,220 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:28,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:28,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:28,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:28,221 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:28,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:28,222 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:28,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:28,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:28,222 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:28,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:28,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,225 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:28,225 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:28,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:28,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:28,357 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:28,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:28,357 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:28,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:28,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:28,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable213 [2022-12-13 01:57:28,358 INFO L420 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1373664351, now seen corresponding path program 1 times [2022-12-13 01:57:28,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:28,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687384615] [2022-12-13 01:57:28,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:28,412 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 01:57:28,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:28,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687384615] [2022-12-13 01:57:28,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687384615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:28,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:28,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338698215] [2022-12-13 01:57:28,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:28,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:28,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:28,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:28,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:28,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:28,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:28,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:28,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:28,461 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:28,461 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:28,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:28,461 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:28,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:28,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:28,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:28,462 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:28,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:28,463 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:28,463 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:28,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:28,463 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:28,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:28,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,466 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:28,466 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:28,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:28,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:28,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:28,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:28,589 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:28,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:28,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:28,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable214 [2022-12-13 01:57:28,590 INFO L420 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1430922653, now seen corresponding path program 1 times [2022-12-13 01:57:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:28,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749833241] [2022-12-13 01:57:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:28,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:28,641 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 01:57:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:28,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749833241] [2022-12-13 01:57:28,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749833241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:28,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:28,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786779109] [2022-12-13 01:57:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:28,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:28,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:28,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:28,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:28,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:28,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:28,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:28,689 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:28,689 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:28,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:28,690 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:28,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:28,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:28,691 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:28,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:28,691 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:28,692 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:28,692 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:28,692 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,692 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:28,692 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:28,692 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,695 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:28,695 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:28,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:28,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:28,815 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:28,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:28,816 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:28,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:28,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:28,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215 [2022-12-13 01:57:28,816 INFO L420 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:28,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1488180955, now seen corresponding path program 1 times [2022-12-13 01:57:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:28,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821811418] [2022-12-13 01:57:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:28,864 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 01:57:28,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:28,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821811418] [2022-12-13 01:57:28,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821811418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:28,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:28,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990962602] [2022-12-13 01:57:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:28,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:28,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:28,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:28,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:28,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:28,922 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:28,922 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:28,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:28,922 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:28,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:28,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:28,923 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:28,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:28,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:28,924 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:28,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:28,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:28,924 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:28,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:28,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:28,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,933 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:28,934 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:28,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:28,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:28,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:29,048 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:29,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:57:29,048 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:29,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:29,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:29,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable216 [2022-12-13 01:57:29,048 INFO L420 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:29,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1545439257, now seen corresponding path program 1 times [2022-12-13 01:57:29,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:29,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315470945] [2022-12-13 01:57:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:29,097 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 01:57:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:29,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315470945] [2022-12-13 01:57:29,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315470945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:29,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:29,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477522636] [2022-12-13 01:57:29,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:29,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:29,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:29,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:29,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:29,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:29,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:29,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:29,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:29,143 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:29,143 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:29,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:29,144 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:29,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:29,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:29,144 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:29,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:29,145 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:29,145 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:29,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:29,145 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:29,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:29,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,148 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:29,148 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:29,149 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,149 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:29,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:29,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:29,263 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:29,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:29,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:29,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217 [2022-12-13 01:57:29,263 INFO L420 AbstractCegarLoop]: === Iteration 219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1602697559, now seen corresponding path program 1 times [2022-12-13 01:57:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:29,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467803845] [2022-12-13 01:57:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:29,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:29,329 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 01:57:29,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:29,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467803845] [2022-12-13 01:57:29,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467803845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:29,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:29,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509340701] [2022-12-13 01:57:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:29,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:29,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:29,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:29,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:29,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:29,382 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:29,382 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:29,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:29,382 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:29,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:29,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:29,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:29,383 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:29,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:29,384 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,384 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:29,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:29,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:29,384 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:29,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:29,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,387 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:29,387 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:29,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:29,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:29,501 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:29,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:57:29,502 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:29,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:29,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218 [2022-12-13 01:57:29,502 INFO L420 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:29,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1659955861, now seen corresponding path program 1 times [2022-12-13 01:57:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:29,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592495349] [2022-12-13 01:57:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:29,551 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 01:57:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:29,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592495349] [2022-12-13 01:57:29,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592495349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:29,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:29,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:29,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114187640] [2022-12-13 01:57:29,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:29,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:29,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:29,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:29,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:29,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:29,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:29,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:29,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:29,604 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:29,604 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:29,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:29,605 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:29,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:29,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:29,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:29,605 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:29,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:29,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:29,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:29,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:29,607 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:29,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:29,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,610 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:29,610 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:29,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:29,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:29,726 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:29,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:29,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:29,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:29,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:29,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable219 [2022-12-13 01:57:29,726 INFO L420 AbstractCegarLoop]: === Iteration 221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1717214163, now seen corresponding path program 1 times [2022-12-13 01:57:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:29,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286694856] [2022-12-13 01:57:29,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:29,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:29,776 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 01:57:29,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:29,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286694856] [2022-12-13 01:57:29,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286694856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:29,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:29,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:29,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472640754] [2022-12-13 01:57:29,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:29,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:29,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:29,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:29,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:29,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:29,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:29,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:29,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:29,820 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:29,820 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:29,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:29,821 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:29,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:29,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:29,821 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:29,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:29,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:29,822 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:29,823 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:29,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:29,823 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:29,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:29,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:29,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,826 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:29,826 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:29,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:29,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:29,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:29,944 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:29,944 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:29,944 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:29,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:29,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:29,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:29,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2022-12-13 01:57:29,945 INFO L420 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:29,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1774472465, now seen corresponding path program 1 times [2022-12-13 01:57:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:29,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743263376] [2022-12-13 01:57:29,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:29,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:30,003 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 01:57:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:30,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743263376] [2022-12-13 01:57:30,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743263376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:30,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:30,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642471346] [2022-12-13 01:57:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:30,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:30,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:30,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:30,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:30,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:30,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:30,061 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:30,062 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:30,062 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:30,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:30,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:30,063 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:30,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:30,064 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:30,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:30,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:30,064 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:30,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:30,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,067 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:30,068 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:30,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:30,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:30,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:30,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:30,190 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:30,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:30,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:30,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2022-12-13 01:57:30,190 INFO L420 AbstractCegarLoop]: === Iteration 223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1831730767, now seen corresponding path program 1 times [2022-12-13 01:57:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:30,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513991190] [2022-12-13 01:57:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:30,244 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 01:57:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:30,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513991190] [2022-12-13 01:57:30,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513991190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:30,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:30,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:30,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837898160] [2022-12-13 01:57:30,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:30,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:30,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:30,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:30,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:30,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:30,302 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:30,302 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:30,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:30,303 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:30,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:30,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:30,304 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:30,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:30,304 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,305 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:30,305 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:30,305 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:30,305 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:30,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:30,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,308 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:30,308 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:30,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:30,432 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:30,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:30,432 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:30,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:30,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:30,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2022-12-13 01:57:30,433 INFO L420 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1888989069, now seen corresponding path program 1 times [2022-12-13 01:57:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:30,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562482901] [2022-12-13 01:57:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:30,483 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 01:57:30,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:30,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562482901] [2022-12-13 01:57:30,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562482901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:30,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:30,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:30,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819672149] [2022-12-13 01:57:30,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:30,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:30,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:30,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:30,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:30,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:30,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:30,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:30,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:30,535 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:30,535 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:30,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:30,536 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:30,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:30,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:30,537 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:30,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:30,537 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:30,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:30,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:30,538 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:30,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:30,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,541 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:30,541 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:30,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:30,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:30,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:30,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:30,679 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:30,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:30,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable223 [2022-12-13 01:57:30,679 INFO L420 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1946247371, now seen corresponding path program 1 times [2022-12-13 01:57:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:30,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37782108] [2022-12-13 01:57:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:30,731 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 01:57:30,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:30,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37782108] [2022-12-13 01:57:30,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37782108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:30,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:30,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:30,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164493109] [2022-12-13 01:57:30,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:30,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:30,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:30,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:30,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:30,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:30,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:30,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:30,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:30,775 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:30,775 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:30,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:30,776 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:30,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:30,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:30,776 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:30,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:30,777 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:30,777 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:30,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:30,777 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,778 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:30,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:30,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,780 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:30,780 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:30,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:30,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:30,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:30,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:30,896 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:30,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:30,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:30,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable224 [2022-12-13 01:57:30,896 INFO L420 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:30,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2003505673, now seen corresponding path program 1 times [2022-12-13 01:57:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:30,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839759654] [2022-12-13 01:57:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:30,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:30,946 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 01:57:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:30,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839759654] [2022-12-13 01:57:30,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839759654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:30,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:30,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:30,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630520549] [2022-12-13 01:57:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:30,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:30,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:30,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:30,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:30,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:30,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:30,991 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:30,991 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:30,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:30,991 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:30,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:30,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:30,992 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:30,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:30,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:30,993 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:30,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:30,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:30,993 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:30,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:30,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,996 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:30,996 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:30,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:30,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:30,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:31,129 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:31,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:31,129 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:31,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:31,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:31,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225 [2022-12-13 01:57:31,130 INFO L420 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:31,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2060763975, now seen corresponding path program 1 times [2022-12-13 01:57:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:31,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157219841] [2022-12-13 01:57:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:31,205 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 01:57:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:31,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157219841] [2022-12-13 01:57:31,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157219841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:31,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:31,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358864827] [2022-12-13 01:57:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:31,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:31,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:31,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:31,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:31,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:31,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:31,272 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:31,272 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:31,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:31,273 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:31,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:31,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:31,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:31,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:31,273 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:31,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:31,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:31,274 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:31,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:31,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:31,275 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:31,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:31,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:31,278 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:31,278 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:31,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:31,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:31,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:31,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:31,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:57:31,414 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:31,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:31,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:31,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226 [2022-12-13 01:57:31,414 INFO L420 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:31,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:31,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2118022277, now seen corresponding path program 1 times [2022-12-13 01:57:31,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:31,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72407616] [2022-12-13 01:57:31,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:31,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:31,468 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 01:57:31,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:31,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72407616] [2022-12-13 01:57:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72407616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:31,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:31,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:31,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702609362] [2022-12-13 01:57:31,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:31,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:31,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:31,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:31,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:31,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:31,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:31,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:31,523 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:31,523 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:31,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:31,524 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:31,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:31,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:31,524 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:31,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:31,525 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:31,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:31,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:31,526 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:31,526 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:31,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:31,529 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:31,529 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:31,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:31,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:31,529 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:31,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:31,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:57:31,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:31,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:31,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:31,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227 [2022-12-13 01:57:31,659 INFO L420 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:31,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:31,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2119686717, now seen corresponding path program 1 times [2022-12-13 01:57:31,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:31,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486013156] [2022-12-13 01:57:31,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:31,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:31,716 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 01:57:31,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:31,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486013156] [2022-12-13 01:57:31,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486013156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:31,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:31,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332766296] [2022-12-13 01:57:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:31,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:31,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:31,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:31,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:31,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:31,770 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:31,770 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:31,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:31,770 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:31,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:31,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:31,771 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:31,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:31,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:31,772 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:31,772 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:31,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:31,772 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:31,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:31,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:31,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:31,775 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:31,775 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:31,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:31,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:31,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:31,905 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:31,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:57:31,905 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:31,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:31,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:31,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable228 [2022-12-13 01:57:31,906 INFO L420 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:31,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:31,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2062428415, now seen corresponding path program 1 times [2022-12-13 01:57:31,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:31,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329185397] [2022-12-13 01:57:31,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:31,966 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 01:57:31,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:31,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329185397] [2022-12-13 01:57:31,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329185397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:31,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:31,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:31,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677578634] [2022-12-13 01:57:31,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:31,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:31,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:31,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:31,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:31,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:31,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:31,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:31,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:31,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:32,026 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:32,026 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:32,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:32,027 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:32,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:32,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:32,028 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:32,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:32,029 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:32,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:32,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:32,030 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:32,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:32,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,033 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:32,034 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:32,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:32,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:32,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:32,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:32,161 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:32,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:32,161 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:32,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable229 [2022-12-13 01:57:32,162 INFO L420 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:32,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2005170113, now seen corresponding path program 1 times [2022-12-13 01:57:32,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:32,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444910969] [2022-12-13 01:57:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:32,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:32,222 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 01:57:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:32,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444910969] [2022-12-13 01:57:32,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444910969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:32,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:32,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706614264] [2022-12-13 01:57:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:32,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:32,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:32,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:32,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:32,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:32,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:32,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:32,285 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:32,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:32,286 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:32,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:32,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:32,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:32,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:32,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:32,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:32,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:32,287 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:32,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:32,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,290 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:32,290 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:32,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:32,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:32,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:32,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:57:32,427 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:32,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:32,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:32,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230 [2022-12-13 01:57:32,427 INFO L420 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:32,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1947911811, now seen corresponding path program 1 times [2022-12-13 01:57:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:32,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617695509] [2022-12-13 01:57:32,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:32,475 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 01:57:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:32,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617695509] [2022-12-13 01:57:32,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617695509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:32,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:32,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462915832] [2022-12-13 01:57:32,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:32,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:32,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:32,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:32,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:32,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:32,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:32,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:32,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:32,522 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:32,522 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:32,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:32,523 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:32,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:32,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:32,523 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:32,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:32,524 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:32,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:32,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:32,525 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:32,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:32,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,528 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:32,528 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:32,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:32,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:32,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:32,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:32,657 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:32,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:32,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:32,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231 [2022-12-13 01:57:32,657 INFO L420 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1890653509, now seen corresponding path program 1 times [2022-12-13 01:57:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010961340] [2022-12-13 01:57:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:32,708 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 01:57:32,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:32,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010961340] [2022-12-13 01:57:32,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010961340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:32,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:32,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:32,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304534190] [2022-12-13 01:57:32,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:32,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:32,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:32,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:32,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:32,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:32,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:32,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:32,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:32,769 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:32,769 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:32,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:32,770 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:32,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:32,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:32,770 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:32,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:32,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:32,772 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:32,772 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:32,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:32,772 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:32,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:32,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:32,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,777 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:32,777 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:32,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:32,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:32,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:32,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:32,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 01:57:32,934 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:32,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:32,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:32,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:32,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable232 [2022-12-13 01:57:32,935 INFO L420 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:32,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:32,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1833395207, now seen corresponding path program 1 times [2022-12-13 01:57:32,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:32,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011353305] [2022-12-13 01:57:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:33,005 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 01:57:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:33,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011353305] [2022-12-13 01:57:33,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011353305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:33,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:33,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736971581] [2022-12-13 01:57:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:33,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:33,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:33,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:33,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:33,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:33,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:33,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:33,077 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:33,077 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:33,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:33,078 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:33,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:33,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:33,078 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:33,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:33,080 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:33,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:33,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:33,081 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:33,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:33,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,085 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:33,085 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:33,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:33,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:33,218 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:33,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:57:33,219 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:33,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:33,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:33,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable233 [2022-12-13 01:57:33,219 INFO L420 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:33,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1776136905, now seen corresponding path program 1 times [2022-12-13 01:57:33,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678703267] [2022-12-13 01:57:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:33,283 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 01:57:33,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:33,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678703267] [2022-12-13 01:57:33,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678703267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:33,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:33,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:33,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141682598] [2022-12-13 01:57:33,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:33,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:33,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:33,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:33,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:33,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:33,356 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:33,356 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:33,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:33,357 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:33,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:33,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:33,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:33,358 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:33,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:33,359 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:33,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:33,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:33,360 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:33,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:33,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,364 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:33,364 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:33,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:33,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:33,497 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:33,498 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:33,498 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:33,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,498 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:33,498 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:33,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable234 [2022-12-13 01:57:33,498 INFO L420 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:33,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1718878603, now seen corresponding path program 1 times [2022-12-13 01:57:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:33,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427722552] [2022-12-13 01:57:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:33,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:33,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427722552] [2022-12-13 01:57:33,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427722552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:33,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:33,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:33,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335605502] [2022-12-13 01:57:33,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:33,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:33,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:33,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:33,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:33,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:33,639 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:33,640 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:33,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:33,640 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:33,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:33,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:33,641 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:33,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:33,642 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:33,642 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:33,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:33,642 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:33,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:33,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,646 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:33,646 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:33,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:33,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:33,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:33,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:33,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:33,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:33,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:33,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235 [2022-12-13 01:57:33,781 INFO L420 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:33,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1661620301, now seen corresponding path program 1 times [2022-12-13 01:57:33,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:33,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54538267] [2022-12-13 01:57:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:33,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 01:57:33,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:33,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54538267] [2022-12-13 01:57:33,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54538267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:33,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:33,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174452806] [2022-12-13 01:57:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:33,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:33,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:33,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:33,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:33,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:33,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:33,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:33,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:33,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:33,901 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:33,901 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:33,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:33,902 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:33,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:33,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:33,903 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:33,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:33,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:33,904 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:33,904 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:33,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:33,904 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:33,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:33,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:33,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,907 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:33,907 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:33,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:33,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:33,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:34,041 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:34,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:34,042 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:34,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:34,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:34,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable236 [2022-12-13 01:57:34,042 INFO L420 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:34,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1604361999, now seen corresponding path program 1 times [2022-12-13 01:57:34,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:34,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087978335] [2022-12-13 01:57:34,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:34,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:34,110 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 01:57:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:34,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087978335] [2022-12-13 01:57:34,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087978335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:34,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:34,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:34,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865911401] [2022-12-13 01:57:34,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:34,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:34,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:34,112 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:34,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:34,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:34,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:34,178 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:34,178 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:34,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:34,179 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:34,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:34,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:34,180 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:34,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:34,181 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:34,181 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:34,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:34,181 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:34,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:34,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,186 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:34,186 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:34,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:34,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:34,320 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:34,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:34,321 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:34,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:34,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:34,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable237 [2022-12-13 01:57:34,321 INFO L420 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:34,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:34,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1547103697, now seen corresponding path program 1 times [2022-12-13 01:57:34,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:34,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188967399] [2022-12-13 01:57:34,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:34,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:34,384 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 01:57:34,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:34,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188967399] [2022-12-13 01:57:34,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188967399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:34,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:34,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526187508] [2022-12-13 01:57:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:34,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:34,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:34,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:34,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:34,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:34,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:34,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:34,441 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:34,442 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:34,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:34,442 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:34,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:34,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:34,443 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:34,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:34,444 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:34,444 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:34,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:34,444 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:34,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:34,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,448 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:34,448 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:34,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:34,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:34,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:34,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:34,578 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:34,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:34,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:34,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable238 [2022-12-13 01:57:34,579 INFO L420 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1489845395, now seen corresponding path program 1 times [2022-12-13 01:57:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:34,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088898128] [2022-12-13 01:57:34,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:34,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:34,631 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 01:57:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:34,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088898128] [2022-12-13 01:57:34,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088898128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:34,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:34,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206547253] [2022-12-13 01:57:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:34,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:34,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:34,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:34,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:34,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:34,697 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:34,697 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:34,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:34,698 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:34,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:34,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:34,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:34,698 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:34,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:34,699 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:34,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:34,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:34,700 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:34,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:34,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:34,703 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:34,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:34,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:34,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:34,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:57:34,846 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:34,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:34,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:34,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239 [2022-12-13 01:57:34,846 INFO L420 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1432587093, now seen corresponding path program 1 times [2022-12-13 01:57:34,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:34,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274903824] [2022-12-13 01:57:34,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:34,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 01:57:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274903824] [2022-12-13 01:57:34,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274903824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:34,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:34,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:34,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664859640] [2022-12-13 01:57:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:34,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:34,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:34,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:34,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:34,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:34,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:34,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:34,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:34,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:34,957 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:34,957 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:34,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:34,958 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:34,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:34,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:34,959 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:34,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:34,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:34,960 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:34,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:34,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:34,960 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:34,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:34,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:34,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,963 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:34,964 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:34,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:34,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:34,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:35,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:35,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:35,095 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:35,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:35,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:35,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240 [2022-12-13 01:57:35,095 INFO L420 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1375328791, now seen corresponding path program 1 times [2022-12-13 01:57:35,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:35,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733832074] [2022-12-13 01:57:35,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:35,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:35,161 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 01:57:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:35,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733832074] [2022-12-13 01:57:35,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733832074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:35,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:35,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77335632] [2022-12-13 01:57:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:35,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:35,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:35,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:35,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:35,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:35,224 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:35,224 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:35,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:35,225 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:35,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:35,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:35,226 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:35,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:35,227 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:35,227 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:35,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:35,227 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:35,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:35,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:35,230 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:35,230 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:35,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:35,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:35,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:35,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:35,364 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:35,364 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:35,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:35,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:35,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241 [2022-12-13 01:57:35,365 INFO L420 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:35,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:35,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1318070489, now seen corresponding path program 1 times [2022-12-13 01:57:35,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:35,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2157073] [2022-12-13 01:57:35,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:35,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:35,426 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 01:57:35,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:35,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2157073] [2022-12-13 01:57:35,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2157073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:35,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:35,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:35,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076567557] [2022-12-13 01:57:35,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:35,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:35,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:35,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:35,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:35,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:35,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:35,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:35,489 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:35,489 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:35,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:35,490 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:35,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:35,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:35,490 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:35,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:35,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:35,491 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:35,492 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:35,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:35,492 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:35,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:35,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:35,495 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:35,495 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:35,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:35,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:35,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:35,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:35,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 01:57:35,653 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:35,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:35,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:35,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242 [2022-12-13 01:57:35,654 INFO L420 AbstractCegarLoop]: === Iteration 244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1260812187, now seen corresponding path program 1 times [2022-12-13 01:57:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:35,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737050129] [2022-12-13 01:57:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:35,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:35,709 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 01:57:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:35,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737050129] [2022-12-13 01:57:35,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737050129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:35,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:35,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:35,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261928135] [2022-12-13 01:57:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:35,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:35,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:35,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:35,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:35,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:35,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:35,772 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:35,772 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:35,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:35,773 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:35,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:35,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:35,773 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:35,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:35,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:35,774 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:35,774 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:35,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:35,775 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:35,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:35,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:35,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:35,786 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:35,787 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:35,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:35,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:35,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:35,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:35,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 01:57:35,933 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:35,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:35,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:35,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable243 [2022-12-13 01:57:35,934 INFO L420 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:35,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:35,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1203553885, now seen corresponding path program 1 times [2022-12-13 01:57:35,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:35,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578013995] [2022-12-13 01:57:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:35,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:35,996 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 01:57:35,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:35,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578013995] [2022-12-13 01:57:35,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578013995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:35,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:35,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965465596] [2022-12-13 01:57:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:35,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:35,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:35,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:35,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:35,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:35,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,064 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:36,064 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:36,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:36,065 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:36,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:36,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:36,066 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:36,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:36,066 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:36,067 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:36,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,067 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,070 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:36,070 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:36,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:36,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:36,190 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:36,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:57:36,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244 [2022-12-13 01:57:36,191 INFO L420 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:36,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:36,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1146295583, now seen corresponding path program 1 times [2022-12-13 01:57:36,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:36,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128149180] [2022-12-13 01:57:36,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:36,250 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 01:57:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:36,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128149180] [2022-12-13 01:57:36,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128149180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:36,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:36,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934668969] [2022-12-13 01:57:36,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:36,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:36,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:36,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:36,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:36,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:36,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:36,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,302 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:36,302 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:36,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:36,303 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:36,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:36,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:36,303 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:36,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:36,304 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:36,304 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:36,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,305 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,305 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,305 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,308 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:36,308 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:36,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:36,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:36,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:36,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:36,424 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable245 [2022-12-13 01:57:36,424 INFO L420 AbstractCegarLoop]: === Iteration 247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:36,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1089037281, now seen corresponding path program 1 times [2022-12-13 01:57:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:36,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507453320] [2022-12-13 01:57:36,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:36,474 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 01:57:36,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:36,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507453320] [2022-12-13 01:57:36,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507453320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:36,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:36,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:36,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436061411] [2022-12-13 01:57:36,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:36,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:36,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:36,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:36,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,526 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:36,526 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:36,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:36,526 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:36,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:36,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:36,527 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:36,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:36,528 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:36,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:36,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,528 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,531 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:36,531 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:36,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:36,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:36,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:36,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:57:36,672 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:36,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable246 [2022-12-13 01:57:36,672 INFO L420 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:36,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1031778979, now seen corresponding path program 1 times [2022-12-13 01:57:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:36,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438560764] [2022-12-13 01:57:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:36,741 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 01:57:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:36,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438560764] [2022-12-13 01:57:36,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438560764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:36,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:36,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787302229] [2022-12-13 01:57:36,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:36,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:36,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:36,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:36,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:36,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:36,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:36,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:36,798 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:36,798 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:36,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:36,799 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:36,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:36,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:36,800 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:36,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:36,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:36,801 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:36,801 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:36,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:36,802 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:36,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:36,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:36,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,805 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:36,806 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:36,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:36,806 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:36,806 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:36,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:36,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:36,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:36,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:36,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:36,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:36,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247 [2022-12-13 01:57:36,938 INFO L420 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:36,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:36,938 INFO L85 PathProgramCache]: Analyzing trace with hash -974520677, now seen corresponding path program 1 times [2022-12-13 01:57:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:36,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879367167] [2022-12-13 01:57:36,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,001 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 01:57:37,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879367167] [2022-12-13 01:57:37,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879367167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654787790] [2022-12-13 01:57:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:37,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:37,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,068 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:37,068 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:37,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:37,069 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:37,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:37,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:37,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:37,070 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:37,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:37,071 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:37,072 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:37,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,072 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,076 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:37,076 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:37,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:37,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:37,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:37,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:37,204 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:37,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248 [2022-12-13 01:57:37,204 INFO L420 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,204 INFO L85 PathProgramCache]: Analyzing trace with hash -917262375, now seen corresponding path program 1 times [2022-12-13 01:57:37,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194322948] [2022-12-13 01:57:37,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,282 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 01:57:37,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194322948] [2022-12-13 01:57:37,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194322948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359131462] [2022-12-13 01:57:37,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:37,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:37,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,340 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:37,341 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:37,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:37,341 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:37,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:37,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:37,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:37,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:37,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:37,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:37,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,344 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,348 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:37,348 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:37,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:37,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:37,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:37,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:57:37,467 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:37,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249 [2022-12-13 01:57:37,467 INFO L420 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash -860004073, now seen corresponding path program 1 times [2022-12-13 01:57:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60873222] [2022-12-13 01:57:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,533 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 01:57:37,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60873222] [2022-12-13 01:57:37,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60873222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:37,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113351618] [2022-12-13 01:57:37,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:37,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:37,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,588 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:37,588 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:37,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:37,589 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:37,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:37,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:37,589 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:37,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:37,590 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:37,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:37,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,591 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,593 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:37,594 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:37,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:37,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:37,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:37,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:37,709 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:37,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250 [2022-12-13 01:57:37,710 INFO L420 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,710 INFO L85 PathProgramCache]: Analyzing trace with hash -802745771, now seen corresponding path program 1 times [2022-12-13 01:57:37,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686587138] [2022-12-13 01:57:37,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,760 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 01:57:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686587138] [2022-12-13 01:57:37,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686587138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366339126] [2022-12-13 01:57:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:37,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:37,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:37,805 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:37,806 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:37,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:37,806 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:37,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:37,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:37,807 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:37,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:37,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:37,808 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:37,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:37,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:37,808 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:37,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:37,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:37,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,812 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:37,812 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:37,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:37,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:37,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:37,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:37,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:37,928 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:37,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:37,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251 [2022-12-13 01:57:37,928 INFO L420 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:37,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash -745487469, now seen corresponding path program 1 times [2022-12-13 01:57:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:37,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973206586] [2022-12-13 01:57:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:37,979 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 01:57:37,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973206586] [2022-12-13 01:57:37,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973206586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:37,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:37,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788771581] [2022-12-13 01:57:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:37,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:37,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:37,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:37,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:37,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:37,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:37,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:37,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,029 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:38,029 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:38,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:38,030 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:38,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:38,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:38,031 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:38,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:38,031 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:38,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:38,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,032 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,035 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:38,035 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:38,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:38,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:38,153 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:38,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:38,153 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:38,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:38,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:38,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252 [2022-12-13 01:57:38,154 INFO L420 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:38,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:38,154 INFO L85 PathProgramCache]: Analyzing trace with hash -688229167, now seen corresponding path program 1 times [2022-12-13 01:57:38,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:38,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849853665] [2022-12-13 01:57:38,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:38,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:38,208 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 01:57:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:38,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849853665] [2022-12-13 01:57:38,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849853665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:38,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:38,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:38,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290384580] [2022-12-13 01:57:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:38,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:38,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:38,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:38,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:38,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,252 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:38,252 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:38,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:38,252 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:38,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:38,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:38,253 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:38,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:38,254 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:38,254 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:38,254 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,254 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,254 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,254 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,258 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:38,258 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:38,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:38,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:38,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:38,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:38,373 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:38,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:38,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:38,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253 [2022-12-13 01:57:38,374 INFO L420 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:38,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash -630970865, now seen corresponding path program 1 times [2022-12-13 01:57:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:38,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243786109] [2022-12-13 01:57:38,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:38,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:38,423 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 01:57:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:38,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243786109] [2022-12-13 01:57:38,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243786109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:38,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:38,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295973560] [2022-12-13 01:57:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:38,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:38,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:38,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:38,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:38,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:38,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:38,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,468 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:38,468 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:38,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:38,468 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:38,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:38,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:38,469 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:38,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:38,470 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:38,470 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:38,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,470 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,473 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:38,473 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:38,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:38,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:38,590 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:38,591 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:38,591 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,591 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:38,591 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable254 [2022-12-13 01:57:38,591 INFO L420 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:38,592 INFO L85 PathProgramCache]: Analyzing trace with hash -573712563, now seen corresponding path program 1 times [2022-12-13 01:57:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:38,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495257267] [2022-12-13 01:57:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:38,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:38,647 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 01:57:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:38,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495257267] [2022-12-13 01:57:38,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495257267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:38,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:38,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178507389] [2022-12-13 01:57:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:38,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:38,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:38,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:38,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:38,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,692 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:38,692 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:38,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:38,692 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:38,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:38,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:38,694 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:38,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:38,694 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:38,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:38,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,695 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,698 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:38,698 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:38,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:38,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:38,828 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:38,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:38,829 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:38,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:38,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:38,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable255 [2022-12-13 01:57:38,830 INFO L420 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:38,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:38,830 INFO L85 PathProgramCache]: Analyzing trace with hash -516454261, now seen corresponding path program 1 times [2022-12-13 01:57:38,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:38,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920359535] [2022-12-13 01:57:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:38,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:38,879 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 01:57:38,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:38,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920359535] [2022-12-13 01:57:38,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920359535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:38,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:38,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:38,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084844870] [2022-12-13 01:57:38,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:38,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:38,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:38,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:38,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:38,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:38,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:38,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:38,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:38,944 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:38,945 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:38,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:38,945 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:38,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:38,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:38,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:38,946 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:38,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:38,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:38,947 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:38,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:38,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:38,947 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:38,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:38,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:38,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,950 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:38,950 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:38,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:38,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:38,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:39,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:39,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:39,070 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:39,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:39,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:39,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable256 [2022-12-13 01:57:39,071 INFO L420 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -459195959, now seen corresponding path program 1 times [2022-12-13 01:57:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777913147] [2022-12-13 01:57:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,122 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 01:57:39,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:39,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777913147] [2022-12-13 01:57:39,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777913147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:39,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:39,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80203555] [2022-12-13 01:57:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:39,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:39,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:39,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:39,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:39,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:39,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:39,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:39,172 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:39,172 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:39,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:39,173 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:39,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:39,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:39,174 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:39,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:39,175 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,175 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:39,175 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:39,175 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:39,175 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,175 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:39,175 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:39,175 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,178 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:39,178 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:39,178 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:39,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:39,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:39,295 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:39,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:39,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:39,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable257 [2022-12-13 01:57:39,295 INFO L420 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -401937657, now seen corresponding path program 1 times [2022-12-13 01:57:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353319741] [2022-12-13 01:57:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,347 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 01:57:39,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:39,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353319741] [2022-12-13 01:57:39,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353319741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:39,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:39,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:39,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221837537] [2022-12-13 01:57:39,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:39,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:39,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:39,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:39,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:39,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:39,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:39,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:39,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:39,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:39,401 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:39,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:39,401 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:39,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:39,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:39,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:39,402 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:39,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:39,404 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:39,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:39,404 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:39,404 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:39,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:39,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,408 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:39,408 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:39,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:39,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:39,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:39,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:57:39,533 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:39,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:39,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:39,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258 [2022-12-13 01:57:39,533 INFO L420 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash -344679355, now seen corresponding path program 1 times [2022-12-13 01:57:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324815050] [2022-12-13 01:57:39,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,584 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 01:57:39,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:39,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324815050] [2022-12-13 01:57:39,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324815050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:39,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:39,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:39,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356021430] [2022-12-13 01:57:39,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:39,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:39,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:39,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:39,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:39,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:39,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:39,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:39,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:39,630 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:39,630 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:39,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:39,630 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:39,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:39,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:39,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:39,631 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:39,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:39,632 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:39,632 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:39,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:39,632 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:39,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:39,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,635 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:39,635 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:39,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:39,635 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:39,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:39,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:39,758 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:39,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:39,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:39,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable259 [2022-12-13 01:57:39,758 INFO L420 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,759 INFO L85 PathProgramCache]: Analyzing trace with hash -287421053, now seen corresponding path program 1 times [2022-12-13 01:57:39,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760803433] [2022-12-13 01:57:39,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:39,809 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 01:57:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:39,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760803433] [2022-12-13 01:57:39,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760803433] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:39,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:39,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900230126] [2022-12-13 01:57:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:39,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:39,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:39,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:39,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:39,861 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:39,861 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:39,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:39,861 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:39,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:39,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:39,862 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:39,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:39,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:39,863 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:39,863 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:39,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:39,863 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:39,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:39,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:39,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,866 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:39,866 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:39,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:39,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:39,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:39,980 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:39,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:57:39,980 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:39,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:39,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:39,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:39,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260 [2022-12-13 01:57:39,981 INFO L420 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:39,981 INFO L85 PathProgramCache]: Analyzing trace with hash -230162751, now seen corresponding path program 1 times [2022-12-13 01:57:39,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:39,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293330929] [2022-12-13 01:57:39,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:39,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,041 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 01:57:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:40,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293330929] [2022-12-13 01:57:40,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293330929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:40,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:40,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:40,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365329969] [2022-12-13 01:57:40,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:40,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:40,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:40,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:40,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:40,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:40,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:40,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:40,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:40,085 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:40,085 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:40,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:40,086 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:40,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:40,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:40,086 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:40,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:40,087 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:40,087 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:40,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,087 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,090 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:40,090 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:40,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:40,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,091 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:40,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:40,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:57:40,212 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:40,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:40,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:40,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261 [2022-12-13 01:57:40,213 INFO L420 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash -172904449, now seen corresponding path program 1 times [2022-12-13 01:57:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:40,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298066734] [2022-12-13 01:57:40,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,286 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 01:57:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:40,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298066734] [2022-12-13 01:57:40,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298066734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:40,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:40,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454033560] [2022-12-13 01:57:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:40,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:40,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:40,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:40,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:40,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:40,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:40,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:40,342 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:40,342 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:40,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:40,343 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:40,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:40,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:40,343 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:40,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:40,344 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:40,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:40,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,344 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,347 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:40,348 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:40,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:40,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:40,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:40,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:40,479 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:40,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:40,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:40,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262 [2022-12-13 01:57:40,480 INFO L420 AbstractCegarLoop]: === Iteration 264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash -115646147, now seen corresponding path program 1 times [2022-12-13 01:57:40,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:40,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187608867] [2022-12-13 01:57:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,551 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 01:57:40,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:40,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187608867] [2022-12-13 01:57:40,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187608867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:40,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:40,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:40,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661633896] [2022-12-13 01:57:40,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:40,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:40,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:40,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:40,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:40,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:40,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:40,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:40,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:40,604 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:40,604 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:40,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:40,604 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:40,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:40,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:40,605 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:40,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:40,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:40,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:40,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,607 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,610 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:40,610 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:40,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:40,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:40,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:40,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:40,744 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:40,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:40,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:40,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263 [2022-12-13 01:57:40,744 INFO L420 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:40,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -58387845, now seen corresponding path program 1 times [2022-12-13 01:57:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976168663] [2022-12-13 01:57:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:40,799 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 01:57:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:40,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976168663] [2022-12-13 01:57:40,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976168663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:40,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:40,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734763878] [2022-12-13 01:57:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:40,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:40,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:40,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:40,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:40,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:40,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:40,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:40,853 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:40,853 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:40,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:40,854 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:40,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:40,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:40,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:40,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:40,854 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:40,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:40,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:40,855 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:40,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:40,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:40,856 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:40,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:40,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:40,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,859 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:40,859 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:40,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:40,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:40,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:40,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:40,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:40,994 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:40,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:40,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:40,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:40,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264 [2022-12-13 01:57:40,995 INFO L420 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:40,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1129543, now seen corresponding path program 1 times [2022-12-13 01:57:40,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:40,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247009954] [2022-12-13 01:57:40,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:40,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:41,072 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 01:57:41,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:41,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247009954] [2022-12-13 01:57:41,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247009954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:41,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:41,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:41,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668071559] [2022-12-13 01:57:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:41,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:41,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:41,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:41,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:41,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:41,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:41,133 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:41,133 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:41,134 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:41,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:41,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:41,135 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:41,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:41,135 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:41,136 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:41,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:41,136 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:41,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:41,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,139 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:41,139 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:41,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:41,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:41,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:41,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:41,270 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:41,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:41,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:41,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable265 [2022-12-13 01:57:41,271 INFO L420 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash 56128759, now seen corresponding path program 1 times [2022-12-13 01:57:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:41,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26268754] [2022-12-13 01:57:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:41,336 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 01:57:41,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:41,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26268754] [2022-12-13 01:57:41,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26268754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:41,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:41,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:41,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681861434] [2022-12-13 01:57:41,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:41,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:41,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:41,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:41,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:41,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:41,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:41,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:41,407 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:41,407 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:41,408 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:41,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:41,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:41,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:41,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:41,408 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:41,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:41,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:41,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:41,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:41,410 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:41,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:41,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,412 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:41,412 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:41,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:41,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:41,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:41,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:41,540 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:41,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:41,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:41,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable266 [2022-12-13 01:57:41,540 INFO L420 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:41,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 113387061, now seen corresponding path program 1 times [2022-12-13 01:57:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:41,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954092001] [2022-12-13 01:57:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:41,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:41,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 01:57:41,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:41,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954092001] [2022-12-13 01:57:41,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954092001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:41,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:41,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:41,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885777156] [2022-12-13 01:57:41,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:41,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:41,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:41,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:41,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:41,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:41,649 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:41,649 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:41,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:41,650 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:41,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:41,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:41,651 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:41,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:41,651 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:41,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:41,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:41,652 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:41,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:41,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,655 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:41,655 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:41,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:41,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:41,783 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:41,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:41,784 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:41,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:41,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:41,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267 [2022-12-13 01:57:41,784 INFO L420 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 170645363, now seen corresponding path program 1 times [2022-12-13 01:57:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048655052] [2022-12-13 01:57:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:41,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 01:57:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:41,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048655052] [2022-12-13 01:57:41,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048655052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:41,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:41,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:41,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980067718] [2022-12-13 01:57:41,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:41,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:41,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:41,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:41,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:41,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:41,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:41,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:41,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:41,900 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:41,900 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:41,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:41,900 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:41,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:41,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:41,901 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:41,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:41,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:41,902 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:41,902 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:41,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:41,902 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:41,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:41,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:41,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,905 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:41,905 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:41,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:41,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:41,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:42,037 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:42,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:42,037 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:42,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,037 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:42,037 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:42,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable268 [2022-12-13 01:57:42,038 INFO L420 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:42,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 227903665, now seen corresponding path program 1 times [2022-12-13 01:57:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:42,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721469873] [2022-12-13 01:57:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:42,103 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 01:57:42,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:42,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721469873] [2022-12-13 01:57:42,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721469873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:42,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:42,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:42,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68455011] [2022-12-13 01:57:42,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:42,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:42,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:42,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:42,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:42,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:42,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:42,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:42,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:42,180 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:42,180 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:42,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:42,181 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:42,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:42,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:42,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:42,182 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:42,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:42,183 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:42,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:42,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:42,184 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:42,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:42,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,188 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:42,188 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:42,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:42,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:42,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:42,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:42,323 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:42,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:42,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:42,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable269 [2022-12-13 01:57:42,324 INFO L420 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash 285161967, now seen corresponding path program 1 times [2022-12-13 01:57:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:42,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935049120] [2022-12-13 01:57:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:42,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:42,389 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 01:57:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935049120] [2022-12-13 01:57:42,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935049120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:42,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959755983] [2022-12-13 01:57:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:42,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:42,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:42,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:42,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:42,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:42,445 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:42,445 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:42,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:42,446 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:42,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:42,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:42,447 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:42,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:42,448 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,448 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:42,448 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:42,448 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:42,448 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:42,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:42,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:42,453 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:42,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:42,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:42,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:42,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:42,583 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:42,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:42,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:42,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270 [2022-12-13 01:57:42,583 INFO L420 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 342420269, now seen corresponding path program 1 times [2022-12-13 01:57:42,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:42,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037367376] [2022-12-13 01:57:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:42,651 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 01:57:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:42,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037367376] [2022-12-13 01:57:42,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037367376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:42,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:42,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098472244] [2022-12-13 01:57:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:42,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:42,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:42,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:42,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:42,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:42,706 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:42,706 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:42,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:42,707 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:42,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:42,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:42,707 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:42,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:42,708 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:42,708 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:42,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:42,709 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:42,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:42,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,712 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:42,712 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:42,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:42,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:42,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:42,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:57:42,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:42,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:42,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:42,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable271 [2022-12-13 01:57:42,854 INFO L420 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash 399678571, now seen corresponding path program 1 times [2022-12-13 01:57:42,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:42,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331235048] [2022-12-13 01:57:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:42,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:42,913 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 01:57:42,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:42,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331235048] [2022-12-13 01:57:42,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331235048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:42,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:42,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752096483] [2022-12-13 01:57:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:42,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:42,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:42,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:42,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:42,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:42,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:42,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:42,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:42,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:42,967 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:42,967 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:42,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:42,967 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:42,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:42,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:42,968 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:42,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:42,969 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:42,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:42,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:42,969 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:42,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:42,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:42,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,972 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:42,972 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:42,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:42,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:43,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:43,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:43,106 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:43,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272 [2022-12-13 01:57:43,107 INFO L420 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash 456936873, now seen corresponding path program 1 times [2022-12-13 01:57:43,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606307773] [2022-12-13 01:57:43,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,167 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 01:57:43,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606307773] [2022-12-13 01:57:43,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606307773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:43,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643752415] [2022-12-13 01:57:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:43,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:43,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:43,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,219 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:43,219 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:43,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:43,220 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:43,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:43,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:43,220 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:43,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:43,221 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:43,221 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:43,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,221 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,224 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:43,225 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:43,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:43,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:43,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:43,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:43,341 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:43,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273 [2022-12-13 01:57:43,341 INFO L420 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,341 INFO L85 PathProgramCache]: Analyzing trace with hash 514195175, now seen corresponding path program 1 times [2022-12-13 01:57:43,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890836893] [2022-12-13 01:57:43,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890836893] [2022-12-13 01:57:43,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890836893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6687055] [2022-12-13 01:57:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:43,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:43,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:43,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:43,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,450 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:43,450 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:43,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:43,451 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:43,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:43,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:43,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:43,452 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:43,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:43,452 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:43,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:43,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:43,456 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:43,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:43,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:43,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:43,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:43,593 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:43,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable274 [2022-12-13 01:57:43,593 INFO L420 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 571453477, now seen corresponding path program 1 times [2022-12-13 01:57:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744993430] [2022-12-13 01:57:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,654 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 01:57:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744993430] [2022-12-13 01:57:43,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744993430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738254381] [2022-12-13 01:57:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:43,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:43,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:43,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,708 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:43,708 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:43,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:43,709 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:43,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:43,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:43,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:43,710 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:43,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:43,711 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:43,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:43,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,711 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,711 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,711 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,714 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:43,714 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:43,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:43,714 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:43,846 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:43,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:43,847 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:43,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:43,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:43,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275 [2022-12-13 01:57:43,847 INFO L420 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:43,847 INFO L85 PathProgramCache]: Analyzing trace with hash 628711779, now seen corresponding path program 1 times [2022-12-13 01:57:43,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:43,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44391924] [2022-12-13 01:57:43,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:43,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:43,915 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 01:57:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:43,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44391924] [2022-12-13 01:57:43,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44391924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:43,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:43,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:43,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699397254] [2022-12-13 01:57:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:43,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:43,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:43,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:43,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:43,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:43,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:43,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:43,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:43,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:43,978 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:43,978 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:43,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:43,979 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:43,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:43,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:43,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:43,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:43,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:43,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:43,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:43,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:43,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:43,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:43,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:43,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,983 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:43,983 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:43,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:43,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:43,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:44,117 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:44,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:44,117 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:44,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,117 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276 [2022-12-13 01:57:44,118 INFO L420 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,118 INFO L85 PathProgramCache]: Analyzing trace with hash 685970081, now seen corresponding path program 1 times [2022-12-13 01:57:44,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865049029] [2022-12-13 01:57:44,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,184 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 01:57:44,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865049029] [2022-12-13 01:57:44,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865049029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:44,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:44,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010431937] [2022-12-13 01:57:44,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:44,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:44,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:44,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:44,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,254 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:44,254 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:44,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:44,255 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:44,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:44,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:44,256 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:44,256 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:44,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:44,257 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,257 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:44,257 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:44,257 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,257 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,257 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,257 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,257 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,260 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:44,260 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:44,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:44,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:44,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:44,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:44,398 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:44,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable277 [2022-12-13 01:57:44,398 INFO L420 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash 743228383, now seen corresponding path program 1 times [2022-12-13 01:57:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535109493] [2022-12-13 01:57:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,454 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 01:57:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535109493] [2022-12-13 01:57:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535109493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:44,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291394657] [2022-12-13 01:57:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:44,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:44,455 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:44,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:44,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,509 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:44,509 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:44,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:44,510 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:44,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:44,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:44,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:44,510 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:44,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:44,512 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:44,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:44,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,512 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,516 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:44,516 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:44,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:44,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:44,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:44,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:57:44,656 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:44,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable278 [2022-12-13 01:57:44,657 INFO L420 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash 800486685, now seen corresponding path program 1 times [2022-12-13 01:57:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631597731] [2022-12-13 01:57:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,704 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 01:57:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631597731] [2022-12-13 01:57:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631597731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:44,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449651600] [2022-12-13 01:57:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:44,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:44,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:44,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,755 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:44,755 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:44,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:44,755 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:44,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:44,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:44,756 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:44,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:44,757 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:44,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:44,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,757 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,760 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:44,760 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:44,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:44,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:44,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:44,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:44,875 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:44,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:44,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:44,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable279 [2022-12-13 01:57:44,876 INFO L420 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:44,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 857744987, now seen corresponding path program 1 times [2022-12-13 01:57:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512480627] [2022-12-13 01:57:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:44,926 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 01:57:44,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512480627] [2022-12-13 01:57:44,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512480627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:44,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:44,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:44,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724181245] [2022-12-13 01:57:44,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:44,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:44,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:44,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:44,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:44,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:44,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:44,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:44,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:44,980 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:44,980 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:44,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:44,980 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:44,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:44,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:44,981 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:44,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:44,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:44,982 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:44,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:44,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:44,982 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:44,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:44,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:44,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,985 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:44,985 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:44,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:44,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:44,986 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:45,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:45,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:45,102 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:45,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:45,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:45,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280 [2022-12-13 01:57:45,103 INFO L420 AbstractCegarLoop]: === Iteration 282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:45,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash 915003289, now seen corresponding path program 1 times [2022-12-13 01:57:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:45,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784253896] [2022-12-13 01:57:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,173 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 01:57:45,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784253896] [2022-12-13 01:57:45,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784253896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:45,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:45,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:45,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199658821] [2022-12-13 01:57:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:45,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:45,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:45,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:45,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:45,224 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:45,225 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:45,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:45,225 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:45,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:45,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:45,226 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:45,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:45,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:45,227 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:45,227 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:45,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:45,227 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:45,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:45,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:45,230 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:45,230 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:45,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:45,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:45,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:45,357 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:45,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:45,358 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:45,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:45,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:45,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable281 [2022-12-13 01:57:45,358 INFO L420 AbstractCegarLoop]: === Iteration 283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:45,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 972261591, now seen corresponding path program 1 times [2022-12-13 01:57:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:45,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813736617] [2022-12-13 01:57:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,432 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 01:57:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813736617] [2022-12-13 01:57:45,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813736617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:45,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:45,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160243069] [2022-12-13 01:57:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:45,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:45,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:45,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:45,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:45,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:45,519 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:45,519 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:45,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:45,519 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:45,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:45,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:45,520 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:45,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:45,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:45,521 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:45,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:45,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:45,521 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:45,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:45,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:45,524 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:45,524 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:45,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:45,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:45,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:45,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:45,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:45,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:45,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:45,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:45,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable282 [2022-12-13 01:57:45,659 INFO L420 AbstractCegarLoop]: === Iteration 284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:45,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1029519893, now seen corresponding path program 1 times [2022-12-13 01:57:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:45,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563266922] [2022-12-13 01:57:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,728 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 01:57:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563266922] [2022-12-13 01:57:45,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563266922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:45,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:45,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:45,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199352857] [2022-12-13 01:57:45,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:45,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:45,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:45,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:45,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:45,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:45,784 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:45,784 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:45,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:45,785 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:45,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:45,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:45,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:45,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:45,785 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:45,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:45,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:45,787 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:45,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:45,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:45,787 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:45,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:45,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:45,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:45,791 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:45,791 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:45,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:45,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:45,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:45,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:57:45,912 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:45,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:45,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:45,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable283 [2022-12-13 01:57:45,912 INFO L420 AbstractCegarLoop]: === Iteration 285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:45,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1086778195, now seen corresponding path program 1 times [2022-12-13 01:57:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045308270] [2022-12-13 01:57:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:45,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:45,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045308270] [2022-12-13 01:57:45,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045308270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:45,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:45,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:45,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841399988] [2022-12-13 01:57:45,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:45,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:45,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:45,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:45,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:45,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:45,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:45,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,008 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:46,009 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:46,009 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:46,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:46,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:46,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:46,010 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:46,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:46,010 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:46,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:46,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,011 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,014 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:46,014 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:46,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:46,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,014 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:46,144 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:46,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:46,145 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:46,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284 [2022-12-13 01:57:46,145 INFO L420 AbstractCegarLoop]: === Iteration 286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1144036497, now seen corresponding path program 1 times [2022-12-13 01:57:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879720488] [2022-12-13 01:57:46,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,199 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 01:57:46,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879720488] [2022-12-13 01:57:46,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879720488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:46,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:46,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297040625] [2022-12-13 01:57:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:46,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:46,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:46,200 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:46,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,260 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:46,260 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:46,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:46,261 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:46,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:46,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:46,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:46,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:46,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:46,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:46,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:46,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:46,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:46,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:46,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:46,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:46,399 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:46,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable285 [2022-12-13 01:57:46,400 INFO L420 AbstractCegarLoop]: === Iteration 287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1201294799, now seen corresponding path program 1 times [2022-12-13 01:57:46,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369462810] [2022-12-13 01:57:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,467 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 01:57:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369462810] [2022-12-13 01:57:46,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369462810] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:46,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:46,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000535072] [2022-12-13 01:57:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:46,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:46,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:46,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:46,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,534 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:46,534 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:46,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:46,535 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:46,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:46,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:46,535 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:46,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:46,536 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:46,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:46,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,536 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,539 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:46,539 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:46,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:46,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:46,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:46,671 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:46,671 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:46,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable286 [2022-12-13 01:57:46,672 INFO L420 AbstractCegarLoop]: === Iteration 288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1258553101, now seen corresponding path program 1 times [2022-12-13 01:57:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20159215] [2022-12-13 01:57:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,733 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 01:57:46,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20159215] [2022-12-13 01:57:46,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20159215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:46,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:46,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:46,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572610825] [2022-12-13 01:57:46,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:46,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:46,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:46,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:46,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:46,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:46,787 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:46,787 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:46,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:46,787 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:46,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:46,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:46,788 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:46,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:46,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:46,789 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:46,789 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:46,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:46,789 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:46,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:46,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:46,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,792 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:46,792 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:46,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:46,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:46,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:46,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:46,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:57:46,932 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:46,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:46,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:46,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable287 [2022-12-13 01:57:46,932 INFO L420 AbstractCegarLoop]: === Iteration 289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1315811403, now seen corresponding path program 1 times [2022-12-13 01:57:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:46,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2547823] [2022-12-13 01:57:46,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:46,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:46,992 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 01:57:46,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:46,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2547823] [2022-12-13 01:57:46,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2547823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:46,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:46,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:46,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078317111] [2022-12-13 01:57:46,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:46,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:46,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:46,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:46,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:46,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:46,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:46,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,054 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:47,054 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:47,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:47,055 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:47,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:47,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:47,056 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:47,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:47,056 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:47,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:47,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,057 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,060 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:47,060 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:47,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:47,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:47,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:47,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:47,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:47,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable288 [2022-12-13 01:57:47,192 INFO L420 AbstractCegarLoop]: === Iteration 290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1373069705, now seen corresponding path program 1 times [2022-12-13 01:57:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549613800] [2022-12-13 01:57:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,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 01:57:47,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549613800] [2022-12-13 01:57:47,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549613800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:47,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:47,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203835703] [2022-12-13 01:57:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:47,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:47,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:47,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:47,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,309 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:47,309 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:47,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:47,310 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:47,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:47,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:47,310 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:47,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:47,311 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,311 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:47,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:47,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,312 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,315 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:47,315 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:47,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:47,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:47,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:47,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:47,450 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:47,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable289 [2022-12-13 01:57:47,451 INFO L420 AbstractCegarLoop]: === Iteration 291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1430328007, now seen corresponding path program 1 times [2022-12-13 01:57:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20380424] [2022-12-13 01:57:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,507 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 01:57:47,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20380424] [2022-12-13 01:57:47,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20380424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:47,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:47,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393268921] [2022-12-13 01:57:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:47,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:47,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:47,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,569 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:47,569 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:47,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:47,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:47,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:47,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:47,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:47,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:47,571 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:47,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:47,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,575 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:47,575 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:47,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:47,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:47,703 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:47,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:47,703 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:47,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable290 [2022-12-13 01:57:47,704 INFO L420 AbstractCegarLoop]: === Iteration 292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1487586309, now seen corresponding path program 1 times [2022-12-13 01:57:47,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356556237] [2022-12-13 01:57:47,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,757 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 01:57:47,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356556237] [2022-12-13 01:57:47,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356556237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:47,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:47,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794627807] [2022-12-13 01:57:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:47,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:47,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:47,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:47,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:47,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:47,804 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:47,804 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:47,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:47,804 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:47,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:47,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:47,805 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:47,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:47,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:47,806 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:47,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:47,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:47,806 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:47,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:47,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:47,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,809 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:47,809 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:47,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:47,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:47,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:47,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:47,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:57:47,934 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:47,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,934 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:47,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:47,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable291 [2022-12-13 01:57:47,935 INFO L420 AbstractCegarLoop]: === Iteration 293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:47,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1544844611, now seen corresponding path program 1 times [2022-12-13 01:57:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:47,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307322679] [2022-12-13 01:57:47,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:47,985 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 01:57:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:47,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307322679] [2022-12-13 01:57:47,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307322679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:47,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:47,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195116909] [2022-12-13 01:57:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:47,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:47,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:47,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:47,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:47,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:48,030 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:48,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:48,031 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:48,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:48,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:48,031 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:48,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:48,032 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:48,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:48,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,033 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,036 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:48,036 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:48,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:48,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:48,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:48,151 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:48,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable292 [2022-12-13 01:57:48,151 INFO L420 AbstractCegarLoop]: === Iteration 294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1602102913, now seen corresponding path program 1 times [2022-12-13 01:57:48,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103131465] [2022-12-13 01:57:48,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,221 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 01:57:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103131465] [2022-12-13 01:57:48,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103131465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:48,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:48,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:48,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913937800] [2022-12-13 01:57:48,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:48,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:48,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:48,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,271 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:48,271 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:48,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:48,272 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:48,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:48,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:48,272 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:48,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:48,273 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:48,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:48,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,273 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,276 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:48,277 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:48,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:48,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:48,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:48,392 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:48,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable293 [2022-12-13 01:57:48,392 INFO L420 AbstractCegarLoop]: === Iteration 295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1659361215, now seen corresponding path program 1 times [2022-12-13 01:57:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633493955] [2022-12-13 01:57:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633493955] [2022-12-13 01:57:48,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633493955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:48,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:48,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:48,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961665293] [2022-12-13 01:57:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:48,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:48,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:48,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,517 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:48,518 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:48,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:48,518 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:48,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:48,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:48,519 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:48,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:48,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:48,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:48,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,521 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,525 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:48,525 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:48,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:48,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:48,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:48,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:48,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable294 [2022-12-13 01:57:48,659 INFO L420 AbstractCegarLoop]: === Iteration 296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1716619517, now seen corresponding path program 1 times [2022-12-13 01:57:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12469042] [2022-12-13 01:57:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,712 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 01:57:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12469042] [2022-12-13 01:57:48,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12469042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:48,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:48,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539952674] [2022-12-13 01:57:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:48,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:48,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:48,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:48,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:48,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:48,766 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:48,766 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:48,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:48,767 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:48,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:48,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:48,767 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:48,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:48,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:48,768 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:48,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:48,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:48,768 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:48,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:48,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:48,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,771 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:48,771 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:48,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:48,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:48,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:48,907 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:48,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:57:48,908 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:48,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:48,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:48,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable295 [2022-12-13 01:57:48,908 INFO L420 AbstractCegarLoop]: === Iteration 297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:48,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1773877819, now seen corresponding path program 1 times [2022-12-13 01:57:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:48,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215597894] [2022-12-13 01:57:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:48,966 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 01:57:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:48,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215597894] [2022-12-13 01:57:48,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215597894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:48,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:48,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184592307] [2022-12-13 01:57:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:48,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:48,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:48,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:48,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:48,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:48,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:48,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,027 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:49,027 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:49,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:49,028 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:49,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:49,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:49,028 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:49,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:49,029 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:49,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:49,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,029 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,032 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:49,032 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:49,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:49,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:49,163 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:49,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:49,164 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:49,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable296 [2022-12-13 01:57:49,165 INFO L420 AbstractCegarLoop]: === Iteration 298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1831136121, now seen corresponding path program 1 times [2022-12-13 01:57:49,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503958828] [2022-12-13 01:57:49,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,221 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 01:57:49,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503958828] [2022-12-13 01:57:49,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503958828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862617293] [2022-12-13 01:57:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:49,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:49,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:49,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,273 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:49,273 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:49,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:49,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:49,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:49,274 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:49,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:49,275 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:49,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:49,275 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,275 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,278 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:49,278 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:49,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:49,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:49,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:49,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:49,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:49,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable297 [2022-12-13 01:57:49,410 INFO L420 AbstractCegarLoop]: === Iteration 299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1888394423, now seen corresponding path program 1 times [2022-12-13 01:57:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701094440] [2022-12-13 01:57:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,476 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 01:57:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701094440] [2022-12-13 01:57:49,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701094440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461027394] [2022-12-13 01:57:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:49,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:49,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:49,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:49,528 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:49,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:49,529 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:49,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:49,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:49,530 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:49,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:49,531 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:49,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:49,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,534 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:49,534 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:49,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:49,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:49,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:49,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:49,663 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:49,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable298 [2022-12-13 01:57:49,664 INFO L420 AbstractCegarLoop]: === Iteration 300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1945652725, now seen corresponding path program 1 times [2022-12-13 01:57:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139781967] [2022-12-13 01:57:49,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,717 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 01:57:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139781967] [2022-12-13 01:57:49,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139781967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206667910] [2022-12-13 01:57:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:49,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:49,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:49,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:49,777 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:49,778 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:49,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:49,778 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:49,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:49,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:49,779 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:49,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:49,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:49,780 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,780 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:49,780 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:49,780 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:49,780 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,780 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:49,780 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:49,780 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:49,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,783 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:49,783 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:49,783 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:49,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:49,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:49,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:57:49,915 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:49,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:49,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:49,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable299 [2022-12-13 01:57:49,915 INFO L420 AbstractCegarLoop]: === Iteration 301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2002911027, now seen corresponding path program 1 times [2022-12-13 01:57:49,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627015944] [2022-12-13 01:57:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:49,972 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 01:57:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:49,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627015944] [2022-12-13 01:57:49,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627015944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:49,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:49,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:49,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899458762] [2022-12-13 01:57:49,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:49,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:49,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:49,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:49,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:49,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:49,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:49,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,027 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:50,027 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:50,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:50,027 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:50,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:50,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:50,028 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:50,028 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:50,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,029 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,029 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:50,029 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:50,029 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,029 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,032 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:50,032 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:50,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:50,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:50,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:50,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:50,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:50,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:50,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable300 [2022-12-13 01:57:50,150 INFO L420 AbstractCegarLoop]: === Iteration 302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:50,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2060169329, now seen corresponding path program 1 times [2022-12-13 01:57:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:50,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044556901] [2022-12-13 01:57:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,198 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 01:57:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:50,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044556901] [2022-12-13 01:57:50,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044556901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:50,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:50,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348900543] [2022-12-13 01:57:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:50,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:50,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:50,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:50,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:50,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,249 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:50,250 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:50,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:50,250 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:50,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:50,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:50,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:50,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:50,251 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:50,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,252 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:50,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:50,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,252 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,255 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:50,255 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:50,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:50,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:50,368 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:50,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:50,370 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:50,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,370 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:50,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable301 [2022-12-13 01:57:50,370 INFO L420 AbstractCegarLoop]: === Iteration 303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2117427631, now seen corresponding path program 1 times [2022-12-13 01:57:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:50,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722872512] [2022-12-13 01:57:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,418 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 01:57:50,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:50,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722872512] [2022-12-13 01:57:50,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722872512] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:50,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:50,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:50,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592749599] [2022-12-13 01:57:50,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:50,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:50,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:50,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:50,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:50,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:50,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:50,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:50,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,470 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:50,470 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:50,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:50,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:50,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:50,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:50,471 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:50,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,472 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:50,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:50,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,472 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,475 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:50,475 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:50,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:50,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:50,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:50,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:50,602 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:50,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,602 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,602 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:50,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable302 [2022-12-13 01:57:50,602 INFO L420 AbstractCegarLoop]: === Iteration 304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:50,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2120281363, now seen corresponding path program 1 times [2022-12-13 01:57:50,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:50,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573339505] [2022-12-13 01:57:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,657 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 01:57:50,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:50,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573339505] [2022-12-13 01:57:50,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573339505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:50,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:50,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:50,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757609297] [2022-12-13 01:57:50,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:50,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:50,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:50,658 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:50,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:50,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:50,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,706 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:50,706 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:50,706 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:50,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:50,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:50,707 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:50,707 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:50,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,708 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,708 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:50,708 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:50,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,708 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,711 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:50,711 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:50,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:50,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:50,838 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:50,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:57:50,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:50,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:50,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:50,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable303 [2022-12-13 01:57:50,839 INFO L420 AbstractCegarLoop]: === Iteration 305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2063023061, now seen corresponding path program 1 times [2022-12-13 01:57:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:50,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934453260] [2022-12-13 01:57:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:50,889 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 01:57:50,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:50,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934453260] [2022-12-13 01:57:50,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934453260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:50,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:50,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:50,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396921335] [2022-12-13 01:57:50,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:50,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:50,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:50,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:50,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:50,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:50,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:50,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:50,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:50,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:50,934 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:50,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:50,934 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:50,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:50,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:50,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:50,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:50,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:50,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:50,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:50,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:50,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:50,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:50,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:50,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:50,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:50,939 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:50,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:50,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:50,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:51,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:51,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:57:51,077 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:51,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:51,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable304 [2022-12-13 01:57:51,078 INFO L420 AbstractCegarLoop]: === Iteration 306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2005764759, now seen corresponding path program 1 times [2022-12-13 01:57:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562229418] [2022-12-13 01:57:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,125 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 01:57:51,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562229418] [2022-12-13 01:57:51,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562229418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:51,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:51,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903179767] [2022-12-13 01:57:51,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:51,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:51,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:51,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:51,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:51,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:51,169 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:51,169 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:51,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:51,170 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:51,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:51,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:51,170 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:51,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:51,171 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:51,171 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:51,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:51,172 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,172 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:51,172 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:51,172 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,175 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:51,175 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:51,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:51,175 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,175 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:51,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:51,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:51,293 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:51,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:51,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable305 [2022-12-13 01:57:51,293 INFO L420 AbstractCegarLoop]: === Iteration 307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1948506457, now seen corresponding path program 1 times [2022-12-13 01:57:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143951232] [2022-12-13 01:57:51,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,362 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 01:57:51,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143951232] [2022-12-13 01:57:51,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143951232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:51,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:51,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181880273] [2022-12-13 01:57:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:51,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:51,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:51,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:51,428 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:51,428 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:51,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:51,429 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:51,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:51,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:51,429 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:51,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:51,430 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:51,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:51,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:51,431 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:51,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:51,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,434 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:51,434 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:51,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:51,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:51,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:51,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:51,550 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:51,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:51,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable306 [2022-12-13 01:57:51,550 INFO L420 AbstractCegarLoop]: === Iteration 308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1891248155, now seen corresponding path program 1 times [2022-12-13 01:57:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529577842] [2022-12-13 01:57:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,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 01:57:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529577842] [2022-12-13 01:57:51,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529577842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:51,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:51,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372627978] [2022-12-13 01:57:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:51,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:51,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:51,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:51,652 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:51,652 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:51,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:51,653 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:51,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:51,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:51,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:51,654 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:51,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:51,655 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:51,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:51,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:51,655 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:51,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:51,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,659 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:51,660 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:51,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:51,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,660 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:51,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:51,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:51,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:51,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:51,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable307 [2022-12-13 01:57:51,781 INFO L420 AbstractCegarLoop]: === Iteration 309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:51,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1833989853, now seen corresponding path program 1 times [2022-12-13 01:57:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:51,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340659590] [2022-12-13 01:57:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:51,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:51,830 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 01:57:51,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:51,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340659590] [2022-12-13 01:57:51,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340659590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:51,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:51,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509853428] [2022-12-13 01:57:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:51,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:51,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:51,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:51,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:51,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:51,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:51,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:51,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:51,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:51,875 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:51,875 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:51,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:51,876 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:51,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:51,876 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:51,876 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:51,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:51,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:51,877 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:51,877 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:51,877 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:51,877 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,877 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:51,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:51,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:51,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,880 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:51,880 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:51,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:51,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:51,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:52,008 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:52,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:52,008 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:52,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,009 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable308 [2022-12-13 01:57:52,009 INFO L420 AbstractCegarLoop]: === Iteration 310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1776731551, now seen corresponding path program 1 times [2022-12-13 01:57:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088066987] [2022-12-13 01:57:52,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,068 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 01:57:52,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088066987] [2022-12-13 01:57:52,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088066987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:52,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:52,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:52,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934321458] [2022-12-13 01:57:52,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:52,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:52,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:52,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:52,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:52,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:52,126 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:52,126 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:52,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:52,127 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:52,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:52,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:52,127 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:52,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:52,128 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:52,128 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:52,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,128 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,131 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:52,131 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:52,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:52,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:52,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:52,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:57:52,252 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:52,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2022-12-13 01:57:52,252 INFO L420 AbstractCegarLoop]: === Iteration 311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1719473249, now seen corresponding path program 1 times [2022-12-13 01:57:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20255447] [2022-12-13 01:57:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,301 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 01:57:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20255447] [2022-12-13 01:57:52,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20255447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:52,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:52,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867882485] [2022-12-13 01:57:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:52,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:52,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:52,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:52,344 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:52,344 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:52,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:52,344 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:52,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:52,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:52,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:52,345 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:52,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:52,346 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:52,346 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:52,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,346 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,349 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:52,349 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:52,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:52,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:52,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:52,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:52,466 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:52,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2022-12-13 01:57:52,466 INFO L420 AbstractCegarLoop]: === Iteration 312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1662214947, now seen corresponding path program 1 times [2022-12-13 01:57:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697393001] [2022-12-13 01:57:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,532 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 01:57:52,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697393001] [2022-12-13 01:57:52,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697393001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:52,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:52,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:52,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695025907] [2022-12-13 01:57:52,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:52,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:52,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:52,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:52,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:52,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:52,594 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:52,594 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:52,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:52,595 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:52,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:52,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:52,596 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:52,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:52,597 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:52,597 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:52,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,597 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,600 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:52,600 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:52,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:52,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:52,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:52,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:57:52,719 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:52,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable311 [2022-12-13 01:57:52,719 INFO L420 AbstractCegarLoop]: === Iteration 313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1604956645, now seen corresponding path program 1 times [2022-12-13 01:57:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695362298] [2022-12-13 01:57:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,768 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 01:57:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695362298] [2022-12-13 01:57:52,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695362298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:52,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:52,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159997564] [2022-12-13 01:57:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:52,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:52,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:52,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:52,813 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:52,813 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:52,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:52,814 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:52,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:52,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:52,814 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:52,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:52,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:52,815 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:52,815 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:52,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:52,815 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:52,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:52,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:52,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:52,819 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:52,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:52,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:52,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:52,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:52,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:52,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:52,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:52,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable312 [2022-12-13 01:57:52,942 INFO L420 AbstractCegarLoop]: === Iteration 314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1547698343, now seen corresponding path program 1 times [2022-12-13 01:57:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:52,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29450651] [2022-12-13 01:57:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:52,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:52,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:52,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29450651] [2022-12-13 01:57:52,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29450651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:52,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:52,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561818619] [2022-12-13 01:57:52,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:52,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:52,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:52,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:52,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:52,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:52,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:52,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:52,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,041 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:53,042 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:53,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:53,042 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:53,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:53,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:53,043 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:53,044 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:53,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:53,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:53,044 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:53,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:53,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,047 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:53,047 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:53,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:53,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:53,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:53,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:57:53,166 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:53,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:53,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:53,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable313 [2022-12-13 01:57:53,166 INFO L420 AbstractCegarLoop]: === Iteration 315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1490440041, now seen corresponding path program 1 times [2022-12-13 01:57:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:53,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259451431] [2022-12-13 01:57:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,221 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 01:57:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:53,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259451431] [2022-12-13 01:57:53,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259451431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:53,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:53,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19308571] [2022-12-13 01:57:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:53,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:53,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:53,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:53,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:53,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:53,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,273 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:53,273 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:53,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:53,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:53,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:53,274 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:53,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:53,275 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:53,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:53,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:53,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:53,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:53,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,279 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:53,279 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:53,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:53,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:53,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:53,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:53,396 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:53,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:53,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable314 [2022-12-13 01:57:53,396 INFO L420 AbstractCegarLoop]: === Iteration 316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:53,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1433181739, now seen corresponding path program 1 times [2022-12-13 01:57:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:53,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722496590] [2022-12-13 01:57:53,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:53,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:53,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722496590] [2022-12-13 01:57:53,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722496590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:53,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:53,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074789150] [2022-12-13 01:57:53,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:53,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:53,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:53,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:53,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:53,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:53,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:53,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,500 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:53,500 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:53,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:53,501 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:53,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:53,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:53,501 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:53,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:53,502 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:53,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:53,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:53,503 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,503 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:53,503 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:53,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,505 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:53,506 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:53,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:53,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:53,624 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:53,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:57:53,625 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:53,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:53,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:53,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable315 [2022-12-13 01:57:53,625 INFO L420 AbstractCegarLoop]: === Iteration 317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1375923437, now seen corresponding path program 1 times [2022-12-13 01:57:53,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:53,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302420603] [2022-12-13 01:57:53,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,674 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 01:57:53,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:53,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302420603] [2022-12-13 01:57:53,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302420603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:53,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:53,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:53,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027642490] [2022-12-13 01:57:53,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:53,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:53,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:53,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:53,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:53,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:53,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:53,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,718 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:53,718 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:53,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:53,719 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:53,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:53,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:53,720 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:53,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:53,721 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:53,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:53,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:53,721 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:53,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:53,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,725 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:53,725 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:53,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:53,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:53,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:53,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:57:53,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:53,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:53,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:53,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable316 [2022-12-13 01:57:53,865 INFO L420 AbstractCegarLoop]: === Iteration 318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:53,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1318665135, now seen corresponding path program 1 times [2022-12-13 01:57:53,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:53,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984059011] [2022-12-13 01:57:53,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:53,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:53,930 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 01:57:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984059011] [2022-12-13 01:57:53,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984059011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:53,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:53,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499745565] [2022-12-13 01:57:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:53,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:53,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:53,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:53,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:53,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:53,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:53,983 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:53,983 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:53,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:53,984 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:53,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:53,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:53,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:53,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:53,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:53,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:53,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:53,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:53,986 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:53,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:53,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:53,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,990 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:53,990 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:53,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:53,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:54,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:54,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:54,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:54,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:54,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:54,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable317 [2022-12-13 01:57:54,125 INFO L420 AbstractCegarLoop]: === Iteration 319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:54,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:54,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1261406833, now seen corresponding path program 1 times [2022-12-13 01:57:54,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:54,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872635404] [2022-12-13 01:57:54,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:54,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,187 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 01:57:54,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:54,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872635404] [2022-12-13 01:57:54,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872635404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:54,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:54,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:54,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83521372] [2022-12-13 01:57:54,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:54,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:54,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:54,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:54,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:54,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:54,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:54,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:54,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:54,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:54,237 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:54,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:54,238 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:54,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:54,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:54,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:54,239 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:54,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:54,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:54,240 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,240 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:54,240 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:54,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:54,240 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:54,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:54,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:54,243 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:54,243 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:54,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:54,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:54,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:54,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:54,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:57:54,384 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:54,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:54,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:54,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable318 [2022-12-13 01:57:54,384 INFO L420 AbstractCegarLoop]: === Iteration 320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:54,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1204148531, now seen corresponding path program 1 times [2022-12-13 01:57:54,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:54,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552771943] [2022-12-13 01:57:54,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:54,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,435 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 01:57:54,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:54,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552771943] [2022-12-13 01:57:54,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552771943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:54,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:54,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687392273] [2022-12-13 01:57:54,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:54,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:54,437 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:54,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:54,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:54,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:54,498 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:54,498 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:54,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:54,499 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:54,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:54,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:54,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:54,499 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:54,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:54,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:54,500 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:54,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:54,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:54,500 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:54,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:54,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:54,503 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:54,503 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:54,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:54,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:54,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:54,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:54,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:54,638 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:54,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:54,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:54,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable319 [2022-12-13 01:57:54,638 INFO L420 AbstractCegarLoop]: === Iteration 321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:54,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1146890229, now seen corresponding path program 1 times [2022-12-13 01:57:54,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:54,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90844663] [2022-12-13 01:57:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,707 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 01:57:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:54,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90844663] [2022-12-13 01:57:54,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90844663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:54,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:54,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921337836] [2022-12-13 01:57:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:54,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:54,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:54,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:54,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:54,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:54,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:54,774 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:54,775 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:54,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:54,775 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:54,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:54,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:54,776 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:54,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:54,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:54,777 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:54,777 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:54,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:54,777 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:54,778 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:54,778 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:54,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:54,780 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:54,780 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:54,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:54,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:54,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:54,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:54,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:57:54,914 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:54,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:54,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:54,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable320 [2022-12-13 01:57:54,915 INFO L420 AbstractCegarLoop]: === Iteration 322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1089631927, now seen corresponding path program 1 times [2022-12-13 01:57:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:54,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213682487] [2022-12-13 01:57:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:54,971 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 01:57:54,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:54,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213682487] [2022-12-13 01:57:54,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213682487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:54,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:54,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:54,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221721074] [2022-12-13 01:57:54,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:54,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:54,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:54,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:54,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:55,025 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:55,026 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:55,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:55,026 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:55,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:55,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:55,027 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:55,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:55,028 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:55,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:55,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:55,028 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:55,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:55,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,031 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:55,031 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:55,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:55,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:55,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:55,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:57:55,163 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:55,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:55,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable321 [2022-12-13 01:57:55,163 INFO L420 AbstractCegarLoop]: === Iteration 323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1032373625, now seen corresponding path program 1 times [2022-12-13 01:57:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:55,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495863299] [2022-12-13 01:57:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:55,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:55,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495863299] [2022-12-13 01:57:55,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495863299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:55,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:55,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:55,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131137587] [2022-12-13 01:57:55,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:55,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:55,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:55,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:55,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:55,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:55,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:55,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:55,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:55,269 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:55,269 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:55,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:55,270 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:55,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:55,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:55,271 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:55,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:55,273 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:55,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:55,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:55,273 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:55,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:55,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,277 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:55,277 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:55,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:55,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:55,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:55,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:55,411 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:55,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:55,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:55,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable322 [2022-12-13 01:57:55,411 INFO L420 AbstractCegarLoop]: === Iteration 324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -975115323, now seen corresponding path program 1 times [2022-12-13 01:57:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794274450] [2022-12-13 01:57:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:55,463 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 01:57:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:55,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794274450] [2022-12-13 01:57:55,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794274450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:55,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:55,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784961445] [2022-12-13 01:57:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:55,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:55,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:55,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:55,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:55,517 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:55,518 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:55,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:55,518 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:55,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:55,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:55,519 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:55,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:55,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:55,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:55,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:55,520 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:55,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:55,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,523 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:55,523 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:55,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:55,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:55,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:55,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:57:55,656 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:55,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:55,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:55,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable323 [2022-12-13 01:57:55,657 INFO L420 AbstractCegarLoop]: === Iteration 325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:55,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash -917857021, now seen corresponding path program 1 times [2022-12-13 01:57:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:55,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210598991] [2022-12-13 01:57:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:55,710 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 01:57:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:55,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210598991] [2022-12-13 01:57:55,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210598991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:55,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:55,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:55,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100392304] [2022-12-13 01:57:55,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:55,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:55,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:55,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:55,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:55,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:55,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:55,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:55,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:55,764 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:55,764 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:55,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:55,765 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:55,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:55,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:55,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:55,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:55,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:55,766 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:55,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:55,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:55,767 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:55,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:55,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:55,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,770 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:55,770 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:55,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:55,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:55,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:55,924 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:55,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 01:57:55,925 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:55,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:55,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:55,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable324 [2022-12-13 01:57:55,925 INFO L420 AbstractCegarLoop]: === Iteration 326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash -860598719, now seen corresponding path program 1 times [2022-12-13 01:57:55,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:55,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703329848] [2022-12-13 01:57:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:55,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:55,989 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 01:57:55,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703329848] [2022-12-13 01:57:55,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703329848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:55,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:55,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:55,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956120675] [2022-12-13 01:57:55,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:55,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:55,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:55,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:55,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:55,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:55,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:55,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:55,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:56,043 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:56,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:56,044 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:56,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:56,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:56,045 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:56,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:56,046 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:56,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:56,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:56,046 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:56,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:56,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,049 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:56,049 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:56,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:56,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:56,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:56,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:57:56,177 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:56,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:56,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:56,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable325 [2022-12-13 01:57:56,178 INFO L420 AbstractCegarLoop]: === Iteration 327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -803340417, now seen corresponding path program 1 times [2022-12-13 01:57:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822133922] [2022-12-13 01:57:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,249 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 01:57:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:56,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822133922] [2022-12-13 01:57:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822133922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:56,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:56,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469584108] [2022-12-13 01:57:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:56,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:56,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:56,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:56,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:56,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,304 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:56,304 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:56,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:56,304 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:56,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:56,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:56,305 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:56,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:56,306 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:56,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:56,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:56,306 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:56,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:56,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,309 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:56,309 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:56,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:56,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:56,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:56,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:57:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:56,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:56,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable326 [2022-12-13 01:57:56,427 INFO L420 AbstractCegarLoop]: === Iteration 328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash -746082115, now seen corresponding path program 1 times [2022-12-13 01:57:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203512893] [2022-12-13 01:57:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,476 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 01:57:56,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:56,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203512893] [2022-12-13 01:57:56,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203512893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:56,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:56,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624501200] [2022-12-13 01:57:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:56,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:56,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:56,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:56,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:56,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,529 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:56,529 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:56,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:56,530 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:56,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:56,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:56,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:56,530 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:56,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:56,531 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:56,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:56,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:56,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,532 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:56,532 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:56,532 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,534 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:56,534 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:56,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:56,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:56,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:56,649 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:56,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:56,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:56,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable327 [2022-12-13 01:57:56,650 INFO L420 AbstractCegarLoop]: === Iteration 329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:56,650 INFO L85 PathProgramCache]: Analyzing trace with hash -688823813, now seen corresponding path program 1 times [2022-12-13 01:57:56,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:56,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128755147] [2022-12-13 01:57:56,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,699 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 01:57:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:56,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128755147] [2022-12-13 01:57:56,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128755147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:56,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:56,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429141278] [2022-12-13 01:57:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:56,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:56,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:56,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:56,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:56,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:56,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:56,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,745 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:56,745 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:56,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:56,746 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:56,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:56,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:56,746 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:56,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:56,747 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:56,747 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:56,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:56,747 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:56,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:56,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,750 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:56,750 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:56,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:56,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:56,871 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:56,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:57:56,872 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:56,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:56,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:56,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable328 [2022-12-13 01:57:56,872 INFO L420 AbstractCegarLoop]: === Iteration 330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:56,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:56,873 INFO L85 PathProgramCache]: Analyzing trace with hash -631565511, now seen corresponding path program 1 times [2022-12-13 01:57:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:56,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438342017] [2022-12-13 01:57:56,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:56,922 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 01:57:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:56,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438342017] [2022-12-13 01:57:56,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438342017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:56,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:56,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407483109] [2022-12-13 01:57:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:56,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:56,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:56,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:56,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:56,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:56,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:56,967 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:56,967 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:56,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:56,968 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:56,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:56,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:56,969 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:56,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:56,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:56,969 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:56,970 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:56,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:56,970 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:56,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:56,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:56,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,973 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:56,973 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:56,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:56,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:56,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:57,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:57,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:57:57,090 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:57,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:57,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:57,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable329 [2022-12-13 01:57:57,090 INFO L420 AbstractCegarLoop]: === Iteration 331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:57,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:57,090 INFO L85 PathProgramCache]: Analyzing trace with hash -574307209, now seen corresponding path program 1 times [2022-12-13 01:57:57,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:57,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966685525] [2022-12-13 01:57:57,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:57:57,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:57,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966685525] [2022-12-13 01:57:57,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966685525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:57,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:57,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:57,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595767610] [2022-12-13 01:57:57,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:57,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:57,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:57,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:57,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:57,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:57,209 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:57,209 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:57,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:57,209 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:57,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:57,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:57,210 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:57,211 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:57,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:57,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:57,211 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:57,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:57,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,214 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:57,214 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:57,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:57,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:57,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:57,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:57:57,331 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:57,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:57,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:57,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable330 [2022-12-13 01:57:57,331 INFO L420 AbstractCegarLoop]: === Iteration 332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash -517048907, now seen corresponding path program 1 times [2022-12-13 01:57:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:57,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190974533] [2022-12-13 01:57:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,392 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 01:57:57,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:57,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190974533] [2022-12-13 01:57:57,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190974533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:57,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:57,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:57,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374216406] [2022-12-13 01:57:57,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:57,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:57,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:57,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:57,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:57,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:57,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:57,441 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:57,442 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:57,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:57,442 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:57,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:57,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:57,443 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:57,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:57,444 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:57,444 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:57,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:57,444 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:57,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:57,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,447 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:57,447 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:57,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:57,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:57,571 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:57,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:57:57,571 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:57,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:57,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:57,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable331 [2022-12-13 01:57:57,571 INFO L420 AbstractCegarLoop]: === Iteration 333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:57,572 INFO L85 PathProgramCache]: Analyzing trace with hash -459790605, now seen corresponding path program 1 times [2022-12-13 01:57:57,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:57,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578028697] [2022-12-13 01:57:57,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,623 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 01:57:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:57,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578028697] [2022-12-13 01:57:57,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578028697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:57,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:57,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791385098] [2022-12-13 01:57:57,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:57,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:57,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:57,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:57,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:57,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:57,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:57,669 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:57,669 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:57,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:57,670 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:57,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:57,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:57,671 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:57,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:57,672 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:57,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:57,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:57,672 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:57,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:57,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,675 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:57,675 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:57,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:57,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:57,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:57,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:57:57,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:57,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:57,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:57,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable332 [2022-12-13 01:57:57,795 INFO L420 AbstractCegarLoop]: === Iteration 334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash -402532303, now seen corresponding path program 1 times [2022-12-13 01:57:57,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:57,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728791938] [2022-12-13 01:57:57,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:57,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:57,860 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 01:57:57,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:57,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728791938] [2022-12-13 01:57:57,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728791938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:57,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:57,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035961727] [2022-12-13 01:57:57,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:57,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:57,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:57,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:57,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:57,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:57,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:57,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:57,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:57,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:57,907 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:57,907 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:57,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:57,907 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:57,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:57,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:57,908 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:57,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:57,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:57,909 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:57,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:57,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:57,909 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:57,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:57,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:57,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,912 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:57,912 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:57,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:57,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:57,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:58,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:58,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:58,035 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:58,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:58,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:58,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable333 [2022-12-13 01:57:58,035 INFO L420 AbstractCegarLoop]: === Iteration 335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:58,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash -345274001, now seen corresponding path program 1 times [2022-12-13 01:57:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:58,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568696342] [2022-12-13 01:57:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:58,085 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 01:57:58,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:58,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568696342] [2022-12-13 01:57:58,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568696342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:58,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:58,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:58,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067144590] [2022-12-13 01:57:58,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:58,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:58,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:58,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:58,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:58,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:58,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:58,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:58,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:58,130 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:58,130 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:58,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:58,131 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:58,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:58,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:58,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:58,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:58,131 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:58,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:58,132 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:58,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:58,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:58,133 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:58,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:58,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,135 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:58,136 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:58,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:58,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:58,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:57:58,270 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:58,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:58,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:58,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable334 [2022-12-13 01:57:58,270 INFO L420 AbstractCegarLoop]: === Iteration 336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:58,271 INFO L85 PathProgramCache]: Analyzing trace with hash -288015699, now seen corresponding path program 1 times [2022-12-13 01:57:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:58,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627753431] [2022-12-13 01:57:58,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:58,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:58,333 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 01:57:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:58,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627753431] [2022-12-13 01:57:58,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627753431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:58,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:58,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643702312] [2022-12-13 01:57:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:58,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:58,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:58,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:58,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:58,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:58,393 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:58,393 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:58,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:58,394 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:58,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:58,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:58,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:58,395 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:58,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:58,396 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:58,396 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:58,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:58,396 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:58,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:58,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,399 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:58,399 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:58,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:58,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:58,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:58,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:58,528 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:58,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:58,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:58,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable335 [2022-12-13 01:57:58,529 INFO L420 AbstractCegarLoop]: === Iteration 337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:58,529 INFO L85 PathProgramCache]: Analyzing trace with hash -230757397, now seen corresponding path program 1 times [2022-12-13 01:57:58,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:58,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005144880] [2022-12-13 01:57:58,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:58,592 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 01:57:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:58,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005144880] [2022-12-13 01:57:58,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005144880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:58,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774309660] [2022-12-13 01:57:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:58,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:58,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:58,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:58,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:58,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:58,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:58,643 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:58,643 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:58,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:58,644 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:58,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:58,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:58,644 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:58,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:58,645 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:58,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:58,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:58,645 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:58,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:58,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,663 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:58,664 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:58,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:58,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:58,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:58,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 195 [2022-12-13 01:57:58,841 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:58,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:58,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable336 [2022-12-13 01:57:58,841 INFO L420 AbstractCegarLoop]: === Iteration 338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash -173499095, now seen corresponding path program 1 times [2022-12-13 01:57:58,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:58,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840038906] [2022-12-13 01:57:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:58,912 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 01:57:58,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:58,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840038906] [2022-12-13 01:57:58,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840038906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:58,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:58,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103464774] [2022-12-13 01:57:58,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:58,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:58,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:58,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:58,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:58,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:58,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:58,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:58,975 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:58,975 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:58,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:58,976 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:58,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:58,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:58,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:58,977 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:58,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:58,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:58,978 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:58,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:58,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:58,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:58,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:58,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:58,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,982 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:58,982 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:58,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:58,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:58,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:59,103 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:59,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:57:59,104 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:59,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:59,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:59,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable337 [2022-12-13 01:57:59,104 INFO L420 AbstractCegarLoop]: === Iteration 339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash -116240793, now seen corresponding path program 1 times [2022-12-13 01:57:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:59,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469363980] [2022-12-13 01:57:59,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:59,154 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 01:57:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:59,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469363980] [2022-12-13 01:57:59,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469363980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:59,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:59,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180031790] [2022-12-13 01:57:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:59,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:59,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:59,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:59,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:59,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:59,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:59,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:59,205 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:59,205 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:59,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:59,206 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:59,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:59,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:59,206 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:59,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:59,207 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:59,207 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:59,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:59,207 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:59,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:59,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,210 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:59,210 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:59,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:59,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:59,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:59,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:57:59,325 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:59,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:59,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:59,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable338 [2022-12-13 01:57:59,325 INFO L420 AbstractCegarLoop]: === Iteration 340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -58982491, now seen corresponding path program 1 times [2022-12-13 01:57:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:59,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455018309] [2022-12-13 01:57:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:59,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:59,375 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 01:57:59,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:59,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455018309] [2022-12-13 01:57:59,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455018309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:59,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:59,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:59,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487972055] [2022-12-13 01:57:59,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:59,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:59,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:59,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:59,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:59,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:59,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:59,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:59,418 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:59,419 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:57:59,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:59,419 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:59,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:59,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:59,420 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:59,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:59,420 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:59,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:59,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:59,421 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:59,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:59,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,424 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:59,424 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:59,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:59,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:59,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:59,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:57:59,538 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:59,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:59,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:59,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable339 [2022-12-13 01:57:59,538 INFO L420 AbstractCegarLoop]: === Iteration 341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1724189, now seen corresponding path program 1 times [2022-12-13 01:57:59,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:59,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302407617] [2022-12-13 01:57:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:59,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:59,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 01:57:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302407617] [2022-12-13 01:57:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302407617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:59,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:59,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58781909] [2022-12-13 01:57:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:59,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:59,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:59,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:59,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:59,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:59,649 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:59,649 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:59,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:59,649 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:59,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:59,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:59,650 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:59,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:59,651 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:59,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:59,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:59,651 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:59,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:59,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,654 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:59,654 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:57:59,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:59,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:57:59,782 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:57:59,783 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:57:59,783 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:57:59,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,783 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:57:59,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:57:59,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable340 [2022-12-13 01:57:59,783 INFO L420 AbstractCegarLoop]: === Iteration 342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:57:59,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:57:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 55534113, now seen corresponding path program 1 times [2022-12-13 01:57:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:57:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66200623] [2022-12-13 01:57:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:57:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:57:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:57:59,831 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 01:57:59,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:57:59,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66200623] [2022-12-13 01:57:59,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66200623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:57:59,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:57:59,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:57:59,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195538430] [2022-12-13 01:57:59,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:57:59,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:57:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:57:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:57:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:57:59,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:57:59,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:57:59,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:57:59,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:57:59,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:57:59,884 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:57:59,884 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:57:59,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:57:59,885 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:57:59,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:57:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:57:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:57:59,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:57:59,886 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:57:59,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:57:59,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:57:59,886 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:57:59,887 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:57:59,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:57:59,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:57:59,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:57:59,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:57:59,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,890 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:57:59,890 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:57:59,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 201 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:57:59,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:57:59,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:00,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:00,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:00,017 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:00,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:00,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:00,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable341 [2022-12-13 01:58:00,017 INFO L420 AbstractCegarLoop]: === Iteration 343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 112792415, now seen corresponding path program 1 times [2022-12-13 01:58:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:00,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619919935] [2022-12-13 01:58:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:00,064 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 01:58:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:00,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619919935] [2022-12-13 01:58:00,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619919935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:00,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:00,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389469865] [2022-12-13 01:58:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:00,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:00,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:00,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:00,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:00,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:00,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:00,115 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:00,115 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:00,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:00,115 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:00,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:00,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:00,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:00,116 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:00,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:00,117 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:00,117 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:00,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:00,117 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:00,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:00,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,120 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:00,120 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:00,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:00,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:00,247 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:00,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:58:00,247 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:00,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:00,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:00,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable342 [2022-12-13 01:58:00,247 INFO L420 AbstractCegarLoop]: === Iteration 344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:00,248 INFO L85 PathProgramCache]: Analyzing trace with hash 170050717, now seen corresponding path program 1 times [2022-12-13 01:58:00,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:00,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346211091] [2022-12-13 01:58:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:00,297 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 01:58:00,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:00,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346211091] [2022-12-13 01:58:00,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346211091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:00,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:00,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:00,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738984426] [2022-12-13 01:58:00,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:00,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:00,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:00,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:00,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:00,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:00,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:00,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:00,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:00,341 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:00,341 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:00,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:00,341 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:00,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:00,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:00,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:00,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:00,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:00,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:00,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:00,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:00,343 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:00,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:00,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:00,346 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:00,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:00,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:00,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:00,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:00,465 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:00,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:00,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable343 [2022-12-13 01:58:00,465 INFO L420 AbstractCegarLoop]: === Iteration 345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 227309019, now seen corresponding path program 1 times [2022-12-13 01:58:00,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:00,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647259255] [2022-12-13 01:58:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:00,524 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 01:58:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:00,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647259255] [2022-12-13 01:58:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647259255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:00,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:00,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:00,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207186156] [2022-12-13 01:58:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:00,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:00,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:00,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:00,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:00,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:00,568 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:00,568 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:00,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:00,569 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:00,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:00,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:00,569 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:00,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:00,570 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:00,570 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:00,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:00,571 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:00,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:00,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,573 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:00,573 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:00,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:00,574 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,574 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:00,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:00,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:00,688 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:00,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:00,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:00,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable344 [2022-12-13 01:58:00,688 INFO L420 AbstractCegarLoop]: === Iteration 346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 284567321, now seen corresponding path program 1 times [2022-12-13 01:58:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:00,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490206622] [2022-12-13 01:58:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:00,735 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 01:58:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:00,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490206622] [2022-12-13 01:58:00,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490206622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:00,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:00,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347235989] [2022-12-13 01:58:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:00,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:00,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:00,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:00,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:00,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:00,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:00,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:00,786 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:00,786 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:00,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:00,787 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:00,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:00,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:00,787 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:00,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:00,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:00,788 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:00,789 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:00,789 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:00,789 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,789 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:00,789 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:00,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:00,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,792 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:00,792 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:00,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:00,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:00,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:00,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:58:00,934 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:00,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:00,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:00,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable345 [2022-12-13 01:58:00,935 INFO L420 AbstractCegarLoop]: === Iteration 347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash 341825623, now seen corresponding path program 1 times [2022-12-13 01:58:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:00,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577959849] [2022-12-13 01:58:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:00,984 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 01:58:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:00,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577959849] [2022-12-13 01:58:00,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577959849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:00,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:00,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301066244] [2022-12-13 01:58:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:00,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:00,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:00,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:00,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:00,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:00,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:00,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:01,045 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:01,045 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:01,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:01,046 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:01,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:01,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:01,047 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:01,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:01,047 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:01,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:01,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:01,048 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:01,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:01,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,051 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:01,051 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:01,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:01,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:01,174 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:01,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:58:01,175 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:01,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:01,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:01,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable346 [2022-12-13 01:58:01,175 INFO L420 AbstractCegarLoop]: === Iteration 348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash 399083925, now seen corresponding path program 1 times [2022-12-13 01:58:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:01,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546956816] [2022-12-13 01:58:01,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:01,232 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 01:58:01,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:01,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546956816] [2022-12-13 01:58:01,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546956816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:01,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:01,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898818625] [2022-12-13 01:58:01,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:01,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:01,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:01,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:01,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:01,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:01,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:01,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:01,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:01,283 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:01,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:01,283 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:01,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:01,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:01,284 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:01,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:01,285 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:01,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:01,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:01,285 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:01,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:01,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,288 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:01,288 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:01,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:01,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:01,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:01,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:01,405 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:01,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:01,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:01,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable347 [2022-12-13 01:58:01,405 INFO L420 AbstractCegarLoop]: === Iteration 349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:01,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:01,405 INFO L85 PathProgramCache]: Analyzing trace with hash 456342227, now seen corresponding path program 1 times [2022-12-13 01:58:01,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:01,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154314367] [2022-12-13 01:58:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:01,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:01,470 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 01:58:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:01,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154314367] [2022-12-13 01:58:01,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154314367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:01,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:01,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:01,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650832436] [2022-12-13 01:58:01,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:01,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:01,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:01,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:01,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:01,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:01,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:01,527 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:01,527 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:01,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:01,528 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:01,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:01,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:01,529 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:01,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:01,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:01,530 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:01,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:01,530 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:01,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:01,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,534 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:01,535 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:01,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:01,535 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,535 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:01,670 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:01,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:58:01,671 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:01,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:01,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:01,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348 [2022-12-13 01:58:01,671 INFO L420 AbstractCegarLoop]: === Iteration 350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash 513600529, now seen corresponding path program 1 times [2022-12-13 01:58:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:01,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567831848] [2022-12-13 01:58:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:01,732 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 01:58:01,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:01,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567831848] [2022-12-13 01:58:01,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567831848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:01,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:01,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:01,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100169858] [2022-12-13 01:58:01,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:01,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:01,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:01,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:01,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:01,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:01,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:01,792 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:01,792 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:01,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:01,793 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:01,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:01,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:01,794 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:01,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:01,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:01,794 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:01,795 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:01,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:01,795 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:01,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:01,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:01,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,798 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:01,798 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:01,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:01,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:01,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:01,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:01,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:58:01,928 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:01,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:01,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:01,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable349 [2022-12-13 01:58:01,928 INFO L420 AbstractCegarLoop]: === Iteration 351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:01,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:01,928 INFO L85 PathProgramCache]: Analyzing trace with hash 570858831, now seen corresponding path program 1 times [2022-12-13 01:58:01,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:01,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289928351] [2022-12-13 01:58:01,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:01,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:01,978 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 01:58:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:01,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289928351] [2022-12-13 01:58:01,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289928351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:01,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:01,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:01,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786096176] [2022-12-13 01:58:01,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:01,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:01,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:01,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:01,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:01,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:01,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:01,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:01,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:02,028 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:02,029 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:02,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:02,029 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:02,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:02,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:02,030 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:02,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:02,031 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:02,031 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:02,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:02,031 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:02,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:02,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,034 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:02,034 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:02,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:02,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:02,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:02,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:02,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:02,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:02,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable350 [2022-12-13 01:58:02,150 INFO L420 AbstractCegarLoop]: === Iteration 352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash 628117133, now seen corresponding path program 1 times [2022-12-13 01:58:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897070278] [2022-12-13 01:58:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:02,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897070278] [2022-12-13 01:58:02,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897070278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:02,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:02,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051080934] [2022-12-13 01:58:02,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:02,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:02,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:02,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:02,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:02,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:02,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:02,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:02,268 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:02,269 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:02,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:02,269 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:02,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:02,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:02,270 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:02,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:02,271 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:02,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:02,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:02,271 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:02,271 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:02,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,274 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:02,274 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:02,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:02,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:02,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:02,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:02,390 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:02,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:02,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:02,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable351 [2022-12-13 01:58:02,390 INFO L420 AbstractCegarLoop]: === Iteration 353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 685375435, now seen corresponding path program 1 times [2022-12-13 01:58:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:02,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370225370] [2022-12-13 01:58:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,438 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 01:58:02,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:02,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370225370] [2022-12-13 01:58:02,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370225370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:02,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:02,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317692326] [2022-12-13 01:58:02,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:02,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:02,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:02,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:02,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:02,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:02,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:02,482 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:02,482 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:02,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:02,482 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:02,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:02,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:02,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:02,483 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:02,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:02,484 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,484 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:02,484 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:02,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:02,484 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:02,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:02,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,487 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:02,487 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:02,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:02,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:02,607 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:02,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:58:02,608 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:02,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,608 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:02,608 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:02,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable352 [2022-12-13 01:58:02,608 INFO L420 AbstractCegarLoop]: === Iteration 354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:02,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash 742633737, now seen corresponding path program 1 times [2022-12-13 01:58:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:02,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384827989] [2022-12-13 01:58:02,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,670 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 01:58:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:02,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384827989] [2022-12-13 01:58:02,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384827989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:02,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:02,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410332473] [2022-12-13 01:58:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:02,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:02,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:02,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:02,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:02,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:02,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:02,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:02,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:02,715 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:02,716 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:02,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:02,716 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:02,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:02,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:02,717 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:02,717 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:02,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:02,718 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:02,718 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:02,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:02,718 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:02,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:02,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,721 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:02,721 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:02,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:02,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:02,834 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:02,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:02,835 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:02,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:02,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:02,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable353 [2022-12-13 01:58:02,835 INFO L420 AbstractCegarLoop]: === Iteration 355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash 799892039, now seen corresponding path program 1 times [2022-12-13 01:58:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335310164] [2022-12-13 01:58:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:02,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:02,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335310164] [2022-12-13 01:58:02,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335310164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:02,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:02,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829636356] [2022-12-13 01:58:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:02,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:02,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:02,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:02,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:02,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:02,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:02,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:02,936 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:02,936 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:02,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:02,937 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:02,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:02,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:02,938 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:02,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:02,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:02,938 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:02,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:02,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:02,939 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:02,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:02,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:02,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,942 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:02,942 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:02,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:02,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:02,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:03,058 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:03,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:03,059 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:03,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable354 [2022-12-13 01:58:03,059 INFO L420 AbstractCegarLoop]: === Iteration 356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 857150341, now seen corresponding path program 1 times [2022-12-13 01:58:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060897607] [2022-12-13 01:58:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:03,110 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 01:58:03,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:03,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060897607] [2022-12-13 01:58:03,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060897607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:03,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:03,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419217505] [2022-12-13 01:58:03,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:03,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:03,111 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:03,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:03,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:03,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:03,161 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:03,161 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:03,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:03,162 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:03,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:03,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:03,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:03,162 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:03,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:03,163 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:03,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:03,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:03,163 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:03,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:03,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,166 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:03,166 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:03,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:03,167 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,167 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:03,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:03,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:03,288 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:03,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355 [2022-12-13 01:58:03,288 INFO L420 AbstractCegarLoop]: === Iteration 357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:03,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 914408643, now seen corresponding path program 1 times [2022-12-13 01:58:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:03,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982473903] [2022-12-13 01:58:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:03,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:03,358 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 01:58:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982473903] [2022-12-13 01:58:03,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982473903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:03,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:03,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691490308] [2022-12-13 01:58:03,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:03,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:03,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:03,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:03,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:03,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:03,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:03,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:03,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:03,410 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:03,411 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:03,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:03,411 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:03,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:03,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:03,412 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:03,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:03,413 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:03,413 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:03,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:03,413 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:03,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:03,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,416 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:03,416 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:03,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:03,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:03,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:03,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:03,533 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:03,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable356 [2022-12-13 01:58:03,533 INFO L420 AbstractCegarLoop]: === Iteration 358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:03,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash 971666945, now seen corresponding path program 1 times [2022-12-13 01:58:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:03,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95827867] [2022-12-13 01:58:03,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:03,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:03,581 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 01:58:03,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:03,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95827867] [2022-12-13 01:58:03,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95827867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:03,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:03,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:03,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422921582] [2022-12-13 01:58:03,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:03,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:03,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:03,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:03,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:03,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:03,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:03,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:03,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:03,625 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:03,625 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:03,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:03,626 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:03,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:03,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:03,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:03,626 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:03,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:03,627 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:03,627 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:03,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:03,628 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,628 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:03,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:03,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,630 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:03,631 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:03,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:03,631 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,631 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:03,749 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:03,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:03,749 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:03,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable357 [2022-12-13 01:58:03,750 INFO L420 AbstractCegarLoop]: === Iteration 359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:03,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1028925247, now seen corresponding path program 1 times [2022-12-13 01:58:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512971363] [2022-12-13 01:58:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:03,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:03,799 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 01:58:03,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:03,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512971363] [2022-12-13 01:58:03,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512971363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:03,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:03,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:03,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792581913] [2022-12-13 01:58:03,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:03,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:03,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:03,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:03,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:03,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:03,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:03,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:03,863 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:03,863 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:03,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:03,864 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:03,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:03,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:03,864 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:03,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:03,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:03,865 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:03,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:03,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:03,866 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:03,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:03,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:03,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,868 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:03,869 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:03,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:03,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:03,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:03,991 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:03,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:03,992 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:03,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:03,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:03,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:03,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable358 [2022-12-13 01:58:03,992 INFO L420 AbstractCegarLoop]: === Iteration 360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:03,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1086183549, now seen corresponding path program 1 times [2022-12-13 01:58:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:03,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793460211] [2022-12-13 01:58:03,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:03,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:04,041 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 01:58:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793460211] [2022-12-13 01:58:04,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793460211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:04,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:04,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:04,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015891458] [2022-12-13 01:58:04,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:04,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:04,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:04,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:04,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:04,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:04,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:04,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:04,086 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:04,086 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:04,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:04,087 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:04,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:04,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:04,087 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:04,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:04,088 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:04,088 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:04,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:04,089 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:04,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:04,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,092 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:04,092 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:04,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:04,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:04,207 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:04,208 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:04,208 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:04,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,208 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:04,208 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:04,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable359 [2022-12-13 01:58:04,208 INFO L420 AbstractCegarLoop]: === Iteration 361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:04,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:04,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1143441851, now seen corresponding path program 1 times [2022-12-13 01:58:04,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:04,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493452199] [2022-12-13 01:58:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:04,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:04,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 01:58:04,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:04,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493452199] [2022-12-13 01:58:04,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493452199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:04,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:04,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:04,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377235719] [2022-12-13 01:58:04,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:04,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:04,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:04,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:04,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:04,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:04,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:04,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:04,311 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:04,312 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:04,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:04,312 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:04,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:04,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:04,313 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:04,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:04,314 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:04,314 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:04,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:04,314 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:04,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:04,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,317 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:04,317 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:04,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:04,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:04,457 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:04,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:58:04,458 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:04,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:04,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:04,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable360 [2022-12-13 01:58:04,458 INFO L420 AbstractCegarLoop]: === Iteration 362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:04,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1200700153, now seen corresponding path program 1 times [2022-12-13 01:58:04,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:04,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716854841] [2022-12-13 01:58:04,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:04,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:04,527 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 01:58:04,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:04,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716854841] [2022-12-13 01:58:04,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716854841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:04,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:04,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:04,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094827695] [2022-12-13 01:58:04,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:04,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:04,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:04,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:04,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:04,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:04,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:04,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:04,596 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:04,597 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:04,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:04,597 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:04,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:04,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:04,598 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:04,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:04,599 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:04,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:04,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:04,599 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:04,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:04,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:04,603 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:04,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:04,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:04,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:04,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:04,733 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:04,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:04,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:04,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable361 [2022-12-13 01:58:04,734 INFO L420 AbstractCegarLoop]: === Iteration 363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:04,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1257958455, now seen corresponding path program 1 times [2022-12-13 01:58:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:04,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980258634] [2022-12-13 01:58:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:04,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:04,786 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 01:58:04,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:04,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980258634] [2022-12-13 01:58:04,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980258634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:04,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:04,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:04,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999695157] [2022-12-13 01:58:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:04,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:04,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:04,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:04,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:04,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:04,847 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:04,847 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:04,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:04,848 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:04,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:04,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:04,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:04,848 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:04,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:04,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:04,849 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:04,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:04,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:04,850 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:04,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:04,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:04,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,852 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:04,853 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:04,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:04,853 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:04,853 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:04,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:04,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:04,983 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:04,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:04,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:04,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:04,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable362 [2022-12-13 01:58:04,983 INFO L420 AbstractCegarLoop]: === Iteration 364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1315216757, now seen corresponding path program 1 times [2022-12-13 01:58:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:04,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060688596] [2022-12-13 01:58:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:04,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:05,038 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 01:58:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:05,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060688596] [2022-12-13 01:58:05,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060688596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:05,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:05,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801143381] [2022-12-13 01:58:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:05,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:05,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:05,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:05,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:05,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:05,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:05,090 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:05,090 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:05,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:05,091 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:05,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:05,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:05,092 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:05,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:05,093 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:05,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:05,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:05,093 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:05,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:05,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:05,097 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:05,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:05,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:05,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:05,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:05,228 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:05,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:05,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:05,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable363 [2022-12-13 01:58:05,228 INFO L420 AbstractCegarLoop]: === Iteration 365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:05,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1372475059, now seen corresponding path program 1 times [2022-12-13 01:58:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:05,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573794877] [2022-12-13 01:58:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:05,275 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 01:58:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:05,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573794877] [2022-12-13 01:58:05,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573794877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:05,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:05,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298849893] [2022-12-13 01:58:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:05,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:05,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:05,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:05,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:05,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:05,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:05,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:05,329 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:05,329 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:05,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:05,330 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:05,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:05,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:05,330 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:05,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:05,331 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:05,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:05,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:05,332 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:05,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:05,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,335 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:05,335 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:05,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:05,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:05,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:05,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:05,464 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:05,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:05,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:05,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable364 [2022-12-13 01:58:05,464 INFO L420 AbstractCegarLoop]: === Iteration 366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:05,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1429733361, now seen corresponding path program 1 times [2022-12-13 01:58:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:05,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130117999] [2022-12-13 01:58:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:05,517 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 01:58:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:05,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130117999] [2022-12-13 01:58:05,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130117999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:05,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:05,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396560075] [2022-12-13 01:58:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:05,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:05,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:05,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:05,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:05,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:05,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:05,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:05,577 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:05,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:05,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:05,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:05,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:05,579 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:05,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:05,580 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:05,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:05,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:05,580 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:05,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:05,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,583 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:05,583 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:05,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:05,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:05,713 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:05,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:05,714 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:05,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:05,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:05,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable365 [2022-12-13 01:58:05,715 INFO L420 AbstractCegarLoop]: === Iteration 367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:05,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1486991663, now seen corresponding path program 1 times [2022-12-13 01:58:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:05,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011012757] [2022-12-13 01:58:05,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:05,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:05,776 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 01:58:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:05,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011012757] [2022-12-13 01:58:05,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011012757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:05,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:05,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:05,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204213342] [2022-12-13 01:58:05,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:05,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:05,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:05,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:05,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:05,777 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:05,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:05,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:05,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:05,828 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:05,828 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:05,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:05,829 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:05,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:05,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:05,829 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:05,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:05,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:05,830 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:05,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:05,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:05,831 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:05,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:05,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:05,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,834 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:05,834 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:05,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:05,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:05,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:05,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:05,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:58:05,975 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:05,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:05,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:05,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable366 [2022-12-13 01:58:05,976 INFO L420 AbstractCegarLoop]: === Iteration 368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:05,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1544249965, now seen corresponding path program 1 times [2022-12-13 01:58:05,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:05,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617849466] [2022-12-13 01:58:05,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:05,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:06,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:06,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617849466] [2022-12-13 01:58:06,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617849466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:06,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:06,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134703731] [2022-12-13 01:58:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:06,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:06,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:06,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:06,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:06,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:06,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:06,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:06,103 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:06,103 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:06,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:06,104 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:06,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:06,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:06,105 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:06,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:06,106 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:06,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:06,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:06,107 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:06,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:06,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,111 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:06,111 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:06,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:06,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:06,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:06,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:06,245 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:06,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:06,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:06,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable367 [2022-12-13 01:58:06,245 INFO L420 AbstractCegarLoop]: === Iteration 369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1601508267, now seen corresponding path program 1 times [2022-12-13 01:58:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:06,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252052640] [2022-12-13 01:58:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,300 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 01:58:06,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:06,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252052640] [2022-12-13 01:58:06,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252052640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:06,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:06,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:06,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52009608] [2022-12-13 01:58:06,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:06,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:06,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:06,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:06,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:06,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:06,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:06,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:06,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:06,355 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:06,355 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:06,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:06,356 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:06,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:06,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:06,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:06,356 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:06,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:06,357 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:06,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:06,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:06,358 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,358 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:06,358 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:06,358 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,361 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:06,361 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:06,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:06,361 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,361 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:06,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:06,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:06,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:06,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:06,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:06,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable368 [2022-12-13 01:58:06,495 INFO L420 AbstractCegarLoop]: === Iteration 370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1658766569, now seen corresponding path program 1 times [2022-12-13 01:58:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184958210] [2022-12-13 01:58:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,547 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 01:58:06,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:06,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184958210] [2022-12-13 01:58:06,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184958210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:06,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:06,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789490915] [2022-12-13 01:58:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:06,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:06,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:06,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:06,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:06,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:06,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:06,611 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:06,611 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:06,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:06,612 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:06,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:06,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:06,613 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:06,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:06,614 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,614 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:06,614 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:06,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:06,614 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:06,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:06,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,617 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:06,617 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:06,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:06,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:06,750 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:06,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:06,750 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:06,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:06,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:06,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable369 [2022-12-13 01:58:06,751 INFO L420 AbstractCegarLoop]: === Iteration 371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1716024871, now seen corresponding path program 1 times [2022-12-13 01:58:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:06,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977599817] [2022-12-13 01:58:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:06,803 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 01:58:06,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:06,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977599817] [2022-12-13 01:58:06,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977599817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:06,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:06,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:06,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927579] [2022-12-13 01:58:06,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:06,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:06,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:06,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:06,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:06,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:06,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:06,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:06,866 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:06,867 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:06,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:06,867 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:06,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:06,868 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:06,868 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:06,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:06,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:06,869 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:06,869 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:06,869 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:06,869 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,869 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:06,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:06,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,872 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:06,872 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:06,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:06,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:06,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:07,007 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:07,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:07,008 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:07,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:07,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:07,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable370 [2022-12-13 01:58:07,008 INFO L420 AbstractCegarLoop]: === Iteration 372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1773283173, now seen corresponding path program 1 times [2022-12-13 01:58:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:07,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251177327] [2022-12-13 01:58:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:07,072 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 01:58:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:07,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251177327] [2022-12-13 01:58:07,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251177327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:07,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:07,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802727614] [2022-12-13 01:58:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:07,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:07,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:07,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:07,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:07,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:07,127 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:07,127 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:07,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:07,128 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:07,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:07,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:07,128 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:07,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:07,129 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:07,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:07,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:07,129 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:07,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:07,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,133 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:07,133 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:07,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:07,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:07,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:07,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:58:07,267 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:07,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:07,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:07,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable371 [2022-12-13 01:58:07,267 INFO L420 AbstractCegarLoop]: === Iteration 373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:07,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:07,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1830541475, now seen corresponding path program 1 times [2022-12-13 01:58:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:07,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878503840] [2022-12-13 01:58:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:07,333 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 01:58:07,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:07,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878503840] [2022-12-13 01:58:07,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878503840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:07,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:07,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213330538] [2022-12-13 01:58:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:07,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:07,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:07,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:07,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:07,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:07,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:07,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:07,388 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:07,388 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:07,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:07,389 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:07,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:07,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:07,390 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:07,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:07,391 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:07,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:07,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:07,391 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:07,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:07,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,394 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:07,394 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:07,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:07,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:07,526 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:07,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:07,527 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:07,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:07,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:07,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable372 [2022-12-13 01:58:07,527 INFO L420 AbstractCegarLoop]: === Iteration 374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:07,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:07,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1887799777, now seen corresponding path program 1 times [2022-12-13 01:58:07,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:07,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076325258] [2022-12-13 01:58:07,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:07,599 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 01:58:07,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:07,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076325258] [2022-12-13 01:58:07,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076325258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:07,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:07,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:07,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051626785] [2022-12-13 01:58:07,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:07,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:07,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:07,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:07,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:07,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:07,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:07,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:07,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:07,653 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:07,653 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:07,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:07,654 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:07,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:07,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:07,655 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:07,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:07,656 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:07,656 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:07,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:07,656 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:07,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:07,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,659 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:07,659 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:07,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:07,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:07,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:07,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:07,792 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:07,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:07,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:07,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable373 [2022-12-13 01:58:07,792 INFO L420 AbstractCegarLoop]: === Iteration 375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:07,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:07,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1945058079, now seen corresponding path program 1 times [2022-12-13 01:58:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:07,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835621265] [2022-12-13 01:58:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:07,849 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 01:58:07,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:07,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835621265] [2022-12-13 01:58:07,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835621265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:07,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:07,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137902565] [2022-12-13 01:58:07,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:07,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:07,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:07,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:07,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:07,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:07,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:07,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:07,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:07,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:07,903 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:07,904 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:07,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:07,904 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:07,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:07,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:07,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:07,905 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:07,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:07,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:07,906 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:07,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:07,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:07,906 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:07,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:07,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:07,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,909 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:07,909 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:07,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:07,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:07,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:08,039 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:08,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:08,040 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:08,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:08,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:08,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable374 [2022-12-13 01:58:08,040 INFO L420 AbstractCegarLoop]: === Iteration 376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2002316381, now seen corresponding path program 1 times [2022-12-13 01:58:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:08,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766418689] [2022-12-13 01:58:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:08,096 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 01:58:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:08,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766418689] [2022-12-13 01:58:08,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766418689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:08,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:08,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607391586] [2022-12-13 01:58:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:08,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:08,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:08,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:08,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:08,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:08,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:08,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:08,140 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:08,141 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:08,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:08,141 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:08,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:08,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:08,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:08,142 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:08,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:08,143 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,143 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:08,143 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:08,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:08,143 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:08,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:08,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,146 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:08,146 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:08,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:08,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:08,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:08,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:08,262 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:08,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:08,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:08,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable375 [2022-12-13 01:58:08,263 INFO L420 AbstractCegarLoop]: === Iteration 377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:08,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2059574683, now seen corresponding path program 1 times [2022-12-13 01:58:08,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:08,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300993441] [2022-12-13 01:58:08,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:08,312 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 01:58:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:08,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300993441] [2022-12-13 01:58:08,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300993441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:08,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:08,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060540091] [2022-12-13 01:58:08,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:08,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:08,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:08,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:08,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:08,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:08,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:08,364 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:08,364 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:08,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:08,365 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:08,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:08,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:08,365 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:08,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:08,366 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:08,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:08,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:08,366 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:08,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:08,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,369 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:08,369 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:08,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:08,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:08,487 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:08,488 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:08,488 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,488 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:08,488 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:08,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable376 [2022-12-13 01:58:08,488 INFO L420 AbstractCegarLoop]: === Iteration 378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:08,488 INFO L85 PathProgramCache]: Analyzing trace with hash 2116832985, now seen corresponding path program 1 times [2022-12-13 01:58:08,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:08,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536551863] [2022-12-13 01:58:08,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:08,551 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 01:58:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:08,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536551863] [2022-12-13 01:58:08,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536551863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:08,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:08,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:08,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936348667] [2022-12-13 01:58:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:08,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:08,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:08,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:08,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:08,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:08,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:08,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:08,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:08,599 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:08,599 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:08,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:08,600 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:08,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:08,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:08,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:08,600 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:08,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:08,601 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:08,601 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:08,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:08,601 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:08,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:08,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,604 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:08,604 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:08,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:08,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:08,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:08,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:08,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:08,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:08,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:08,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable377 [2022-12-13 01:58:08,720 INFO L420 AbstractCegarLoop]: === Iteration 379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:08,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:08,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2120876009, now seen corresponding path program 1 times [2022-12-13 01:58:08,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:08,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006689240] [2022-12-13 01:58:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:08,767 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 01:58:08,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:08,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006689240] [2022-12-13 01:58:08,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006689240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:08,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:08,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:08,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854122817] [2022-12-13 01:58:08,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:08,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:08,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:08,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:08,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:08,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:08,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:08,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:08,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:08,819 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:08,819 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:08,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:08,819 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:08,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:08,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:08,820 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:08,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:08,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:08,821 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:08,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:08,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:08,821 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:08,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:08,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:08,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,824 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:08,824 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:08,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:08,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:08,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:08,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:08,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:08,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:08,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:08,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:08,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:08,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable378 [2022-12-13 01:58:08,940 INFO L420 AbstractCegarLoop]: === Iteration 380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2063617707, now seen corresponding path program 1 times [2022-12-13 01:58:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:08,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091269996] [2022-12-13 01:58:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:09,031 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 01:58:09,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:09,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091269996] [2022-12-13 01:58:09,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091269996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:09,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:09,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770264027] [2022-12-13 01:58:09,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:09,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:09,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:09,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:09,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:09,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:09,077 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:09,077 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:09,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:09,078 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:09,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:09,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:09,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:09,079 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:09,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:09,079 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:09,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:09,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:09,080 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:09,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:09,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,083 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:09,083 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:09,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:09,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:09,218 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:09,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:09,219 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:09,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:09,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:09,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable379 [2022-12-13 01:58:09,219 INFO L420 AbstractCegarLoop]: === Iteration 381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2006359405, now seen corresponding path program 1 times [2022-12-13 01:58:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684414300] [2022-12-13 01:58:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:09,297 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 01:58:09,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:09,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684414300] [2022-12-13 01:58:09,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684414300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:09,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:09,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316848535] [2022-12-13 01:58:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:09,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:09,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:09,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:09,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:09,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:09,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:09,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:09,350 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:09,350 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:09,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:09,350 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:09,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:09,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:09,351 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:09,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:09,352 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:09,352 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:09,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:09,352 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:09,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:09,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,355 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:09,355 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:09,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:09,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:09,480 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:09,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:58:09,480 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:09,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,481 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:09,481 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:09,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable380 [2022-12-13 01:58:09,481 INFO L420 AbstractCegarLoop]: === Iteration 382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:09,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1949101103, now seen corresponding path program 1 times [2022-12-13 01:58:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:09,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435537745] [2022-12-13 01:58:09,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:09,537 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 01:58:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:09,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435537745] [2022-12-13 01:58:09,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435537745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:09,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:09,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:09,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074301204] [2022-12-13 01:58:09,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:09,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:09,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:09,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:09,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:09,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:09,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:09,583 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:09,583 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:09,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:09,584 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:09,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:09,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:09,585 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:09,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:09,586 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:09,586 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:09,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:09,586 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,587 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:09,587 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:09,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,590 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:09,590 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:09,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:09,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:09,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:09,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:09,718 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:09,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:09,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:09,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381 [2022-12-13 01:58:09,719 INFO L420 AbstractCegarLoop]: === Iteration 383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:09,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1891842801, now seen corresponding path program 1 times [2022-12-13 01:58:09,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:09,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285550691] [2022-12-13 01:58:09,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:09,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:09,784 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 01:58:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:09,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285550691] [2022-12-13 01:58:09,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285550691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:09,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:09,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374985121] [2022-12-13 01:58:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:09,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:09,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:09,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:09,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:09,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:09,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:09,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:09,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:09,842 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:09,842 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:09,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:09,843 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:09,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:09,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:09,843 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:09,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:09,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:09,844 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:09,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:09,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:09,844 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:09,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:09,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:09,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,862 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:09,862 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:09,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:09,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:09,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:09,977 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:09,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:58:09,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:09,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:09,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:09,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:09,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable382 [2022-12-13 01:58:09,978 INFO L420 AbstractCegarLoop]: === Iteration 384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1834584499, now seen corresponding path program 1 times [2022-12-13 01:58:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:09,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129994073] [2022-12-13 01:58:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:09,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:10,041 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 01:58:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:10,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129994073] [2022-12-13 01:58:10,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129994073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:10,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:10,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:10,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798565184] [2022-12-13 01:58:10,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:10,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:10,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:10,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:10,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:10,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:10,100 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:10,101 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:10,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:10,101 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:10,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:10,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:10,102 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:10,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:10,103 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:10,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:10,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:10,103 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:10,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:10,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,106 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:10,106 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:10,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:10,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:10,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:10,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:10,229 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:10,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:10,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:10,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable383 [2022-12-13 01:58:10,230 INFO L420 AbstractCegarLoop]: === Iteration 385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:10,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1777326197, now seen corresponding path program 1 times [2022-12-13 01:58:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:10,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979309495] [2022-12-13 01:58:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:10,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:10,286 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 01:58:10,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:10,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979309495] [2022-12-13 01:58:10,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979309495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:10,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:10,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873886277] [2022-12-13 01:58:10,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:10,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:10,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:10,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:10,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:10,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:10,331 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:10,331 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:10,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:10,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:10,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:10,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:10,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:10,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:10,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:10,333 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:10,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:10,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:10,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:10,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:10,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:10,336 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:10,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:10,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:10,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:10,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:10,452 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:10,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:10,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:10,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable384 [2022-12-13 01:58:10,452 INFO L420 AbstractCegarLoop]: === Iteration 386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:10,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1720067895, now seen corresponding path program 1 times [2022-12-13 01:58:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:10,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175213694] [2022-12-13 01:58:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:10,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:10,500 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 01:58:10,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:10,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175213694] [2022-12-13 01:58:10,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175213694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:10,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:10,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:10,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573690233] [2022-12-13 01:58:10,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:10,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:10,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:10,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:10,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:10,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:10,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:10,553 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:10,553 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:10,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:10,553 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:10,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:10,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:10,554 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:10,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:10,555 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:10,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:10,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:10,555 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:10,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:10,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,558 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:10,558 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:10,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:10,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:10,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:10,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:58:10,679 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:10,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:10,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:10,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable385 [2022-12-13 01:58:10,679 INFO L420 AbstractCegarLoop]: === Iteration 387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:10,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:10,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1662809593, now seen corresponding path program 1 times [2022-12-13 01:58:10,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:10,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513356466] [2022-12-13 01:58:10,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:10,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:10,727 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 01:58:10,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:10,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513356466] [2022-12-13 01:58:10,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513356466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:10,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:10,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511020527] [2022-12-13 01:58:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:10,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:10,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:10,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:10,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:10,771 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:10,771 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:10,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:10,772 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:10,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:10,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:10,772 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:10,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:10,773 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:10,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:10,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:10,774 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:10,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:10,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,776 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:10,776 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:10,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:10,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:10,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:10,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:10,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:10,895 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:10,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:10,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:10,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable386 [2022-12-13 01:58:10,895 INFO L420 AbstractCegarLoop]: === Iteration 388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1605551291, now seen corresponding path program 1 times [2022-12-13 01:58:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:10,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949004428] [2022-12-13 01:58:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:10,944 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 01:58:10,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:10,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949004428] [2022-12-13 01:58:10,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949004428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:10,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:10,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:10,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605716603] [2022-12-13 01:58:10,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:10,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:10,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:10,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:10,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:10,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:10,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:10,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:10,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:10,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:10,994 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:10,995 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:10,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:10,995 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:10,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:10,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:10,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:10,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:10,996 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:10,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:10,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:10,997 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:10,997 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:10,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:10,997 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:10,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:10,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:10,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,000 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:11,000 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:11,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:11,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:11,130 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:11,130 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:58:11,130 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:11,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:11,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:11,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable387 [2022-12-13 01:58:11,131 INFO L420 AbstractCegarLoop]: === Iteration 389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:11,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1548292989, now seen corresponding path program 1 times [2022-12-13 01:58:11,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:11,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710758411] [2022-12-13 01:58:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:11,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:11,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 01:58:11,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:11,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710758411] [2022-12-13 01:58:11,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710758411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:11,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:11,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299716582] [2022-12-13 01:58:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:11,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:11,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:11,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:11,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:11,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:11,230 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:11,230 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:11,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:11,231 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:11,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:11,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:11,231 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:11,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:11,232 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:11,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:11,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:11,232 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:11,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:11,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,235 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:11,235 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:11,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:11,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:11,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:11,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:58:11,360 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:11,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:11,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:11,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable388 [2022-12-13 01:58:11,361 INFO L420 AbstractCegarLoop]: === Iteration 390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1491034687, now seen corresponding path program 1 times [2022-12-13 01:58:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:11,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552571015] [2022-12-13 01:58:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:11,410 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 01:58:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:11,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552571015] [2022-12-13 01:58:11,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552571015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:11,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:11,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891488578] [2022-12-13 01:58:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:11,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:11,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:11,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:11,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:11,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:11,464 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:11,464 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:11,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:11,465 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:11,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:11,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:11,465 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:11,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:11,466 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,467 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:11,467 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:11,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:11,467 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:11,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:11,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,470 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:11,470 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:11,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:11,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:11,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:11,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:11,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:11,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:11,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:11,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable389 [2022-12-13 01:58:11,587 INFO L420 AbstractCegarLoop]: === Iteration 391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:11,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1433776385, now seen corresponding path program 1 times [2022-12-13 01:58:11,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:11,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840012857] [2022-12-13 01:58:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:11,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:11,642 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 01:58:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:11,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840012857] [2022-12-13 01:58:11,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840012857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:11,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:11,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417394681] [2022-12-13 01:58:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:11,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:11,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:11,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:11,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:11,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:11,696 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:11,696 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:11,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:11,697 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:11,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:11,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:11,697 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:11,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:11,698 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:11,698 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:11,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:11,698 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:11,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:11,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,701 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:11,701 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:11,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:11,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:11,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:11,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:11,823 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:11,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:11,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:11,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable390 [2022-12-13 01:58:11,823 INFO L420 AbstractCegarLoop]: === Iteration 392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:11,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1376518083, now seen corresponding path program 1 times [2022-12-13 01:58:11,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:11,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920745344] [2022-12-13 01:58:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:11,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:11,872 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 01:58:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:11,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920745344] [2022-12-13 01:58:11,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920745344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:11,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:11,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103635311] [2022-12-13 01:58:11,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:11,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:11,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:11,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:11,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:11,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:11,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:11,922 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:11,922 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:11,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:11,923 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:11,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:11,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:11,924 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:11,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:11,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:11,924 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:11,925 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:11,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:11,925 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:11,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:11,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:11,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,928 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:11,928 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:11,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:11,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:11,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:12,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:12,044 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:12,044 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:12,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:12,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:12,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable391 [2022-12-13 01:58:12,045 INFO L420 AbstractCegarLoop]: === Iteration 393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1319259781, now seen corresponding path program 1 times [2022-12-13 01:58:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:12,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579802435] [2022-12-13 01:58:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:12,095 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 01:58:12,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:12,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579802435] [2022-12-13 01:58:12,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579802435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:12,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:12,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:12,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150064715] [2022-12-13 01:58:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:12,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:12,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:12,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:12,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:12,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:12,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:12,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:12,139 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:12,139 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:12,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:12,140 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:12,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:12,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:12,140 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:12,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:12,141 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:12,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:12,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:12,141 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:12,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:12,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,144 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:12,144 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:12,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:12,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:12,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:12,259 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:12,259 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:12,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:12,259 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:12,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable392 [2022-12-13 01:58:12,259 INFO L420 AbstractCegarLoop]: === Iteration 394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1262001479, now seen corresponding path program 1 times [2022-12-13 01:58:12,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:12,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145296009] [2022-12-13 01:58:12,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:12,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:12,320 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 01:58:12,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:12,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145296009] [2022-12-13 01:58:12,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145296009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:12,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:12,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102818889] [2022-12-13 01:58:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:12,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:12,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:12,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:12,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:12,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:12,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:12,373 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:12,373 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:12,374 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:12,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:12,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:12,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:12,374 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:12,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:12,375 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:12,375 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:12,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:12,375 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:12,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:12,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,378 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:12,378 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:12,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:12,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:12,490 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:12,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:12,491 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:12,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:12,491 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:12,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable393 [2022-12-13 01:58:12,491 INFO L420 AbstractCegarLoop]: === Iteration 395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:12,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1204743177, now seen corresponding path program 1 times [2022-12-13 01:58:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:12,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978262776] [2022-12-13 01:58:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:12,540 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 01:58:12,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:12,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978262776] [2022-12-13 01:58:12,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978262776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:12,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:12,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917378298] [2022-12-13 01:58:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:12,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:12,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:12,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:12,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:12,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:12,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:12,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:12,584 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:12,584 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:12,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:12,584 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:12,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:12,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:12,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:12,585 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:12,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:12,586 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:12,586 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:12,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:12,586 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:12,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:12,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,589 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:12,589 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:12,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:12,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:12,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:12,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:12,702 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:12,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:12,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:12,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable394 [2022-12-13 01:58:12,702 INFO L420 AbstractCegarLoop]: === Iteration 396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1147484875, now seen corresponding path program 1 times [2022-12-13 01:58:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:12,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620389586] [2022-12-13 01:58:12,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:12,766 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 01:58:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620389586] [2022-12-13 01:58:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620389586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:12,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:12,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757116772] [2022-12-13 01:58:12,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:12,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:12,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:12,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:12,767 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:12,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:12,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:12,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:12,817 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:12,817 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:12,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:12,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:12,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:12,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:12,818 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:12,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:12,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:12,819 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:12,819 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:12,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:12,819 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:12,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:12,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:12,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:12,822 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:12,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:12,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:12,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:12,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:12,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:12,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:12,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:12,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:12,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable395 [2022-12-13 01:58:12,935 INFO L420 AbstractCegarLoop]: === Iteration 397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:12,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:12,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1090226573, now seen corresponding path program 1 times [2022-12-13 01:58:12,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:12,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866165209] [2022-12-13 01:58:12,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:12,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:12,992 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 01:58:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866165209] [2022-12-13 01:58:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866165209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:12,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:12,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512148934] [2022-12-13 01:58:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:12,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:12,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:12,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:12,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:12,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:12,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:13,037 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:13,037 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:13,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:13,037 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:13,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:13,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:13,038 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:13,039 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:13,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:13,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:13,039 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:13,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:13,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,042 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:13,042 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:13,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:13,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:13,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:13,157 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:13,157 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:13,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,157 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:13,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:13,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable396 [2022-12-13 01:58:13,157 INFO L420 AbstractCegarLoop]: === Iteration 398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:13,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:13,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1032968271, now seen corresponding path program 1 times [2022-12-13 01:58:13,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:13,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919966666] [2022-12-13 01:58:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:13,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:13,208 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 01:58:13,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:13,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919966666] [2022-12-13 01:58:13,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919966666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:13,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:13,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:13,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701369691] [2022-12-13 01:58:13,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:13,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:13,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:13,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:13,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:13,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:13,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:13,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:13,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:13,253 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:13,253 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:13,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:13,254 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:13,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:13,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:13,254 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:13,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:13,255 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:13,255 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:13,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:13,255 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:13,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:13,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,258 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:13,258 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:13,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:13,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:13,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:13,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:13,373 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:13,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:13,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:13,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable397 [2022-12-13 01:58:13,374 INFO L420 AbstractCegarLoop]: === Iteration 399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:13,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash -975709969, now seen corresponding path program 1 times [2022-12-13 01:58:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:13,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180728959] [2022-12-13 01:58:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:13,441 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 01:58:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:13,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180728959] [2022-12-13 01:58:13,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180728959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:13,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:13,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710134971] [2022-12-13 01:58:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:13,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:13,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:13,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:13,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:13,492 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:13,492 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:13,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:13,493 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:13,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:13,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:13,493 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:13,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:13,494 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:13,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:13,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:13,494 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:13,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:13,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,497 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:13,498 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:13,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:13,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:13,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:13,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:58:13,617 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:13,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:13,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:13,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable398 [2022-12-13 01:58:13,617 INFO L420 AbstractCegarLoop]: === Iteration 400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:13,618 INFO L85 PathProgramCache]: Analyzing trace with hash -918451667, now seen corresponding path program 1 times [2022-12-13 01:58:13,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:13,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163893258] [2022-12-13 01:58:13,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:13,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:13,667 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 01:58:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:13,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163893258] [2022-12-13 01:58:13,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163893258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:13,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:13,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127153315] [2022-12-13 01:58:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:13,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:13,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:13,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:13,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:13,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:13,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:13,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:13,718 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:13,718 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:13,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:13,718 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:13,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:13,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:13,719 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:13,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:13,720 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:13,720 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:13,720 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:13,720 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:13,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:13,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,723 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:13,723 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:13,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:13,723 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,723 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:13,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:13,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:13,840 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:13,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:13,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:13,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable399 [2022-12-13 01:58:13,840 INFO L420 AbstractCegarLoop]: === Iteration 401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:13,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash -861193365, now seen corresponding path program 1 times [2022-12-13 01:58:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:13,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8683524] [2022-12-13 01:58:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:13,889 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 01:58:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:13,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8683524] [2022-12-13 01:58:13,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8683524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:13,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:13,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441316212] [2022-12-13 01:58:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:13,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:13,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:13,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:13,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:13,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:13,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:13,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:13,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:13,941 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:13,941 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:13,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:13,941 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:13,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:13,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:13,942 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:13,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:13,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:13,943 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,943 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:13,943 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:13,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:13,943 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:13,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:13,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:13,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,946 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:13,946 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:13,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:13,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:13,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:14,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:14,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:14,061 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:14,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:14,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:14,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable400 [2022-12-13 01:58:14,061 INFO L420 AbstractCegarLoop]: === Iteration 402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash -803935063, now seen corresponding path program 1 times [2022-12-13 01:58:14,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:14,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114142262] [2022-12-13 01:58:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:14,125 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 01:58:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:14,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114142262] [2022-12-13 01:58:14,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114142262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:14,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:14,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224996039] [2022-12-13 01:58:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:14,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:14,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:14,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:14,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:14,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:14,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:14,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:14,177 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:14,177 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:14,177 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:14,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:14,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:14,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:14,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:14,179 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:14,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:14,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:14,179 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:14,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:14,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:14,182 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:14,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:14,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:14,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:14,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:14,296 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:14,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:14,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:14,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401 [2022-12-13 01:58:14,297 INFO L420 AbstractCegarLoop]: === Iteration 403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:14,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -746676761, now seen corresponding path program 1 times [2022-12-13 01:58:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:14,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789084028] [2022-12-13 01:58:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:14,345 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 01:58:14,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:14,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789084028] [2022-12-13 01:58:14,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789084028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:14,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:14,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215052988] [2022-12-13 01:58:14,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:14,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:14,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:14,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:14,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:14,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:14,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:14,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:14,389 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:14,389 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:14,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:14,390 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:14,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:14,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:14,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:14,391 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:14,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:14,391 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:14,392 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:14,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:14,392 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,392 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:14,392 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:14,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,395 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:14,395 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:14,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:14,395 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:14,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:14,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:14,510 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:14,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:14,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:14,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable402 [2022-12-13 01:58:14,510 INFO L420 AbstractCegarLoop]: === Iteration 404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:14,510 INFO L85 PathProgramCache]: Analyzing trace with hash -689418459, now seen corresponding path program 1 times [2022-12-13 01:58:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:14,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587247903] [2022-12-13 01:58:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:14,561 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 01:58:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:14,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587247903] [2022-12-13 01:58:14,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587247903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:14,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:14,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677260721] [2022-12-13 01:58:14,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:14,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:14,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:14,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:14,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:14,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:14,628 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:14,628 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:14,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:14,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:14,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:14,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:14,629 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:14,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:14,630 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:14,630 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:14,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:14,630 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:14,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:14,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,633 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:14,633 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:14,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:14,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:14,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:14,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:14,747 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:14,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:14,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:14,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable403 [2022-12-13 01:58:14,748 INFO L420 AbstractCegarLoop]: === Iteration 405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:14,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash -632160157, now seen corresponding path program 1 times [2022-12-13 01:58:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:14,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772059255] [2022-12-13 01:58:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:14,798 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 01:58:14,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:14,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772059255] [2022-12-13 01:58:14,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772059255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:14,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:14,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:14,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97304952] [2022-12-13 01:58:14,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:14,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:14,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:14,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:14,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:14,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:14,849 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:14,849 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:14,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:14,850 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:14,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:14,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:14,850 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:14,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:14,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:14,851 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:14,851 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:14,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:14,851 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:14,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:14,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:14,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,854 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:14,854 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:14,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:14,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:14,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:14,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:14,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:14,969 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:14,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:14,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:14,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:14,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable404 [2022-12-13 01:58:14,969 INFO L420 AbstractCegarLoop]: === Iteration 406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:14,970 INFO L85 PathProgramCache]: Analyzing trace with hash -574901855, now seen corresponding path program 1 times [2022-12-13 01:58:14,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:14,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26770747] [2022-12-13 01:58:14,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:14,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,017 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 01:58:15,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:15,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26770747] [2022-12-13 01:58:15,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26770747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:15,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:15,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:15,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993199820] [2022-12-13 01:58:15,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:15,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:15,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:15,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:15,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:15,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:15,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:15,069 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:15,069 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:15,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:15,069 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:15,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:15,070 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:15,070 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:15,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:15,071 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:15,071 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:15,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:15,071 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:15,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:15,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,074 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:15,074 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:15,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:15,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:15,197 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:15,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:58:15,198 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:15,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:15,198 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:15,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable405 [2022-12-13 01:58:15,198 INFO L420 AbstractCegarLoop]: === Iteration 407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:15,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -517643553, now seen corresponding path program 1 times [2022-12-13 01:58:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:15,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742030608] [2022-12-13 01:58:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,249 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 01:58:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:15,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742030608] [2022-12-13 01:58:15,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742030608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:15,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:15,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174658567] [2022-12-13 01:58:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:15,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:15,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:15,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:15,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:15,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:15,294 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:15,294 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:15,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:15,294 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:15,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:15,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:15,295 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:15,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:15,296 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:15,296 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:15,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:15,296 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:15,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:15,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,299 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:15,299 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:15,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:15,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:15,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:15,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:15,414 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:15,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:15,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:15,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable406 [2022-12-13 01:58:15,414 INFO L420 AbstractCegarLoop]: === Iteration 408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:15,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash -460385251, now seen corresponding path program 1 times [2022-12-13 01:58:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918888143] [2022-12-13 01:58:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,464 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 01:58:15,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:15,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918888143] [2022-12-13 01:58:15,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918888143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:15,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:15,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:15,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390697452] [2022-12-13 01:58:15,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:15,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:15,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:15,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:15,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:15,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:15,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:15,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:15,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:15,518 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:15,518 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:15,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:15,518 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:15,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:15,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:15,519 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:15,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:15,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:15,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:15,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:15,520 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:15,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:15,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,523 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:15,523 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:15,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:15,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:15,639 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:15,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:15,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:15,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:15,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:15,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable407 [2022-12-13 01:58:15,639 INFO L420 AbstractCegarLoop]: === Iteration 409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:15,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -403126949, now seen corresponding path program 1 times [2022-12-13 01:58:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:15,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969353155] [2022-12-13 01:58:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:15,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,690 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 01:58:15,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969353155] [2022-12-13 01:58:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969353155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:15,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:15,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:15,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988631261] [2022-12-13 01:58:15,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:15,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:15,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:15,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:15,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:15,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:15,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:15,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:15,734 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:15,734 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:15,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:15,735 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:15,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:15,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:15,735 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:15,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:15,736 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:15,736 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:15,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:15,736 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:15,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:15,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,745 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:15,746 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:15,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:15,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:15,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:15,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:15,862 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:15,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:15,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:15,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable408 [2022-12-13 01:58:15,862 INFO L420 AbstractCegarLoop]: === Iteration 410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:15,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:15,862 INFO L85 PathProgramCache]: Analyzing trace with hash -345868647, now seen corresponding path program 1 times [2022-12-13 01:58:15,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:15,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966616677] [2022-12-13 01:58:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:15,927 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 01:58:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:15,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966616677] [2022-12-13 01:58:15,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966616677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:15,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:15,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:15,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493495557] [2022-12-13 01:58:15,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:15,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:15,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:15,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:15,928 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:15,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:15,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:15,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:15,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:15,980 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:15,980 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:15,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:15,981 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:15,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:15,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:15,982 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:15,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:15,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:15,982 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,983 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:15,983 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:15,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:15,983 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:15,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:15,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:15,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,986 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:15,986 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:15,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:15,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:15,986 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:16,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:16,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:16,103 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:16,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:16,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:16,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable409 [2022-12-13 01:58:16,103 INFO L420 AbstractCegarLoop]: === Iteration 411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash -288610345, now seen corresponding path program 1 times [2022-12-13 01:58:16,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:16,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168857318] [2022-12-13 01:58:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:16,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168857318] [2022-12-13 01:58:16,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168857318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:16,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:16,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:16,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881927138] [2022-12-13 01:58:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:16,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:16,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:16,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:16,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:16,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:16,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:16,204 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:16,204 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:16,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:16,205 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:16,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:16,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:16,205 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:16,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:16,207 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:16,207 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:16,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:16,207 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,207 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:16,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:16,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:16,211 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:16,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:16,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:16,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:16,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:16,344 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:16,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:16,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:16,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable410 [2022-12-13 01:58:16,345 INFO L420 AbstractCegarLoop]: === Iteration 412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:16,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash -231352043, now seen corresponding path program 1 times [2022-12-13 01:58:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:16,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122311998] [2022-12-13 01:58:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:16,403 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 01:58:16,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:16,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122311998] [2022-12-13 01:58:16,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122311998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:16,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:16,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924753081] [2022-12-13 01:58:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:16,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:16,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:16,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:16,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:16,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:16,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:16,466 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:16,466 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:16,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:16,467 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:16,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:16,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:16,468 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:16,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:16,468 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:16,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:16,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:16,469 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:16,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:16,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,472 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:16,472 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:16,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:16,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:16,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:16,605 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:16,605 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:16,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:16,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:16,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable411 [2022-12-13 01:58:16,606 INFO L420 AbstractCegarLoop]: === Iteration 413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:16,606 INFO L85 PathProgramCache]: Analyzing trace with hash -174093741, now seen corresponding path program 1 times [2022-12-13 01:58:16,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:16,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876611471] [2022-12-13 01:58:16,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:16,669 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 01:58:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:16,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876611471] [2022-12-13 01:58:16,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876611471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:16,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:16,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285494387] [2022-12-13 01:58:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:16,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:16,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:16,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:16,671 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:16,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:16,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:16,723 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:16,723 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:16,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:16,724 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:16,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:16,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:16,725 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:16,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:16,726 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:16,726 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:16,726 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:16,726 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:16,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:16,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,731 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:16,731 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:16,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:16,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:16,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:16,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:58:16,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:16,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:16,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:16,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable412 [2022-12-13 01:58:16,865 INFO L420 AbstractCegarLoop]: === Iteration 414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:16,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash -116835439, now seen corresponding path program 1 times [2022-12-13 01:58:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:16,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586496436] [2022-12-13 01:58:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:16,932 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 01:58:16,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:16,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586496436] [2022-12-13 01:58:16,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586496436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:16,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:16,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776836546] [2022-12-13 01:58:16,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:16,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:16,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:16,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:16,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:16,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:16,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:16,987 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:16,987 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:16,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:16,988 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:16,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:16,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:16,989 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:16,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:16,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:16,990 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:16,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:16,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:16,990 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:16,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:16,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:16,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,994 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:16,994 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:16,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:16,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:16,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:17,131 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:17,132 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 01:58:17,132 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:17,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:17,132 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:17,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable413 [2022-12-13 01:58:17,132 INFO L420 AbstractCegarLoop]: === Iteration 415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:17,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash -59577137, now seen corresponding path program 1 times [2022-12-13 01:58:17,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:17,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114857825] [2022-12-13 01:58:17,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,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 01:58:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:17,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114857825] [2022-12-13 01:58:17,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114857825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:17,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:17,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550396051] [2022-12-13 01:58:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:17,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:17,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:17,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:17,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:17,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:17,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:17,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:17,255 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:17,255 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:17,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:17,256 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:17,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:17,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:17,257 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:17,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:17,258 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:17,258 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:17,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:17,259 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:17,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:17,259 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,263 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:17,264 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:17,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:17,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:17,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:17,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:17,393 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:17,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:17,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:17,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable414 [2022-12-13 01:58:17,393 INFO L420 AbstractCegarLoop]: === Iteration 416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2318835, now seen corresponding path program 1 times [2022-12-13 01:58:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:17,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526513558] [2022-12-13 01:58:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:17,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:17,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526513558] [2022-12-13 01:58:17,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526513558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:17,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:17,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:17,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251512900] [2022-12-13 01:58:17,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:17,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:17,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:17,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:17,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:17,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:17,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:17,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:17,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:17,516 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:17,516 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:17,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:17,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:17,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:17,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:17,517 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:17,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:17,518 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:17,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:17,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:17,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:17,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:17,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:17,522 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:17,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:17,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:17,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:17,638 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:17,638 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:17,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:17,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:17,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable415 [2022-12-13 01:58:17,638 INFO L420 AbstractCegarLoop]: === Iteration 417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash 54939467, now seen corresponding path program 1 times [2022-12-13 01:58:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:17,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84542192] [2022-12-13 01:58:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,686 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 01:58:17,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:17,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84542192] [2022-12-13 01:58:17,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84542192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:17,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:17,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002709866] [2022-12-13 01:58:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:17,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:17,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:17,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:17,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:17,730 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:17,730 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:17,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:17,730 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:17,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:17,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:17,731 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:17,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:17,732 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:17,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:17,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:17,732 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:17,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:17,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,735 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:17,735 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:17,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:17,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:17,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:17,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:17,850 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:17,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:17,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:17,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable416 [2022-12-13 01:58:17,850 INFO L420 AbstractCegarLoop]: === Iteration 418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:17,851 INFO L85 PathProgramCache]: Analyzing trace with hash 112197769, now seen corresponding path program 1 times [2022-12-13 01:58:17,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:17,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884911223] [2022-12-13 01:58:17,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:17,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:17,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:17,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884911223] [2022-12-13 01:58:17,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884911223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:17,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:17,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:17,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738069280] [2022-12-13 01:58:17,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:17,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:17,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:17,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:17,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:17,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:17,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:17,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:17,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:17,952 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:17,952 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:17,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:17,953 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:17,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:17,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:17,953 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:17,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:17,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:17,954 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:17,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:17,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:17,954 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,955 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:17,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:17,955 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,957 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:17,957 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:17,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:17,958 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:17,958 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:18,071 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:18,072 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:18,072 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:18,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,072 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:18,072 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:18,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable417 [2022-12-13 01:58:18,072 INFO L420 AbstractCegarLoop]: === Iteration 419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:18,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash 169456071, now seen corresponding path program 1 times [2022-12-13 01:58:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:18,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563749985] [2022-12-13 01:58:18,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:18,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:18,119 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 01:58:18,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:18,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563749985] [2022-12-13 01:58:18,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563749985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:18,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:18,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8416153] [2022-12-13 01:58:18,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:18,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:18,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:18,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:18,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:18,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:18,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:18,163 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:18,163 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:18,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:18,163 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:18,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:18,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:18,164 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:18,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:18,165 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,165 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:18,165 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:18,165 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:18,165 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,165 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:18,165 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:18,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,168 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:18,168 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:18,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:18,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:18,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:18,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:18,291 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:18,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:18,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:18,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable418 [2022-12-13 01:58:18,292 INFO L420 AbstractCegarLoop]: === Iteration 420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash 226714373, now seen corresponding path program 1 times [2022-12-13 01:58:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:18,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998258393] [2022-12-13 01:58:18,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:18,349 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 01:58:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:18,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998258393] [2022-12-13 01:58:18,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998258393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:18,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:18,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:18,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088061202] [2022-12-13 01:58:18,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:18,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:18,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:18,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:18,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:18,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:18,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:18,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:18,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:18,392 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:18,392 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:18,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:18,392 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:18,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:18,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:18,393 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:18,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:18,394 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:18,394 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:18,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:18,394 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:18,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:18,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,397 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:18,397 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:18,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:18,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:18,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:18,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:18,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:18,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:18,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:18,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable419 [2022-12-13 01:58:18,511 INFO L420 AbstractCegarLoop]: === Iteration 421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:18,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:18,512 INFO L85 PathProgramCache]: Analyzing trace with hash 283972675, now seen corresponding path program 1 times [2022-12-13 01:58:18,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:18,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570507439] [2022-12-13 01:58:18,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:18,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:18,561 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 01:58:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:18,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570507439] [2022-12-13 01:58:18,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570507439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:18,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:18,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377374106] [2022-12-13 01:58:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:18,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:18,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:18,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:18,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:18,615 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:18,615 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:18,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:18,615 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:18,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:18,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:18,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:18,616 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:18,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:18,617 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:18,617 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:18,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:18,617 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,617 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:18,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:18,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,620 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:18,620 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:18,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:18,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:18,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:18,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:18,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:18,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:18,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:18,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable420 [2022-12-13 01:58:18,735 INFO L420 AbstractCegarLoop]: === Iteration 422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:18,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash 341230977, now seen corresponding path program 1 times [2022-12-13 01:58:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:18,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646054933] [2022-12-13 01:58:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:18,789 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 01:58:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:18,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646054933] [2022-12-13 01:58:18,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646054933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:18,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:18,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322057133] [2022-12-13 01:58:18,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:18,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:18,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:18,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:18,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:18,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:18,833 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:18,833 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:18,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:18,834 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:18,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:18,834 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:18,834 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:18,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:18,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:18,835 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,835 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:18,835 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:18,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:18,835 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:18,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:18,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:18,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,838 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:18,838 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:18,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:18,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:18,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:18,968 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:18,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:58:18,968 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:18,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:18,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:18,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:18,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable421 [2022-12-13 01:58:18,969 INFO L420 AbstractCegarLoop]: === Iteration 423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 398489279, now seen corresponding path program 1 times [2022-12-13 01:58:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:18,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239095300] [2022-12-13 01:58:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:18,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:19,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 01:58:19,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:19,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239095300] [2022-12-13 01:58:19,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239095300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:19,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:19,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:19,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793428616] [2022-12-13 01:58:19,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:19,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:19,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:19,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:19,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:19,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:19,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:19,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:19,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:19,078 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:19,078 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:19,079 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:19,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:19,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:19,079 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:19,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:19,080 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:19,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:19,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:19,081 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:19,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:19,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,083 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:19,083 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:19,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:19,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:19,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:19,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:19,202 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:19,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:19,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:19,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable422 [2022-12-13 01:58:19,203 INFO L420 AbstractCegarLoop]: === Iteration 424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:19,203 INFO L85 PathProgramCache]: Analyzing trace with hash 455747581, now seen corresponding path program 1 times [2022-12-13 01:58:19,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:19,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141748096] [2022-12-13 01:58:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:19,272 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 01:58:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:19,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141748096] [2022-12-13 01:58:19,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141748096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:19,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499530452] [2022-12-13 01:58:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:19,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:19,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:19,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:19,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:19,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:19,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:19,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:19,352 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:19,353 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:19,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:19,353 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:19,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:19,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:19,354 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:19,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:19,355 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,355 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:19,355 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:19,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:19,355 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:19,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:19,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,358 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:19,358 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:19,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:19,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:19,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:19,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:19,471 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:19,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:19,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:19,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable423 [2022-12-13 01:58:19,472 INFO L420 AbstractCegarLoop]: === Iteration 425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:19,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash 513005883, now seen corresponding path program 1 times [2022-12-13 01:58:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:19,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243742987] [2022-12-13 01:58:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:19,527 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 01:58:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243742987] [2022-12-13 01:58:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243742987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225694290] [2022-12-13 01:58:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:19,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:19,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:19,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:19,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:19,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:19,578 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:19,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:19,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:19,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:19,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:19,579 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:19,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:19,580 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:19,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:19,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:19,580 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:19,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:19,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,583 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:19,583 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:19,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:19,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:19,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:19,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:19,700 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:19,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:19,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:19,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable424 [2022-12-13 01:58:19,700 INFO L420 AbstractCegarLoop]: === Iteration 426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:19,701 INFO L85 PathProgramCache]: Analyzing trace with hash 570264185, now seen corresponding path program 1 times [2022-12-13 01:58:19,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:19,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176439463] [2022-12-13 01:58:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:19,761 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 01:58:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:19,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176439463] [2022-12-13 01:58:19,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176439463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:19,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:19,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208123769] [2022-12-13 01:58:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:19,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:19,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:19,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:19,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:19,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:19,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:19,815 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:19,815 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:19,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:19,816 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:19,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:19,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:19,817 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:19,817 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:19,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:19,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:19,817 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:19,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:19,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:19,818 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:19,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:19,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:19,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,821 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:19,821 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:19,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:19,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:19,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:19,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:19,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:19,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:19,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:19,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:19,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:19,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable425 [2022-12-13 01:58:19,952 INFO L420 AbstractCegarLoop]: === Iteration 427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash 627522487, now seen corresponding path program 1 times [2022-12-13 01:58:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:19,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610751397] [2022-12-13 01:58:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:20,011 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 01:58:20,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:20,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610751397] [2022-12-13 01:58:20,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610751397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:20,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:20,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271407379] [2022-12-13 01:58:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:20,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:20,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:20,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:20,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:20,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:20,071 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:20,071 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:20,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:20,072 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:20,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:20,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:20,072 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:20,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:20,073 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:20,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:20,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:20,073 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:20,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:20,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,076 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:20,076 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:20,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:20,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:20,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:20,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:20,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:20,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:20,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:20,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable426 [2022-12-13 01:58:20,205 INFO L420 AbstractCegarLoop]: === Iteration 428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:20,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 684780789, now seen corresponding path program 1 times [2022-12-13 01:58:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:20,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760029954] [2022-12-13 01:58:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:20,267 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 01:58:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760029954] [2022-12-13 01:58:20,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760029954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:20,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:20,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639582676] [2022-12-13 01:58:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:20,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:20,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:20,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:20,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:20,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:20,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:20,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:20,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:20,320 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:20,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:20,321 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:20,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:20,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:20,322 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:20,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:20,322 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:20,323 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:20,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:20,323 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:20,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:20,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,326 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:20,326 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:20,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:20,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:20,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:20,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:20,454 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:20,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:20,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:20,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable427 [2022-12-13 01:58:20,455 INFO L420 AbstractCegarLoop]: === Iteration 429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:20,455 INFO L85 PathProgramCache]: Analyzing trace with hash 742039091, now seen corresponding path program 1 times [2022-12-13 01:58:20,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:20,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926002199] [2022-12-13 01:58:20,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:20,508 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 01:58:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:20,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926002199] [2022-12-13 01:58:20,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926002199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:20,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:20,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163019647] [2022-12-13 01:58:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:20,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:20,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:20,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:20,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:20,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:20,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:20,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:20,560 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:20,560 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:20,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:20,561 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:20,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:20,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:20,561 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:20,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:20,562 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:20,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:20,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:20,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:20,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:20,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,565 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:20,565 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:20,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:20,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:20,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:20,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:20,693 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:20,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,693 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:20,693 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:20,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable428 [2022-12-13 01:58:20,693 INFO L420 AbstractCegarLoop]: === Iteration 430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 799297393, now seen corresponding path program 1 times [2022-12-13 01:58:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:20,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65422503] [2022-12-13 01:58:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:20,754 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 01:58:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:20,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65422503] [2022-12-13 01:58:20,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65422503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:20,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:20,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932639288] [2022-12-13 01:58:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:20,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:20,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:20,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:20,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:20,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:20,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:20,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:20,814 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:20,814 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:20,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:20,815 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:20,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:20,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:20,827 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:20,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:20,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:20,828 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:20,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:20,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:20,829 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:20,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:20,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:20,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,833 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:20,833 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:20,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:20,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:20,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:20,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:20,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 01:58:20,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:20,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:20,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:20,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:20,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable429 [2022-12-13 01:58:20,988 INFO L420 AbstractCegarLoop]: === Iteration 431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:20,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 856555695, now seen corresponding path program 1 times [2022-12-13 01:58:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:20,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618537079] [2022-12-13 01:58:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:21,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 01:58:21,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:21,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618537079] [2022-12-13 01:58:21,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618537079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:21,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:21,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964693971] [2022-12-13 01:58:21,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:21,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:21,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:21,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:21,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:21,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:21,099 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:21,100 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:21,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:21,100 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:21,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:21,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:21,101 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:21,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:21,102 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:21,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:21,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:21,102 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:21,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:21,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,105 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:21,105 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:21,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:21,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:21,247 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:21,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:58:21,247 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:21,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:21,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:21,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable430 [2022-12-13 01:58:21,248 INFO L420 AbstractCegarLoop]: === Iteration 432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash 913813997, now seen corresponding path program 1 times [2022-12-13 01:58:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:21,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058785031] [2022-12-13 01:58:21,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:21,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:21,298 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 01:58:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:21,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058785031] [2022-12-13 01:58:21,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058785031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:21,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:21,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:21,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583122512] [2022-12-13 01:58:21,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:21,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:21,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:21,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:21,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:21,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:21,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:21,359 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:21,359 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:21,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:21,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:21,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:21,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:21,360 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:21,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:21,361 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:21,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:21,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:21,361 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:21,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:21,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,364 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:21,364 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:21,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:21,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:21,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:21,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:21,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:21,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:21,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:21,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable431 [2022-12-13 01:58:21,495 INFO L420 AbstractCegarLoop]: === Iteration 433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash 971072299, now seen corresponding path program 1 times [2022-12-13 01:58:21,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:21,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597065318] [2022-12-13 01:58:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:21,556 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 01:58:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:21,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597065318] [2022-12-13 01:58:21,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597065318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:21,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:21,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:21,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918651101] [2022-12-13 01:58:21,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:21,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:21,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:21,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:21,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:21,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:21,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:21,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:21,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:21,619 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:21,620 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:21,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:21,620 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:21,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:21,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:21,621 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:21,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:21,622 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,622 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:21,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:21,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:21,622 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:21,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:21,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,625 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:21,625 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:21,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:21,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:21,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:21,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:21,757 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:21,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:21,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:21,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable432 [2022-12-13 01:58:21,757 INFO L420 AbstractCegarLoop]: === Iteration 434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1028330601, now seen corresponding path program 1 times [2022-12-13 01:58:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:21,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61252031] [2022-12-13 01:58:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:21,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:21,809 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 01:58:21,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:21,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61252031] [2022-12-13 01:58:21,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61252031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:21,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:21,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448720272] [2022-12-13 01:58:21,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:21,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:21,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:21,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:21,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:21,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:21,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:21,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:21,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:21,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:21,864 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:21,864 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:21,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:21,865 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:21,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:21,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:21,865 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:21,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:21,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:21,866 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:21,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:21,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:21,866 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:21,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:21,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:21,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,869 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:21,869 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:21,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:21,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:21,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:22,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:22,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:22,002 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:22,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:22,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:22,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable433 [2022-12-13 01:58:22,003 INFO L420 AbstractCegarLoop]: === Iteration 435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:22,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1085588903, now seen corresponding path program 1 times [2022-12-13 01:58:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:22,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105506450] [2022-12-13 01:58:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:22,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:22,064 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 01:58:22,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:22,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105506450] [2022-12-13 01:58:22,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105506450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:22,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:22,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216348105] [2022-12-13 01:58:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:22,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:22,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:22,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:22,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:22,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:22,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:22,127 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:22,127 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:22,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:22,128 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:22,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:22,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:22,129 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:22,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:22,130 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:22,130 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:22,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:22,130 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:22,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:22,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,133 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:22,133 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:22,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:22,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:22,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:22,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:22,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:22,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:22,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:22,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable434 [2022-12-13 01:58:22,267 INFO L420 AbstractCegarLoop]: === Iteration 436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1142847205, now seen corresponding path program 1 times [2022-12-13 01:58:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:22,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905335925] [2022-12-13 01:58:22,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:22,329 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 01:58:22,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:22,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905335925] [2022-12-13 01:58:22,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905335925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:22,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:22,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:22,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929093470] [2022-12-13 01:58:22,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:22,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:22,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:22,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:22,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:22,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:22,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:22,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:22,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:22,382 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:22,382 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:22,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:22,383 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:22,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:22,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:22,383 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:22,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:22,385 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:22,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:22,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:22,385 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:22,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:22,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,389 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:22,389 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:22,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:22,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:22,523 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:22,523 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:58:22,524 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:22,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:22,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:22,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable435 [2022-12-13 01:58:22,524 INFO L420 AbstractCegarLoop]: === Iteration 437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:22,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1200105507, now seen corresponding path program 1 times [2022-12-13 01:58:22,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:22,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129783369] [2022-12-13 01:58:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:22,576 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 01:58:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:22,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129783369] [2022-12-13 01:58:22,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129783369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:22,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:22,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542965183] [2022-12-13 01:58:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:22,577 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:22,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:22,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:22,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:22,630 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:22,630 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:22,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:22,631 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:22,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:22,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:22,632 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:22,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:22,633 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:22,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:22,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:22,633 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,633 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:22,633 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:22,633 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,636 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:22,636 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:22,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:22,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:22,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:22,769 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:22,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:22,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:22,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable436 [2022-12-13 01:58:22,770 INFO L420 AbstractCegarLoop]: === Iteration 438 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1257363809, now seen corresponding path program 1 times [2022-12-13 01:58:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:22,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149486801] [2022-12-13 01:58:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:22,834 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 01:58:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:22,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149486801] [2022-12-13 01:58:22,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149486801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:22,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:22,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:22,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855201379] [2022-12-13 01:58:22,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:22,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:22,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:22,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:22,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:22,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:22,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:22,890 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:22,890 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:22,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:22,890 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:22,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:22,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:22,891 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:22,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:22,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:22,892 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,892 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:22,892 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:22,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:22,892 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:22,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:22,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:22,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,895 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:22,895 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:22,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:22,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:22,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:23,031 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:23,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:58:23,032 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:23,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:23,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:23,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable437 [2022-12-13 01:58:23,032 INFO L420 AbstractCegarLoop]: === Iteration 439 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1314622111, now seen corresponding path program 1 times [2022-12-13 01:58:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:23,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924384695] [2022-12-13 01:58:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:23,090 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 01:58:23,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:23,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924384695] [2022-12-13 01:58:23,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924384695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:23,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:23,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:23,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878695612] [2022-12-13 01:58:23,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:23,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:23,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:23,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:23,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:23,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:23,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:23,147 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:23,148 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:23,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:23,148 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:23,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:23,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:23,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:23,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:23,149 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:23,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:23,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:23,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:23,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:23,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,153 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:23,153 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:23,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:23,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:23,266 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:23,267 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:23,267 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:23,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:23,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:23,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable438 [2022-12-13 01:58:23,267 INFO L420 AbstractCegarLoop]: === Iteration 440 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1371880413, now seen corresponding path program 1 times [2022-12-13 01:58:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:23,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227287015] [2022-12-13 01:58:23,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:23,316 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 01:58:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:23,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227287015] [2022-12-13 01:58:23,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227287015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:23,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:23,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324709691] [2022-12-13 01:58:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:23,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:23,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:23,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:23,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:23,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:23,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:23,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:23,361 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:23,361 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:23,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:23,362 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:23,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:23,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:23,363 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:23,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:23,363 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:23,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:23,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:23,364 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:23,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:23,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,366 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:23,367 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:23,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:23,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:23,481 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:23,481 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:23,482 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:23,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:23,482 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:23,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439 [2022-12-13 01:58:23,482 INFO L420 AbstractCegarLoop]: === Iteration 441 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1429138715, now seen corresponding path program 1 times [2022-12-13 01:58:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:23,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845822321] [2022-12-13 01:58:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:23,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:23,536 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 01:58:23,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:23,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845822321] [2022-12-13 01:58:23,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845822321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:23,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:23,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523370581] [2022-12-13 01:58:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:23,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:23,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:23,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:23,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:23,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:23,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:23,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:23,588 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:23,588 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:23,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:23,588 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:23,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:23,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:23,589 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:23,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:23,590 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:23,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:23,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:23,590 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:23,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:23,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,593 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:23,593 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:23,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:23,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,593 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:23,707 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:23,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:23,708 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:23,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:23,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:23,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable440 [2022-12-13 01:58:23,708 INFO L420 AbstractCegarLoop]: === Iteration 442 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:23,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1486397017, now seen corresponding path program 1 times [2022-12-13 01:58:23,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:23,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659768305] [2022-12-13 01:58:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:23,761 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 01:58:23,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:23,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659768305] [2022-12-13 01:58:23,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659768305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:23,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:23,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:23,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998115475] [2022-12-13 01:58:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:23,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:23,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:23,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:23,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:23,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:23,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:23,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:23,812 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:23,813 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:23,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:23,813 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:23,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:23,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:23,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:23,814 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:23,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:23,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:23,814 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:23,815 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:23,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:23,815 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:23,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:23,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:23,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:23,818 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:23,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:23,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:23,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:23,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:23,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:58:23,938 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:23,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:23,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:23,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable441 [2022-12-13 01:58:23,938 INFO L420 AbstractCegarLoop]: === Iteration 443 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1543655319, now seen corresponding path program 1 times [2022-12-13 01:58:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:23,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225872942] [2022-12-13 01:58:23,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:23,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:23,998 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 01:58:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:23,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225872942] [2022-12-13 01:58:23,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225872942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:23,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:23,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201677475] [2022-12-13 01:58:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:23,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:23,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:23,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:23,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:23,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:24,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:24,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:24,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:24,049 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:24,049 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:24,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:24,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:24,050 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:24,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:24,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:24,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:24,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:24,051 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:24,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:24,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,054 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:24,054 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:24,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:24,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:24,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:24,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:58:24,179 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:24,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:24,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:24,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable442 [2022-12-13 01:58:24,180 INFO L420 AbstractCegarLoop]: === Iteration 444 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:24,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1600913621, now seen corresponding path program 1 times [2022-12-13 01:58:24,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:24,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237033631] [2022-12-13 01:58:24,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:24,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:24,234 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 01:58:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237033631] [2022-12-13 01:58:24,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237033631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:24,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:24,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:24,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706957141] [2022-12-13 01:58:24,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:24,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:24,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:24,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:24,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:24,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:24,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:24,289 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:24,289 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:24,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:24,290 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:24,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:24,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:24,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:24,290 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:24,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:24,291 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:24,291 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:24,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:24,291 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,292 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:24,292 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:24,292 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,294 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:24,294 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:24,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:24,295 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,295 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:24,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:24,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:24,413 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:24,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:24,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:24,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable443 [2022-12-13 01:58:24,413 INFO L420 AbstractCegarLoop]: === Iteration 445 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:24,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1658171923, now seen corresponding path program 1 times [2022-12-13 01:58:24,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:24,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708130402] [2022-12-13 01:58:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:24,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:24,462 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 01:58:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:24,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708130402] [2022-12-13 01:58:24,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708130402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:24,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:24,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:24,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145997386] [2022-12-13 01:58:24,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:24,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:24,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:24,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:24,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:24,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:24,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:24,514 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:24,514 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:24,515 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:24,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:24,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:24,515 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:24,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:24,516 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:24,516 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:24,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:24,517 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:24,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:24,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,519 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:24,520 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:24,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:24,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:24,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:24,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:58:24,655 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:24,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:24,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:24,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable444 [2022-12-13 01:58:24,656 INFO L420 AbstractCegarLoop]: === Iteration 446 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:24,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:24,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1715430225, now seen corresponding path program 1 times [2022-12-13 01:58:24,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:24,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555361067] [2022-12-13 01:58:24,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:24,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:24,718 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 01:58:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:24,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555361067] [2022-12-13 01:58:24,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555361067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:24,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:24,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773884020] [2022-12-13 01:58:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:24,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:24,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:24,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:24,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:24,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:24,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:24,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:24,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:24,784 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:24,784 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:24,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:24,785 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:24,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:24,786 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:24,786 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:24,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:24,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:24,787 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,787 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:24,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:24,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:24,787 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:24,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:24,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:24,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,790 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:24,790 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:24,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:24,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:24,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:24,922 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:24,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:24,923 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:24,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:24,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:24,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable445 [2022-12-13 01:58:24,923 INFO L420 AbstractCegarLoop]: === Iteration 447 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:24,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1772688527, now seen corresponding path program 1 times [2022-12-13 01:58:24,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:24,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108042365] [2022-12-13 01:58:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:24,979 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 01:58:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:24,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108042365] [2022-12-13 01:58:24,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108042365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:24,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:24,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484852946] [2022-12-13 01:58:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:24,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:24,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:24,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:24,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:24,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:24,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:24,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:25,040 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:25,040 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:25,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:25,041 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:25,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:25,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:25,041 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:25,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:25,042 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:25,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:25,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:25,043 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:25,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:25,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,045 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:25,046 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:25,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:25,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:25,160 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:25,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:25,160 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:25,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:25,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:25,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable446 [2022-12-13 01:58:25,160 INFO L420 AbstractCegarLoop]: === Iteration 448 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1829946829, now seen corresponding path program 1 times [2022-12-13 01:58:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821587036] [2022-12-13 01:58:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:25,208 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 01:58:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821587036] [2022-12-13 01:58:25,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821587036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:25,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:25,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184114147] [2022-12-13 01:58:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:25,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:25,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:25,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:25,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:25,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:25,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:25,259 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:25,259 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:25,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:25,260 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:25,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:25,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:25,260 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:25,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:25,261 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,261 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:25,261 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:25,261 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:25,261 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:25,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:25,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,265 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:25,265 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:25,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:25,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:25,379 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:25,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:25,380 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:25,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:25,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:25,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable447 [2022-12-13 01:58:25,380 INFO L420 AbstractCegarLoop]: === Iteration 449 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1887205131, now seen corresponding path program 1 times [2022-12-13 01:58:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:25,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873284855] [2022-12-13 01:58:25,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:25,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:25,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 01:58:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:25,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873284855] [2022-12-13 01:58:25,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873284855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:25,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66989463] [2022-12-13 01:58:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:25,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:25,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:25,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:25,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:25,496 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:25,496 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:25,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:25,497 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:25,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:25,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:25,497 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:25,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:25,498 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:25,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:25,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:25,498 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:25,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:25,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,501 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:25,501 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:25,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:25,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:25,615 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:25,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:25,616 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:25,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:25,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:25,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable448 [2022-12-13 01:58:25,616 INFO L420 AbstractCegarLoop]: === Iteration 450 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1944463433, now seen corresponding path program 1 times [2022-12-13 01:58:25,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:25,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910180659] [2022-12-13 01:58:25,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:25,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:25,673 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 01:58:25,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:25,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910180659] [2022-12-13 01:58:25,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910180659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:25,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:25,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170300203] [2022-12-13 01:58:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:25,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:25,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:25,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:25,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:25,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:25,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:25,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:25,718 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:25,718 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:25,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:25,719 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:25,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:25,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:25,719 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:25,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:25,720 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:25,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:25,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:25,721 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:25,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:25,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,724 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:25,724 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:25,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:25,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:25,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:25,839 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:25,839 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:25,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,839 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:25,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:25,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable449 [2022-12-13 01:58:25,840 INFO L420 AbstractCegarLoop]: === Iteration 451 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:25,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:25,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2001721735, now seen corresponding path program 1 times [2022-12-13 01:58:25,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:25,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350139623] [2022-12-13 01:58:25,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:25,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:25,889 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 01:58:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:25,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350139623] [2022-12-13 01:58:25,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350139623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:25,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:25,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:25,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939008692] [2022-12-13 01:58:25,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:25,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:25,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:25,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:25,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:25,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:25,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:25,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:25,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:25,945 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:25,959 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:25,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:25,960 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:25,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:25,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:25,967 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:25,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:25,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:25,968 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,968 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:25,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:25,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:25,969 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:25,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:25,969 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:25,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,972 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:25,972 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:25,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:25,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:25,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:26,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:26,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:26,094 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:26,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:26,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:26,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable450 [2022-12-13 01:58:26,094 INFO L420 AbstractCegarLoop]: === Iteration 452 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:26,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2058980037, now seen corresponding path program 1 times [2022-12-13 01:58:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:26,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452864503] [2022-12-13 01:58:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,143 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 01:58:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452864503] [2022-12-13 01:58:26,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452864503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:26,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:26,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:26,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784197765] [2022-12-13 01:58:26,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:26,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:26,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:26,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:26,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:26,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:26,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:26,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:26,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:26,196 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:26,196 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:26,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:26,196 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:26,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:26,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:26,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:26,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:26,197 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:26,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:26,198 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:26,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:26,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:26,198 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:26,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:26,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,201 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:26,201 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:26,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:26,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:26,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:26,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:26,315 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:26,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:26,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:26,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable451 [2022-12-13 01:58:26,315 INFO L420 AbstractCegarLoop]: === Iteration 453 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 2116238339, now seen corresponding path program 1 times [2022-12-13 01:58:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:26,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477977998] [2022-12-13 01:58:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,372 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 01:58:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:26,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477977998] [2022-12-13 01:58:26,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477977998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:26,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:26,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315803400] [2022-12-13 01:58:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:26,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:26,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:26,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:26,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:26,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:26,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:26,424 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:26,424 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:26,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:26,424 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:26,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:26,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:26,425 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:26,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:26,426 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:26,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:26,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:26,426 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:26,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:26,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,429 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:26,429 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:26,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:26,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:26,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:26,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:26,545 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:26,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:26,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:26,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable452 [2022-12-13 01:58:26,546 INFO L420 AbstractCegarLoop]: === Iteration 454 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2121470655, now seen corresponding path program 1 times [2022-12-13 01:58:26,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:26,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944012095] [2022-12-13 01:58:26,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,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 01:58:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:26,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944012095] [2022-12-13 01:58:26,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944012095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:26,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:26,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417196670] [2022-12-13 01:58:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:26,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:26,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:26,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:26,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:26,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:26,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:26,637 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:26,637 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:26,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:26,637 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:26,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:26,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:26,638 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:26,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:26,639 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:26,639 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:26,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:26,639 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:26,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:26,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,642 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:26,642 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:26,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:26,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:26,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:26,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:26,768 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:26,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:26,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable453 [2022-12-13 01:58:26,768 INFO L420 AbstractCegarLoop]: === Iteration 455 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2064212353, now seen corresponding path program 1 times [2022-12-13 01:58:26,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:26,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809606233] [2022-12-13 01:58:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:26,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:26,818 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 01:58:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:26,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809606233] [2022-12-13 01:58:26,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809606233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:26,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:26,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251012349] [2022-12-13 01:58:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:26,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:26,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:26,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:26,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:26,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:26,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:26,887 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:26,887 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:26,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:26,887 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:26,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:26,888 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:26,888 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:26,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:26,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:26,889 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,889 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:26,889 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:26,889 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:26,889 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:26,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:26,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,892 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:26,892 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:26,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:26,892 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:26,892 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:27,014 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:27,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:27,015 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:27,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:27,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:27,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable454 [2022-12-13 01:58:27,015 INFO L420 AbstractCegarLoop]: === Iteration 456 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2006954051, now seen corresponding path program 1 times [2022-12-13 01:58:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390566568] [2022-12-13 01:58:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:27,066 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 01:58:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:27,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390566568] [2022-12-13 01:58:27,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390566568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:27,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:27,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66495553] [2022-12-13 01:58:27,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:27,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:27,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:27,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:27,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:27,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:27,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:27,121 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:27,121 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:27,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:27,122 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:27,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:27,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:27,122 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:27,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:27,123 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:27,124 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:27,124 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:27,124 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:27,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:27,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,127 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:27,127 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:27,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:27,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:27,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:27,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:58:27,270 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:27,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:27,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable455 [2022-12-13 01:58:27,271 INFO L420 AbstractCegarLoop]: === Iteration 457 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:27,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1949695749, now seen corresponding path program 1 times [2022-12-13 01:58:27,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:27,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019876887] [2022-12-13 01:58:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:27,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:27,320 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 01:58:27,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:27,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019876887] [2022-12-13 01:58:27,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019876887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:27,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:27,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:27,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926955043] [2022-12-13 01:58:27,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:27,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:27,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:27,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:27,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:27,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:27,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:27,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:27,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:27,381 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:27,381 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:27,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:27,382 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:27,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:27,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:27,383 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:27,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:27,383 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:27,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:27,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:27,384 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:27,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:27,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,387 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:27,387 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:27,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:27,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:27,515 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:27,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:27,515 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:27,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:27,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:27,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable456 [2022-12-13 01:58:27,515 INFO L420 AbstractCegarLoop]: === Iteration 458 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:27,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1892437447, now seen corresponding path program 1 times [2022-12-13 01:58:27,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:27,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384071687] [2022-12-13 01:58:27,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:27,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:27,576 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 01:58:27,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:27,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384071687] [2022-12-13 01:58:27,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384071687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:27,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:27,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:27,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905622890] [2022-12-13 01:58:27,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:27,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:27,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:27,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:27,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:27,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:27,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:27,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:27,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:27,627 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:27,628 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:27,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:27,628 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:27,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:27,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:27,629 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:27,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:27,630 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:27,630 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:27,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:27,630 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:27,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:27,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,634 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:27,634 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:27,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:27,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,635 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:27,760 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:27,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:27,761 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:27,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:27,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:27,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable457 [2022-12-13 01:58:27,762 INFO L420 AbstractCegarLoop]: === Iteration 459 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:27,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1835179145, now seen corresponding path program 1 times [2022-12-13 01:58:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2346937] [2022-12-13 01:58:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:27,820 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 01:58:27,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:27,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2346937] [2022-12-13 01:58:27,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2346937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:27,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:27,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:27,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823907120] [2022-12-13 01:58:27,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:27,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:27,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:27,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:27,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:27,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:27,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:27,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:27,871 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:27,872 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:27,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:27,872 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:27,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:27,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:27,873 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:27,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:27,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:27,874 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:27,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:27,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:27,874 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:27,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:27,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:27,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,877 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:27,877 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:27,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:27,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:27,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:28,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:28,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:58:28,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:28,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:28,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:28,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable458 [2022-12-13 01:58:28,004 INFO L420 AbstractCegarLoop]: === Iteration 460 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:28,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1777920843, now seen corresponding path program 1 times [2022-12-13 01:58:28,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:28,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057082101] [2022-12-13 01:58:28,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:28,060 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 01:58:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:28,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057082101] [2022-12-13 01:58:28,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057082101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:28,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:28,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:28,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952487057] [2022-12-13 01:58:28,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:28,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:28,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:28,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:28,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:28,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:28,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:28,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:28,110 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:28,110 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:28,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:28,111 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:28,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:28,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:28,112 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:28,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:28,112 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:28,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:28,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:28,113 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:28,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:28,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,115 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:28,116 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:28,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:28,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:28,232 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:28,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:28,232 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:28,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:28,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:28,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable459 [2022-12-13 01:58:28,233 INFO L420 AbstractCegarLoop]: === Iteration 461 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1720662541, now seen corresponding path program 1 times [2022-12-13 01:58:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:28,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009794472] [2022-12-13 01:58:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:28,291 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 01:58:28,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:28,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009794472] [2022-12-13 01:58:28,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009794472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:28,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:28,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109745657] [2022-12-13 01:58:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:28,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:28,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:28,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:28,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:28,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:28,338 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:28,338 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:28,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:28,339 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:28,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:28,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:28,340 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:28,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:28,341 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:28,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:28,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:28,341 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:28,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:28,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,344 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:28,344 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:28,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:28,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:28,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:28,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:28,461 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:28,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:28,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:28,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable460 [2022-12-13 01:58:28,461 INFO L420 AbstractCegarLoop]: === Iteration 462 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:28,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1663404239, now seen corresponding path program 1 times [2022-12-13 01:58:28,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:28,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664335864] [2022-12-13 01:58:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:28,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664335864] [2022-12-13 01:58:28,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664335864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:28,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:28,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860064310] [2022-12-13 01:58:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:28,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:28,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:28,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:28,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:28,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:28,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:28,562 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:28,562 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:28,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:28,563 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:28,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:28,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:28,563 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:28,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:28,564 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:28,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:28,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:28,564 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:28,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:28,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,567 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:28,567 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:28,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:28,568 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,568 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:28,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:28,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:28,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:28,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:28,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:28,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461 [2022-12-13 01:58:28,681 INFO L420 AbstractCegarLoop]: === Iteration 463 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1606145937, now seen corresponding path program 1 times [2022-12-13 01:58:28,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:28,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408533167] [2022-12-13 01:58:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:28,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:28,733 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 01:58:28,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:28,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408533167] [2022-12-13 01:58:28,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408533167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:28,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:28,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664840938] [2022-12-13 01:58:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:28,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:28,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:28,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:28,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:28,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:28,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:28,784 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:28,784 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:28,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:28,784 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:28,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:28,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:28,785 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:28,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:28,786 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:28,786 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:28,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:28,786 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:28,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:28,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:28,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,789 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:28,789 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:28,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:28,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:28,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:28,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:28,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:28,903 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:28,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:28,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:28,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable462 [2022-12-13 01:58:28,904 INFO L420 AbstractCegarLoop]: === Iteration 464 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1548887635, now seen corresponding path program 1 times [2022-12-13 01:58:28,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:28,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229129434] [2022-12-13 01:58:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:28,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:28,953 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 01:58:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:28,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229129434] [2022-12-13 01:58:28,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229129434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:28,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:28,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418778323] [2022-12-13 01:58:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:28,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:28,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:28,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:28,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:28,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:28,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:28,998 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:28,998 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:28,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:28,999 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:28,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:28,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:28,999 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:29,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:29,000 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:29,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:29,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:29,001 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:29,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:29,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,004 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:29,004 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:29,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:29,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:29,133 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:29,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:29,133 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:29,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:29,134 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:29,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable463 [2022-12-13 01:58:29,134 INFO L420 AbstractCegarLoop]: === Iteration 465 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:29,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1491629333, now seen corresponding path program 1 times [2022-12-13 01:58:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:29,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594284095] [2022-12-13 01:58:29,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:29,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:29,185 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 01:58:29,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:29,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594284095] [2022-12-13 01:58:29,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594284095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:29,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:29,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:29,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999586295] [2022-12-13 01:58:29,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:29,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:29,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:29,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:29,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:29,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:29,239 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:29,239 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:29,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:29,240 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:29,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:29,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:29,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:29,240 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:29,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:29,241 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:29,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:29,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:29,241 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:29,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:29,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,244 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:29,244 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:29,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:29,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:29,379 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:29,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:29,380 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:29,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,380 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:29,380 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:29,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable464 [2022-12-13 01:58:29,380 INFO L420 AbstractCegarLoop]: === Iteration 466 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:29,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1434371031, now seen corresponding path program 1 times [2022-12-13 01:58:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:29,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424744007] [2022-12-13 01:58:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:29,432 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 01:58:29,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:29,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424744007] [2022-12-13 01:58:29,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424744007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:29,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:29,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:29,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002621237] [2022-12-13 01:58:29,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:29,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:29,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:29,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:29,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:29,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:29,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:29,495 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:29,496 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:29,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:29,496 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:29,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:29,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:29,497 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:29,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:29,498 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:29,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:29,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:29,498 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:29,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:29,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,501 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:29,501 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:29,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:29,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:29,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:29,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:29,637 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:29,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:29,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:29,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable465 [2022-12-13 01:58:29,638 INFO L420 AbstractCegarLoop]: === Iteration 467 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:29,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1377112729, now seen corresponding path program 1 times [2022-12-13 01:58:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:29,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804866482] [2022-12-13 01:58:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:29,708 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 01:58:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:29,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804866482] [2022-12-13 01:58:29,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804866482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:29,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:29,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224798199] [2022-12-13 01:58:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:29,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:29,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:29,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:29,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:29,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:29,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:29,769 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:29,770 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:29,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:29,770 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:29,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:29,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:29,771 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:29,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:29,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:29,772 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:29,772 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:29,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:29,772 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:29,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:29,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:29,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,775 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:29,775 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:29,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:29,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:29,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:29,908 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:29,909 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:29,909 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:29,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,909 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:29,909 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:29,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable466 [2022-12-13 01:58:29,909 INFO L420 AbstractCegarLoop]: === Iteration 468 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:29,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1319854427, now seen corresponding path program 1 times [2022-12-13 01:58:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:29,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181601200] [2022-12-13 01:58:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:29,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:29,972 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 01:58:29,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:29,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181601200] [2022-12-13 01:58:29,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181601200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:29,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:29,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378972054] [2022-12-13 01:58:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:29,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:29,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:29,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:29,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:29,973 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:29,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:29,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:29,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:29,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:30,036 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:30,037 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:30,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:30,037 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:30,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:30,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:30,038 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:30,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:30,039 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:30,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:30,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:30,039 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:30,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:30,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,042 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:30,042 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:30,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:30,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:30,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:30,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:30,176 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:30,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:30,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:30,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable467 [2022-12-13 01:58:30,176 INFO L420 AbstractCegarLoop]: === Iteration 469 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1262596125, now seen corresponding path program 1 times [2022-12-13 01:58:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:30,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225179635] [2022-12-13 01:58:30,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:30,230 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 01:58:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:30,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225179635] [2022-12-13 01:58:30,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225179635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:30,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:30,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:30,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734917165] [2022-12-13 01:58:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:30,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:30,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:30,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:30,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:30,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:30,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:30,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:30,284 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:30,284 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:30,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:30,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:30,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:30,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:30,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:30,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:30,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:30,286 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:30,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:30,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:30,287 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:30,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:30,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,291 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:30,291 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:30,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:30,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:30,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:30,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:30,424 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:30,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:30,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:30,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable468 [2022-12-13 01:58:30,424 INFO L420 AbstractCegarLoop]: === Iteration 470 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:30,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1205337823, now seen corresponding path program 1 times [2022-12-13 01:58:30,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:30,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808343523] [2022-12-13 01:58:30,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:30,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:30,482 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 01:58:30,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:30,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808343523] [2022-12-13 01:58:30,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808343523] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:30,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:30,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121990492] [2022-12-13 01:58:30,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:30,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:30,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:30,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:30,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:30,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:30,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:30,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:30,537 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:30,538 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:30,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:30,538 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:30,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:30,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:30,539 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:30,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:30,539 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:30,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:30,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:30,540 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:30,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:30,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,543 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:30,543 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:30,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:30,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:30,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:30,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:30,666 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:30,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:30,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:30,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable469 [2022-12-13 01:58:30,666 INFO L420 AbstractCegarLoop]: === Iteration 471 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1148079521, now seen corresponding path program 1 times [2022-12-13 01:58:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:30,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047342050] [2022-12-13 01:58:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:30,714 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 01:58:30,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:30,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047342050] [2022-12-13 01:58:30,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047342050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:30,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:30,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:30,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740730231] [2022-12-13 01:58:30,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:30,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:30,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:30,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:30,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:30,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:30,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:30,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:30,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:30,763 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:30,763 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:30,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:30,764 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:30,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:30,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:30,765 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:30,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:30,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:30,766 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:30,766 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:30,766 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:30,766 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:30,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:30,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:30,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,769 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:30,769 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:30,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:30,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:30,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:30,909 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:30,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 01:58:30,910 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:30,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:30,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:30,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470 [2022-12-13 01:58:30,910 INFO L420 AbstractCegarLoop]: === Iteration 472 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:30,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:30,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1090821219, now seen corresponding path program 1 times [2022-12-13 01:58:30,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:30,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098923721] [2022-12-13 01:58:30,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:30,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:30,981 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 01:58:30,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098923721] [2022-12-13 01:58:30,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098923721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:30,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:30,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469240245] [2022-12-13 01:58:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:30,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:30,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:30,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:30,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:30,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:31,044 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:31,044 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:31,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:31,045 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:31,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:31,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:31,045 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:31,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:31,046 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,046 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:31,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:31,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:31,047 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:31,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:31,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,050 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:31,050 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:31,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:31,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:31,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:31,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:58:31,192 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:31,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:31,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:31,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable471 [2022-12-13 01:58:31,192 INFO L420 AbstractCegarLoop]: === Iteration 473 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:31,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1033562917, now seen corresponding path program 1 times [2022-12-13 01:58:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:31,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977264231] [2022-12-13 01:58:31,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:31,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:31,261 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 01:58:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977264231] [2022-12-13 01:58:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977264231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581357654] [2022-12-13 01:58:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:31,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:31,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:31,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:31,315 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:31,315 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:31,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:31,316 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:31,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:31,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:31,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:31,316 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:31,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:31,317 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:31,317 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:31,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:31,317 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:31,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:31,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,320 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:31,320 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:31,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:31,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:31,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:31,453 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:31,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:31,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:31,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable472 [2022-12-13 01:58:31,454 INFO L420 AbstractCegarLoop]: === Iteration 474 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:31,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -976304615, now seen corresponding path program 1 times [2022-12-13 01:58:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:31,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070494801] [2022-12-13 01:58:31,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:31,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:31,505 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 01:58:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:31,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070494801] [2022-12-13 01:58:31,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070494801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:31,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:31,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:31,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267201924] [2022-12-13 01:58:31,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:31,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:31,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:31,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:31,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:31,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:31,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:31,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:31,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:31,558 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:31,558 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:31,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:31,559 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:31,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:31,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:31,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:31,560 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:31,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:31,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:31,561 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:31,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:31,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:31,564 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:31,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:31,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:31,689 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:31,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:31,690 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:31,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:31,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:31,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable473 [2022-12-13 01:58:31,690 INFO L420 AbstractCegarLoop]: === Iteration 475 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:31,690 INFO L85 PathProgramCache]: Analyzing trace with hash -919046313, now seen corresponding path program 1 times [2022-12-13 01:58:31,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:31,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292534846] [2022-12-13 01:58:31,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:31,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 01:58:31,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:31,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292534846] [2022-12-13 01:58:31,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292534846] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:31,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:31,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103130747] [2022-12-13 01:58:31,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:31,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:31,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:31,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:31,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:31,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:31,781 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:31,782 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:31,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:31,782 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:31,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:31,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:31,783 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:31,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:31,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:31,784 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:31,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:31,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:31,784 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:31,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:31,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:31,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,787 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:31,787 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:31,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:31,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:31,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:31,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:31,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:31,903 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:31,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:31,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:31,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable474 [2022-12-13 01:58:31,903 INFO L420 AbstractCegarLoop]: === Iteration 476 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash -861788011, now seen corresponding path program 1 times [2022-12-13 01:58:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491378100] [2022-12-13 01:58:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:31,953 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 01:58:31,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:31,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491378100] [2022-12-13 01:58:31,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491378100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:31,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:31,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817096137] [2022-12-13 01:58:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:31,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:31,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:31,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:31,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:31,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:31,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:31,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:32,004 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:32,004 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:32,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:32,005 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:32,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:32,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:32,005 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:32,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:32,006 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,006 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:32,006 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:32,006 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:32,006 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:32,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:32,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,009 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:32,009 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:32,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:32,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:32,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:32,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:32,138 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:32,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:32,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:32,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable475 [2022-12-13 01:58:32,139 INFO L420 AbstractCegarLoop]: === Iteration 477 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash -804529709, now seen corresponding path program 1 times [2022-12-13 01:58:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:32,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792017250] [2022-12-13 01:58:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:32,204 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 01:58:32,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:32,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792017250] [2022-12-13 01:58:32,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792017250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:32,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:32,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007684978] [2022-12-13 01:58:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:32,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:32,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:32,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:32,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:32,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:32,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:32,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:32,264 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:32,264 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:32,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:32,265 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:32,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:32,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:32,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:32,266 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:32,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:32,267 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:32,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:32,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:32,267 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:32,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:32,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,271 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:32,271 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:32,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:32,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:32,405 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:32,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:32,406 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:32,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:32,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:32,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable476 [2022-12-13 01:58:32,406 INFO L420 AbstractCegarLoop]: === Iteration 478 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash -747271407, now seen corresponding path program 1 times [2022-12-13 01:58:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:32,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081316567] [2022-12-13 01:58:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:32,463 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 01:58:32,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:32,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081316567] [2022-12-13 01:58:32,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081316567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:32,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:32,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:32,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237701378] [2022-12-13 01:58:32,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:32,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:32,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:32,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:32,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:32,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:32,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:32,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:32,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:32,518 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:32,518 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:32,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:32,518 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:32,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:32,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:32,519 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:32,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:32,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:32,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:32,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:32,520 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:32,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:32,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,525 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:32,525 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:32,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:32,525 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,525 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:32,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:32,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:58:32,650 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:32,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:32,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:32,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable477 [2022-12-13 01:58:32,650 INFO L420 AbstractCegarLoop]: === Iteration 479 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash -690013105, now seen corresponding path program 1 times [2022-12-13 01:58:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:32,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237531643] [2022-12-13 01:58:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:32,700 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 01:58:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237531643] [2022-12-13 01:58:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237531643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:32,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797773367] [2022-12-13 01:58:32,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:32,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:32,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:32,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:32,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:32,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:32,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:32,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:32,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:32,743 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:32,743 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:32,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:32,744 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:32,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:32,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:32,744 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:32,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:32,745 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:32,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:32,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:32,745 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:32,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:32,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,748 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:32,748 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:32,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:32,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,749 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:32,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:32,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:32,862 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:32,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:32,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:32,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable478 [2022-12-13 01:58:32,862 INFO L420 AbstractCegarLoop]: === Iteration 480 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:32,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:32,862 INFO L85 PathProgramCache]: Analyzing trace with hash -632754803, now seen corresponding path program 1 times [2022-12-13 01:58:32,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:32,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399551831] [2022-12-13 01:58:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:32,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:32,911 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 01:58:32,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:32,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399551831] [2022-12-13 01:58:32,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399551831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:32,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:32,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:32,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830214467] [2022-12-13 01:58:32,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:32,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:32,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:32,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:32,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:32,912 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:32,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:32,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:32,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:32,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:32,962 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:32,962 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:32,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:32,963 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:32,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:32,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:32,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:32,964 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:32,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:32,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:32,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:32,965 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:32,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:32,965 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:32,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:32,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:32,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:32,968 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:32,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:32,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:32,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:33,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:33,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:33,083 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:33,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:33,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:33,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable479 [2022-12-13 01:58:33,083 INFO L420 AbstractCegarLoop]: === Iteration 481 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,083 INFO L85 PathProgramCache]: Analyzing trace with hash -575496501, now seen corresponding path program 1 times [2022-12-13 01:58:33,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826895881] [2022-12-13 01:58:33,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,131 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 01:58:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:33,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826895881] [2022-12-13 01:58:33,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826895881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:33,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:33,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321833435] [2022-12-13 01:58:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:33,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:33,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:33,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:33,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:33,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:33,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:33,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:33,175 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:33,175 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:33,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:33,175 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:33,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:33,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:33,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:33,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:33,176 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:33,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:33,177 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:33,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:33,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:33,177 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:33,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:33,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,180 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:33,180 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:33,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:33,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:33,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:33,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:33,294 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:33,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:33,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:33,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable480 [2022-12-13 01:58:33,294 INFO L420 AbstractCegarLoop]: === Iteration 482 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,294 INFO L85 PathProgramCache]: Analyzing trace with hash -518238199, now seen corresponding path program 1 times [2022-12-13 01:58:33,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115280473] [2022-12-13 01:58:33,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,344 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 01:58:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:33,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115280473] [2022-12-13 01:58:33,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115280473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:33,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:33,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389425927] [2022-12-13 01:58:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:33,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:33,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:33,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:33,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:33,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:33,388 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:33,388 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:33,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:33,388 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:33,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:33,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:33,389 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:33,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:33,390 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:33,390 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:33,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:33,390 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:33,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:33,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,393 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:33,393 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:33,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:33,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:33,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:33,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:58:33,514 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:33,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:33,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:33,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable481 [2022-12-13 01:58:33,514 INFO L420 AbstractCegarLoop]: === Iteration 483 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,514 INFO L85 PathProgramCache]: Analyzing trace with hash -460979897, now seen corresponding path program 1 times [2022-12-13 01:58:33,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659629245] [2022-12-13 01:58:33,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,564 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 01:58:33,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:33,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659629245] [2022-12-13 01:58:33,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659629245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:33,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:33,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:33,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123583305] [2022-12-13 01:58:33,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:33,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:33,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:33,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:33,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:33,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:33,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:33,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:33,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:33,615 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:33,615 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:33,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:33,615 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:33,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:33,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:33,616 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:33,616 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:33,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:33,617 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,617 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:33,617 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:33,617 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:33,617 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,617 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:33,617 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:33,617 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,620 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:33,620 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:33,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:33,620 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,620 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:33,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:33,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:33,733 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:33,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:33,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:33,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable482 [2022-12-13 01:58:33,733 INFO L420 AbstractCegarLoop]: === Iteration 484 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash -403721595, now seen corresponding path program 1 times [2022-12-13 01:58:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649688830] [2022-12-13 01:58:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:33,795 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 01:58:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:33,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649688830] [2022-12-13 01:58:33,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649688830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:33,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:33,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975136240] [2022-12-13 01:58:33,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:33,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:33,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:33,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:33,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:33,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:33,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:33,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:33,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:33,845 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:33,846 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:33,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:33,846 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:33,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:33,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:33,847 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:33,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:33,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:33,847 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:33,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:33,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:33,848 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:33,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:33,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:33,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,851 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:33,851 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:33,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:33,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:33,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:33,971 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:33,972 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:58:33,972 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:33,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:33,972 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:33,972 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:33,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable483 [2022-12-13 01:58:33,973 INFO L420 AbstractCegarLoop]: === Iteration 485 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:33,973 INFO L85 PathProgramCache]: Analyzing trace with hash -346463293, now seen corresponding path program 1 times [2022-12-13 01:58:33,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:33,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547625559] [2022-12-13 01:58:33,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:33,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:34,026 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 01:58:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547625559] [2022-12-13 01:58:34,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547625559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:34,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:34,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588268257] [2022-12-13 01:58:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:34,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:34,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:34,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:34,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:34,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:34,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:34,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:34,079 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:34,079 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:34,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:34,080 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:34,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:34,080 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:34,080 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:34,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:34,081 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,081 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:34,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:34,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:34,082 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,082 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:34,082 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:34,082 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,084 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:34,085 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:34,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:34,085 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,085 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:34,203 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:34,203 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:58:34,203 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:34,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,204 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:34,204 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:34,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable484 [2022-12-13 01:58:34,204 INFO L420 AbstractCegarLoop]: === Iteration 486 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:34,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -289204991, now seen corresponding path program 1 times [2022-12-13 01:58:34,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:34,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025014428] [2022-12-13 01:58:34,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:34,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 01:58:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:34,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025014428] [2022-12-13 01:58:34,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025014428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:34,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:34,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705764474] [2022-12-13 01:58:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:34,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:34,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:34,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:34,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:34,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:34,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:34,304 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:34,304 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:34,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:34,305 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:34,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:34,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:34,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:34,305 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:34,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:34,306 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:34,307 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:34,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:34,307 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:34,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:34,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,310 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:34,310 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:34,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:34,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:34,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:34,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:34,425 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:34,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:34,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:34,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable485 [2022-12-13 01:58:34,425 INFO L420 AbstractCegarLoop]: === Iteration 487 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:34,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash -231946689, now seen corresponding path program 1 times [2022-12-13 01:58:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:34,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719530513] [2022-12-13 01:58:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:34,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:34,483 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 01:58:34,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:34,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719530513] [2022-12-13 01:58:34,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719530513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:34,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:34,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284842656] [2022-12-13 01:58:34,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:34,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:34,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:34,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:34,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:34,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:34,532 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:34,532 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:34,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:34,532 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:34,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:34,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:34,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:34,533 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:34,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:34,534 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:34,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:34,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:34,534 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:34,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:34,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,537 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:34,537 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:34,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:34,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:34,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:34,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:58:34,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:34,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:34,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:34,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable486 [2022-12-13 01:58:34,661 INFO L420 AbstractCegarLoop]: === Iteration 488 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:34,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash -174688387, now seen corresponding path program 1 times [2022-12-13 01:58:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:34,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791863754] [2022-12-13 01:58:34,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:34,711 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 01:58:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:34,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791863754] [2022-12-13 01:58:34,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791863754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:34,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:34,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:34,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145466530] [2022-12-13 01:58:34,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:34,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:34,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:34,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:34,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:34,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:34,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:34,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:34,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:34,761 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:34,761 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:34,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:34,761 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:34,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:34,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:34,762 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:34,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:34,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:34,763 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:34,763 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:34,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:34,763 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:34,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:34,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:34,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,767 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:34,767 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:34,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:34,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:34,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:34,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:34,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:34,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:34,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:34,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:34,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable487 [2022-12-13 01:58:34,895 INFO L420 AbstractCegarLoop]: === Iteration 489 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -117430085, now seen corresponding path program 1 times [2022-12-13 01:58:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:34,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282350357] [2022-12-13 01:58:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:34,955 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 01:58:34,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:34,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282350357] [2022-12-13 01:58:34,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282350357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:34,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:34,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:34,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785019041] [2022-12-13 01:58:34,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:34,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:34,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:34,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:34,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:34,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:34,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:34,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:34,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:35,016 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:35,016 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:35,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:35,017 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:35,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:35,018 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:35,018 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:35,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:35,018 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,018 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:35,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:35,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:35,019 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:35,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:35,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,022 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:35,022 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:35,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:35,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:35,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:35,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:58:35,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:35,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:35,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:35,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable488 [2022-12-13 01:58:35,150 INFO L420 AbstractCegarLoop]: === Iteration 490 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:35,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash -60171783, now seen corresponding path program 1 times [2022-12-13 01:58:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:35,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250531887] [2022-12-13 01:58:35,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:35,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:35,213 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 01:58:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:35,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250531887] [2022-12-13 01:58:35,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250531887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:35,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:35,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138448517] [2022-12-13 01:58:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:35,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:35,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:35,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:35,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:35,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:35,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:35,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:35,266 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:35,266 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:35,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:35,267 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:35,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:35,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:35,267 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:35,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:35,268 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:35,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:35,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:35,268 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:35,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:35,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,271 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:35,271 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:35,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:35,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:35,400 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:35,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:58:35,401 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:35,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:35,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:35,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable489 [2022-12-13 01:58:35,401 INFO L420 AbstractCegarLoop]: === Iteration 491 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:35,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2913481, now seen corresponding path program 1 times [2022-12-13 01:58:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:35,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122364826] [2022-12-13 01:58:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:35,462 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 01:58:35,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:35,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122364826] [2022-12-13 01:58:35,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122364826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:35,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:35,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:35,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344524374] [2022-12-13 01:58:35,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:35,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:35,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:35,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:35,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:35,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:35,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:35,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:35,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:35,514 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:35,514 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:35,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:35,515 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:35,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:35,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:35,516 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:35,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:35,516 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:35,517 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:35,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:35,517 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:35,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:35,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,520 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:35,520 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:35,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:35,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:35,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:35,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:35,648 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:35,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:35,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:35,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable490 [2022-12-13 01:58:35,648 INFO L420 AbstractCegarLoop]: === Iteration 492 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:35,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash 54344821, now seen corresponding path program 1 times [2022-12-13 01:58:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:35,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622692649] [2022-12-13 01:58:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:35,722 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 01:58:35,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:35,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622692649] [2022-12-13 01:58:35,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622692649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:35,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:35,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:35,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382998812] [2022-12-13 01:58:35,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:35,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:35,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:35,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:35,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:35,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:35,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:35,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:35,784 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:35,784 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:35,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:35,784 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:35,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:35,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:35,785 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:35,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:35,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:35,786 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:35,786 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:35,786 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:35,786 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:35,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:35,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:35,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,789 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:35,789 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:35,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:35,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:35,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:35,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:35,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:58:35,916 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:35,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:35,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:35,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable491 [2022-12-13 01:58:35,917 INFO L420 AbstractCegarLoop]: === Iteration 493 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:35,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash 111603123, now seen corresponding path program 1 times [2022-12-13 01:58:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:35,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564986577] [2022-12-13 01:58:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:35,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:35,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564986577] [2022-12-13 01:58:35,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564986577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:35,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:35,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401994453] [2022-12-13 01:58:35,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:35,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:35,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:35,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:35,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:35,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:35,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:35,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:35,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:35,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:36,056 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:36,056 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:36,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:36,057 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:36,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:36,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:36,057 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:36,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:36,058 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:36,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:36,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:36,058 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:36,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:36,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:36,061 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:36,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:36,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:36,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:36,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 01:58:36,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:36,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:36,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:36,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable492 [2022-12-13 01:58:36,205 INFO L420 AbstractCegarLoop]: === Iteration 494 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:36,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:36,206 INFO L85 PathProgramCache]: Analyzing trace with hash 168861425, now seen corresponding path program 1 times [2022-12-13 01:58:36,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:36,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983243028] [2022-12-13 01:58:36,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:36,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:36,256 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 01:58:36,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:36,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983243028] [2022-12-13 01:58:36,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983243028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:36,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:36,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002430932] [2022-12-13 01:58:36,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:36,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:36,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:36,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:36,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:36,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:36,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:36,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:36,301 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:36,301 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:36,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:36,302 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:36,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:36,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:36,303 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:36,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:36,303 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:36,304 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:36,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:36,304 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:36,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:36,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,307 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:36,307 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:36,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:36,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:36,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:36,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:36,429 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:36,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:36,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:36,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493 [2022-12-13 01:58:36,429 INFO L420 AbstractCegarLoop]: === Iteration 495 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash 226119727, now seen corresponding path program 1 times [2022-12-13 01:58:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:36,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218755503] [2022-12-13 01:58:36,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:36,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:36,480 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 01:58:36,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:36,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218755503] [2022-12-13 01:58:36,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218755503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:36,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:36,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237929829] [2022-12-13 01:58:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:36,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:36,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:36,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:36,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:36,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:36,524 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:36,524 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:36,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:36,525 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:36,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:36,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:36,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:36,525 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:36,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:36,526 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:36,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:36,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:36,527 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:36,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:36,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,529 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:36,530 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:36,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:36,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:36,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:36,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:36,656 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:36,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:36,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:36,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable494 [2022-12-13 01:58:36,656 INFO L420 AbstractCegarLoop]: === Iteration 496 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:36,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash 283378029, now seen corresponding path program 1 times [2022-12-13 01:58:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432194621] [2022-12-13 01:58:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:36,723 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 01:58:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:36,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432194621] [2022-12-13 01:58:36,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432194621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:36,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:36,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521366316] [2022-12-13 01:58:36,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:36,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:36,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:36,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:36,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:36,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:36,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:36,785 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:36,785 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:36,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:36,786 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:36,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:36,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:36,787 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:36,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:36,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:36,788 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:36,788 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:36,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:36,788 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,788 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:36,788 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:36,788 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:36,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,791 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:36,791 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:36,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:36,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:36,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:36,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:36,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:36,925 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:36,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:36,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:36,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable495 [2022-12-13 01:58:36,926 INFO L420 AbstractCegarLoop]: === Iteration 497 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:36,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash 340636331, now seen corresponding path program 1 times [2022-12-13 01:58:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:36,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2542543] [2022-12-13 01:58:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:36,995 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 01:58:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:36,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2542543] [2022-12-13 01:58:36,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2542543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:36,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:36,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:36,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049066764] [2022-12-13 01:58:36,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:36,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:36,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:36,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:36,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:36,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:36,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:36,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:37,058 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:37,058 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:37,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:37,059 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:37,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:37,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:37,059 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:37,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:37,060 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,060 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:37,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:37,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:37,060 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:37,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:37,061 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,063 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:37,063 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:37,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:37,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:37,205 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:37,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:58:37,206 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:37,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:37,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:37,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable496 [2022-12-13 01:58:37,206 INFO L420 AbstractCegarLoop]: === Iteration 498 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash 397894633, now seen corresponding path program 1 times [2022-12-13 01:58:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639210432] [2022-12-13 01:58:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:37,275 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 01:58:37,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:37,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639210432] [2022-12-13 01:58:37,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639210432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:37,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:37,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:37,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92526580] [2022-12-13 01:58:37,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:37,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:37,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:37,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:37,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:37,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:37,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:37,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:37,332 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:37,332 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:37,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:37,333 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:37,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:37,334 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:37,334 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:37,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:37,335 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:37,335 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:37,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:37,336 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:37,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:37,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,340 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:37,340 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:37,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:37,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:37,470 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:37,471 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:37,471 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:37,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,471 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:37,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:37,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable497 [2022-12-13 01:58:37,471 INFO L420 AbstractCegarLoop]: === Iteration 499 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:37,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:37,471 INFO L85 PathProgramCache]: Analyzing trace with hash 455152935, now seen corresponding path program 1 times [2022-12-13 01:58:37,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:37,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567033022] [2022-12-13 01:58:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:37,525 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 01:58:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567033022] [2022-12-13 01:58:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567033022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:37,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:37,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:37,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715935133] [2022-12-13 01:58:37,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:37,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:37,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:37,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:37,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:37,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:37,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:37,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:37,586 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:37,587 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:37,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:37,587 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:37,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:37,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:37,588 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:37,588 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:37,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:37,589 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,589 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:37,589 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:37,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:37,589 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,589 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:37,589 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:37,589 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,592 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:37,592 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:37,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:37,592 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,592 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:37,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:37,725 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:37,725 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:37,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:37,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:37,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable498 [2022-12-13 01:58:37,726 INFO L420 AbstractCegarLoop]: === Iteration 500 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:37,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash 512411237, now seen corresponding path program 1 times [2022-12-13 01:58:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:37,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093071270] [2022-12-13 01:58:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:37,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:37,792 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 01:58:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093071270] [2022-12-13 01:58:37,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093071270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:37,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:37,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:37,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863615456] [2022-12-13 01:58:37,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:37,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:37,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:37,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:37,793 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:37,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:37,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:37,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:37,848 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:37,848 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:37,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:37,848 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:37,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:37,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:37,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:37,849 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:37,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:37,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:37,850 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,850 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:37,850 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:37,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:37,850 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:37,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:37,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:37,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,853 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:37,853 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:37,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:37,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:37,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:37,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:37,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:37,984 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:37,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:37,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:37,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:37,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable499 [2022-12-13 01:58:37,985 INFO L420 AbstractCegarLoop]: === Iteration 501 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:37,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:37,985 INFO L85 PathProgramCache]: Analyzing trace with hash 569669539, now seen corresponding path program 1 times [2022-12-13 01:58:37,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:37,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817768918] [2022-12-13 01:58:37,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:37,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:38,065 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 01:58:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:38,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817768918] [2022-12-13 01:58:38,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817768918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:38,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:38,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242486058] [2022-12-13 01:58:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:38,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:38,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:38,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:38,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:38,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:38,121 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:38,121 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:38,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:38,122 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:38,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:38,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:38,122 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:38,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:38,123 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:38,123 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:38,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:38,123 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,124 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:38,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:38,124 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,126 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:38,126 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:38,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:38,127 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,127 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:38,260 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:38,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:58:38,261 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:38,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,261 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:38,261 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:38,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable500 [2022-12-13 01:58:38,261 INFO L420 AbstractCegarLoop]: === Iteration 502 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:38,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:38,261 INFO L85 PathProgramCache]: Analyzing trace with hash 626927841, now seen corresponding path program 1 times [2022-12-13 01:58:38,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:38,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239894211] [2022-12-13 01:58:38,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:38,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:38,323 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 01:58:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:38,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239894211] [2022-12-13 01:58:38,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239894211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:38,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:38,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617907804] [2022-12-13 01:58:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:38,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:38,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:38,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:38,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:38,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:38,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:38,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:38,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:38,385 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:38,385 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:38,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:38,386 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:38,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:38,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:38,387 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:38,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:38,387 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:38,388 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:38,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:38,388 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:38,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:38,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,391 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:38,391 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:38,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:38,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:38,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:38,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:38,522 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:38,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:38,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:38,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable501 [2022-12-13 01:58:38,523 INFO L420 AbstractCegarLoop]: === Iteration 503 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:38,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:38,523 INFO L85 PathProgramCache]: Analyzing trace with hash 684186143, now seen corresponding path program 1 times [2022-12-13 01:58:38,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:38,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134812165] [2022-12-13 01:58:38,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:38,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:38,588 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 01:58:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:38,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134812165] [2022-12-13 01:58:38,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134812165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:38,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:38,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:38,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884104770] [2022-12-13 01:58:38,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:38,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:38,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:38,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:38,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:38,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:38,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:38,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:38,642 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:38,642 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:38,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:38,643 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:38,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:38,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:38,644 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:38,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:38,645 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:38,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:38,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:38,645 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:38,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:38,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,648 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:38,648 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:38,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:38,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:38,778 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:38,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:38,779 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:38,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:38,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:38,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable502 [2022-12-13 01:58:38,780 INFO L420 AbstractCegarLoop]: === Iteration 504 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash 741444445, now seen corresponding path program 1 times [2022-12-13 01:58:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:38,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621901165] [2022-12-13 01:58:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:38,833 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 01:58:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:38,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621901165] [2022-12-13 01:58:38,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621901165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:38,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:38,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444023680] [2022-12-13 01:58:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:38,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:38,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:38,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:38,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:38,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:38,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:38,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:38,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:38,895 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:38,895 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:38,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:38,896 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:38,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:38,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:38,896 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:38,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:38,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:38,897 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,897 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:38,897 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:38,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:38,898 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:38,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:38,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:38,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,900 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:38,900 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:38,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:38,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:38,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:39,031 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:39,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:39,032 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:39,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:39,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:39,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable503 [2022-12-13 01:58:39,033 INFO L420 AbstractCegarLoop]: === Iteration 505 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash 798702747, now seen corresponding path program 1 times [2022-12-13 01:58:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:39,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773374350] [2022-12-13 01:58:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:39,086 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 01:58:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:39,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773374350] [2022-12-13 01:58:39,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773374350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:39,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:39,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984801223] [2022-12-13 01:58:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:39,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:39,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:39,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:39,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:39,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:39,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:39,148 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:39,148 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:39,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:39,149 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:39,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:39,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:39,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:39,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:39,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:39,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:39,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:39,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:39,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:39,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,153 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:39,153 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:39,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:39,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:39,284 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:39,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:39,285 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:39,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:39,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:39,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable504 [2022-12-13 01:58:39,285 INFO L420 AbstractCegarLoop]: === Iteration 506 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:39,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 855961049, now seen corresponding path program 1 times [2022-12-13 01:58:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:39,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099649012] [2022-12-13 01:58:39,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:39,351 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 01:58:39,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:39,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099649012] [2022-12-13 01:58:39,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099649012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:39,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:39,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:39,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439597325] [2022-12-13 01:58:39,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:39,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:39,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:39,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:39,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:39,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:39,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:39,413 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:39,413 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:39,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:39,414 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:39,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:39,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:39,414 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:39,415 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:39,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:39,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:39,415 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,416 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:39,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:39,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,418 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:39,418 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:39,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:39,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:39,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:39,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:39,550 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:39,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:39,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:39,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable505 [2022-12-13 01:58:39,550 INFO L420 AbstractCegarLoop]: === Iteration 507 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:39,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash 913219351, now seen corresponding path program 1 times [2022-12-13 01:58:39,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:39,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986944851] [2022-12-13 01:58:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:39,604 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 01:58:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986944851] [2022-12-13 01:58:39,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986944851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:39,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:39,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123784729] [2022-12-13 01:58:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:39,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:39,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:39,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:39,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:39,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:39,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:39,668 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:39,668 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:39,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:39,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:39,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:39,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:39,669 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:39,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:39,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:39,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:39,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:39,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:39,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:39,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,674 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:39,674 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:39,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:39,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:39,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:39,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:39,809 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:39,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable506 [2022-12-13 01:58:39,809 INFO L420 AbstractCegarLoop]: === Iteration 508 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash 970477653, now seen corresponding path program 1 times [2022-12-13 01:58:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583262514] [2022-12-13 01:58:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:39,873 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 01:58:39,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:39,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583262514] [2022-12-13 01:58:39,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583262514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:39,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:39,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:39,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230934792] [2022-12-13 01:58:39,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:39,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:39,874 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:39,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:39,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:39,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:39,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:39,935 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:39,935 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:39,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:39,936 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:39,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:39,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:39,937 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:39,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:39,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:39,938 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:39,938 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:39,938 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:39,938 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:39,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:39,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:39,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,941 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:39,941 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:39,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:39,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:39,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:40,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:40,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:40,074 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:40,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:40,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:40,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable507 [2022-12-13 01:58:40,075 INFO L420 AbstractCegarLoop]: === Iteration 509 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1027735955, now seen corresponding path program 1 times [2022-12-13 01:58:40,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:40,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198625777] [2022-12-13 01:58:40,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:40,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:40,130 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 01:58:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:40,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198625777] [2022-12-13 01:58:40,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198625777] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:40,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:40,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:40,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242688272] [2022-12-13 01:58:40,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:40,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:40,131 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:40,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:40,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:40,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:40,183 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:40,183 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:40,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:40,184 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:40,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:40,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:40,184 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:40,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:40,185 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:40,185 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:40,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:40,185 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:40,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:40,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,188 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:40,188 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:40,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:40,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:40,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:40,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:40,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:40,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:40,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:40,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable508 [2022-12-13 01:58:40,324 INFO L420 AbstractCegarLoop]: === Iteration 510 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:40,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1084994257, now seen corresponding path program 1 times [2022-12-13 01:58:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:40,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855680847] [2022-12-13 01:58:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:40,393 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 01:58:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:40,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855680847] [2022-12-13 01:58:40,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855680847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:40,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:40,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033559763] [2022-12-13 01:58:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:40,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:40,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:40,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:40,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:40,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:40,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:40,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:40,444 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:40,444 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:40,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:40,445 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:40,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:40,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:40,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:40,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:40,445 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:40,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:40,446 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:40,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:40,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:40,447 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:40,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:40,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,450 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:40,450 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:40,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:40,450 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,450 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:40,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:40,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:40,579 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:40,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:40,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:40,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable509 [2022-12-13 01:58:40,579 INFO L420 AbstractCegarLoop]: === Iteration 511 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:40,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:40,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1142252559, now seen corresponding path program 1 times [2022-12-13 01:58:40,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:40,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561403026] [2022-12-13 01:58:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:40,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:40,639 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 01:58:40,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:40,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561403026] [2022-12-13 01:58:40,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561403026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:40,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:40,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:40,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667274601] [2022-12-13 01:58:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:40,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:40,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:40,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:40,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:40,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:40,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:40,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:40,696 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:40,696 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:40,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:40,697 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:40,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:40,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:40,698 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:40,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:40,699 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:40,699 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:40,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:40,699 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:40,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:40,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:40,703 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:40,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:40,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:40,828 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:40,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:40,829 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:40,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:40,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:40,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable510 [2022-12-13 01:58:40,829 INFO L420 AbstractCegarLoop]: === Iteration 512 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:40,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1199510861, now seen corresponding path program 1 times [2022-12-13 01:58:40,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:40,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932094491] [2022-12-13 01:58:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:40,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:40,886 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 01:58:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:40,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932094491] [2022-12-13 01:58:40,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932094491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:40,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:40,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714781271] [2022-12-13 01:58:40,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:40,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:40,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:40,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:40,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:40,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:40,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:40,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:40,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:40,950 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:40,951 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:40,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:40,951 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:40,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:40,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:40,952 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:40,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:40,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:40,952 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:40,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:40,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:40,953 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:40,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:40,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:40,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,956 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:40,956 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:40,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:40,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:40,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:41,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:41,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:58:41,076 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:41,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:41,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:41,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable511 [2022-12-13 01:58:41,076 INFO L420 AbstractCegarLoop]: === Iteration 513 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1256769163, now seen corresponding path program 1 times [2022-12-13 01:58:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:41,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019911640] [2022-12-13 01:58:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:41,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:41,128 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 01:58:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:41,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019911640] [2022-12-13 01:58:41,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019911640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:41,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:41,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:41,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544612807] [2022-12-13 01:58:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:41,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:41,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:41,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:41,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:41,129 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:41,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:41,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:41,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:41,172 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:41,172 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:41,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:41,185 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:41,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:41,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:41,185 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:41,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:41,186 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:41,186 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:41,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:41,187 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:41,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:41,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,190 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:41,190 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:41,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:41,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:41,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:41,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:41,320 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:41,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:41,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:41,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable512 [2022-12-13 01:58:41,320 INFO L420 AbstractCegarLoop]: === Iteration 514 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:41,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1314027465, now seen corresponding path program 1 times [2022-12-13 01:58:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:41,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256626723] [2022-12-13 01:58:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:41,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 01:58:41,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:41,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256626723] [2022-12-13 01:58:41,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256626723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:41,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:41,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793458251] [2022-12-13 01:58:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:41,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:41,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:41,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:41,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:41,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:41,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:41,418 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:41,419 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:41,419 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:41,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:41,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:41,420 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:41,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:41,420 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:41,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:41,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:41,421 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:41,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:41,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,424 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:41,424 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:41,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:41,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:41,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:41,541 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:41,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:41,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable513 [2022-12-13 01:58:41,542 INFO L420 AbstractCegarLoop]: === Iteration 515 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1371285767, now seen corresponding path program 1 times [2022-12-13 01:58:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:41,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864766141] [2022-12-13 01:58:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:41,592 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 01:58:41,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:41,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864766141] [2022-12-13 01:58:41,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864766141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:41,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:41,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443576982] [2022-12-13 01:58:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:41,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:41,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:41,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:41,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:41,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:41,637 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:41,637 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:41,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:41,638 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:41,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:41,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:41,638 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:41,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:41,639 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:41,639 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:41,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:41,639 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:41,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:41,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,642 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:41,642 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:41,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:41,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:41,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:41,757 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:41,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:41,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:41,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable514 [2022-12-13 01:58:41,757 INFO L420 AbstractCegarLoop]: === Iteration 516 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:41,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1428544069, now seen corresponding path program 1 times [2022-12-13 01:58:41,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:41,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216385248] [2022-12-13 01:58:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:41,805 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 01:58:41,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:41,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216385248] [2022-12-13 01:58:41,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216385248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:41,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:41,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145165146] [2022-12-13 01:58:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:41,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:41,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:41,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:41,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:41,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:41,857 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:41,857 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:41,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:41,858 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:41,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:41,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:41,858 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:41,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:41,859 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:41,859 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:41,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:41,859 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:41,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:41,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:41,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,862 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:41,862 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:41,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:41,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:41,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:41,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:41,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:41,978 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:41,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:41,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:41,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:41,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable515 [2022-12-13 01:58:41,978 INFO L420 AbstractCegarLoop]: === Iteration 517 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1485802371, now seen corresponding path program 1 times [2022-12-13 01:58:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:41,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035080026] [2022-12-13 01:58:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:42,027 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 01:58:42,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:42,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035080026] [2022-12-13 01:58:42,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035080026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:42,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:42,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319421685] [2022-12-13 01:58:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:42,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:42,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:42,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:42,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:42,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:42,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:42,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:42,072 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:42,072 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:42,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:42,073 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:42,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:42,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:42,073 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:42,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:42,074 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:42,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:42,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:42,075 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:42,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:42,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,078 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:42,078 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:42,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:42,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:42,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:42,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:58:42,196 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:42,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:42,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:42,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable516 [2022-12-13 01:58:42,196 INFO L420 AbstractCegarLoop]: === Iteration 518 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1543060673, now seen corresponding path program 1 times [2022-12-13 01:58:42,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:42,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238461205] [2022-12-13 01:58:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:42,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:42,248 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 01:58:42,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:42,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238461205] [2022-12-13 01:58:42,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238461205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:42,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:42,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619298644] [2022-12-13 01:58:42,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:42,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:42,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:42,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:42,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:42,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:42,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:42,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:42,298 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:42,298 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:42,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:42,299 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:42,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:42,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:42,300 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:42,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:42,300 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:42,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:42,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:42,301 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:42,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:42,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,304 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:42,304 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:42,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:42,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:42,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:42,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:42,433 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:42,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:42,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable517 [2022-12-13 01:58:42,434 INFO L420 AbstractCegarLoop]: === Iteration 519 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1600318975, now seen corresponding path program 1 times [2022-12-13 01:58:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:42,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433379372] [2022-12-13 01:58:42,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:42,483 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 01:58:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433379372] [2022-12-13 01:58:42,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433379372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:42,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:42,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984519427] [2022-12-13 01:58:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:42,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:42,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:42,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:42,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:42,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:42,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:42,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:42,527 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:42,527 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:42,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:42,528 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:42,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:42,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:42,528 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:42,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:42,529 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:42,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:42,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:42,529 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:42,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:42,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,532 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:42,532 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:42,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:42,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:42,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:42,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:42,645 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:42,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:42,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:42,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable518 [2022-12-13 01:58:42,646 INFO L420 AbstractCegarLoop]: === Iteration 520 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:42,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1657577277, now seen corresponding path program 1 times [2022-12-13 01:58:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:42,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086821729] [2022-12-13 01:58:42,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:42,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:42,704 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 01:58:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:42,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086821729] [2022-12-13 01:58:42,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086821729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:42,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:42,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452251538] [2022-12-13 01:58:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:42,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:42,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:42,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:42,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:42,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:42,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:42,756 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:42,757 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:42,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:42,757 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:42,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:42,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:42,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:42,758 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:42,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:42,758 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:42,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:42,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:42,759 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,759 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:42,759 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:42,759 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,762 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:42,762 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:42,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:42,762 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,762 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:42,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:42,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:42,879 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:42,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:42,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable519 [2022-12-13 01:58:42,879 INFO L420 AbstractCegarLoop]: === Iteration 521 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1714835579, now seen corresponding path program 1 times [2022-12-13 01:58:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:42,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911327722] [2022-12-13 01:58:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:42,929 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 01:58:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:42,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911327722] [2022-12-13 01:58:42,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911327722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:42,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:42,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:42,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456278089] [2022-12-13 01:58:42,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:42,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:42,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:42,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:42,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:42,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:42,979 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:42,979 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:42,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:42,980 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:42,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:42,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:42,980 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:42,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:42,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:42,981 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:42,981 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:42,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:42,981 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:42,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:42,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:42,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,984 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:42,984 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:42,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:42,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:42,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:43,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:43,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:43,098 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:43,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:43,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:43,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable520 [2022-12-13 01:58:43,098 INFO L420 AbstractCegarLoop]: === Iteration 522 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093881, now seen corresponding path program 1 times [2022-12-13 01:58:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:43,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590797920] [2022-12-13 01:58:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:43,148 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 01:58:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:43,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590797920] [2022-12-13 01:58:43,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590797920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:43,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:43,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914020119] [2022-12-13 01:58:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:43,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:43,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:43,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:43,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:43,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:43,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:43,198 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:43,198 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:43,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:43,198 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:43,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:43,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:43,199 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:43,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:43,200 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,200 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:43,200 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:43,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:43,200 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:43,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:43,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,203 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:43,203 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:43,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:43,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:43,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:43,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:43,317 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:43,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:43,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:43,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable521 [2022-12-13 01:58:43,317 INFO L420 AbstractCegarLoop]: === Iteration 523 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:43,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1829352183, now seen corresponding path program 1 times [2022-12-13 01:58:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:43,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990937798] [2022-12-13 01:58:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:43,367 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 01:58:43,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:43,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990937798] [2022-12-13 01:58:43,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990937798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:43,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:43,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:43,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347544346] [2022-12-13 01:58:43,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:43,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:43,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:43,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:43,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:43,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:43,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:43,412 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:43,412 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:43,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:43,412 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:43,412 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:43,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:43,413 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:43,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:43,414 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:43,414 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:43,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:43,414 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:43,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:43,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,417 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:43,417 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:43,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:43,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:43,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:43,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:58:43,535 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:43,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:43,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:43,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable522 [2022-12-13 01:58:43,535 INFO L420 AbstractCegarLoop]: === Iteration 524 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1886610485, now seen corresponding path program 1 times [2022-12-13 01:58:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:43,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537845837] [2022-12-13 01:58:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:43,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:43,590 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 01:58:43,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:43,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537845837] [2022-12-13 01:58:43,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537845837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:43,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:43,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245550272] [2022-12-13 01:58:43,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:43,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:43,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:43,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:43,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:43,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:43,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:43,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:43,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:43,633 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:43,633 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:43,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:43,634 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:43,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:43,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:43,634 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:43,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:43,635 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:43,635 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:43,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:43,636 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:43,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:43,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,638 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:43,638 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:43,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:43,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:43,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:43,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:58:43,756 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:43,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:43,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:43,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable523 [2022-12-13 01:58:43,757 INFO L420 AbstractCegarLoop]: === Iteration 525 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1943868787, now seen corresponding path program 1 times [2022-12-13 01:58:43,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:43,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627265701] [2022-12-13 01:58:43,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:43,810 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 01:58:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:43,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627265701] [2022-12-13 01:58:43,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627265701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:43,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:43,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:43,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555582368] [2022-12-13 01:58:43,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:43,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:43,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:43,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:43,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:43,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:43,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:43,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:43,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:43,860 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:43,860 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:43,860 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:43,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:43,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:43,861 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:43,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:43,862 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:43,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:43,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:43,862 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:43,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:43,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,865 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:43,865 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:43,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:43,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:43,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:43,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:43,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:43,979 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:43,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:43,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:43,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:43,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable524 [2022-12-13 01:58:43,980 INFO L420 AbstractCegarLoop]: === Iteration 526 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2001127089, now seen corresponding path program 1 times [2022-12-13 01:58:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498734671] [2022-12-13 01:58:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:44,030 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 01:58:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:44,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498734671] [2022-12-13 01:58:44,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498734671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:44,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:44,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:44,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227334237] [2022-12-13 01:58:44,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:44,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:44,031 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:44,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:44,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:44,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:44,080 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:44,080 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:44,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:44,081 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:44,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:44,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:44,081 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:44,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:44,082 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:44,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:44,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:44,083 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:44,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:44,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,085 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:44,085 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:44,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:44,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:44,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:44,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:44,201 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:44,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:44,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:44,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable525 [2022-12-13 01:58:44,201 INFO L420 AbstractCegarLoop]: === Iteration 527 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:44,201 INFO L85 PathProgramCache]: Analyzing trace with hash 2058385391, now seen corresponding path program 1 times [2022-12-13 01:58:44,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:44,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237217143] [2022-12-13 01:58:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:44,250 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 01:58:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:44,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237217143] [2022-12-13 01:58:44,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237217143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:44,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:44,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:44,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098586573] [2022-12-13 01:58:44,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:44,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:44,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:44,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:44,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:44,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:44,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:44,294 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:44,294 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:44,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:44,295 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:44,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:44,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:44,295 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:44,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:44,296 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:44,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:44,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:44,297 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:44,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:44,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,299 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:44,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:44,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:44,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:44,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:44,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:44,423 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:44,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:44,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:44,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable526 [2022-12-13 01:58:44,424 INFO L420 AbstractCegarLoop]: === Iteration 528 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2115643693, now seen corresponding path program 1 times [2022-12-13 01:58:44,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:44,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503955967] [2022-12-13 01:58:44,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:44,474 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 01:58:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:44,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503955967] [2022-12-13 01:58:44,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503955967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:44,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:44,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:44,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838438253] [2022-12-13 01:58:44,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:44,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:44,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:44,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:44,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:44,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:44,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:44,518 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:44,518 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:44,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:44,519 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:44,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:44,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:44,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:44,520 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:44,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:44,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:44,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:44,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:44,521 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,521 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:44,521 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:44,521 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,523 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:44,524 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:44,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:44,524 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:44,637 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:44,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:44,638 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:44,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:44,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:44,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable527 [2022-12-13 01:58:44,638 INFO L420 AbstractCegarLoop]: === Iteration 529 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:44,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2122065301, now seen corresponding path program 1 times [2022-12-13 01:58:44,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:44,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143031558] [2022-12-13 01:58:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:44,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:44,694 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 01:58:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:44,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143031558] [2022-12-13 01:58:44,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143031558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:44,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:44,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:44,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551458912] [2022-12-13 01:58:44,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:44,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:44,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:44,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:44,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:44,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:44,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:44,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:44,738 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:44,738 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:44,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:44,738 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:44,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:44,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:44,739 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:44,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:44,740 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:44,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:44,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:44,740 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:44,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:44,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,743 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:44,743 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:44,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:44,743 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:44,859 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:44,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:44,859 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:44,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:44,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:44,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable528 [2022-12-13 01:58:44,860 INFO L420 AbstractCegarLoop]: === Iteration 530 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:44,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2064806999, now seen corresponding path program 1 times [2022-12-13 01:58:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:44,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930018765] [2022-12-13 01:58:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:44,919 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 01:58:44,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:44,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930018765] [2022-12-13 01:58:44,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930018765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:44,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:44,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:44,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667315033] [2022-12-13 01:58:44,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:44,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:44,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:44,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:44,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:44,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:44,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:44,970 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:44,970 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:44,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:44,971 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:44,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:44,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:44,971 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:44,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:44,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:44,972 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:44,973 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:44,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:44,973 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:44,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:44,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:44,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,976 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:44,976 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:44,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:44,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:44,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:45,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:45,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:45,092 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:45,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:45,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:45,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable529 [2022-12-13 01:58:45,093 INFO L420 AbstractCegarLoop]: === Iteration 531 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2007548697, now seen corresponding path program 1 times [2022-12-13 01:58:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809288390] [2022-12-13 01:58:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:45,150 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 01:58:45,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809288390] [2022-12-13 01:58:45,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809288390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:45,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:45,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248927523] [2022-12-13 01:58:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:45,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:45,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:45,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:45,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:45,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:45,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:45,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:45,201 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:45,202 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:45,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:45,202 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:45,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:45,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:45,203 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:45,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:45,203 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:45,204 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:45,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:45,204 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:45,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:45,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,207 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:45,207 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:45,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:45,207 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:45,322 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:45,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:45,322 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:45,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:45,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:45,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable530 [2022-12-13 01:58:45,323 INFO L420 AbstractCegarLoop]: === Iteration 532 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1950290395, now seen corresponding path program 1 times [2022-12-13 01:58:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:45,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641589348] [2022-12-13 01:58:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:45,373 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 01:58:45,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:45,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641589348] [2022-12-13 01:58:45,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641589348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:45,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:45,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002050146] [2022-12-13 01:58:45,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:45,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:45,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:45,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:45,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:45,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:45,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:45,418 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:45,418 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:45,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:45,418 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:45,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:45,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:45,419 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:45,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:45,420 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:45,420 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:45,420 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:45,420 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:45,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:45,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,423 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:45,423 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:45,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:45,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:45,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:45,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:45,538 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:45,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:45,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:45,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable531 [2022-12-13 01:58:45,538 INFO L420 AbstractCegarLoop]: === Iteration 533 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:45,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1893032093, now seen corresponding path program 1 times [2022-12-13 01:58:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:45,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176010181] [2022-12-13 01:58:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:45,590 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 01:58:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:45,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176010181] [2022-12-13 01:58:45,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176010181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:45,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:45,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:45,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707392350] [2022-12-13 01:58:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:45,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:45,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:45,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:45,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:45,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:45,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:45,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:45,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:45,643 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:45,643 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:45,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:45,644 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:45,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:45,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:45,645 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:45,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:45,646 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:45,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:45,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:45,646 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:45,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:45,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,649 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:45,649 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:45,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:45,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:45,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:45,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:58:45,780 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:45,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,780 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:45,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:45,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable532 [2022-12-13 01:58:45,781 INFO L420 AbstractCegarLoop]: === Iteration 534 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:45,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1835773791, now seen corresponding path program 1 times [2022-12-13 01:58:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:45,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529611850] [2022-12-13 01:58:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:45,850 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 01:58:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:45,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529611850] [2022-12-13 01:58:45,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529611850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:45,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:45,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107244432] [2022-12-13 01:58:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:45,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:45,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:45,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:45,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:45,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:45,894 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:45,894 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:45,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:45,895 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:45,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:45,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:45,895 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:45,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:45,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:45,896 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:45,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:45,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:45,897 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:45,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:45,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:45,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,899 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:45,899 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:45,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:45,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:45,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:46,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:46,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:46,014 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:46,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:46,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:46,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable533 [2022-12-13 01:58:46,014 INFO L420 AbstractCegarLoop]: === Iteration 535 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:46,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1778515489, now seen corresponding path program 1 times [2022-12-13 01:58:46,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:46,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773257675] [2022-12-13 01:58:46,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:46,062 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 01:58:46,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:46,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773257675] [2022-12-13 01:58:46,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773257675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:46,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:46,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082432397] [2022-12-13 01:58:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:46,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:46,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:46,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:46,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:46,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:46,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:46,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:46,106 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:46,107 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:46,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:46,107 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:46,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:46,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:46,108 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:46,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:46,109 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:46,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:46,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:46,109 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:46,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:46,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,112 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:46,112 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:46,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:46,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:46,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:46,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:46,225 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:46,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:46,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:46,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable534 [2022-12-13 01:58:46,226 INFO L420 AbstractCegarLoop]: === Iteration 536 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:46,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1721257187, now seen corresponding path program 1 times [2022-12-13 01:58:46,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:46,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130760365] [2022-12-13 01:58:46,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:46,286 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 01:58:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:46,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130760365] [2022-12-13 01:58:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130760365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:46,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873050913] [2022-12-13 01:58:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:46,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:46,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:46,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:46,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:46,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:46,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:46,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:46,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:46,330 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:46,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:46,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:46,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:46,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:46,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:46,331 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:46,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:46,332 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:46,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:46,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:46,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:46,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:46,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,335 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:46,335 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:46,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:46,448 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:46,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:46,449 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:46,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:46,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:46,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable535 [2022-12-13 01:58:46,449 INFO L420 AbstractCegarLoop]: === Iteration 537 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1663998885, now seen corresponding path program 1 times [2022-12-13 01:58:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:46,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335262405] [2022-12-13 01:58:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:46,505 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 01:58:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:46,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335262405] [2022-12-13 01:58:46,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335262405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:46,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:46,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:46,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414669089] [2022-12-13 01:58:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:46,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:46,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:46,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:46,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:46,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:46,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:46,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:46,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:46,559 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:46,559 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:46,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:46,560 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:46,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:46,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:46,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:46,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:46,561 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:46,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:46,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:46,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:46,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:46,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:46,565 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:46,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:46,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:46,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:46,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:46,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:46,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:46,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable536 [2022-12-13 01:58:46,681 INFO L420 AbstractCegarLoop]: === Iteration 538 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:46,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1606740583, now seen corresponding path program 1 times [2022-12-13 01:58:46,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:46,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219971857] [2022-12-13 01:58:46,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:46,729 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 01:58:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:46,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219971857] [2022-12-13 01:58:46,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219971857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:46,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:46,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135472704] [2022-12-13 01:58:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:46,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:46,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:46,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:46,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:46,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:46,781 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:46,781 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:46,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:46,782 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:46,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:46,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:46,782 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:46,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:46,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:46,783 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:46,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:46,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:46,783 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:46,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:46,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:46,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,786 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:46,786 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:46,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:46,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:46,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:46,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:46,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:46,900 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:46,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:46,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:46,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable537 [2022-12-13 01:58:46,900 INFO L420 AbstractCegarLoop]: === Iteration 539 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:46,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1549482281, now seen corresponding path program 1 times [2022-12-13 01:58:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:46,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297422373] [2022-12-13 01:58:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:46,948 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 01:58:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:46,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297422373] [2022-12-13 01:58:46,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297422373] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:46,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:46,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:46,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583227799] [2022-12-13 01:58:46,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:46,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:46,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:46,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:46,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:46,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:46,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:46,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:46,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:46,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:47,009 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:47,009 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:47,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:47,010 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:47,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:47,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:47,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:47,010 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:47,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:47,011 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:47,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:47,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:47,012 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:47,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:47,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,014 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:47,015 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:47,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:47,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:47,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:47,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:47,141 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:47,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:47,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:47,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable538 [2022-12-13 01:58:47,141 INFO L420 AbstractCegarLoop]: === Iteration 540 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:47,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:47,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1492223979, now seen corresponding path program 1 times [2022-12-13 01:58:47,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:47,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419686674] [2022-12-13 01:58:47,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:47,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:47,204 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 01:58:47,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:47,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419686674] [2022-12-13 01:58:47,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419686674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:47,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:47,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:47,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747695150] [2022-12-13 01:58:47,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:47,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:47,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:47,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:47,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:47,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:47,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:47,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:47,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:47,261 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:47,261 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:47,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:47,262 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:47,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:47,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:47,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:47,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:47,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:47,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:47,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:47,264 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:47,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:47,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,268 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:47,268 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:47,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:47,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:47,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:47,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:47,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:47,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:47,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:47,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable539 [2022-12-13 01:58:47,403 INFO L420 AbstractCegarLoop]: === Iteration 541 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1434965677, now seen corresponding path program 1 times [2022-12-13 01:58:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:47,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923265493] [2022-12-13 01:58:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:47,466 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 01:58:47,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:47,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923265493] [2022-12-13 01:58:47,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923265493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:47,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:47,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946088211] [2022-12-13 01:58:47,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:47,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:47,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:47,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:47,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:47,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:47,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:47,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:47,526 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:47,526 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:47,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:47,527 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:47,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:47,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:47,528 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:47,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:47,529 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:47,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:47,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:47,529 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:47,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:47,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,533 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:47,533 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:47,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:47,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:47,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:47,665 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:47,665 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:47,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,665 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:47,665 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:47,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable540 [2022-12-13 01:58:47,665 INFO L420 AbstractCegarLoop]: === Iteration 542 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:47,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1377707375, now seen corresponding path program 1 times [2022-12-13 01:58:47,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:47,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695608582] [2022-12-13 01:58:47,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:47,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:47,715 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 01:58:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:47,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695608582] [2022-12-13 01:58:47,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695608582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:47,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:47,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100433310] [2022-12-13 01:58:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:47,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:47,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:47,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:47,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:47,758 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:47,758 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:47,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:47,759 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:47,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:47,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:47,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:47,759 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:47,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:47,760 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:47,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:47,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:47,761 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:47,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:47,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,763 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:47,764 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:47,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:47,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:47,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:47,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:47,877 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:47,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:47,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable541 [2022-12-13 01:58:47,877 INFO L420 AbstractCegarLoop]: === Iteration 543 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1320449073, now seen corresponding path program 1 times [2022-12-13 01:58:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:47,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992927092] [2022-12-13 01:58:47,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:47,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:47,925 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 01:58:47,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:47,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992927092] [2022-12-13 01:58:47,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992927092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:47,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:47,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:47,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811763498] [2022-12-13 01:58:47,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:47,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:47,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:47,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:47,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:47,926 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:47,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:47,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:47,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:47,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:47,969 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:47,969 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:47,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:47,970 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:47,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:47,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:47,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:47,970 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:47,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:47,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:47,971 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:47,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:47,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:47,971 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:47,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:47,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:47,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,974 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:47,974 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:47,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:47,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:47,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:48,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:48,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:48,090 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:48,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:48,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable542 [2022-12-13 01:58:48,090 INFO L420 AbstractCegarLoop]: === Iteration 544 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1263190771, now seen corresponding path program 1 times [2022-12-13 01:58:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:48,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753620640] [2022-12-13 01:58:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:48,139 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 01:58:48,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:48,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753620640] [2022-12-13 01:58:48,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753620640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:48,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:48,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924929824] [2022-12-13 01:58:48,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:48,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:48,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:48,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:48,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:48,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:48,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:48,182 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:48,182 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:48,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:48,182 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:48,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:48,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:48,183 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:48,183 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:48,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:48,184 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:48,184 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:48,184 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:48,184 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:48,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:48,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,193 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:48,193 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:48,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:48,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:48,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:48,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:58:48,308 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:48,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:48,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:48,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable543 [2022-12-13 01:58:48,308 INFO L420 AbstractCegarLoop]: === Iteration 545 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1205932469, now seen corresponding path program 1 times [2022-12-13 01:58:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:48,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081515096] [2022-12-13 01:58:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:48,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:48,358 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 01:58:48,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:48,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081515096] [2022-12-13 01:58:48,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081515096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:48,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:48,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:48,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73982228] [2022-12-13 01:58:48,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:48,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:48,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:48,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:48,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:48,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:48,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:48,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:48,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:48,408 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:48,409 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:48,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:48,409 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:48,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:48,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:48,410 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:48,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:48,411 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:48,411 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:48,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:48,411 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:48,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:48,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,414 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:48,414 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:48,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:48,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:48,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:48,528 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:48,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:48,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:48,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable544 [2022-12-13 01:58:48,528 INFO L420 AbstractCegarLoop]: === Iteration 546 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1148674167, now seen corresponding path program 1 times [2022-12-13 01:58:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:48,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984277892] [2022-12-13 01:58:48,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:48,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:48,577 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 01:58:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984277892] [2022-12-13 01:58:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984277892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:48,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:48,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557620086] [2022-12-13 01:58:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:48,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:48,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:48,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:48,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:48,628 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:48,628 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:48,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:48,628 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:48,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:48,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:48,629 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:48,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:48,630 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:48,630 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:48,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:48,630 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:48,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:48,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,633 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:48,633 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:48,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:48,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:48,747 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:48,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:48,747 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:48,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:48,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:48,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable545 [2022-12-13 01:58:48,747 INFO L420 AbstractCegarLoop]: === Iteration 547 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1091415865, now seen corresponding path program 1 times [2022-12-13 01:58:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:48,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342431370] [2022-12-13 01:58:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:48,806 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 01:58:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:48,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342431370] [2022-12-13 01:58:48,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342431370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:48,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:48,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753537132] [2022-12-13 01:58:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:48,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:48,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:48,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:48,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:48,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:48,859 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:48,859 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:48,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:48,859 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:48,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:48,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:48,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:48,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:48,860 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:48,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:48,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:48,860 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:48,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:48,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:48,861 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:48,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:48,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:48,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,863 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:48,863 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:48,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:48,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:48,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:48,991 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:48,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:58:48,992 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:48,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:48,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:48,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:48,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable546 [2022-12-13 01:58:48,992 INFO L420 AbstractCegarLoop]: === Iteration 548 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:48,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1034157563, now seen corresponding path program 1 times [2022-12-13 01:58:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:48,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615732293] [2022-12-13 01:58:48,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:49,042 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 01:58:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:49,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615732293] [2022-12-13 01:58:49,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615732293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:49,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:49,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608135197] [2022-12-13 01:58:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:49,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:49,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:49,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:49,043 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:49,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:49,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:49,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:49,087 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:49,087 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:49,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:49,088 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:49,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:49,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:49,088 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:49,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:49,089 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:49,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:49,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:49,089 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:49,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:49,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,092 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:49,092 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:49,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:49,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:49,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:49,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:49,209 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:49,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:49,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:49,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable547 [2022-12-13 01:58:49,209 INFO L420 AbstractCegarLoop]: === Iteration 549 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:49,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash -976899261, now seen corresponding path program 1 times [2022-12-13 01:58:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:49,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112619922] [2022-12-13 01:58:49,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:49,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:49,260 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 01:58:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:49,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112619922] [2022-12-13 01:58:49,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112619922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:49,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:49,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419114019] [2022-12-13 01:58:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:49,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:49,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:49,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:49,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:49,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:49,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:49,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:49,325 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:49,325 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:49,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:49,325 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:49,325 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:49,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:49,326 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:49,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:49,327 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:49,327 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:49,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:49,327 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:49,327 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:49,327 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,330 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:49,330 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:49,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:49,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:49,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:49,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:49,449 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:49,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:49,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:49,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable548 [2022-12-13 01:58:49,450 INFO L420 AbstractCegarLoop]: === Iteration 550 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:49,450 INFO L85 PathProgramCache]: Analyzing trace with hash -919640959, now seen corresponding path program 1 times [2022-12-13 01:58:49,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:49,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869049560] [2022-12-13 01:58:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:49,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:49,501 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 01:58:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:49,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869049560] [2022-12-13 01:58:49,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869049560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:49,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:49,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:49,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890273503] [2022-12-13 01:58:49,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:49,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:49,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:49,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:49,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:49,550 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:49,550 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:49,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:49,550 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:49,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:49,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:49,551 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:49,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:49,552 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:49,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:49,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:49,552 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:49,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:49,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,555 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:49,555 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:49,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:49,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:49,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:49,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:58:49,668 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:49,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:49,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:49,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable549 [2022-12-13 01:58:49,668 INFO L420 AbstractCegarLoop]: === Iteration 551 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash -862382657, now seen corresponding path program 1 times [2022-12-13 01:58:49,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:49,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036436563] [2022-12-13 01:58:49,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:49,717 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 01:58:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:49,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036436563] [2022-12-13 01:58:49,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036436563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:49,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:49,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865233080] [2022-12-13 01:58:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:49,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:49,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:49,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:49,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:49,769 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:49,769 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:49,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:49,770 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:49,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:49,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:49,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:49,770 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:49,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:49,771 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:49,771 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:49,772 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:49,772 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:49,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:49,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,774 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:49,774 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:49,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:49,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:49,889 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:49,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:49,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:49,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:49,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:49,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable550 [2022-12-13 01:58:49,889 INFO L420 AbstractCegarLoop]: === Iteration 552 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:49,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:49,890 INFO L85 PathProgramCache]: Analyzing trace with hash -805124355, now seen corresponding path program 1 times [2022-12-13 01:58:49,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:49,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217100288] [2022-12-13 01:58:49,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:49,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:49,939 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 01:58:49,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:49,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217100288] [2022-12-13 01:58:49,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217100288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:49,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:49,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187066509] [2022-12-13 01:58:49,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:49,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:49,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:49,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:49,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:49,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:49,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:49,989 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:49,989 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:49,990 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:49,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:49,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:49,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:49,990 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:49,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:49,991 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,991 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:49,991 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:49,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:49,991 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:49,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:49,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:49,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,994 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:49,994 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:49,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:49,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:49,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:50,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:50,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:50,110 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:50,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:50,110 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:50,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable551 [2022-12-13 01:58:50,110 INFO L420 AbstractCegarLoop]: === Iteration 553 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash -747866053, now seen corresponding path program 1 times [2022-12-13 01:58:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:50,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858625019] [2022-12-13 01:58:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:50,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:50,158 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 01:58:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:50,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858625019] [2022-12-13 01:58:50,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858625019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:50,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:50,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333157542] [2022-12-13 01:58:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:50,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:50,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:50,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:50,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:50,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:50,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:50,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:50,202 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:50,202 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:50,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:50,202 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:50,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:50,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:50,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:50,203 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:50,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:50,204 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:50,204 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:50,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:50,204 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:50,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:50,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,207 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:50,207 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:50,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:50,207 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:50,322 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:50,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:50,322 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:50,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:50,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:50,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable552 [2022-12-13 01:58:50,323 INFO L420 AbstractCegarLoop]: === Iteration 554 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:50,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -690607751, now seen corresponding path program 1 times [2022-12-13 01:58:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:50,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998628464] [2022-12-13 01:58:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:50,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:50,372 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 01:58:50,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:50,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998628464] [2022-12-13 01:58:50,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998628464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:50,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:50,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882258242] [2022-12-13 01:58:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:50,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:50,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:50,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:50,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:50,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:50,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:50,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:50,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:50,422 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:50,422 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:50,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:50,423 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:50,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:50,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:50,424 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:50,424 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:50,425 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:50,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:50,425 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:50,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:50,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,427 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:50,428 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:50,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:50,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:50,543 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:50,543 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:50,543 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:50,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:50,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:50,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable553 [2022-12-13 01:58:50,544 INFO L420 AbstractCegarLoop]: === Iteration 555 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -633349449, now seen corresponding path program 1 times [2022-12-13 01:58:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:50,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004316292] [2022-12-13 01:58:50,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:50,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:50,599 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 01:58:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:50,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004316292] [2022-12-13 01:58:50,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004316292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:50,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:50,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767791225] [2022-12-13 01:58:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:50,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:50,600 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:50,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:50,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:50,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:50,653 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:50,654 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:50,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:50,654 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:50,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:50,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:50,655 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:50,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:50,655 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:50,656 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:50,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:50,656 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:50,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:50,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,659 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:50,659 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:50,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:50,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:50,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:50,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:58:50,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:50,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:50,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:50,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable554 [2022-12-13 01:58:50,786 INFO L420 AbstractCegarLoop]: === Iteration 556 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:50,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -576091147, now seen corresponding path program 1 times [2022-12-13 01:58:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925725175] [2022-12-13 01:58:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:50,835 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 01:58:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:50,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925725175] [2022-12-13 01:58:50,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925725175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:50,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:50,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580586842] [2022-12-13 01:58:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:50,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:50,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:50,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:50,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:50,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:50,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:50,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:50,879 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:50,879 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:50,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:50,879 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:50,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:50,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:50,880 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:50,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:50,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:50,881 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:50,881 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:50,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:50,881 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,881 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:50,881 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:50,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:50,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,884 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:50,884 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:50,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:50,884 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:50,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:51,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:51,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:58:51,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:51,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:51,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:51,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable555 [2022-12-13 01:58:51,004 INFO L420 AbstractCegarLoop]: === Iteration 557 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash -518832845, now seen corresponding path program 1 times [2022-12-13 01:58:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919847109] [2022-12-13 01:58:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:51,055 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 01:58:51,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919847109] [2022-12-13 01:58:51,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919847109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:51,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792420750] [2022-12-13 01:58:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:51,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:51,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:51,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:51,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:51,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:51,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:51,118 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:51,118 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:51,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:51,119 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:51,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:51,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:51,119 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:51,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:51,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:51,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:51,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:51,120 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:51,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:51,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:51,123 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:51,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:51,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:51,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:51,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:51,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:51,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:51,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:51,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable556 [2022-12-13 01:58:51,255 INFO L420 AbstractCegarLoop]: === Iteration 558 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash -461574543, now seen corresponding path program 1 times [2022-12-13 01:58:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:51,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000398309] [2022-12-13 01:58:51,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:51,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:51,321 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 01:58:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000398309] [2022-12-13 01:58:51,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000398309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:51,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:51,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570260344] [2022-12-13 01:58:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:51,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:51,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:51,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:51,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:51,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:51,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:51,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:51,366 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:51,366 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:51,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:51,367 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:51,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:51,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:51,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:51,367 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:51,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:51,368 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:51,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:51,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:51,368 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:51,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:51,369 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,371 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:51,371 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:51,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:51,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:51,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:51,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:51,490 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:51,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:51,491 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable557 [2022-12-13 01:58:51,491 INFO L420 AbstractCegarLoop]: === Iteration 559 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash -404316241, now seen corresponding path program 1 times [2022-12-13 01:58:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:51,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819948790] [2022-12-13 01:58:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:51,551 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 01:58:51,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:51,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819948790] [2022-12-13 01:58:51,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819948790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:51,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:51,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:51,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015317265] [2022-12-13 01:58:51,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:51,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:51,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:51,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:51,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:51,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:51,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:51,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:51,595 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:51,596 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:51,596 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:51,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:51,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:51,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:51,597 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:51,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:51,597 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:51,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:51,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:51,598 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:51,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:51,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,601 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:51,601 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:51,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:51,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:51,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:51,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:51,716 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:51,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:51,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:51,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558 [2022-12-13 01:58:51,716 INFO L420 AbstractCegarLoop]: === Iteration 560 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:51,717 INFO L85 PathProgramCache]: Analyzing trace with hash -347057939, now seen corresponding path program 1 times [2022-12-13 01:58:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:51,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380669113] [2022-12-13 01:58:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:51,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 01:58:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380669113] [2022-12-13 01:58:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380669113] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:51,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:51,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814350613] [2022-12-13 01:58:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:51,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:51,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:51,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:51,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:51,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:51,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:51,817 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:51,817 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:51,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:51,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:51,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:51,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:51,818 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:51,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:51,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:51,819 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:51,819 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:51,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:51,820 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:51,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:51,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:51,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:51,822 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:51,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:51,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:51,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:51,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:51,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:51,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:51,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:51,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:51,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable559 [2022-12-13 01:58:51,942 INFO L420 AbstractCegarLoop]: === Iteration 561 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:51,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -289799637, now seen corresponding path program 1 times [2022-12-13 01:58:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:51,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081476743] [2022-12-13 01:58:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:51,993 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 01:58:51,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:51,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081476743] [2022-12-13 01:58:51,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081476743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:51,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:51,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850032588] [2022-12-13 01:58:51,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:51,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:51,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:51,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:51,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:51,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:51,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:51,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:52,037 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:52,037 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:52,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:52,037 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:52,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:52,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:52,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:52,038 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:52,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:52,039 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:52,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:52,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:52,039 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:52,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:52,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,042 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:52,042 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:52,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:52,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:52,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:52,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:58:52,156 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:52,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:52,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:52,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable560 [2022-12-13 01:58:52,157 INFO L420 AbstractCegarLoop]: === Iteration 562 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:52,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:52,157 INFO L85 PathProgramCache]: Analyzing trace with hash -232541335, now seen corresponding path program 1 times [2022-12-13 01:58:52,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:52,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867252466] [2022-12-13 01:58:52,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:52,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:52,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 01:58:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:52,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867252466] [2022-12-13 01:58:52,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867252466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:52,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:52,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661154026] [2022-12-13 01:58:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:52,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:52,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:52,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:52,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:52,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:52,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:52,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:52,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:52,250 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:52,250 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:52,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:52,251 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:52,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:52,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:52,251 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:52,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:52,252 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:52,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:52,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:52,252 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:52,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:52,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,255 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:52,255 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:52,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:52,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:52,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:52,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:58:52,375 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:52,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:52,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable561 [2022-12-13 01:58:52,375 INFO L420 AbstractCegarLoop]: === Iteration 563 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -175283033, now seen corresponding path program 1 times [2022-12-13 01:58:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280848173] [2022-12-13 01:58:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:52,426 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 01:58:52,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:52,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280848173] [2022-12-13 01:58:52,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280848173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:52,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:52,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760628491] [2022-12-13 01:58:52,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:52,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:52,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:52,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:52,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:52,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:52,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:52,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:52,473 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:52,473 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:52,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:52,474 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:52,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:52,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:52,474 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:52,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:52,475 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,475 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:52,475 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:52,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:52,475 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:52,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:52,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,478 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:52,478 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:52,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:52,479 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,479 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:52,594 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:52,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:52,594 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:52,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:52,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:52,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable562 [2022-12-13 01:58:52,595 INFO L420 AbstractCegarLoop]: === Iteration 564 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash -118024731, now seen corresponding path program 1 times [2022-12-13 01:58:52,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:52,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370984025] [2022-12-13 01:58:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:52,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:52,647 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 01:58:52,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:52,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370984025] [2022-12-13 01:58:52,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370984025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:52,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:52,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076587201] [2022-12-13 01:58:52,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:52,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:52,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:52,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:52,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:52,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:52,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:52,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:52,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:52,698 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:52,699 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:52,699 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:52,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:52,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:52,700 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:52,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:52,701 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:52,701 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:52,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:52,701 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:52,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:52,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,704 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:52,704 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:52,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:52,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:52,825 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:52,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:52,826 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:52,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:52,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:52,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable563 [2022-12-13 01:58:52,826 INFO L420 AbstractCegarLoop]: === Iteration 565 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -60766429, now seen corresponding path program 1 times [2022-12-13 01:58:52,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:52,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164991271] [2022-12-13 01:58:52,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:52,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:52,890 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 01:58:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164991271] [2022-12-13 01:58:52,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164991271] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:52,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:52,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:52,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065791035] [2022-12-13 01:58:52,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:52,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:52,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:52,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:52,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:52,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:52,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:52,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:52,934 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:52,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:52,935 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:52,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:52,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:52,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:52,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:52,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:52,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:52,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:52,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:52,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:52,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:52,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:52,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:52,939 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:52,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:52,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:52,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:53,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:53,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:58:53,055 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:53,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:53,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable564 [2022-12-13 01:58:53,055 INFO L420 AbstractCegarLoop]: === Iteration 566 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -3508127, now seen corresponding path program 1 times [2022-12-13 01:58:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:53,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268816401] [2022-12-13 01:58:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:53,104 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 01:58:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:53,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268816401] [2022-12-13 01:58:53,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268816401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:53,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:53,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004455924] [2022-12-13 01:58:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:53,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:53,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:53,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:53,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:53,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:53,151 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:53,151 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:53,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:53,152 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:53,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:53,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:53,152 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:53,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:53,153 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:53,154 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:53,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:53,154 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:53,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:53,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,158 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:53,158 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:53,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:53,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:53,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:53,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:53,290 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:53,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:53,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:53,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable565 [2022-12-13 01:58:53,291 INFO L420 AbstractCegarLoop]: === Iteration 567 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:53,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash 53750175, now seen corresponding path program 1 times [2022-12-13 01:58:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:53,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640728039] [2022-12-13 01:58:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:53,342 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 01:58:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:53,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640728039] [2022-12-13 01:58:53,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640728039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:53,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:53,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:53,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673391198] [2022-12-13 01:58:53,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:53,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:53,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:53,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:53,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:53,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:53,396 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:53,396 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:53,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:53,397 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:53,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:53,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:53,397 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:53,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:53,398 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,398 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:53,398 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:53,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:53,398 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,399 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:53,399 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:53,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,401 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:53,401 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:53,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:53,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:53,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:53,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:53,534 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:53,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:53,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable566 [2022-12-13 01:58:53,534 INFO L420 AbstractCegarLoop]: === Iteration 568 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:53,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:53,534 INFO L85 PathProgramCache]: Analyzing trace with hash 111008477, now seen corresponding path program 1 times [2022-12-13 01:58:53,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:53,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582216443] [2022-12-13 01:58:53,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:53,606 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 01:58:53,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:53,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582216443] [2022-12-13 01:58:53,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582216443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:53,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:53,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:53,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474529602] [2022-12-13 01:58:53,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:53,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:53,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:53,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:53,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:53,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:53,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:53,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:53,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:53,660 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:53,660 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:53,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:53,661 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:53,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:53,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:53,661 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:53,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:53,662 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,662 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:53,662 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:53,662 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:53,662 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:53,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:53,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,665 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:53,665 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:53,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:53,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:53,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:53,801 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:53,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:53,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:53,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable567 [2022-12-13 01:58:53,801 INFO L420 AbstractCegarLoop]: === Iteration 569 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 168266779, now seen corresponding path program 1 times [2022-12-13 01:58:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:53,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217316577] [2022-12-13 01:58:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:53,865 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 01:58:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:53,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217316577] [2022-12-13 01:58:53,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217316577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:53,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:53,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192344933] [2022-12-13 01:58:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:53,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:53,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:53,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:53,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:53,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:53,919 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:53,920 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:53,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:53,920 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:53,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:53,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:53,921 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:53,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:53,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:53,922 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,922 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:53,922 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:53,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:53,922 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:53,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:53,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:53,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,925 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:53,925 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:53,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:53,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:53,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:54,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:54,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:54,059 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:54,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:54,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable568 [2022-12-13 01:58:54,060 INFO L420 AbstractCegarLoop]: === Iteration 570 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash 225525081, now seen corresponding path program 1 times [2022-12-13 01:58:54,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:54,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258942755] [2022-12-13 01:58:54,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:54,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:54,125 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 01:58:54,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:54,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258942755] [2022-12-13 01:58:54,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258942755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:54,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:54,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:54,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027266781] [2022-12-13 01:58:54,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:54,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:54,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:54,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:54,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:54,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:54,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:54,191 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:54,191 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:54,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:54,192 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:54,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:54,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:54,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:54,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:54,193 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:54,194 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:54,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:54,194 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:54,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:54,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,198 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:54,198 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:54,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:54,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:54,333 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:54,334 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:58:54,334 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:54,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,334 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:54,334 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:54,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable569 [2022-12-13 01:58:54,334 INFO L420 AbstractCegarLoop]: === Iteration 571 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:54,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 282783383, now seen corresponding path program 1 times [2022-12-13 01:58:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:54,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38636014] [2022-12-13 01:58:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:54,400 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 01:58:54,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:54,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38636014] [2022-12-13 01:58:54,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38636014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:54,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:54,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:54,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495446238] [2022-12-13 01:58:54,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:54,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:54,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:54,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:54,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:54,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:54,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:54,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:54,449 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:54,450 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:54,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:54,450 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:54,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:54,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:54,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:54,451 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:54,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:54,452 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:54,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:54,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:54,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:54,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:54,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:54,457 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:54,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:54,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:54,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:54,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:58:54,594 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:54,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:54,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:54,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable570 [2022-12-13 01:58:54,594 INFO L420 AbstractCegarLoop]: === Iteration 572 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:54,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:54,595 INFO L85 PathProgramCache]: Analyzing trace with hash 340041685, now seen corresponding path program 1 times [2022-12-13 01:58:54,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:54,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347395260] [2022-12-13 01:58:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:54,653 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 01:58:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:54,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347395260] [2022-12-13 01:58:54,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347395260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:54,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680526342] [2022-12-13 01:58:54,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:54,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:54,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:54,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:54,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:54,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:54,708 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:54,708 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:54,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:54,709 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:54,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:54,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:54,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:54,710 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:54,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:54,711 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:54,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:54,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:54,711 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:54,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:54,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,715 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:54,715 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:54,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:54,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:54,852 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:54,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 01:58:54,853 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:54,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:54,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:54,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable571 [2022-12-13 01:58:54,853 INFO L420 AbstractCegarLoop]: === Iteration 573 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:54,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash 397299987, now seen corresponding path program 1 times [2022-12-13 01:58:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:54,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243039148] [2022-12-13 01:58:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:54,916 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 01:58:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:54,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243039148] [2022-12-13 01:58:54,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243039148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:54,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:54,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780416122] [2022-12-13 01:58:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:54,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:54,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:54,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:54,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:54,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:54,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:54,977 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:54,978 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:54,978 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:54,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:54,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:54,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:54,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:54,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:54,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:54,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:54,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:54,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:54,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:54,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:54,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,983 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:54,983 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:54,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:54,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:54,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:55,115 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:55,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:55,116 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:55,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:55,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:55,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable572 [2022-12-13 01:58:55,116 INFO L420 AbstractCegarLoop]: === Iteration 574 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:55,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:55,116 INFO L85 PathProgramCache]: Analyzing trace with hash 454558289, now seen corresponding path program 1 times [2022-12-13 01:58:55,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:55,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203742125] [2022-12-13 01:58:55,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:55,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:58:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203742125] [2022-12-13 01:58:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203742125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:55,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:55,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679609537] [2022-12-13 01:58:55,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:55,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:55,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:55,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:55,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:55,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:55,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:55,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:55,245 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:55,245 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:55,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:55,246 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:55,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:55,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:55,247 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:55,247 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:55,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:55,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:55,248 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,248 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:55,248 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:55,248 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:55,248 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:55,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:55,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:55,251 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:55,251 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:55,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:55,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:55,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:55,384 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:55,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:55,385 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:55,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:55,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:55,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable573 [2022-12-13 01:58:55,385 INFO L420 AbstractCegarLoop]: === Iteration 575 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:55,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:55,386 INFO L85 PathProgramCache]: Analyzing trace with hash 511816591, now seen corresponding path program 1 times [2022-12-13 01:58:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:55,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052037729] [2022-12-13 01:58:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:55,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:55,453 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 01:58:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:55,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052037729] [2022-12-13 01:58:55,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052037729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:55,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:55,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995132414] [2022-12-13 01:58:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:55,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:55,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:55,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:55,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:55,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:55,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:55,514 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:55,514 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:55,515 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:55,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:55,515 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:55,516 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:55,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:55,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:55,516 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,516 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:55,517 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:55,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:55,517 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:55,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:55,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:55,520 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:55,520 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:55,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 201 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:55,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:55,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:55,651 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:55,652 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:55,652 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:55,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:55,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:55,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable574 [2022-12-13 01:58:55,652 INFO L420 AbstractCegarLoop]: === Iteration 576 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash 569074893, now seen corresponding path program 1 times [2022-12-13 01:58:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:55,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453127840] [2022-12-13 01:58:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:55,717 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 01:58:55,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:55,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453127840] [2022-12-13 01:58:55,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453127840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:55,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:55,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49702419] [2022-12-13 01:58:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:55,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:55,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:55,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:55,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:55,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:55,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:55,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:55,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:55,780 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:55,780 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:55,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:55,781 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:55,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:55,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:55,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:55,781 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:55,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:55,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:55,782 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:55,782 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:55,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:55,782 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:55,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:55,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:55,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:55,785 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:55,786 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:55,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:55,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:55,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:55,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:55,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:58:55,917 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:55,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:55,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:55,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable575 [2022-12-13 01:58:55,917 INFO L420 AbstractCegarLoop]: === Iteration 577 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 626333195, now seen corresponding path program 1 times [2022-12-13 01:58:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:55,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239177244] [2022-12-13 01:58:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:55,984 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 01:58:55,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:55,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239177244] [2022-12-13 01:58:55,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239177244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:55,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:55,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856959782] [2022-12-13 01:58:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:55,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:55,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:55,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:55,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:55,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:55,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:56,038 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:56,038 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:56,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:56,039 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:56,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:56,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:56,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:56,039 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:56,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:56,040 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,040 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:56,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:56,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:56,041 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:56,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:56,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,043 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:56,044 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:56,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 183 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:56,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:56,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:56,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:58:56,178 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:56,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:56,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:56,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable576 [2022-12-13 01:58:56,178 INFO L420 AbstractCegarLoop]: === Iteration 578 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 683591497, now seen corresponding path program 1 times [2022-12-13 01:58:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:56,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257089114] [2022-12-13 01:58:56,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:56,232 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 01:58:56,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:56,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257089114] [2022-12-13 01:58:56,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257089114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:56,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:56,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582552390] [2022-12-13 01:58:56,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:56,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:56,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:56,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:56,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:56,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:56,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:56,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:56,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:56,285 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:56,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:56,286 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:56,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:56,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:56,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:56,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:56,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:56,288 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:56,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:56,288 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:56,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:56,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,292 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:56,292 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:56,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:56,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:56,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:56,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:58:56,427 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:56,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,427 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:56,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:56,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable577 [2022-12-13 01:58:56,427 INFO L420 AbstractCegarLoop]: === Iteration 579 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:56,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 740849799, now seen corresponding path program 1 times [2022-12-13 01:58:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:56,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86672300] [2022-12-13 01:58:56,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:56,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:56,488 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 01:58:56,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:56,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86672300] [2022-12-13 01:58:56,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86672300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:56,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:56,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561150396] [2022-12-13 01:58:56,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:56,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:56,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:56,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:56,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:56,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:56,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:56,550 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:56,550 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:56,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:56,551 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:56,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:56,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:56,551 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:56,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:56,552 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:56,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:56,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:56,552 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:56,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:56,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,555 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:56,555 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:56,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:56,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:56,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:56,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:58:56,688 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:56,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:56,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:56,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable578 [2022-12-13 01:58:56,688 INFO L420 AbstractCegarLoop]: === Iteration 580 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 798108101, now seen corresponding path program 1 times [2022-12-13 01:58:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:56,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064077010] [2022-12-13 01:58:56,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:56,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:56,753 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 01:58:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:56,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064077010] [2022-12-13 01:58:56,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064077010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:56,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:56,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:56,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587035196] [2022-12-13 01:58:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:56,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:56,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:56,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:56,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:56,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:56,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:56,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:56,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:56,808 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:56,808 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:56,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:56,809 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:56,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:56,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:56,809 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:56,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:56,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:56,810 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:56,810 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:56,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:56,810 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:56,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:56,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:56,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,813 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:56,813 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:56,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:56,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:56,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:56,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:56,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:56,936 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:56,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:56,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:56,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:56,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable579 [2022-12-13 01:58:56,936 INFO L420 AbstractCegarLoop]: === Iteration 581 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 855366403, now seen corresponding path program 1 times [2022-12-13 01:58:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:56,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433736039] [2022-12-13 01:58:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:56,999 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 01:58:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:56,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433736039] [2022-12-13 01:58:56,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433736039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:56,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:57,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518400282] [2022-12-13 01:58:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:57,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:57,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:57,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:57,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:57,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:57,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:57,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:57,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:57,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:57,053 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:57,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:57,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:57,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:57,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:57,055 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:57,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:57,056 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:57,056 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:57,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:57,057 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:57,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:57,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:57,061 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:57,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:57,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:57,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:57,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:58:57,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:57,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:57,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:57,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable580 [2022-12-13 01:58:57,183 INFO L420 AbstractCegarLoop]: === Iteration 582 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 912624705, now seen corresponding path program 1 times [2022-12-13 01:58:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:57,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550927766] [2022-12-13 01:58:57,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:57,234 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 01:58:57,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:57,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550927766] [2022-12-13 01:58:57,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550927766] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:57,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:57,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923655955] [2022-12-13 01:58:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:57,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:57,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:57,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:57,235 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:57,235 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,235 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:57,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:57,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:57,278 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:57,278 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:57,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:57,278 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:57,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:57,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:57,279 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:57,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:57,280 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:57,280 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:57,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:57,280 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:57,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:57,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,283 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:57,283 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:57,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:57,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:57,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:57,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 01:58:57,395 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:57,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable581 [2022-12-13 01:58:57,396 INFO L420 AbstractCegarLoop]: === Iteration 583 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 969883007, now seen corresponding path program 1 times [2022-12-13 01:58:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:57,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280971352] [2022-12-13 01:58:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:57,446 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 01:58:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:57,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280971352] [2022-12-13 01:58:57,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280971352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:57,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:57,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476396753] [2022-12-13 01:58:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:57,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:57,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:57,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:57,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:57,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:57,490 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:57,490 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:57,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:57,490 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:57,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:57,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:57,491 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:57,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:57,492 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:57,492 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:57,492 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:57,492 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,492 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:57,492 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:57,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,495 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:57,495 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:57,495 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,495 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:57,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:57,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:58:57,626 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:57,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:57,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable582 [2022-12-13 01:58:57,626 INFO L420 AbstractCegarLoop]: === Iteration 584 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1027141309, now seen corresponding path program 1 times [2022-12-13 01:58:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:57,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688434397] [2022-12-13 01:58:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:57,688 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 01:58:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:57,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688434397] [2022-12-13 01:58:57,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688434397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:57,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:57,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:57,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936090552] [2022-12-13 01:58:57,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:57,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:57,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:57,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:57,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:57,741 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:57,741 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:57,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:57,742 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:57,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:57,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:57,742 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:57,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:57,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:57,743 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:57,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:57,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:57,744 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:57,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:57,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:57,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,746 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:57,747 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:57,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:57,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:57,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:57,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:57,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:58:57,881 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:57,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:57,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:57,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable583 [2022-12-13 01:58:57,881 INFO L420 AbstractCegarLoop]: === Iteration 585 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:57,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1084399611, now seen corresponding path program 1 times [2022-12-13 01:58:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:57,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971538337] [2022-12-13 01:58:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:57,941 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 01:58:57,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:57,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971538337] [2022-12-13 01:58:57,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971538337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:57,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:57,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882110123] [2022-12-13 01:58:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:57,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:57,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:57,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:57,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:57,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:57,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:57,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:57,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:57,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:58,000 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:58,000 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:58,001 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:58,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:58,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:58,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:58,002 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:58,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:58,002 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,002 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:58,003 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:58,003 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:58,003 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:58,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:58,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,005 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:58,006 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:58,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:58,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:58,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:58:58,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:58,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:58,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable584 [2022-12-13 01:58:58,149 INFO L420 AbstractCegarLoop]: === Iteration 586 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:58,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1141657913, now seen corresponding path program 1 times [2022-12-13 01:58:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:58,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312980484] [2022-12-13 01:58:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:58,204 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 01:58:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:58,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312980484] [2022-12-13 01:58:58,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312980484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:58,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:58,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038499505] [2022-12-13 01:58:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:58,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:58,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:58,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:58,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:58,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:58,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:58,262 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:58,262 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:58,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:58,263 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:58,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:58,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:58,264 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:58,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:58,265 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:58,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:58,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:58,265 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:58,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:58,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,268 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:58,268 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:58,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:58,396 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:58,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:58,397 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:58,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:58,397 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:58,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable585 [2022-12-13 01:58:58,397 INFO L420 AbstractCegarLoop]: === Iteration 587 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1198916215, now seen corresponding path program 1 times [2022-12-13 01:58:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:58,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948115454] [2022-12-13 01:58:58,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:58,461 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 01:58:58,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:58,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948115454] [2022-12-13 01:58:58,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948115454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:58,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:58,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:58,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985271589] [2022-12-13 01:58:58,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:58,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:58,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:58,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:58,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:58,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:58,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:58,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:58,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:58,520 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:58,520 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:58,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:58,521 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:58,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:58,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:58,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:58,521 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:58,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:58,522 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:58,522 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:58,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:58,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:58,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:58,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,526 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:58,526 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:58,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:58,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:58,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:58,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:58,655 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:58,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:58,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:58,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable586 [2022-12-13 01:58:58,656 INFO L420 AbstractCegarLoop]: === Iteration 588 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:58,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1256174517, now seen corresponding path program 1 times [2022-12-13 01:58:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259019404] [2022-12-13 01:58:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:58,707 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 01:58:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:58,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259019404] [2022-12-13 01:58:58,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259019404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:58,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:58,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542072591] [2022-12-13 01:58:58,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:58,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:58,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:58,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:58,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:58,708 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:58,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:58,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:58,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:58,766 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:58,766 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:58,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:58,767 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:58,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:58,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:58,767 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:58,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:58,768 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:58,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:58,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:58,768 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:58,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:58,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,771 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:58,771 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:58,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:58,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:58,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:58,892 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:58,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:58:58,893 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:58,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:58,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable587 [2022-12-13 01:58:58,893 INFO L420 AbstractCegarLoop]: === Iteration 589 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1313432819, now seen corresponding path program 1 times [2022-12-13 01:58:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:58,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454404387] [2022-12-13 01:58:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:58,949 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 01:58:58,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:58,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454404387] [2022-12-13 01:58:58,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454404387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:58,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:58,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773535301] [2022-12-13 01:58:58,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:58,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:58,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:58,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:58,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:58,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:58,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:58,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:58,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:58,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:58,997 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:58,997 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:58,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:58,998 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:58,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:58,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:58,998 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:58,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:58,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:58,999 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:58,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:58,999 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:58,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:58,999 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:59,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:59,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,002 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:59,002 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:59,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:59,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:59,121 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:59,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:58:59,121 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:59,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:59,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:59,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable588 [2022-12-13 01:58:59,122 INFO L420 AbstractCegarLoop]: === Iteration 590 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1370691121, now seen corresponding path program 1 times [2022-12-13 01:58:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119185002] [2022-12-13 01:58:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:59,171 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 01:58:59,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:59,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119185002] [2022-12-13 01:58:59,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119185002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:59,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:59,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356449059] [2022-12-13 01:58:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:59,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:59,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:59,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:59,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:59,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:59,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:59,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:59,224 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:59,224 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:59,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:59,225 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:59,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:59,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:59,225 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:59,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:59,226 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:59,226 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:59,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:59,226 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:59,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:59,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,230 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:59,231 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:59,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:59,358 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:59,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:58:59,358 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:59,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:59,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:59,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable589 [2022-12-13 01:58:59,359 INFO L420 AbstractCegarLoop]: === Iteration 591 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:59,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1427949423, now seen corresponding path program 1 times [2022-12-13 01:58:59,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:59,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668506502] [2022-12-13 01:58:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:59,423 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 01:58:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:59,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668506502] [2022-12-13 01:58:59,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668506502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:59,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:59,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987375439] [2022-12-13 01:58:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:59,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:59,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:59,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:59,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:59,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:59,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:59,466 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:59,466 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:59,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:59,467 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:59,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:59,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:59,468 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:59,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:59,468 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,468 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:59,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:59,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:59,469 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:59,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:59,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,472 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:59,472 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:58:59,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:59,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:59,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:59,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:58:59,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:59,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:59,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:59,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable590 [2022-12-13 01:58:59,587 INFO L420 AbstractCegarLoop]: === Iteration 592 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:59,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:59,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1485207725, now seen corresponding path program 1 times [2022-12-13 01:58:59,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:59,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050886560] [2022-12-13 01:58:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:59,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:59,646 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 01:58:59,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:59,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050886560] [2022-12-13 01:58:59,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050886560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:59,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:59,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960586499] [2022-12-13 01:58:59,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:59,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:59,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:59,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:59,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:59,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:59,692 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:59,692 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:58:59,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:59,692 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:59,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:59,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:59,693 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:59,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:59,694 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:59,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:59,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:59,694 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:59,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:59,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,697 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:59,697 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:59,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:59,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:58:59,813 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:58:59,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:58:59,814 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:58:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:58:59,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:58:59,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable591 [2022-12-13 01:58:59,814 INFO L420 AbstractCegarLoop]: === Iteration 593 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:58:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:58:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1542466027, now seen corresponding path program 1 times [2022-12-13 01:58:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:58:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874103553] [2022-12-13 01:58:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:58:59,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:58:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:58:59,865 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 01:58:59,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:58:59,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874103553] [2022-12-13 01:58:59,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874103553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:58:59,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:58:59,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:58:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657598806] [2022-12-13 01:58:59,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:58:59,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:58:59,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:58:59,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:58:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:58:59,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:58:59,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:58:59,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:58:59,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:58:59,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:58:59,910 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:58:59,910 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:58:59,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:58:59,910 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:58:59,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:58:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:58:59,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:58:59,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:58:59,911 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:58:59,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:58:59,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:58:59,912 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:58:59,912 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:58:59,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:58:59,912 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:58:59,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:58:59,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:58:59,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,915 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:58:59,915 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:58:59,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:58:59,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:58:59,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:00,039 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:00,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:59:00,040 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:00,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:00,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable592 [2022-12-13 01:59:00,040 INFO L420 AbstractCegarLoop]: === Iteration 594 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1599724329, now seen corresponding path program 1 times [2022-12-13 01:59:00,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:00,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365943164] [2022-12-13 01:59:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:00,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:00,115 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 01:59:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:00,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365943164] [2022-12-13 01:59:00,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365943164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:00,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:00,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:00,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295248011] [2022-12-13 01:59:00,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:00,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:00,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:00,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:00,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:00,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:00,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:00,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:00,181 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:00,181 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:00,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:00,182 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:00,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:00,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:00,182 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:00,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:00,183 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:00,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:00,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:00,183 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:00,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:00,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,186 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:00,186 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:00,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:00,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:00,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:00,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:00,320 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:00,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:00,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:00,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable593 [2022-12-13 01:59:00,320 INFO L420 AbstractCegarLoop]: === Iteration 595 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:00,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:00,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1656982631, now seen corresponding path program 1 times [2022-12-13 01:59:00,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:00,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450259560] [2022-12-13 01:59:00,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:00,374 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 01:59:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:00,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450259560] [2022-12-13 01:59:00,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450259560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:00,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:00,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034301427] [2022-12-13 01:59:00,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:00,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:00,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:00,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:00,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:00,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:00,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:00,437 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:00,437 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:00,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:00,438 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:00,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:00,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:00,438 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:00,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:00,439 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:00,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:00,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:00,440 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:00,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:00,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,442 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:00,443 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:00,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:00,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:00,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:00,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:00,577 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:00,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:00,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:00,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable594 [2022-12-13 01:59:00,577 INFO L420 AbstractCegarLoop]: === Iteration 596 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1714240933, now seen corresponding path program 1 times [2022-12-13 01:59:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737603673] [2022-12-13 01:59:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:00,648 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 01:59:00,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:00,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737603673] [2022-12-13 01:59:00,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737603673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:00,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:00,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:00,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380309690] [2022-12-13 01:59:00,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:00,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:00,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:00,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:00,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:00,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:00,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:00,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:00,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:00,702 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:00,702 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:00,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:00,703 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:00,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:00,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:00,704 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:00,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:00,704 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:00,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:00,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:00,705 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:00,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:00,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,708 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:00,708 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:00,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:00,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:00,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:00,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:00,840 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:00,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:00,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:00,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable595 [2022-12-13 01:59:00,840 INFO L420 AbstractCegarLoop]: === Iteration 597 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:00,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:00,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1771499235, now seen corresponding path program 1 times [2022-12-13 01:59:00,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:00,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197661297] [2022-12-13 01:59:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:00,896 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 01:59:00,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:00,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197661297] [2022-12-13 01:59:00,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197661297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:00,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:00,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874754961] [2022-12-13 01:59:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:00,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:00,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:00,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:00,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:00,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:00,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:00,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:00,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:00,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:00,949 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:00,949 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:00,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:00,950 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:00,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:00,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:00,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:00,951 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:00,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:00,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:00,952 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:00,952 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:00,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:00,952 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,952 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:00,952 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:00,952 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:00,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,955 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:00,955 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:00,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:00,955 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:00,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:01,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:01,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:59:01,093 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:01,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:01,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:01,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable596 [2022-12-13 01:59:01,094 INFO L420 AbstractCegarLoop]: === Iteration 598 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:01,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1828757537, now seen corresponding path program 1 times [2022-12-13 01:59:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:01,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332988598] [2022-12-13 01:59:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:01,165 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 01:59:01,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:01,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332988598] [2022-12-13 01:59:01,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332988598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:01,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:01,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902335195] [2022-12-13 01:59:01,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:01,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:01,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:01,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:01,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:01,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:01,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:01,226 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:01,226 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:01,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:01,227 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:01,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:01,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:01,227 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:01,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:01,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:01,229 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:01,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:01,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:01,229 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:01,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:01,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:01,234 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:01,234 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:01,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:01,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:01,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:01,386 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:01,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 01:59:01,387 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:01,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:01,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:01,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable597 [2022-12-13 01:59:01,387 INFO L420 AbstractCegarLoop]: === Iteration 599 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1886015839, now seen corresponding path program 1 times [2022-12-13 01:59:01,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:01,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965849383] [2022-12-13 01:59:01,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:01,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:01,460 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 01:59:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:01,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965849383] [2022-12-13 01:59:01,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965849383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:01,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:01,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853481337] [2022-12-13 01:59:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:01,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:01,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:01,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:01,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:01,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:01,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:01,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:01,522 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:01,522 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:01,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:01,523 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:01,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:01,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:01,524 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:01,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:01,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:01,524 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:01,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:01,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:01,525 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:01,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:01,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:01,543 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:01,543 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:01,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:01,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:01,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:01,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:01,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 01:59:01,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:01,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:01,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:01,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable598 [2022-12-13 01:59:01,682 INFO L420 AbstractCegarLoop]: === Iteration 600 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1943274141, now seen corresponding path program 1 times [2022-12-13 01:59:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:01,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959312100] [2022-12-13 01:59:01,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:01,747 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 01:59:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:01,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959312100] [2022-12-13 01:59:01,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959312100] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:01,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:01,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:01,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167147906] [2022-12-13 01:59:01,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:01,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:01,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:01,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:01,748 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:01,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:01,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:01,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:01,801 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:01,802 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:01,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:01,802 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:01,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:01,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:01,803 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:01,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:01,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:01,804 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:01,804 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:01,804 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:01,804 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:01,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:01,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:01,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:01,807 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:01,807 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:01,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:01,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:01,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:01,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:01,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:01,941 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:01,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:01,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:01,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:01,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable599 [2022-12-13 01:59:01,942 INFO L420 AbstractCegarLoop]: === Iteration 601 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2000532443, now seen corresponding path program 1 times [2022-12-13 01:59:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:01,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835494877] [2022-12-13 01:59:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:01,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:02,024 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 01:59:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:02,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835494877] [2022-12-13 01:59:02,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835494877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:02,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:02,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547337930] [2022-12-13 01:59:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:02,025 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:02,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:02,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:02,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:02,088 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:02,088 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:02,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:02,089 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:02,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:02,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:02,090 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:02,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:02,091 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:02,092 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:02,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:02,092 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:02,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:02,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,096 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:02,096 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:02,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:02,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:02,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:02,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:59:02,232 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:02,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:02,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:02,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable600 [2022-12-13 01:59:02,232 INFO L420 AbstractCegarLoop]: === Iteration 602 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:02,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:02,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2057790745, now seen corresponding path program 1 times [2022-12-13 01:59:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:02,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484993870] [2022-12-13 01:59:02,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:02,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:02,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:02,299 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 01:59:02,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:02,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484993870] [2022-12-13 01:59:02,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484993870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:02,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:02,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155780359] [2022-12-13 01:59:02,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:02,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:02,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:02,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:02,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:02,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:02,353 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:02,354 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:02,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:02,354 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:02,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:02,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:02,355 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:02,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:02,356 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,356 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:02,356 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:02,356 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:02,356 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:02,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:02,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,359 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:02,359 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:02,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:02,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,360 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:02,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:02,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:02,492 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:02,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:02,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable601 [2022-12-13 01:59:02,493 INFO L420 AbstractCegarLoop]: === Iteration 603 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2115049047, now seen corresponding path program 1 times [2022-12-13 01:59:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832117915] [2022-12-13 01:59:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:02,566 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 01:59:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:02,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832117915] [2022-12-13 01:59:02,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832117915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:02,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:02,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460162271] [2022-12-13 01:59:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:02,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:02,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:02,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:02,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:02,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:02,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:02,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:02,628 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:02,628 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:02,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:02,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:02,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:02,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:02,630 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:02,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:02,631 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:02,631 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:02,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:02,631 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:02,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:02,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,634 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:02,634 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:02,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:02,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:02,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:02,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:02,765 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:02,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:02,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:02,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable602 [2022-12-13 01:59:02,766 INFO L420 AbstractCegarLoop]: === Iteration 604 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:02,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2122659947, now seen corresponding path program 1 times [2022-12-13 01:59:02,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:02,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140646457] [2022-12-13 01:59:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:02,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:02,829 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 01:59:02,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:02,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140646457] [2022-12-13 01:59:02,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140646457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:02,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:02,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250231352] [2022-12-13 01:59:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:02,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:02,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:02,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:02,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:02,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:02,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:02,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:02,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:02,893 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:02,894 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:02,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:02,894 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:02,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:02,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:02,895 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:02,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:02,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:02,896 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:02,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:02,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:02,896 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:02,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:02,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:02,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,900 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:02,900 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:02,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:02,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:02,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:03,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:03,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:03,033 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:03,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:03,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:03,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable603 [2022-12-13 01:59:03,034 INFO L420 AbstractCegarLoop]: === Iteration 605 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:03,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2065401645, now seen corresponding path program 1 times [2022-12-13 01:59:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:03,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809217212] [2022-12-13 01:59:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:03,100 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 01:59:03,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:03,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809217212] [2022-12-13 01:59:03,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809217212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:03,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:03,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:03,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953527337] [2022-12-13 01:59:03,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:03,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:03,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:03,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:03,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:03,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:03,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:03,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:03,179 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:03,179 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:03,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:03,180 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:03,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:03,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:03,180 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:03,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:03,182 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,182 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:03,182 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:03,182 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:03,182 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:03,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:03,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,186 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:03,186 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:03,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:03,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:03,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:03,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:03,319 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:03,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:03,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:03,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable604 [2022-12-13 01:59:03,320 INFO L420 AbstractCegarLoop]: === Iteration 606 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:03,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2008143343, now seen corresponding path program 1 times [2022-12-13 01:59:03,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:03,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294379828] [2022-12-13 01:59:03,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:03,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:03,393 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 01:59:03,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:03,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294379828] [2022-12-13 01:59:03,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294379828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:03,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:03,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:03,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483138469] [2022-12-13 01:59:03,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:03,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:03,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:03,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:03,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:03,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:03,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:03,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:03,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:03,449 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:03,449 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:03,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:03,449 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:03,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:03,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:03,450 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:03,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:03,451 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:03,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:03,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:03,452 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:03,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:03,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:03,456 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:03,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:03,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:03,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:03,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:59:03,576 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:03,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:03,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable605 [2022-12-13 01:59:03,576 INFO L420 AbstractCegarLoop]: === Iteration 607 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1950885041, now seen corresponding path program 1 times [2022-12-13 01:59:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:03,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079415371] [2022-12-13 01:59:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:03,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:03,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079415371] [2022-12-13 01:59:03,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079415371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:03,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:03,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38355059] [2022-12-13 01:59:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:03,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:03,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:03,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:03,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:03,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:03,680 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:03,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:03,680 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:03,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:03,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:03,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:03,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:03,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:03,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:03,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:03,682 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:03,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:03,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,685 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:03,685 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:03,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:03,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:03,801 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:03,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:03,802 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:03,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:03,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:03,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable606 [2022-12-13 01:59:03,802 INFO L420 AbstractCegarLoop]: === Iteration 608 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:03,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:03,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1893626739, now seen corresponding path program 1 times [2022-12-13 01:59:03,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:03,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630727392] [2022-12-13 01:59:03,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:03,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:03,852 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 01:59:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:03,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630727392] [2022-12-13 01:59:03,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630727392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:03,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:03,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151795834] [2022-12-13 01:59:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:03,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:03,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:03,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:03,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:03,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:03,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:03,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:03,904 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:03,904 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:03,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:03,904 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:03,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:03,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:03,905 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:03,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:03,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:03,906 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:03,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:03,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:03,906 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,906 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:03,906 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:03,906 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:03,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,909 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:03,909 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:03,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:03,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:03,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:04,026 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:04,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:04,027 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:04,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:04,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:04,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable607 [2022-12-13 01:59:04,027 INFO L420 AbstractCegarLoop]: === Iteration 609 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:04,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1836368437, now seen corresponding path program 1 times [2022-12-13 01:59:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:04,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81492208] [2022-12-13 01:59:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:04,078 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 01:59:04,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:04,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81492208] [2022-12-13 01:59:04,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81492208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:04,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:04,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:04,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048307917] [2022-12-13 01:59:04,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:04,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:04,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:04,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:04,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:04,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:04,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:04,131 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:04,131 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:04,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:04,131 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:04,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:04,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:04,132 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:04,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:04,133 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:04,133 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:04,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:04,133 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:04,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:04,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,136 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:04,136 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:04,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:04,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:04,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:04,254 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:04,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:04,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:04,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable608 [2022-12-13 01:59:04,254 INFO L420 AbstractCegarLoop]: === Iteration 610 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:04,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1779110135, now seen corresponding path program 1 times [2022-12-13 01:59:04,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:04,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489675040] [2022-12-13 01:59:04,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:04,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:04,304 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 01:59:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:04,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489675040] [2022-12-13 01:59:04,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489675040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:04,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:04,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936255483] [2022-12-13 01:59:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:04,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:04,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:04,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:04,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:04,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:04,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:04,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:04,356 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:04,356 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:04,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:04,357 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:04,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:04,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:04,357 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:04,357 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:04,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:04,358 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,358 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:04,358 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:04,358 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:04,358 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:04,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:04,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,361 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:04,361 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:04,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:04,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:04,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:04,477 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:04,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:04,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:04,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable609 [2022-12-13 01:59:04,478 INFO L420 AbstractCegarLoop]: === Iteration 611 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:04,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1721851833, now seen corresponding path program 1 times [2022-12-13 01:59:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:04,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96221700] [2022-12-13 01:59:04,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:04,549 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 01:59:04,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:04,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96221700] [2022-12-13 01:59:04,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96221700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:04,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:04,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:04,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622677724] [2022-12-13 01:59:04,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:04,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:04,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:04,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:04,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:04,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:04,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:04,600 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:04,600 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:04,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:04,601 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:04,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:04,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:04,601 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:04,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:04,602 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:04,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:04,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:04,602 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:04,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:04,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,605 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:04,605 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:04,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:04,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:04,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:04,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:04,721 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:04,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:04,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:04,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable610 [2022-12-13 01:59:04,721 INFO L420 AbstractCegarLoop]: === Iteration 612 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:04,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1664593531, now seen corresponding path program 1 times [2022-12-13 01:59:04,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:04,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708482924] [2022-12-13 01:59:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:04,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:04,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 01:59:04,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:04,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708482924] [2022-12-13 01:59:04,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708482924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:04,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:04,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217745217] [2022-12-13 01:59:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:04,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:04,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:04,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:04,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:04,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:04,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:04,817 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:04,817 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:04,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:04,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:04,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:04,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:04,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:04,818 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:04,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:04,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:04,819 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:04,819 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:04,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:04,820 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:04,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:04,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:04,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:04,822 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:04,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:04,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:04,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:04,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:04,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:04,938 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:04,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:04,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:04,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable611 [2022-12-13 01:59:04,938 INFO L420 AbstractCegarLoop]: === Iteration 613 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1607335229, now seen corresponding path program 1 times [2022-12-13 01:59:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:04,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847967197] [2022-12-13 01:59:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:04,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 01:59:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:04,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847967197] [2022-12-13 01:59:04,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847967197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:04,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:04,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:04,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527743877] [2022-12-13 01:59:04,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:04,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:04,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:04,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:04,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:04,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:04,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:04,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:04,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:04,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:05,032 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:05,032 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:05,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:05,032 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:05,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:05,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:05,033 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:05,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:05,034 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:05,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:05,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:05,034 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:05,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:05,035 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,037 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:05,037 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:05,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:05,038 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:05,152 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:05,153 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:05,153 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:05,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:05,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:05,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable612 [2022-12-13 01:59:05,153 INFO L420 AbstractCegarLoop]: === Iteration 614 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:05,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1550076927, now seen corresponding path program 1 times [2022-12-13 01:59:05,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:05,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884520627] [2022-12-13 01:59:05,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:05,212 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 01:59:05,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:05,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884520627] [2022-12-13 01:59:05,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884520627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:05,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:05,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672655518] [2022-12-13 01:59:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:05,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:05,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:05,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:05,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:05,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:05,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:05,257 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:05,257 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:05,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:05,258 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:05,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:05,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:05,258 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:05,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:05,259 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,259 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:05,259 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:05,259 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:05,260 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:05,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:05,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,262 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:05,262 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:05,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:05,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:05,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:05,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:05,379 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:05,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:05,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:05,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable613 [2022-12-13 01:59:05,379 INFO L420 AbstractCegarLoop]: === Iteration 615 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:05,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:05,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1492818625, now seen corresponding path program 1 times [2022-12-13 01:59:05,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:05,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516582207] [2022-12-13 01:59:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:05,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:05,431 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 01:59:05,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:05,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516582207] [2022-12-13 01:59:05,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516582207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:05,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:05,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:05,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202546014] [2022-12-13 01:59:05,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:05,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:05,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:05,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:05,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:05,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:05,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:05,493 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:05,493 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:05,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:05,494 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:05,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:05,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:05,495 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:05,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:05,495 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:05,496 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:05,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:05,496 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:05,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:05,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,499 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:05,499 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:05,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:05,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:05,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:05,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:59:05,622 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:05,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:05,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:05,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable614 [2022-12-13 01:59:05,622 INFO L420 AbstractCegarLoop]: === Iteration 616 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:05,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1435560323, now seen corresponding path program 1 times [2022-12-13 01:59:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:05,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360501726] [2022-12-13 01:59:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:05,675 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 01:59:05,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:05,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360501726] [2022-12-13 01:59:05,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360501726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:05,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:05,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:05,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048854911] [2022-12-13 01:59:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:05,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:05,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:05,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:05,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:05,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:05,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:05,738 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:05,738 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:05,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:05,739 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:05,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:05,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:05,739 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:05,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:05,740 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:05,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:05,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:05,740 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:05,741 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:05,741 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,743 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:05,743 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:05,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:05,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:05,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:05,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:59:05,879 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:05,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:05,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:05,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable615 [2022-12-13 01:59:05,879 INFO L420 AbstractCegarLoop]: === Iteration 617 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1378302021, now seen corresponding path program 1 times [2022-12-13 01:59:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:05,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386972129] [2022-12-13 01:59:05,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:05,939 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 01:59:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:05,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386972129] [2022-12-13 01:59:05,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386972129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:05,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:05,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:05,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592409979] [2022-12-13 01:59:05,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:05,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:05,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:05,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:05,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:05,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:05,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:05,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:05,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:05,984 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:05,984 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:05,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:05,985 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:05,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:05,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:05,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:05,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:05,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:05,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:05,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:05,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:05,986 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:05,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:05,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:05,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,989 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:05,989 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:05,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:05,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:05,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:06,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:06,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:59:06,110 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:06,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:06,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:06,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable616 [2022-12-13 01:59:06,111 INFO L420 AbstractCegarLoop]: === Iteration 618 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:06,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1321043719, now seen corresponding path program 1 times [2022-12-13 01:59:06,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:06,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323353474] [2022-12-13 01:59:06,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:06,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:06,175 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 01:59:06,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:06,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323353474] [2022-12-13 01:59:06,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323353474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:06,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:06,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:06,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391124804] [2022-12-13 01:59:06,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:06,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:06,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:06,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:06,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:06,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:06,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:06,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:06,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:06,220 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:06,220 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:06,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:06,221 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:06,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:06,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:06,221 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:06,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:06,222 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:06,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:06,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:06,222 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:06,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:06,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,225 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:06,225 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:06,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:06,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:06,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:06,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:59:06,354 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:06,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:06,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:06,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable617 [2022-12-13 01:59:06,354 INFO L420 AbstractCegarLoop]: === Iteration 619 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1263785417, now seen corresponding path program 1 times [2022-12-13 01:59:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:06,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43258383] [2022-12-13 01:59:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:06,414 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 01:59:06,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:06,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43258383] [2022-12-13 01:59:06,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43258383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:06,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:06,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:06,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004377711] [2022-12-13 01:59:06,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:06,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:06,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:06,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:06,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:06,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:06,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:06,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:06,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:06,471 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:06,471 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:06,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:06,472 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:06,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:06,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:06,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:06,473 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:06,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:06,473 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:06,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:06,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:06,474 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:06,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:06,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,477 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:06,477 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:06,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:06,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:06,606 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:06,607 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:06,607 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:06,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,607 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:06,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:06,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable618 [2022-12-13 01:59:06,607 INFO L420 AbstractCegarLoop]: === Iteration 620 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1206527115, now seen corresponding path program 1 times [2022-12-13 01:59:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:06,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921719412] [2022-12-13 01:59:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:06,660 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 01:59:06,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:06,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921719412] [2022-12-13 01:59:06,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921719412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:06,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:06,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:06,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709162681] [2022-12-13 01:59:06,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:06,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:06,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:06,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:06,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:06,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:06,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:06,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:06,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:06,712 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:06,712 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:06,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:06,713 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:06,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:06,714 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:06,714 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:06,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:06,714 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:06,715 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:06,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:06,715 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,715 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:06,715 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:06,715 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,718 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:06,718 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:06,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:06,718 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,718 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:06,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:06,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:06,837 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:06,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:06,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:06,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable619 [2022-12-13 01:59:06,837 INFO L420 AbstractCegarLoop]: === Iteration 621 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1149268813, now seen corresponding path program 1 times [2022-12-13 01:59:06,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:06,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53563882] [2022-12-13 01:59:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:06,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:06,888 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 01:59:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:06,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53563882] [2022-12-13 01:59:06,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53563882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:06,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:06,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720044324] [2022-12-13 01:59:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:06,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:06,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:06,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:06,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:06,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:06,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:06,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:06,932 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:06,932 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:06,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:06,933 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:06,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:06,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:06,933 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:06,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:06,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:06,941 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:06,941 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:06,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:06,941 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,941 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:06,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:06,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:06,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,944 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:06,944 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:06,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:06,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:06,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:07,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:07,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:07,059 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:07,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:07,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:07,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable620 [2022-12-13 01:59:07,060 INFO L420 AbstractCegarLoop]: === Iteration 622 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1092010511, now seen corresponding path program 1 times [2022-12-13 01:59:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:07,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009477863] [2022-12-13 01:59:07,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:07,120 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 01:59:07,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:07,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009477863] [2022-12-13 01:59:07,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009477863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:07,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:07,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758759891] [2022-12-13 01:59:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:07,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:07,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:07,121 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:07,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:07,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:07,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:07,174 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:07,174 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:07,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:07,175 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:07,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:07,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:07,175 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:07,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:07,176 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:07,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:07,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:07,176 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:07,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:07,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,179 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:07,179 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:07,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:07,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:07,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:07,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:07,296 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:07,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:07,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:07,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable621 [2022-12-13 01:59:07,297 INFO L420 AbstractCegarLoop]: === Iteration 623 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:07,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:07,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1034752209, now seen corresponding path program 1 times [2022-12-13 01:59:07,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:07,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104685042] [2022-12-13 01:59:07,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:07,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:07,349 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 01:59:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:07,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104685042] [2022-12-13 01:59:07,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104685042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:07,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:07,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:07,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795447259] [2022-12-13 01:59:07,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:07,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:07,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:07,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:07,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:07,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:07,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:07,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:07,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:07,394 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:07,394 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:07,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:07,395 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:07,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:07,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:07,396 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:07,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:07,396 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:07,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:07,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:07,397 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:07,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:07,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,400 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:07,400 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:07,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:07,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,400 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:07,516 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:07,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:07,517 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:07,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:07,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:07,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable622 [2022-12-13 01:59:07,517 INFO L420 AbstractCegarLoop]: === Iteration 624 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:07,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash -977493907, now seen corresponding path program 1 times [2022-12-13 01:59:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:07,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509484142] [2022-12-13 01:59:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:07,568 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 01:59:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:07,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509484142] [2022-12-13 01:59:07,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509484142] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:07,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:07,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:07,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047873190] [2022-12-13 01:59:07,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:07,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:07,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:07,569 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:07,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:07,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:07,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:07,619 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:07,620 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:07,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:07,620 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:07,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:07,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:07,621 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:07,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:07,621 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:07,622 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:07,622 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:07,622 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,622 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:07,622 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:07,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,625 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:07,625 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:07,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:07,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:07,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:07,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:07,742 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:07,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:07,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable623 [2022-12-13 01:59:07,742 INFO L420 AbstractCegarLoop]: === Iteration 625 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash -920235605, now seen corresponding path program 1 times [2022-12-13 01:59:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:07,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614740697] [2022-12-13 01:59:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:07,796 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 01:59:07,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:07,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614740697] [2022-12-13 01:59:07,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614740697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:07,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:07,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:07,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411167065] [2022-12-13 01:59:07,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:07,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:07,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:07,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:07,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:07,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:07,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:07,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:07,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:07,850 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:07,850 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:07,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:07,851 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:07,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:07,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:07,852 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:07,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:07,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:07,853 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:07,853 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:07,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:07,853 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:07,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:07,853 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:07,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,856 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:07,856 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:07,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:07,856 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:07,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:07,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:07,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:07,987 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:07,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:07,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:07,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:07,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable624 [2022-12-13 01:59:07,987 INFO L420 AbstractCegarLoop]: === Iteration 626 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:07,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:07,987 INFO L85 PathProgramCache]: Analyzing trace with hash -862977303, now seen corresponding path program 1 times [2022-12-13 01:59:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:07,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107093804] [2022-12-13 01:59:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:08,051 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 01:59:08,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:08,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107093804] [2022-12-13 01:59:08,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107093804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:08,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:08,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:08,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473203889] [2022-12-13 01:59:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:08,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:08,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:08,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:08,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:08,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:08,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:08,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:08,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:08,114 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:08,114 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:08,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:08,115 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:08,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:08,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:08,116 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:08,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:08,117 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:08,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:08,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:08,118 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,118 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:08,118 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:08,118 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,131 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:08,131 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:08,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:08,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:08,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:08,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 01:59:08,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:08,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:08,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:08,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable625 [2022-12-13 01:59:08,266 INFO L420 AbstractCegarLoop]: === Iteration 627 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash -805719001, now seen corresponding path program 1 times [2022-12-13 01:59:08,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:08,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587274030] [2022-12-13 01:59:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:08,321 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 01:59:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587274030] [2022-12-13 01:59:08,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587274030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:08,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:08,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224953821] [2022-12-13 01:59:08,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:08,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:08,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:08,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:08,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:08,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:08,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:08,377 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:08,377 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:08,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:08,378 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:08,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:08,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:08,378 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:08,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:08,379 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:08,379 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:08,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:08,379 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:08,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:08,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,382 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:08,382 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:08,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:08,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:08,521 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:08,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 01:59:08,522 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:08,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:08,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:08,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable626 [2022-12-13 01:59:08,522 INFO L420 AbstractCegarLoop]: === Iteration 628 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -748460699, now seen corresponding path program 1 times [2022-12-13 01:59:08,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:08,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900949579] [2022-12-13 01:59:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:08,585 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 01:59:08,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:08,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900949579] [2022-12-13 01:59:08,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900949579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:08,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:08,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882697092] [2022-12-13 01:59:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:08,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:08,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:08,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:08,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:08,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:08,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:08,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:08,638 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:08,638 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:08,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:08,639 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:08,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:08,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:08,640 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:08,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:08,640 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:08,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:08,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:08,641 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:08,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:08,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,644 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:08,644 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:08,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:08,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:08,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:08,777 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:08,777 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:08,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:08,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:08,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable627 [2022-12-13 01:59:08,778 INFO L420 AbstractCegarLoop]: === Iteration 629 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:08,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash -691202397, now seen corresponding path program 1 times [2022-12-13 01:59:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:08,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906899099] [2022-12-13 01:59:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:08,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906899099] [2022-12-13 01:59:08,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906899099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:08,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:08,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:08,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278641579] [2022-12-13 01:59:08,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:08,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:08,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:08,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:08,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:08,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:08,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:08,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:08,908 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:08,908 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:08,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:08,908 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:08,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:08,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:08,909 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:08,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:08,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:08,910 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:08,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:08,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:08,910 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:08,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:08,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:08,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,913 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:08,913 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:08,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:08,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:08,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:09,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:09,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:09,047 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:09,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:09,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:09,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable628 [2022-12-13 01:59:09,048 INFO L420 AbstractCegarLoop]: === Iteration 630 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:09,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -633944095, now seen corresponding path program 1 times [2022-12-13 01:59:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:09,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225348805] [2022-12-13 01:59:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:09,118 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 01:59:09,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:09,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225348805] [2022-12-13 01:59:09,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225348805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:09,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:09,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:09,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297302956] [2022-12-13 01:59:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:09,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:09,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:09,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:09,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:09,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:09,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:09,187 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:09,187 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:09,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:09,188 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:09,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:09,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:09,188 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:09,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:09,189 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:09,189 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:09,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:09,189 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:09,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:09,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,192 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:09,192 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:09,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:09,193 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,193 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:09,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:09,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:09,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:09,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:09,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:09,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable629 [2022-12-13 01:59:09,324 INFO L420 AbstractCegarLoop]: === Iteration 631 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:09,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:09,325 INFO L85 PathProgramCache]: Analyzing trace with hash -576685793, now seen corresponding path program 1 times [2022-12-13 01:59:09,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:09,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479709353] [2022-12-13 01:59:09,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:09,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:09,376 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 01:59:09,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:09,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479709353] [2022-12-13 01:59:09,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479709353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:09,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:09,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644201970] [2022-12-13 01:59:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:09,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:09,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:09,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:09,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:09,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:09,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:09,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:09,428 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:09,429 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:09,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:09,429 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:09,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:09,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:09,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:09,430 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:09,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:09,431 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:09,432 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:09,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:09,432 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:09,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:09,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,436 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:09,436 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:09,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:09,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:09,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:59:09,577 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:09,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:09,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable630 [2022-12-13 01:59:09,577 INFO L420 AbstractCegarLoop]: === Iteration 632 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:09,578 INFO L85 PathProgramCache]: Analyzing trace with hash -519427491, now seen corresponding path program 1 times [2022-12-13 01:59:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:09,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747326356] [2022-12-13 01:59:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:09,633 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 01:59:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747326356] [2022-12-13 01:59:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747326356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:09,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:09,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:09,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056623028] [2022-12-13 01:59:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:09,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:09,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:09,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:09,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:09,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:09,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:09,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:09,695 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:09,695 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:09,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:09,696 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:09,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:09,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:09,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:09,697 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:09,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:09,698 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:09,698 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:09,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:09,698 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:09,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:09,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,701 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:09,701 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:09,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:09,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:09,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:09,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:09,834 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:09,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:09,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:09,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable631 [2022-12-13 01:59:09,834 INFO L420 AbstractCegarLoop]: === Iteration 633 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:09,834 INFO L85 PathProgramCache]: Analyzing trace with hash -462169189, now seen corresponding path program 1 times [2022-12-13 01:59:09,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:09,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235775000] [2022-12-13 01:59:09,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:09,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:09,889 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 01:59:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:09,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235775000] [2022-12-13 01:59:09,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235775000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:09,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:09,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704441146] [2022-12-13 01:59:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:09,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:09,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:09,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:09,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:09,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:09,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:09,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:09,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:09,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:09,942 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:09,942 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:09,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:09,943 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:09,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:09,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:09,944 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:09,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:09,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:09,945 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:09,945 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:09,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:09,945 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:09,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:09,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:09,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,948 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:09,948 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:09,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:09,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:09,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:10,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:10,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:10,080 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:10,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:10,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:10,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable632 [2022-12-13 01:59:10,081 INFO L420 AbstractCegarLoop]: === Iteration 634 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -404910887, now seen corresponding path program 1 times [2022-12-13 01:59:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:10,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143235967] [2022-12-13 01:59:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:10,135 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 01:59:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:10,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143235967] [2022-12-13 01:59:10,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143235967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:10,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:10,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658291641] [2022-12-13 01:59:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:10,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:10,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:10,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:10,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:10,190 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:10,191 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:10,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:10,191 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:10,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:10,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:10,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:10,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:10,193 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:10,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:10,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:10,193 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:10,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:10,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,196 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:10,196 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:10,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:10,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:10,329 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:10,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:10,330 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:10,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:10,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:10,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable633 [2022-12-13 01:59:10,330 INFO L420 AbstractCegarLoop]: === Iteration 635 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:10,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash -347652585, now seen corresponding path program 1 times [2022-12-13 01:59:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:10,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698459222] [2022-12-13 01:59:10,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:10,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:10,389 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 01:59:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698459222] [2022-12-13 01:59:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698459222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:10,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:10,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:10,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438645247] [2022-12-13 01:59:10,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:10,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:10,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:10,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:10,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:10,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:10,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:10,453 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:10,453 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:10,454 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:10,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:10,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:10,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:10,454 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:10,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:10,455 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:10,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:10,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:10,456 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:10,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:10,456 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,459 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:10,459 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:10,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:10,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:10,574 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:10,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:10,575 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:10,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:10,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:10,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable634 [2022-12-13 01:59:10,575 INFO L420 AbstractCegarLoop]: === Iteration 636 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:10,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:10,575 INFO L85 PathProgramCache]: Analyzing trace with hash -290394283, now seen corresponding path program 1 times [2022-12-13 01:59:10,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:10,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992305293] [2022-12-13 01:59:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:10,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:10,636 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 01:59:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:10,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992305293] [2022-12-13 01:59:10,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992305293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:10,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:10,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:10,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766205183] [2022-12-13 01:59:10,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:10,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:10,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:10,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:10,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:10,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:10,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:10,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:10,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:10,684 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:10,684 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:10,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:10,684 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:10,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:10,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:10,685 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:10,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:10,686 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:10,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:10,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:10,686 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:10,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:10,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,689 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:10,689 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:10,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:10,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:10,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:10,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:10,808 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:10,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:10,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:10,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable635 [2022-12-13 01:59:10,809 INFO L420 AbstractCegarLoop]: === Iteration 637 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:10,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash -233135981, now seen corresponding path program 1 times [2022-12-13 01:59:10,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:10,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811112125] [2022-12-13 01:59:10,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:10,867 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 01:59:10,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:10,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811112125] [2022-12-13 01:59:10,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811112125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:10,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:10,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486542852] [2022-12-13 01:59:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:10,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:10,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:10,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:10,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:10,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:10,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:10,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:10,913 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:10,914 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:10,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:10,914 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:10,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:10,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:10,915 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:10,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:10,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:10,915 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:10,916 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:10,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:10,916 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:10,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:10,916 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:10,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,919 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:10,919 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:10,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:10,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:10,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:11,037 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:11,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:11,037 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:11,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,037 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:11,037 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:11,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable636 [2022-12-13 01:59:11,037 INFO L420 AbstractCegarLoop]: === Iteration 638 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:11,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash -175877679, now seen corresponding path program 1 times [2022-12-13 01:59:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:11,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880070201] [2022-12-13 01:59:11,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,087 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 01:59:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880070201] [2022-12-13 01:59:11,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880070201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:11,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:11,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:11,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209721654] [2022-12-13 01:59:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:11,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:11,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:11,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:11,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:11,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:11,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:11,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:11,139 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:11,139 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:11,139 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:11,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:11,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:11,140 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:11,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:11,141 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:11,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:11,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:11,141 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:11,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:11,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,144 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:11,144 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:11,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:11,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:11,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:11,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:11,275 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:11,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:11,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:11,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable637 [2022-12-13 01:59:11,275 INFO L420 AbstractCegarLoop]: === Iteration 639 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:11,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -118619377, now seen corresponding path program 1 times [2022-12-13 01:59:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:11,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63848559] [2022-12-13 01:59:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,341 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 01:59:11,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:11,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63848559] [2022-12-13 01:59:11,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63848559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:11,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:11,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:11,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731642155] [2022-12-13 01:59:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:11,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:11,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:11,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:11,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:11,342 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:11,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:11,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:11,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:11,406 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:11,407 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:11,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:11,407 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:11,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:11,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:11,408 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:11,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:11,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:11,410 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:11,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:11,410 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:11,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:11,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,414 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:11,414 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:11,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:11,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:11,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:11,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 01:59:11,559 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:11,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:11,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:11,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable638 [2022-12-13 01:59:11,559 INFO L420 AbstractCegarLoop]: === Iteration 640 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -61361075, now seen corresponding path program 1 times [2022-12-13 01:59:11,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177198909] [2022-12-13 01:59:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:11,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,623 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 01:59:11,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:11,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177198909] [2022-12-13 01:59:11,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177198909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:11,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:11,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418323082] [2022-12-13 01:59:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:11,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:11,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:11,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:11,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:11,674 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:11,675 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:11,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:11,675 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:11,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:11,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:11,676 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:11,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:11,676 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:11,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:11,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:11,677 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:11,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:11,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,680 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:11,680 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:11,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:11,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:11,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:11,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:59:11,818 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:11,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:11,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:11,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable639 [2022-12-13 01:59:11,818 INFO L420 AbstractCegarLoop]: === Iteration 641 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:11,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:11,818 INFO L85 PathProgramCache]: Analyzing trace with hash -4102773, now seen corresponding path program 1 times [2022-12-13 01:59:11,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:11,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777059448] [2022-12-13 01:59:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:11,877 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 01:59:11,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:11,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777059448] [2022-12-13 01:59:11,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777059448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:11,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:11,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:11,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446884811] [2022-12-13 01:59:11,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:11,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:11,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:11,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:11,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:11,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:11,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:11,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:11,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:11,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:11,936 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:11,936 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:11,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:11,936 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:11,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:11,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:11,937 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:11,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:11,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:11,938 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:11,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:11,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:11,939 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:11,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:11,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:11,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,943 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:11,943 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:11,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:11,943 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:11,943 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:12,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:12,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:59:12,078 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:12,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:12,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:12,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable640 [2022-12-13 01:59:12,078 INFO L420 AbstractCegarLoop]: === Iteration 642 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash 53155529, now seen corresponding path program 1 times [2022-12-13 01:59:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:12,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15544805] [2022-12-13 01:59:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:12,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:12,139 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 01:59:12,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:12,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15544805] [2022-12-13 01:59:12,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15544805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:12,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:12,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522226089] [2022-12-13 01:59:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:12,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:12,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:12,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:12,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:12,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:12,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:12,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:12,190 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:12,190 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:12,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:12,190 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:12,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:12,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:12,191 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:12,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:12,192 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:12,192 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:12,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:12,192 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:12,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:12,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,195 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:12,195 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:12,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:12,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:12,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:12,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:12,310 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:12,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:12,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:12,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable641 [2022-12-13 01:59:12,310 INFO L420 AbstractCegarLoop]: === Iteration 643 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash 110413831, now seen corresponding path program 1 times [2022-12-13 01:59:12,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:12,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763763885] [2022-12-13 01:59:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:12,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:12,360 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 01:59:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:12,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763763885] [2022-12-13 01:59:12,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763763885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:12,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:12,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:12,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673259863] [2022-12-13 01:59:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:12,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:12,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:12,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:12,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:12,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:12,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:12,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:12,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:12,408 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:12,408 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:12,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:12,409 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:12,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:12,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:12,409 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:12,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:12,410 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:12,410 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:12,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:12,410 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:12,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:12,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,413 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:12,413 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:12,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:12,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:12,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:12,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:12,530 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:12,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:12,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:12,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable642 [2022-12-13 01:59:12,530 INFO L420 AbstractCegarLoop]: === Iteration 644 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:12,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash 167672133, now seen corresponding path program 1 times [2022-12-13 01:59:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:12,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563445170] [2022-12-13 01:59:12,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:12,590 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 01:59:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:12,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563445170] [2022-12-13 01:59:12,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563445170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:12,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:12,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:12,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992880903] [2022-12-13 01:59:12,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:12,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:12,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:12,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:12,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:12,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:12,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:12,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:12,636 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:12,636 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:12,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:12,636 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:12,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:12,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:12,637 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:12,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:12,638 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:12,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:12,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:12,638 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:12,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:12,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,641 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:12,641 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:12,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:12,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:12,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:12,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:12,756 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:12,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:12,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:12,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable643 [2022-12-13 01:59:12,757 INFO L420 AbstractCegarLoop]: === Iteration 645 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash 224930435, now seen corresponding path program 1 times [2022-12-13 01:59:12,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:12,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173504328] [2022-12-13 01:59:12,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:12,809 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 01:59:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:12,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173504328] [2022-12-13 01:59:12,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173504328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:12,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:12,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862633928] [2022-12-13 01:59:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:12,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:12,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:12,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:12,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:12,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:12,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:12,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:12,853 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:12,853 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:12,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:12,854 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:12,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:12,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:12,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:12,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:12,854 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:12,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:12,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:12,855 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:12,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:12,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:12,855 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:12,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:12,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:12,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,858 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:12,858 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:12,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:12,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:12,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:12,974 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:12,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:12,974 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:12,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:12,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:12,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:12,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable644 [2022-12-13 01:59:12,975 INFO L420 AbstractCegarLoop]: === Iteration 646 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:12,975 INFO L85 PathProgramCache]: Analyzing trace with hash 282188737, now seen corresponding path program 1 times [2022-12-13 01:59:12,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:12,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855127643] [2022-12-13 01:59:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:13,027 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 01:59:13,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:13,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855127643] [2022-12-13 01:59:13,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855127643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:13,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:13,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:13,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518647776] [2022-12-13 01:59:13,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:13,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:13,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:13,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:13,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:13,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:13,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:13,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:13,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:13,078 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:13,078 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:13,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:13,079 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:13,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:13,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:13,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:13,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:13,079 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:13,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:13,080 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:13,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:13,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:13,081 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:13,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:13,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,084 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:13,084 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:13,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:13,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:13,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:13,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:13,200 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:13,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,200 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:13,200 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:13,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable645 [2022-12-13 01:59:13,200 INFO L420 AbstractCegarLoop]: === Iteration 647 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:13,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash 339447039, now seen corresponding path program 1 times [2022-12-13 01:59:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:13,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836508270] [2022-12-13 01:59:13,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:13,259 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 01:59:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836508270] [2022-12-13 01:59:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836508270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:13,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:13,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:13,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390764585] [2022-12-13 01:59:13,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:13,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:13,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:13,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:13,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:13,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:13,310 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:13,310 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:13,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:13,311 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:13,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:13,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:13,311 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:13,312 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:13,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:13,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:13,313 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:13,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:13,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,315 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:13,316 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:13,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:13,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:13,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:13,430 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:13,430 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:13,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:13,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable646 [2022-12-13 01:59:13,431 INFO L420 AbstractCegarLoop]: === Iteration 648 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:13,431 INFO L85 PathProgramCache]: Analyzing trace with hash 396705341, now seen corresponding path program 1 times [2022-12-13 01:59:13,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:13,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153840981] [2022-12-13 01:59:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:13,490 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 01:59:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:13,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153840981] [2022-12-13 01:59:13,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153840981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:13,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:13,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456504840] [2022-12-13 01:59:13,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:13,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:13,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:13,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:13,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:13,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:13,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:13,536 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:13,537 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:13,537 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:13,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:13,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:13,538 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:13,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:13,539 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:13,539 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:13,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:13,539 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:13,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:13,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,542 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:13,542 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:13,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:13,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:13,660 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:13,660 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:13,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:13,660 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:13,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable647 [2022-12-13 01:59:13,660 INFO L420 AbstractCegarLoop]: === Iteration 649 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 453963643, now seen corresponding path program 1 times [2022-12-13 01:59:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:13,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512079885] [2022-12-13 01:59:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:13,724 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 01:59:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512079885] [2022-12-13 01:59:13,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512079885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:13,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:13,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:13,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734346600] [2022-12-13 01:59:13,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:13,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:13,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:13,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:13,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:13,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:13,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:13,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:13,767 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:13,768 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:13,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:13,768 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:13,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:13,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:13,769 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:13,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:13,769 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:13,770 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:13,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:13,770 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:13,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:13,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,773 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:13,773 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:13,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:13,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:13,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:13,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:13,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:13,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:13,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:13,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable648 [2022-12-13 01:59:13,889 INFO L420 AbstractCegarLoop]: === Iteration 650 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:13,889 INFO L85 PathProgramCache]: Analyzing trace with hash 511221945, now seen corresponding path program 1 times [2022-12-13 01:59:13,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:13,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679291515] [2022-12-13 01:59:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:13,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:13,940 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 01:59:13,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:13,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679291515] [2022-12-13 01:59:13,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679291515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:13,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449117969] [2022-12-13 01:59:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:13,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:13,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:13,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:13,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:13,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:13,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:13,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:13,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:13,984 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:13,984 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:13,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:13,985 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:13,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:13,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:13,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:13,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:13,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:13,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:13,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:13,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:13,986 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:13,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:13,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:13,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,989 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:13,989 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:13,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:13,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:13,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:14,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:14,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:14,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:14,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:14,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:14,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable649 [2022-12-13 01:59:14,108 INFO L420 AbstractCegarLoop]: === Iteration 651 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:14,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:14,108 INFO L85 PathProgramCache]: Analyzing trace with hash 568480247, now seen corresponding path program 1 times [2022-12-13 01:59:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:14,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660993621] [2022-12-13 01:59:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:14,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:14,162 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 01:59:14,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:14,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660993621] [2022-12-13 01:59:14,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660993621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:14,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:14,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:14,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397775508] [2022-12-13 01:59:14,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:14,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:14,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:14,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:14,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:14,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:14,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:14,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:14,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:14,207 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:14,208 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:14,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:14,208 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:14,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:14,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:14,209 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:14,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:14,209 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:14,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:14,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:14,210 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:14,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:14,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,213 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:14,213 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:14,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:14,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:14,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:14,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:14,329 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:14,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:14,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:14,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable650 [2022-12-13 01:59:14,329 INFO L420 AbstractCegarLoop]: === Iteration 652 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 625738549, now seen corresponding path program 1 times [2022-12-13 01:59:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:14,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912530826] [2022-12-13 01:59:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:14,390 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 01:59:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:14,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912530826] [2022-12-13 01:59:14,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912530826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:14,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:14,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143714466] [2022-12-13 01:59:14,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:14,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:14,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:14,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:14,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:14,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:14,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:14,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:14,432 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:14,432 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:14,432 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:14,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:14,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:14,433 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:14,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:14,434 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:14,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:14,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:14,434 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:14,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:14,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:14,437 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:14,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:14,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:14,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:14,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:14,557 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:14,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:14,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:14,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable651 [2022-12-13 01:59:14,557 INFO L420 AbstractCegarLoop]: === Iteration 653 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:14,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:14,558 INFO L85 PathProgramCache]: Analyzing trace with hash 682996851, now seen corresponding path program 1 times [2022-12-13 01:59:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:14,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003435566] [2022-12-13 01:59:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:14,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:14,609 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 01:59:14,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:14,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003435566] [2022-12-13 01:59:14,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003435566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:14,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:14,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83606668] [2022-12-13 01:59:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:14,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:14,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:14,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:14,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:14,664 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:14,664 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:14,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:14,665 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:14,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:14,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:14,665 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:14,665 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:14,666 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,666 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:14,666 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:14,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:14,666 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,666 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:14,666 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:14,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,669 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:14,669 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:14,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:14,669 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,669 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:14,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:14,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:14,786 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:14,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:14,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:14,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable652 [2022-12-13 01:59:14,787 INFO L420 AbstractCegarLoop]: === Iteration 654 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:14,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:14,787 INFO L85 PathProgramCache]: Analyzing trace with hash 740255153, now seen corresponding path program 1 times [2022-12-13 01:59:14,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:14,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343610437] [2022-12-13 01:59:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:14,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:14,837 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 01:59:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:14,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343610437] [2022-12-13 01:59:14,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343610437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:14,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:14,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:14,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392525962] [2022-12-13 01:59:14,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:14,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:14,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:14,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:14,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:14,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:14,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:14,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:14,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:14,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:14,880 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:14,880 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:14,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:14,881 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:14,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:14,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:14,881 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:14,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:14,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:14,882 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:14,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:14,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:14,883 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:14,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:14,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:14,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,885 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:14,885 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:14,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:14,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:14,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:15,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:15,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:15,003 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:15,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:15,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:15,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable653 [2022-12-13 01:59:15,004 INFO L420 AbstractCegarLoop]: === Iteration 655 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:15,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash 797513455, now seen corresponding path program 1 times [2022-12-13 01:59:15,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:15,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922842981] [2022-12-13 01:59:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:15,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:15,055 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 01:59:15,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:15,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922842981] [2022-12-13 01:59:15,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922842981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:15,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:15,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:15,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126752357] [2022-12-13 01:59:15,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:15,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:15,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:15,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:15,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:15,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:15,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:15,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:15,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:15,106 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:15,107 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:15,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:15,107 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:15,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:15,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:15,108 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:15,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:15,108 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:15,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:15,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:15,109 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:15,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:15,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,112 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:15,112 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:15,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:15,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:15,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:15,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:15,226 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:15,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:15,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:15,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable654 [2022-12-13 01:59:15,226 INFO L420 AbstractCegarLoop]: === Iteration 656 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:15,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:15,226 INFO L85 PathProgramCache]: Analyzing trace with hash 854771757, now seen corresponding path program 1 times [2022-12-13 01:59:15,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:15,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761739095] [2022-12-13 01:59:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:15,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:15,281 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 01:59:15,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761739095] [2022-12-13 01:59:15,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761739095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:15,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:15,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225943361] [2022-12-13 01:59:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:15,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:15,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:15,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:15,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:15,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:15,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:15,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:15,325 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:15,325 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:15,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:15,326 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:15,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:15,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:15,326 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:15,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:15,327 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:15,327 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:15,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:15,327 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:15,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:15,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,330 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:15,330 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:15,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:15,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:15,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:15,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:15,445 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:15,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:15,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:15,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable655 [2022-12-13 01:59:15,446 INFO L420 AbstractCegarLoop]: === Iteration 657 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:15,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash 912030059, now seen corresponding path program 1 times [2022-12-13 01:59:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:15,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847148603] [2022-12-13 01:59:15,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:15,508 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 01:59:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:15,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847148603] [2022-12-13 01:59:15,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847148603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:15,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:15,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:15,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846601014] [2022-12-13 01:59:15,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:15,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:15,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:15,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:15,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:15,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:15,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:15,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:15,559 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:15,560 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:15,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:15,560 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:15,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:15,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:15,561 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:15,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:15,561 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:15,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:15,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:15,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:15,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:15,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:15,565 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:15,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:15,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:15,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:15,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:15,695 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:15,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:15,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:15,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable656 [2022-12-13 01:59:15,696 INFO L420 AbstractCegarLoop]: === Iteration 658 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:15,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:15,696 INFO L85 PathProgramCache]: Analyzing trace with hash 969288361, now seen corresponding path program 1 times [2022-12-13 01:59:15,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:15,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606362197] [2022-12-13 01:59:15,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:15,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:15,745 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 01:59:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:15,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606362197] [2022-12-13 01:59:15,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606362197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:15,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:15,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651378840] [2022-12-13 01:59:15,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:15,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:15,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:15,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:15,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:15,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:15,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:15,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:15,789 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:15,789 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:15,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:15,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:15,790 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:15,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:15,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:15,791 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:15,791 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:15,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:15,791 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:15,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:15,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:15,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,794 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:15,794 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:15,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:15,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:15,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:15,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:15,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:59:15,919 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:15,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:15,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:15,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable657 [2022-12-13 01:59:15,919 INFO L420 AbstractCegarLoop]: === Iteration 659 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1026546663, now seen corresponding path program 1 times [2022-12-13 01:59:15,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945081745] [2022-12-13 01:59:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:15,969 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 01:59:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:15,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945081745] [2022-12-13 01:59:15,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945081745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:15,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:15,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865945465] [2022-12-13 01:59:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:15,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:15,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:15,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:15,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:15,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:16,013 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:16,013 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:16,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:16,014 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:16,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:16,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:16,014 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:16,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:16,015 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:16,015 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:16,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:16,015 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:16,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:16,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,018 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:16,018 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:16,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:16,019 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:16,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:16,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 01:59:16,155 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:16,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:16,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:16,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable658 [2022-12-13 01:59:16,156 INFO L420 AbstractCegarLoop]: === Iteration 660 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:16,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1083804965, now seen corresponding path program 1 times [2022-12-13 01:59:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:16,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893519278] [2022-12-13 01:59:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:16,207 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 01:59:16,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:16,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893519278] [2022-12-13 01:59:16,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893519278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:16,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:16,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287225931] [2022-12-13 01:59:16,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:16,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:16,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:16,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:16,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:16,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:16,258 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:16,258 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:16,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:16,258 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:16,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:16,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:16,259 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:16,260 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:16,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:16,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:16,260 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:16,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:16,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,263 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:16,263 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:16,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:16,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:16,377 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:16,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:16,378 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:16,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,378 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:16,378 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:16,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable659 [2022-12-13 01:59:16,378 INFO L420 AbstractCegarLoop]: === Iteration 661 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:16,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1141063267, now seen corresponding path program 1 times [2022-12-13 01:59:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:16,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108015153] [2022-12-13 01:59:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:16,431 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 01:59:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:16,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108015153] [2022-12-13 01:59:16,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108015153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:16,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:16,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33919064] [2022-12-13 01:59:16,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:16,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:16,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:16,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:16,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:16,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:16,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:16,475 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:16,475 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:16,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:16,476 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:16,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:16,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:16,476 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:16,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:16,477 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:16,477 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:16,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:16,477 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:16,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:16,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,480 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:16,480 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:16,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:16,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:16,604 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:16,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:59:16,605 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:16,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:16,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:16,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660 [2022-12-13 01:59:16,605 INFO L420 AbstractCegarLoop]: === Iteration 662 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:16,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1198321569, now seen corresponding path program 1 times [2022-12-13 01:59:16,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:16,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551608749] [2022-12-13 01:59:16,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:16,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:16,680 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 01:59:16,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:16,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551608749] [2022-12-13 01:59:16,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551608749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:16,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:16,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791745927] [2022-12-13 01:59:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:16,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:16,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:16,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:16,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:16,742 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:16,742 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:16,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:16,743 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:16,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:16,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:16,743 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:16,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:16,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:16,744 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:16,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:16,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:16,744 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:16,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:16,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:16,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,747 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:16,747 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:16,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:16,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:16,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:16,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:16,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:16,881 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:16,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:16,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:16,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable661 [2022-12-13 01:59:16,882 INFO L420 AbstractCegarLoop]: === Iteration 663 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1255579871, now seen corresponding path program 1 times [2022-12-13 01:59:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:16,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360776406] [2022-12-13 01:59:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:16,946 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 01:59:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:16,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360776406] [2022-12-13 01:59:16,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360776406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:16,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:16,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:16,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086879636] [2022-12-13 01:59:16,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:16,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:16,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:16,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:16,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:16,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:16,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:16,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:16,999 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:16,999 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:16,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:16,999 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:17,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:17,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:17,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:17,000 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:17,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:17,001 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:17,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:17,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:17,001 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:17,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:17,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,004 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:17,004 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:17,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:17,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:17,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:17,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:17,119 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:17,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:17,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:17,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable662 [2022-12-13 01:59:17,120 INFO L420 AbstractCegarLoop]: === Iteration 664 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1312838173, now seen corresponding path program 1 times [2022-12-13 01:59:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:17,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939283377] [2022-12-13 01:59:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:17,169 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 01:59:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:17,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939283377] [2022-12-13 01:59:17,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939283377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:17,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:17,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:17,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414876494] [2022-12-13 01:59:17,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:17,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:17,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:17,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:17,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:17,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:17,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:17,222 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:17,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:17,223 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:17,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:17,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:17,224 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:17,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:17,225 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:17,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:17,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:17,225 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:17,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:17,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,229 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:17,229 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:17,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:17,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:17,362 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:17,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:17,362 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:17,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:17,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:17,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable663 [2022-12-13 01:59:17,363 INFO L420 AbstractCegarLoop]: === Iteration 665 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:17,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:17,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1370096475, now seen corresponding path program 1 times [2022-12-13 01:59:17,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:17,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850788400] [2022-12-13 01:59:17,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:17,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:17,418 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 01:59:17,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:17,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850788400] [2022-12-13 01:59:17,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850788400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:17,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:17,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049605233] [2022-12-13 01:59:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:17,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:17,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:17,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:17,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:17,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:17,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:17,472 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:17,472 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:17,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:17,473 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:17,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:17,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:17,473 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:17,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:17,474 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:17,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:17,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:17,475 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:17,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:17,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,477 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:17,478 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:17,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:17,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:17,610 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:17,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:17,610 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:17,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:17,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:17,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable664 [2022-12-13 01:59:17,611 INFO L420 AbstractCegarLoop]: === Iteration 666 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:17,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:17,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1427354777, now seen corresponding path program 1 times [2022-12-13 01:59:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:17,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205974659] [2022-12-13 01:59:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:17,666 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 01:59:17,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:17,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205974659] [2022-12-13 01:59:17,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205974659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:17,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:17,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065970298] [2022-12-13 01:59:17,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:17,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:17,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:17,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:17,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:17,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:17,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:17,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:17,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:17,720 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:17,720 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:17,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:17,721 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:17,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:17,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:17,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:17,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:17,722 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:17,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:17,722 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:17,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:17,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:17,723 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:17,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:17,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,726 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:17,726 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:17,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:17,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:17,857 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:17,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:17,858 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:17,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:17,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:17,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665 [2022-12-13 01:59:17,858 INFO L420 AbstractCegarLoop]: === Iteration 667 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1484613079, now seen corresponding path program 1 times [2022-12-13 01:59:17,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:17,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312810496] [2022-12-13 01:59:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:17,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:17,936 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 01:59:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:17,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312810496] [2022-12-13 01:59:17,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312810496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:17,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:17,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149896218] [2022-12-13 01:59:17,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:17,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:17,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:17,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:17,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:17,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:17,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:17,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:17,990 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:17,990 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:17,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:17,991 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:17,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:17,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:17,991 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:17,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:17,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:17,992 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:17,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:17,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:17,993 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:17,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:17,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:17,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,996 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:17,996 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:17,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:17,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:17,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:18,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:18,126 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:18,126 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:18,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:18,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:18,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable666 [2022-12-13 01:59:18,126 INFO L420 AbstractCegarLoop]: === Iteration 668 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1541871381, now seen corresponding path program 1 times [2022-12-13 01:59:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:18,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360372885] [2022-12-13 01:59:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:18,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:18,186 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 01:59:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:18,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360372885] [2022-12-13 01:59:18,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360372885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:18,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:18,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487621312] [2022-12-13 01:59:18,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:18,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:18,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:18,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:18,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:18,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:18,241 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:18,241 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:18,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:18,242 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:18,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:18,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:18,243 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:18,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:18,244 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:18,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:18,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:18,244 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:18,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:18,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,247 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:18,247 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:18,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:18,247 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,247 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:18,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:18,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:18,379 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:18,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:18,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:18,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable667 [2022-12-13 01:59:18,380 INFO L420 AbstractCegarLoop]: === Iteration 669 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:18,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1599129683, now seen corresponding path program 1 times [2022-12-13 01:59:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:18,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809238624] [2022-12-13 01:59:18,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:18,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:18,441 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 01:59:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:18,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809238624] [2022-12-13 01:59:18,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809238624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:18,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:18,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299942386] [2022-12-13 01:59:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:18,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:18,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:18,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:18,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:18,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:18,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:18,494 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:18,494 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:18,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:18,495 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:18,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:18,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:18,496 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:18,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:18,496 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,496 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:18,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:18,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:18,497 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:18,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:18,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:18,500 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:18,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:18,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:18,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:18,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:18,632 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:18,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:18,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable668 [2022-12-13 01:59:18,632 INFO L420 AbstractCegarLoop]: === Iteration 670 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1656387985, now seen corresponding path program 1 times [2022-12-13 01:59:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:18,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135012141] [2022-12-13 01:59:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:18,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:18,687 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 01:59:18,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:18,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135012141] [2022-12-13 01:59:18,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135012141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:18,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:18,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:18,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356530938] [2022-12-13 01:59:18,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:18,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:18,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:18,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:18,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:18,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:18,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:18,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:18,741 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:18,741 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:18,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:18,742 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:18,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:18,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:18,742 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:18,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:18,743 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:18,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:18,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:18,743 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:18,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:18,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,746 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:18,746 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:18,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:18,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:18,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:18,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:18,877 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:18,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:18,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:18,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable669 [2022-12-13 01:59:18,878 INFO L420 AbstractCegarLoop]: === Iteration 671 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:18,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:18,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1713646287, now seen corresponding path program 1 times [2022-12-13 01:59:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:18,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355582555] [2022-12-13 01:59:18,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:18,938 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 01:59:18,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:18,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355582555] [2022-12-13 01:59:18,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355582555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:18,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:18,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366370885] [2022-12-13 01:59:18,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:18,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:18,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:18,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:18,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:18,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:18,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:18,991 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:18,991 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:18,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:18,992 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:18,992 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:18,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:18,993 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:18,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:18,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:18,994 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:18,994 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:18,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:18,994 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,994 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:18,994 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:18,994 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:18,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,997 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:18,997 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:18,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:18,997 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:18,997 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:19,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:19,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:19,128 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:19,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:19,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:19,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable670 [2022-12-13 01:59:19,128 INFO L420 AbstractCegarLoop]: === Iteration 672 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1770904589, now seen corresponding path program 1 times [2022-12-13 01:59:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:19,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698915198] [2022-12-13 01:59:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:19,216 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 01:59:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698915198] [2022-12-13 01:59:19,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698915198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:19,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:19,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975471454] [2022-12-13 01:59:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:19,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:19,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:19,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:19,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:19,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:19,270 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:19,270 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:19,271 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:19,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:19,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:19,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:19,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:19,272 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:19,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:19,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:19,273 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:19,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:19,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:19,273 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:19,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:19,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:19,276 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:19,276 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:19,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:19,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:19,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:19,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:19,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 01:59:19,434 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:19,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:19,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:19,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable671 [2022-12-13 01:59:19,435 INFO L420 AbstractCegarLoop]: === Iteration 673 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:19,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1828162891, now seen corresponding path program 1 times [2022-12-13 01:59:19,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:19,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522713467] [2022-12-13 01:59:19,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:19,502 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 01:59:19,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:19,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522713467] [2022-12-13 01:59:19,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522713467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:19,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:19,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204386462] [2022-12-13 01:59:19,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:19,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:19,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:19,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:19,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:19,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:19,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:19,566 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:19,567 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:19,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:19,567 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:19,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:19,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:19,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:19,568 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:19,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:19,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:19,569 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:19,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:19,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:19,569 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:19,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:19,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:19,572 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:19,572 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:19,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:19,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:19,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:19,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:19,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:19,703 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:19,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:19,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:19,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable672 [2022-12-13 01:59:19,703 INFO L420 AbstractCegarLoop]: === Iteration 674 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:19,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1885421193, now seen corresponding path program 1 times [2022-12-13 01:59:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:19,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322722247] [2022-12-13 01:59:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:19,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:19,768 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 01:59:19,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:19,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322722247] [2022-12-13 01:59:19,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322722247] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:19,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:19,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003431627] [2022-12-13 01:59:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:19,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:19,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:19,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:19,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:19,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:19,821 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:19,821 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:19,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:19,822 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:19,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:19,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:19,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:19,823 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:19,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:19,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:19,824 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:19,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:19,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:19,824 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:19,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:19,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:19,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:19,829 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:19,830 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:19,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:19,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:19,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:19,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:19,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:19,961 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:19,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:19,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:19,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:19,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable673 [2022-12-13 01:59:19,961 INFO L420 AbstractCegarLoop]: === Iteration 675 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1942679495, now seen corresponding path program 1 times [2022-12-13 01:59:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:19,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093324454] [2022-12-13 01:59:19,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,025 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 01:59:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:20,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093324454] [2022-12-13 01:59:20,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093324454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:20,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:20,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402417260] [2022-12-13 01:59:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:20,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:20,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:20,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:20,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:20,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:20,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:20,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:20,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:20,076 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:20,076 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:20,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:20,077 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:20,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:20,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:20,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:20,077 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:20,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:20,078 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,078 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:20,078 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:20,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:20,079 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:20,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:20,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,082 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:20,082 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:20,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:20,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:20,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:20,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:20,212 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:20,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,212 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:20,212 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:20,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable674 [2022-12-13 01:59:20,213 INFO L420 AbstractCegarLoop]: === Iteration 676 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1999937797, now seen corresponding path program 1 times [2022-12-13 01:59:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:20,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317574756] [2022-12-13 01:59:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,273 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 01:59:20,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:20,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317574756] [2022-12-13 01:59:20,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317574756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:20,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:20,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46206055] [2022-12-13 01:59:20,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:20,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:20,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:20,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:20,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:20,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:20,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:20,323 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:20,324 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:20,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:20,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:20,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:20,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:20,325 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:20,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:20,325 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:20,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:20,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:20,326 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:20,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:20,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,328 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:20,329 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:20,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:20,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:20,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:20,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:20,444 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:20,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:20,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:20,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable675 [2022-12-13 01:59:20,444 INFO L420 AbstractCegarLoop]: === Iteration 677 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2057196099, now seen corresponding path program 1 times [2022-12-13 01:59:20,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:20,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346407733] [2022-12-13 01:59:20,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:20,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,506 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 01:59:20,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:20,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346407733] [2022-12-13 01:59:20,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346407733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:20,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:20,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:20,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142425312] [2022-12-13 01:59:20,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:20,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:20,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:20,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:20,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:20,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:20,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:20,556 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:20,556 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:20,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:20,556 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:20,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:20,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:20,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:20,557 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:20,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:20,558 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:20,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:20,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:20,558 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:20,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:20,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,561 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:20,561 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:20,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:20,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:20,674 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:20,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:20,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:20,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:20,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:20,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable676 [2022-12-13 01:59:20,674 INFO L420 AbstractCegarLoop]: === Iteration 678 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2114454401, now seen corresponding path program 1 times [2022-12-13 01:59:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943915884] [2022-12-13 01:59:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,723 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 01:59:20,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:20,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943915884] [2022-12-13 01:59:20,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943915884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:20,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:20,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:20,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086382028] [2022-12-13 01:59:20,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:20,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:20,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:20,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:20,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:20,724 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:20,724 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:20,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:20,774 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:20,774 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:20,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:20,775 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:20,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:20,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:20,775 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:20,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:20,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:20,776 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:20,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:20,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:20,776 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:20,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:20,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,779 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:20,779 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:20,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:20,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:20,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:20,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:20,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:20,899 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:20,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:20,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:20,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable677 [2022-12-13 01:59:20,899 INFO L420 AbstractCegarLoop]: === Iteration 679 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:20,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:20,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2123254593, now seen corresponding path program 1 times [2022-12-13 01:59:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:20,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367648730] [2022-12-13 01:59:20,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:20,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:20,950 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 01:59:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:20,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367648730] [2022-12-13 01:59:20,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367648730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:20,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:20,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447193952] [2022-12-13 01:59:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:20,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:20,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:20,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:20,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:20,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:20,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:20,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:20,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:21,001 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:21,001 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:21,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:21,001 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:21,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:21,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:21,002 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:21,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:21,003 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,003 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:21,003 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:21,003 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:21,003 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,003 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:21,003 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:21,003 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,006 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:21,006 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:21,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:21,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:21,132 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:21,133 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:59:21,133 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:21,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,133 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:21,133 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:21,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable678 [2022-12-13 01:59:21,133 INFO L420 AbstractCegarLoop]: === Iteration 680 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2065996291, now seen corresponding path program 1 times [2022-12-13 01:59:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:21,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55341207] [2022-12-13 01:59:21,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:21,202 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 01:59:21,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:21,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55341207] [2022-12-13 01:59:21,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55341207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:21,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:21,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582123810] [2022-12-13 01:59:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:21,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:21,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:21,203 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:21,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:21,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:21,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:21,252 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:21,252 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:21,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:21,253 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:21,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:21,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:21,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:21,253 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:21,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:21,254 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:21,254 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:21,254 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:21,254 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:21,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:21,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,257 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:21,257 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:21,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:21,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:21,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:21,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:21,374 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:21,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:21,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable679 [2022-12-13 01:59:21,374 INFO L420 AbstractCegarLoop]: === Iteration 681 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:21,374 INFO L85 PathProgramCache]: Analyzing trace with hash -2008737989, now seen corresponding path program 1 times [2022-12-13 01:59:21,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:21,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421127376] [2022-12-13 01:59:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:21,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:21,426 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 01:59:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:21,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421127376] [2022-12-13 01:59:21,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421127376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:21,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:21,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104405757] [2022-12-13 01:59:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:21,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:21,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:21,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:21,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:21,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:21,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:21,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:21,478 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:21,478 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:21,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:21,479 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:21,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:21,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:21,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:21,479 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:21,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:21,480 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:21,481 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:21,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:21,481 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:21,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:21,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,483 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:21,484 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:21,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:21,484 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,484 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:21,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:21,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:59:21,609 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:21,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:21,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:21,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable680 [2022-12-13 01:59:21,610 INFO L420 AbstractCegarLoop]: === Iteration 682 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1951479687, now seen corresponding path program 1 times [2022-12-13 01:59:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:21,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133743085] [2022-12-13 01:59:21,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:21,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:21,669 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 01:59:21,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:21,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133743085] [2022-12-13 01:59:21,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133743085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:21,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:21,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:21,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742592069] [2022-12-13 01:59:21,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:21,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:21,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:21,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:21,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:21,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:21,721 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:21,721 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:21,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:21,722 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:21,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:21,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:21,722 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:21,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:21,723 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:21,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:21,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:21,724 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:21,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:21,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,726 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:21,726 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:21,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:21,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:21,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:21,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:21,840 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:21,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:21,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:21,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable681 [2022-12-13 01:59:21,841 INFO L420 AbstractCegarLoop]: === Iteration 683 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:21,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1894221385, now seen corresponding path program 1 times [2022-12-13 01:59:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:21,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233763471] [2022-12-13 01:59:21,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:21,890 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 01:59:21,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:21,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233763471] [2022-12-13 01:59:21,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233763471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:21,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:21,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987093226] [2022-12-13 01:59:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:21,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:21,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:21,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:21,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:21,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:21,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:21,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:21,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:21,933 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:21,933 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:21,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:21,933 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:21,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:21,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:21,934 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:21,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:21,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:21,935 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:21,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:21,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:21,935 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:21,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:21,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:21,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,938 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:21,938 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:21,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:21,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:21,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:22,051 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:22,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:22,052 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:22,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:22,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:22,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable682 [2022-12-13 01:59:22,052 INFO L420 AbstractCegarLoop]: === Iteration 684 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1836963083, now seen corresponding path program 1 times [2022-12-13 01:59:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196353780] [2022-12-13 01:59:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:22,102 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 01:59:22,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:22,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196353780] [2022-12-13 01:59:22,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196353780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:22,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:22,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323237520] [2022-12-13 01:59:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:22,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:22,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:22,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:22,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:22,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:22,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:22,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:22,146 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:22,146 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:22,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:22,147 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:22,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:22,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:22,147 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:22,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:22,148 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:22,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:22,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:22,149 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:22,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:22,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,151 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:22,151 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:22,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:22,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:22,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:22,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:22,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:22,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:22,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:22,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable683 [2022-12-13 01:59:22,266 INFO L420 AbstractCegarLoop]: === Iteration 685 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:22,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:22,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1779704781, now seen corresponding path program 1 times [2022-12-13 01:59:22,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:22,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228103541] [2022-12-13 01:59:22,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:22,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:22,324 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 01:59:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:22,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228103541] [2022-12-13 01:59:22,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228103541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:22,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:22,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054447808] [2022-12-13 01:59:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:22,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:22,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:22,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:22,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:22,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:22,369 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:22,369 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:22,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:22,369 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:22,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:22,370 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:22,370 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:22,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:22,371 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,371 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:22,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:22,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:22,371 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:22,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:22,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,374 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:22,374 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:22,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:22,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:22,488 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:22,489 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:22,489 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:22,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,489 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:22,489 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:22,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable684 [2022-12-13 01:59:22,489 INFO L420 AbstractCegarLoop]: === Iteration 686 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:22,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1722446479, now seen corresponding path program 1 times [2022-12-13 01:59:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:22,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209474591] [2022-12-13 01:59:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:22,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:22,539 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 01:59:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:22,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209474591] [2022-12-13 01:59:22,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209474591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:22,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:22,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611437133] [2022-12-13 01:59:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:22,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:22,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:22,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:22,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:22,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:22,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:22,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:22,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:22,584 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:22,584 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:22,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:22,585 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:22,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:22,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:22,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:22,585 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:22,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:22,586 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:22,586 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:22,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:22,586 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:22,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:22,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,589 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:22,589 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:22,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:22,590 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,590 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:22,732 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:22,732 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:59:22,732 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:22,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,732 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:22,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:22,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable685 [2022-12-13 01:59:22,733 INFO L420 AbstractCegarLoop]: === Iteration 687 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:22,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:22,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1665188177, now seen corresponding path program 1 times [2022-12-13 01:59:22,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:22,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344741840] [2022-12-13 01:59:22,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:22,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:22,798 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 01:59:22,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:22,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344741840] [2022-12-13 01:59:22,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344741840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:22,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:22,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:22,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315520633] [2022-12-13 01:59:22,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:22,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:22,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:22,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:22,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:22,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:22,862 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:22,862 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:22,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:22,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:22,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:22,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:22,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:22,863 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:22,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:22,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:22,864 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:22,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:22,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:22,865 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:22,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:22,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:22,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,869 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:22,869 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:22,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:22,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:22,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:23,010 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:23,010 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:59:23,010 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:23,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:23,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:23,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable686 [2022-12-13 01:59:23,011 INFO L420 AbstractCegarLoop]: === Iteration 688 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:23,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1607929875, now seen corresponding path program 1 times [2022-12-13 01:59:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:23,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045580856] [2022-12-13 01:59:23,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:23,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:23,072 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 01:59:23,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:23,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045580856] [2022-12-13 01:59:23,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045580856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:23,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:23,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:23,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667923741] [2022-12-13 01:59:23,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:23,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:23,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:23,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:23,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:23,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:23,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:23,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:23,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:23,127 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:23,127 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:23,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:23,128 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:23,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:23,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:23,128 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:23,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:23,129 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:23,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:23,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:23,129 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:23,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:23,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,132 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:23,132 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:23,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:23,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:23,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:23,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:23,251 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:23,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:23,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:23,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable687 [2022-12-13 01:59:23,251 INFO L420 AbstractCegarLoop]: === Iteration 689 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:23,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1550671573, now seen corresponding path program 1 times [2022-12-13 01:59:23,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:23,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422329012] [2022-12-13 01:59:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:23,311 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 01:59:23,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:23,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422329012] [2022-12-13 01:59:23,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422329012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:23,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:23,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:23,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400600803] [2022-12-13 01:59:23,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:23,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:23,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:23,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:23,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:23,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:23,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:23,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:23,365 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:23,365 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:23,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:23,365 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:23,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:23,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:23,366 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:23,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:23,367 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:23,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:23,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:23,367 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:23,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:23,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,370 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:23,370 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:23,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:23,371 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:23,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:23,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:23,486 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:23,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:23,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:23,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable688 [2022-12-13 01:59:23,487 INFO L420 AbstractCegarLoop]: === Iteration 690 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1493413271, now seen corresponding path program 1 times [2022-12-13 01:59:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:23,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323515762] [2022-12-13 01:59:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:23,537 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 01:59:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:23,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323515762] [2022-12-13 01:59:23,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323515762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:23,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:23,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880420279] [2022-12-13 01:59:23,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:23,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:23,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:23,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:23,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:23,581 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:23,581 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:23,581 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:23,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:23,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:23,582 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:23,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:23,583 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:23,583 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:23,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:23,583 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:23,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:23,583 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,586 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:23,586 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:23,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:23,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:23,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:23,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:23,699 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:23,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:23,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:23,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable689 [2022-12-13 01:59:23,699 INFO L420 AbstractCegarLoop]: === Iteration 691 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:23,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1436154969, now seen corresponding path program 1 times [2022-12-13 01:59:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:23,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746210838] [2022-12-13 01:59:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:23,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746210838] [2022-12-13 01:59:23,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746210838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:23,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:23,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758174088] [2022-12-13 01:59:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:23,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:23,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:23,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:23,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:23,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:23,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:23,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:23,794 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:23,794 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:23,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:23,794 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:23,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:23,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:23,795 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:23,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:23,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:23,796 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,796 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:23,796 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:23,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:23,796 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:23,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:23,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:23,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,799 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:23,799 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:23,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:23,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:23,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:23,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:23,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:23,919 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:23,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:23,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:23,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable690 [2022-12-13 01:59:23,920 INFO L420 AbstractCegarLoop]: === Iteration 692 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:23,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1378896667, now seen corresponding path program 1 times [2022-12-13 01:59:23,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:23,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541791949] [2022-12-13 01:59:23,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:23,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:23,977 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 01:59:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:23,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541791949] [2022-12-13 01:59:23,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541791949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:23,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:23,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487759620] [2022-12-13 01:59:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:23,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:23,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:23,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:23,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:23,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:23,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:24,028 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:24,028 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:24,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:24,029 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:24,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:24,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:24,029 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:24,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:24,030 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:24,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:24,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:24,030 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,031 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:24,031 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:24,031 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,033 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:24,033 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:24,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:24,034 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:24,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:24,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:24,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:24,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:24,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:24,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable691 [2022-12-13 01:59:24,149 INFO L420 AbstractCegarLoop]: === Iteration 693 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:24,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:24,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1321638365, now seen corresponding path program 1 times [2022-12-13 01:59:24,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:24,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452921538] [2022-12-13 01:59:24,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:24,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:24,201 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 01:59:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:24,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452921538] [2022-12-13 01:59:24,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452921538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:24,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:24,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:24,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495989142] [2022-12-13 01:59:24,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:24,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:24,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:24,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:24,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:24,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:24,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:24,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:24,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:24,244 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:24,244 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:24,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:24,245 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:24,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:24,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:24,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:24,246 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:24,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:24,246 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,246 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:24,247 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:24,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:24,247 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:24,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:24,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,249 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:24,250 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:24,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:24,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:24,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:24,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:24,365 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:24,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:24,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:24,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable692 [2022-12-13 01:59:24,365 INFO L420 AbstractCegarLoop]: === Iteration 694 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:24,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1264380063, now seen corresponding path program 1 times [2022-12-13 01:59:24,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:24,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084397616] [2022-12-13 01:59:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:24,416 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 01:59:24,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:24,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084397616] [2022-12-13 01:59:24,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084397616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:24,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:24,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:24,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396885038] [2022-12-13 01:59:24,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:24,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:24,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:24,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:24,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:24,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:24,469 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:24,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:24,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:24,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:24,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:24,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:24,470 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:24,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:24,471 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:24,471 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:24,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:24,471 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:24,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:24,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,474 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:24,474 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:24,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:24,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:24,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:24,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:59:24,596 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:24,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:24,596 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:24,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable693 [2022-12-13 01:59:24,597 INFO L420 AbstractCegarLoop]: === Iteration 695 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:24,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1207121761, now seen corresponding path program 1 times [2022-12-13 01:59:24,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:24,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019508742] [2022-12-13 01:59:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:24,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:24,650 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 01:59:24,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:24,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019508742] [2022-12-13 01:59:24,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019508742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:24,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:24,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:24,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848147958] [2022-12-13 01:59:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:24,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:24,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:24,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:24,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:24,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:24,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:24,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:24,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:24,697 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:24,697 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:24,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:24,698 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:24,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:24,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:24,698 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:24,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:24,699 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:24,699 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:24,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:24,699 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:24,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:24,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,702 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:24,702 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:24,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:24,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:24,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:24,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:24,818 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:24,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:24,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:24,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable694 [2022-12-13 01:59:24,818 INFO L420 AbstractCegarLoop]: === Iteration 696 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:24,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:24,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1149863459, now seen corresponding path program 1 times [2022-12-13 01:59:24,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:24,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074554059] [2022-12-13 01:59:24,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:24,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:24,869 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 01:59:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074554059] [2022-12-13 01:59:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074554059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:24,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:24,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:24,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490681162] [2022-12-13 01:59:24,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:24,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:24,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:24,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:24,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:24,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:24,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:24,913 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:24,913 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:24,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:24,913 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:24,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:24,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:24,914 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:24,914 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:24,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:24,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:24,915 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,915 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:24,915 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:24,915 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:24,915 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:24,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:24,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:24,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,918 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:24,918 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:24,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:24,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:24,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:25,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:25,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:25,033 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:25,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:25,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:25,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable695 [2022-12-13 01:59:25,033 INFO L420 AbstractCegarLoop]: === Iteration 697 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1092605157, now seen corresponding path program 1 times [2022-12-13 01:59:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:25,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356894618] [2022-12-13 01:59:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:25,092 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 01:59:25,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:25,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356894618] [2022-12-13 01:59:25,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356894618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:25,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:25,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095859448] [2022-12-13 01:59:25,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:25,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:25,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:25,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:25,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:25,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:25,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:25,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:25,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:25,136 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:25,136 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:25,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:25,136 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:25,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:25,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:25,137 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:25,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:25,138 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:25,138 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:25,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:25,138 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:25,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:25,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,141 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:25,141 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:25,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:25,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:25,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:25,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:25,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:25,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:25,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable696 [2022-12-13 01:59:25,256 INFO L420 AbstractCegarLoop]: === Iteration 698 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1035346855, now seen corresponding path program 1 times [2022-12-13 01:59:25,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914039046] [2022-12-13 01:59:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:25,305 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 01:59:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:25,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914039046] [2022-12-13 01:59:25,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914039046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:25,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:25,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:25,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983197730] [2022-12-13 01:59:25,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:25,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:25,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:25,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:25,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:25,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:25,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:25,350 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:25,350 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:25,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:25,351 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:25,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:25,352 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:25,352 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:25,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:25,352 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:25,353 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:25,353 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:25,353 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,353 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:25,353 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:25,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,356 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:25,356 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:25,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:25,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:25,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:25,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:25,474 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:25,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:25,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:25,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable697 [2022-12-13 01:59:25,474 INFO L420 AbstractCegarLoop]: === Iteration 699 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash -978088553, now seen corresponding path program 1 times [2022-12-13 01:59:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986452975] [2022-12-13 01:59:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:25,526 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 01:59:25,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:25,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986452975] [2022-12-13 01:59:25,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986452975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:25,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:25,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900126455] [2022-12-13 01:59:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:25,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:25,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:25,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:25,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:25,578 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:25,578 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:25,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:25,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:25,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:25,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:25,579 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:25,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:25,580 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:25,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:25,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:25,580 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:25,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:25,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,583 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:25,583 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:25,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:25,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:25,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:25,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:25,700 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:25,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:25,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:25,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable698 [2022-12-13 01:59:25,700 INFO L420 AbstractCegarLoop]: === Iteration 700 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -920830251, now seen corresponding path program 1 times [2022-12-13 01:59:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:25,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090752025] [2022-12-13 01:59:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:25,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:25,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090752025] [2022-12-13 01:59:25,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090752025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:25,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:25,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:25,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036014718] [2022-12-13 01:59:25,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:25,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:25,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:25,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:25,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:25,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:25,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:25,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:25,826 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:25,826 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:25,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:25,827 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:25,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:25,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:25,828 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:25,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:25,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:25,828 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:25,829 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:25,829 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:25,829 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:25,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:25,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:25,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,832 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:25,832 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:25,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:25,832 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:25,832 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:25,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:25,967 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:59:25,967 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:25,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:25,967 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:25,967 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:25,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable699 [2022-12-13 01:59:25,967 INFO L420 AbstractCegarLoop]: === Iteration 701 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash -863571949, now seen corresponding path program 1 times [2022-12-13 01:59:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:25,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889975490] [2022-12-13 01:59:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:26,026 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 01:59:26,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:26,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889975490] [2022-12-13 01:59:26,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889975490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:26,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:26,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892562545] [2022-12-13 01:59:26,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:26,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:26,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:26,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:26,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:26,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:26,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:26,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:26,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:26,090 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:26,090 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:26,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:26,091 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:26,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:26,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:26,091 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:26,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:26,092 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,092 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:26,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:26,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:26,093 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:26,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:26,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:26,097 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:26,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:26,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:26,219 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:26,219 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:59:26,219 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:26,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable700 [2022-12-13 01:59:26,219 INFO L420 AbstractCegarLoop]: === Iteration 702 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -806313647, now seen corresponding path program 1 times [2022-12-13 01:59:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753809582] [2022-12-13 01:59:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:26,270 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 01:59:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:26,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753809582] [2022-12-13 01:59:26,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753809582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:26,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:26,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:26,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307048283] [2022-12-13 01:59:26,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:26,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:26,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:26,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:26,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:26,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:26,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:26,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:26,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:26,321 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:26,321 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:26,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:26,322 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:26,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:26,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:26,323 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:26,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:26,323 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:26,324 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:26,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:26,324 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:26,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:26,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,326 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:26,327 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:26,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:26,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:26,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:26,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:26,441 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:26,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:26,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable701 [2022-12-13 01:59:26,441 INFO L420 AbstractCegarLoop]: === Iteration 703 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash -749055345, now seen corresponding path program 1 times [2022-12-13 01:59:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:26,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769718071] [2022-12-13 01:59:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:26,490 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 01:59:26,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:26,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769718071] [2022-12-13 01:59:26,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769718071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:26,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:26,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850975757] [2022-12-13 01:59:26,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:26,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:26,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:26,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:26,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:26,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:26,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:26,534 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:26,535 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:26,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:26,535 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:26,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:26,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:26,536 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:26,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:26,536 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:26,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:26,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:26,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:26,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:26,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,539 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:26,540 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:26,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:26,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:26,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:26,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:59:26,667 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:26,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:26,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:26,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable702 [2022-12-13 01:59:26,667 INFO L420 AbstractCegarLoop]: === Iteration 704 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -691797043, now seen corresponding path program 1 times [2022-12-13 01:59:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:26,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995797088] [2022-12-13 01:59:26,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:26,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:26,718 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 01:59:26,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:26,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995797088] [2022-12-13 01:59:26,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995797088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:26,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:26,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:26,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720186193] [2022-12-13 01:59:26,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:26,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:26,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:26,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:26,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:26,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:26,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:26,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:26,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:26,762 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:26,762 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:26,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:26,762 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:26,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:26,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:26,763 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:26,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:26,764 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:26,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:26,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:26,764 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:26,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:26,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,767 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:26,767 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:26,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:26,767 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,767 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:26,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:26,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:26,882 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:26,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:26,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:26,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable703 [2022-12-13 01:59:26,882 INFO L420 AbstractCegarLoop]: === Iteration 705 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:26,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:26,882 INFO L85 PathProgramCache]: Analyzing trace with hash -634538741, now seen corresponding path program 1 times [2022-12-13 01:59:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:26,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046402548] [2022-12-13 01:59:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:26,931 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 01:59:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:26,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046402548] [2022-12-13 01:59:26,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046402548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:26,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:26,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:26,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607364978] [2022-12-13 01:59:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:26,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:26,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:26,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:26,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:26,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:26,974 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:26,974 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:26,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:26,975 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:26,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:26,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:26,976 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:26,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:26,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:26,976 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:26,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:26,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:26,977 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:26,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:26,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,980 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:26,980 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:26,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:26,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:26,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:27,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:27,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:27,093 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:27,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:27,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:27,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable704 [2022-12-13 01:59:27,093 INFO L420 AbstractCegarLoop]: === Iteration 706 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash -577280439, now seen corresponding path program 1 times [2022-12-13 01:59:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:27,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433454923] [2022-12-13 01:59:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:27,143 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 01:59:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:27,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433454923] [2022-12-13 01:59:27,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433454923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:27,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:27,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776566545] [2022-12-13 01:59:27,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:27,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:27,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:27,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:27,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:27,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:27,187 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:27,187 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:27,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:27,187 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:27,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:27,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:27,188 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:27,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:27,189 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:27,189 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:27,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:27,189 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:27,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:27,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,192 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:27,192 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:27,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:27,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:27,306 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:27,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:27,307 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:27,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:27,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:27,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable705 [2022-12-13 01:59:27,307 INFO L420 AbstractCegarLoop]: === Iteration 707 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash -520022137, now seen corresponding path program 1 times [2022-12-13 01:59:27,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:27,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461038691] [2022-12-13 01:59:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:27,357 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 01:59:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:27,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461038691] [2022-12-13 01:59:27,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461038691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:27,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:27,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694818550] [2022-12-13 01:59:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:27,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:27,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:27,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:27,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:27,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:27,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:27,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:27,413 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:27,413 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:27,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:27,413 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:27,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:27,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:27,414 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:27,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:27,415 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:27,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:27,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:27,415 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:27,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:27,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,418 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:27,418 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:27,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:27,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:27,543 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:27,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:59:27,544 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:27,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:27,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:27,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable706 [2022-12-13 01:59:27,544 INFO L420 AbstractCegarLoop]: === Iteration 708 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:27,545 INFO L85 PathProgramCache]: Analyzing trace with hash -462763835, now seen corresponding path program 1 times [2022-12-13 01:59:27,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:27,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141427496] [2022-12-13 01:59:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:27,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:27,597 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 01:59:27,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:27,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141427496] [2022-12-13 01:59:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141427496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:27,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:27,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931570135] [2022-12-13 01:59:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:27,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:27,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:27,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:27,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:27,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:27,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:27,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:27,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:27,651 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:27,651 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:27,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:27,651 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:27,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:27,652 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:27,652 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:27,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:27,653 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,653 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:27,653 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:27,653 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:27,653 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:27,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:27,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,656 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:27,656 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:27,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:27,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:27,771 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:27,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:27,771 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:27,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:27,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:27,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable707 [2022-12-13 01:59:27,772 INFO L420 AbstractCegarLoop]: === Iteration 709 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash -405505533, now seen corresponding path program 1 times [2022-12-13 01:59:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328495967] [2022-12-13 01:59:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:27,821 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 01:59:27,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:27,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328495967] [2022-12-13 01:59:27,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328495967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:27,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:27,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:27,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396748830] [2022-12-13 01:59:27,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:27,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:27,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:27,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:27,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:27,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:27,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:27,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:27,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:27,864 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:27,864 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:27,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:27,865 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:27,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:27,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:27,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:27,865 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:27,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:27,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:27,866 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:27,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:27,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:27,867 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:27,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:27,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:27,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,869 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:27,869 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:27,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:27,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:27,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:27,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:27,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:27,983 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:27,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:27,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:27,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:27,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable708 [2022-12-13 01:59:27,983 INFO L420 AbstractCegarLoop]: === Iteration 710 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash -348247231, now seen corresponding path program 1 times [2022-12-13 01:59:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:27,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832464189] [2022-12-13 01:59:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:27,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:28,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 01:59:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:28,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832464189] [2022-12-13 01:59:28,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832464189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:28,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:28,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:28,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588016728] [2022-12-13 01:59:28,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:28,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:28,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:28,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:28,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:28,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:28,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:28,078 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:28,078 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:28,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:28,079 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:28,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:28,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:28,080 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:28,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:28,080 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:28,081 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:28,081 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:28,081 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:28,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:28,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,083 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:28,084 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:28,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:28,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:28,198 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:28,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:28,198 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:28,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:28,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:28,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709 [2022-12-13 01:59:28,199 INFO L420 AbstractCegarLoop]: === Iteration 711 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash -290988929, now seen corresponding path program 1 times [2022-12-13 01:59:28,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:28,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763015317] [2022-12-13 01:59:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:28,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:28,258 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 01:59:28,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:28,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763015317] [2022-12-13 01:59:28,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763015317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:28,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:28,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:28,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480863011] [2022-12-13 01:59:28,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:28,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:28,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:28,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:28,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:28,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:28,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:28,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:28,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:28,304 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:28,304 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:28,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:28,304 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:28,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:28,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:28,305 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:28,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:28,306 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:28,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:28,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:28,306 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:28,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:28,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,309 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:28,309 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:28,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:28,310 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:28,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:28,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:28,425 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:28,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:28,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:28,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable710 [2022-12-13 01:59:28,425 INFO L420 AbstractCegarLoop]: === Iteration 712 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -233730627, now seen corresponding path program 1 times [2022-12-13 01:59:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:28,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252465319] [2022-12-13 01:59:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:28,478 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 01:59:28,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:28,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252465319] [2022-12-13 01:59:28,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252465319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:28,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:28,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49554161] [2022-12-13 01:59:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:28,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:28,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:28,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:28,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:28,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:28,531 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:28,531 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:28,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:28,531 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:28,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:28,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:28,539 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:28,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:28,540 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:28,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:28,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:28,540 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:28,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:28,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,543 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:28,543 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:28,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:28,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:28,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:28,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:28,673 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:28,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:28,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:28,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable711 [2022-12-13 01:59:28,673 INFO L420 AbstractCegarLoop]: === Iteration 713 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash -176472325, now seen corresponding path program 1 times [2022-12-13 01:59:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:28,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083523143] [2022-12-13 01:59:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:28,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083523143] [2022-12-13 01:59:28,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083523143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:28,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:28,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041800181] [2022-12-13 01:59:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:28,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:28,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:28,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:28,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:28,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:28,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:28,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:28,793 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:28,793 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:28,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:28,794 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:28,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:28,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:28,794 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:28,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:28,795 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:28,796 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:28,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:28,796 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:28,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:28,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:28,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,799 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:28,799 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:28,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:28,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:28,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:28,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:28,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:28,930 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:28,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:28,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:28,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable712 [2022-12-13 01:59:28,930 INFO L420 AbstractCegarLoop]: === Iteration 714 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:28,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash -119214023, now seen corresponding path program 1 times [2022-12-13 01:59:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:28,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912076674] [2022-12-13 01:59:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:28,984 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 01:59:28,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:28,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912076674] [2022-12-13 01:59:28,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912076674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:28,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:28,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278544282] [2022-12-13 01:59:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:28,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:28,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:28,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:28,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:28,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:28,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:28,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:29,038 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:29,039 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:29,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:29,039 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:29,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:29,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:29,040 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:29,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:29,041 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,042 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:29,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:29,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:29,042 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:29,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:29,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,046 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:29,046 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:29,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:29,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:29,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:29,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:29,163 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:29,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:29,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:29,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable713 [2022-12-13 01:59:29,163 INFO L420 AbstractCegarLoop]: === Iteration 715 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash -61955721, now seen corresponding path program 1 times [2022-12-13 01:59:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678996543] [2022-12-13 01:59:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:29,211 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 01:59:29,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:29,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678996543] [2022-12-13 01:59:29,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678996543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:29,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:29,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:29,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708848217] [2022-12-13 01:59:29,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:29,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:29,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:29,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:29,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:29,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:29,264 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:29,264 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:29,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:29,264 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:29,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:29,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:29,265 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:29,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:29,266 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:29,266 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:29,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:29,266 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:29,266 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:29,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,269 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:29,269 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:29,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:29,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:29,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:29,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:29,386 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:29,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:29,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable714 [2022-12-13 01:59:29,386 INFO L420 AbstractCegarLoop]: === Iteration 716 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash -4697419, now seen corresponding path program 1 times [2022-12-13 01:59:29,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:29,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089288889] [2022-12-13 01:59:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:29,438 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 01:59:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:29,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089288889] [2022-12-13 01:59:29,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089288889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:29,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:29,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:29,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746911694] [2022-12-13 01:59:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:29,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:29,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:29,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:29,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:29,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:29,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:29,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:29,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:29,510 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:29,510 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:29,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:29,510 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:29,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:29,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:29,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:29,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:29,511 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:29,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:29,512 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:29,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:29,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:29,512 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:29,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:29,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,515 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:29,515 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:29,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:29,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:29,634 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:29,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:29,635 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:29,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:29,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:29,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable715 [2022-12-13 01:59:29,635 INFO L420 AbstractCegarLoop]: === Iteration 717 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:29,635 INFO L85 PathProgramCache]: Analyzing trace with hash 52560883, now seen corresponding path program 1 times [2022-12-13 01:59:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:29,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126396782] [2022-12-13 01:59:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:29,689 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 01:59:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:29,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126396782] [2022-12-13 01:59:29,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126396782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:29,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:29,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:29,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918647491] [2022-12-13 01:59:29,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:29,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:29,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:29,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:29,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:29,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:29,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:29,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:29,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:29,743 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:29,743 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:29,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:29,744 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:29,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:29,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:29,744 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:29,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:29,745 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:29,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:29,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:29,746 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,746 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:29,746 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:29,746 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,756 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:29,756 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:29,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:29,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:29,870 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:29,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:59:29,871 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:29,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:29,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:29,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable716 [2022-12-13 01:59:29,871 INFO L420 AbstractCegarLoop]: === Iteration 718 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 109819185, now seen corresponding path program 1 times [2022-12-13 01:59:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711898458] [2022-12-13 01:59:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:29,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:29,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711898458] [2022-12-13 01:59:29,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711898458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:29,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:29,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653305025] [2022-12-13 01:59:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:29,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:29,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:29,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:29,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:29,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:29,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:29,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:29,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:29,966 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:29,967 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:29,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:29,967 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:29,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:29,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:29,968 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:29,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:29,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:29,968 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:29,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:29,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:29,969 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:29,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:29,969 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:29,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,972 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:29,972 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:29,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:29,972 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:29,972 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:30,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:30,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:30,088 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:30,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:30,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:30,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable717 [2022-12-13 01:59:30,089 INFO L420 AbstractCegarLoop]: === Iteration 719 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:30,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 167077487, now seen corresponding path program 1 times [2022-12-13 01:59:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:30,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832520816] [2022-12-13 01:59:30,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:30,140 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 01:59:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:30,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832520816] [2022-12-13 01:59:30,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832520816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:30,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:30,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:30,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845661531] [2022-12-13 01:59:30,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:30,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:30,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:30,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:30,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:30,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:30,185 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:30,186 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:30,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:30,186 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:30,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:30,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:30,187 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:30,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:30,188 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:30,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:30,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:30,188 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:30,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:30,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,191 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:30,191 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:30,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:30,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:30,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:30,319 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:59:30,320 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:30,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:30,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:30,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable718 [2022-12-13 01:59:30,320 INFO L420 AbstractCegarLoop]: === Iteration 720 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:30,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 224335789, now seen corresponding path program 1 times [2022-12-13 01:59:30,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:30,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192564934] [2022-12-13 01:59:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:30,373 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 01:59:30,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:30,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192564934] [2022-12-13 01:59:30,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192564934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:30,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:30,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409607241] [2022-12-13 01:59:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:30,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:30,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:30,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:30,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:30,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:30,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:30,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:30,423 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:30,424 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:30,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:30,424 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:30,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:30,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:30,425 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:30,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:30,426 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:30,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:30,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:30,426 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:30,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:30,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,429 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:30,429 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:30,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:30,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:30,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:30,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:30,547 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:30,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,548 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:30,548 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:30,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable719 [2022-12-13 01:59:30,548 INFO L420 AbstractCegarLoop]: === Iteration 721 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash 281594091, now seen corresponding path program 1 times [2022-12-13 01:59:30,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:30,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078396482] [2022-12-13 01:59:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:30,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:30,602 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 01:59:30,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:30,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078396482] [2022-12-13 01:59:30,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078396482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:30,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:30,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:30,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275216452] [2022-12-13 01:59:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:30,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:30,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:30,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:30,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:30,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:30,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:30,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:30,649 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:30,650 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:30,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:30,650 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:30,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:30,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:30,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:30,651 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:30,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:30,652 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:30,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:30,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:30,652 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:30,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:30,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,655 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:30,655 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:30,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:30,777 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:30,778 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:59:30,778 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:30,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,778 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:30,778 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:30,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable720 [2022-12-13 01:59:30,778 INFO L420 AbstractCegarLoop]: === Iteration 722 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash 338852393, now seen corresponding path program 1 times [2022-12-13 01:59:30,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:30,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96780109] [2022-12-13 01:59:30,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:30,828 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 01:59:30,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:30,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96780109] [2022-12-13 01:59:30,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96780109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:30,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:30,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033050605] [2022-12-13 01:59:30,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:30,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:30,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:30,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:30,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:30,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:30,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:30,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:30,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:30,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:30,881 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:30,881 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:30,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:30,881 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:30,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:30,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:30,882 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:30,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:30,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:30,883 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:30,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:30,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:30,883 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:30,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:30,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:30,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,886 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:30,886 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:30,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:30,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:30,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:31,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:31,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 01:59:31,029 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:31,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:31,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:31,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable721 [2022-12-13 01:59:31,029 INFO L420 AbstractCegarLoop]: === Iteration 723 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 396110695, now seen corresponding path program 1 times [2022-12-13 01:59:31,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:31,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729505058] [2022-12-13 01:59:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:31,079 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 01:59:31,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:31,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729505058] [2022-12-13 01:59:31,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729505058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:31,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:31,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:31,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226704973] [2022-12-13 01:59:31,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:31,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:31,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:31,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:31,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:31,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:31,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:31,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:31,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:31,132 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:31,132 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:31,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:31,133 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:31,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:31,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:31,133 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:31,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:31,134 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:31,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:31,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:31,135 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:31,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:31,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,138 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:31,138 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:31,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:31,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:31,264 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:31,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:59:31,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:31,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:31,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:31,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable722 [2022-12-13 01:59:31,265 INFO L420 AbstractCegarLoop]: === Iteration 724 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 453368997, now seen corresponding path program 1 times [2022-12-13 01:59:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:31,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757527357] [2022-12-13 01:59:31,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:31,327 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 01:59:31,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:31,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757527357] [2022-12-13 01:59:31,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757527357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:31,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:31,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:31,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651718589] [2022-12-13 01:59:31,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:31,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:31,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:31,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:31,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:31,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:31,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:31,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:31,381 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:31,381 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:31,382 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:31,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:31,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:31,382 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:31,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:31,383 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:31,383 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:31,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:31,383 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:31,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:31,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,386 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:31,386 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:31,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:31,386 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:31,501 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:31,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:31,502 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:31,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:31,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:31,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable723 [2022-12-13 01:59:31,502 INFO L420 AbstractCegarLoop]: === Iteration 725 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 510627299, now seen corresponding path program 1 times [2022-12-13 01:59:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:31,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089080859] [2022-12-13 01:59:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:31,555 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 01:59:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089080859] [2022-12-13 01:59:31,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089080859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:31,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:31,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:31,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186658140] [2022-12-13 01:59:31,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:31,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:31,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:31,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:31,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:31,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:31,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:31,610 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:31,610 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:31,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:31,611 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:31,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:31,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:31,611 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:31,613 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:31,613 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:31,613 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:31,613 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:31,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:31,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,617 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:31,617 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:31,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:31,618 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,618 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:31,746 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:31,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:31,747 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:31,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:31,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:31,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable724 [2022-12-13 01:59:31,747 INFO L420 AbstractCegarLoop]: === Iteration 726 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash 567885601, now seen corresponding path program 1 times [2022-12-13 01:59:31,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:31,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121523204] [2022-12-13 01:59:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:31,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:31,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:31,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121523204] [2022-12-13 01:59:31,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121523204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:31,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:31,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358508193] [2022-12-13 01:59:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:31,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:31,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:31,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:31,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:31,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:31,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:31,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:31,861 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:31,861 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:31,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:31,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:31,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:31,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:31,863 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:31,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:31,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:31,864 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:31,864 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:31,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:31,864 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:31,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:31,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:31,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,868 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:31,868 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:31,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:31,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:31,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:31,992 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:31,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:59:31,993 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:31,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:31,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:31,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:31,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable725 [2022-12-13 01:59:31,993 INFO L420 AbstractCegarLoop]: === Iteration 727 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:31,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:31,994 INFO L85 PathProgramCache]: Analyzing trace with hash 625143903, now seen corresponding path program 1 times [2022-12-13 01:59:31,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:31,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236737318] [2022-12-13 01:59:31,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:31,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:32,043 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 01:59:32,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:32,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236737318] [2022-12-13 01:59:32,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236737318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:32,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:32,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267220368] [2022-12-13 01:59:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:32,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:32,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:32,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:32,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:32,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:32,087 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:32,087 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:32,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:32,088 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:32,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:32,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:32,088 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:32,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:32,089 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:32,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:32,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:32,089 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:32,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:32,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,092 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:32,093 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:32,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:32,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:32,222 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:32,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:32,223 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:32,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:32,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable726 [2022-12-13 01:59:32,223 INFO L420 AbstractCegarLoop]: === Iteration 728 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:32,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 682402205, now seen corresponding path program 1 times [2022-12-13 01:59:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:32,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947150798] [2022-12-13 01:59:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:32,281 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 01:59:32,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:32,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947150798] [2022-12-13 01:59:32,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947150798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:32,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:32,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:32,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146325842] [2022-12-13 01:59:32,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:32,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:32,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:32,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:32,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:32,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:32,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:32,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:32,332 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:32,332 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:32,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:32,332 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:32,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:32,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:32,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:32,333 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:32,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:32,334 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:32,334 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:32,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:32,334 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:32,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:32,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,337 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:32,337 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:32,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:32,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:32,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:32,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:32,451 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:32,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:32,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:32,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable727 [2022-12-13 01:59:32,451 INFO L420 AbstractCegarLoop]: === Iteration 729 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 739660507, now seen corresponding path program 1 times [2022-12-13 01:59:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:32,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933326964] [2022-12-13 01:59:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:32,500 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 01:59:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:32,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933326964] [2022-12-13 01:59:32,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933326964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:32,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:32,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:32,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707674703] [2022-12-13 01:59:32,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:32,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:32,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:32,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:32,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:32,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:32,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:32,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:32,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:32,543 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:32,543 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:32,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:32,544 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:32,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:32,544 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:32,544 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:32,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:32,545 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,545 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:32,545 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:32,545 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:32,546 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:32,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:32,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,548 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:32,548 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:32,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:32,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:32,661 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:32,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:32,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:32,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:32,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable728 [2022-12-13 01:59:32,661 INFO L420 AbstractCegarLoop]: === Iteration 730 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:32,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:32,662 INFO L85 PathProgramCache]: Analyzing trace with hash 796918809, now seen corresponding path program 1 times [2022-12-13 01:59:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:32,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851481949] [2022-12-13 01:59:32,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:32,713 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 01:59:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:32,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851481949] [2022-12-13 01:59:32,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851481949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:32,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:32,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933052211] [2022-12-13 01:59:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:32,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:32,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:32,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:32,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:32,763 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:32,763 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:32,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:32,763 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:32,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:32,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:32,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:32,764 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:32,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:32,765 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:32,765 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:32,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:32,765 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:32,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:32,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,768 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:32,768 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:32,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:32,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:32,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:32,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:32,882 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:32,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:32,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:32,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable729 [2022-12-13 01:59:32,882 INFO L420 AbstractCegarLoop]: === Iteration 731 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:32,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash 854177111, now seen corresponding path program 1 times [2022-12-13 01:59:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:32,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484701458] [2022-12-13 01:59:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:32,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:32,932 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 01:59:32,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:32,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484701458] [2022-12-13 01:59:32,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484701458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:32,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:32,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:32,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465436161] [2022-12-13 01:59:32,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:32,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:32,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:32,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:32,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:32,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:32,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:32,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:32,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:32,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:32,975 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:32,975 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:32,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:32,976 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:32,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:32,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:32,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:32,976 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:32,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:32,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:32,977 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:32,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:32,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:32,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:32,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:32,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:32,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,980 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:32,980 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:32,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:32,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:32,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:33,095 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:33,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:33,095 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:33,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:33,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:33,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable730 [2022-12-13 01:59:33,096 INFO L420 AbstractCegarLoop]: === Iteration 732 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:33,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash 911435413, now seen corresponding path program 1 times [2022-12-13 01:59:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927361366] [2022-12-13 01:59:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:33,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 01:59:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:33,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927361366] [2022-12-13 01:59:33,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927361366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:33,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:33,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:33,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477974784] [2022-12-13 01:59:33,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:33,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:33,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:33,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:33,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:33,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:33,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:33,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:33,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:33,196 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:33,196 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:33,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:33,196 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:33,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:33,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:33,197 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:33,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:33,197 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:33,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:33,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:33,198 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:33,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:33,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,201 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:33,201 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:33,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:33,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:33,321 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:33,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:59:33,322 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:33,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:33,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:33,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable731 [2022-12-13 01:59:33,322 INFO L420 AbstractCegarLoop]: === Iteration 733 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:33,322 INFO L85 PathProgramCache]: Analyzing trace with hash 968693715, now seen corresponding path program 1 times [2022-12-13 01:59:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:33,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010397680] [2022-12-13 01:59:33,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:33,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:33,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 01:59:33,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:33,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010397680] [2022-12-13 01:59:33,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010397680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:33,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:33,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582353389] [2022-12-13 01:59:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:33,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:33,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:33,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:33,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:33,372 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:33,372 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:33,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:33,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:33,415 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:33,415 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:33,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:33,416 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:33,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:33,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:33,416 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:33,417 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,417 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:33,417 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:33,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:33,417 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:33,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:33,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,420 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:33,420 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:33,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:33,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:33,536 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:33,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:33,536 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:33,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:33,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:33,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable732 [2022-12-13 01:59:33,537 INFO L420 AbstractCegarLoop]: === Iteration 734 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:33,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:33,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1025952017, now seen corresponding path program 1 times [2022-12-13 01:59:33,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:33,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547178515] [2022-12-13 01:59:33,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:33,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:33,596 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 01:59:33,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:33,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547178515] [2022-12-13 01:59:33,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547178515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:33,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:33,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:33,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254271063] [2022-12-13 01:59:33,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:33,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:33,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:33,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:33,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:33,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:33,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:33,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:33,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:33,649 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:33,649 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:33,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:33,650 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:33,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:33,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:33,650 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:33,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:33,651 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:33,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:33,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:33,651 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:33,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:33,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,654 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:33,654 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:33,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:33,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:33,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:33,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:33,769 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:33,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:33,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable733 [2022-12-13 01:59:33,769 INFO L420 AbstractCegarLoop]: === Iteration 735 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1083210319, now seen corresponding path program 1 times [2022-12-13 01:59:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:33,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255074505] [2022-12-13 01:59:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:33,817 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 01:59:33,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:33,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255074505] [2022-12-13 01:59:33,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255074505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:33,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:33,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717053619] [2022-12-13 01:59:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:33,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:33,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:33,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:33,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:33,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:33,860 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:33,860 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:33,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:33,861 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:33,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:33,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:33,861 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:33,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:33,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:33,862 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:33,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:33,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:33,862 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:33,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:33,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:33,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,865 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:33,865 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:33,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:33,865 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:33,865 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:33,978 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:33,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 01:59:33,978 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:33,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:33,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:33,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:33,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable734 [2022-12-13 01:59:33,978 INFO L420 AbstractCegarLoop]: === Iteration 736 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:33,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1140468621, now seen corresponding path program 1 times [2022-12-13 01:59:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:33,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464342098] [2022-12-13 01:59:33,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:34,028 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 01:59:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:34,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464342098] [2022-12-13 01:59:34,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464342098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:34,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:34,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745592352] [2022-12-13 01:59:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:34,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:34,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:34,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:34,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:34,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:34,071 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:34,071 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:34,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:34,071 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:34,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:34,072 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:34,072 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:34,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:34,073 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:34,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:34,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:34,073 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:34,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:34,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,076 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:34,076 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:34,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:34,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:34,190 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:34,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:34,190 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:34,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:34,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:34,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable735 [2022-12-13 01:59:34,190 INFO L420 AbstractCegarLoop]: === Iteration 737 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1197726923, now seen corresponding path program 1 times [2022-12-13 01:59:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:34,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481740004] [2022-12-13 01:59:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:34,254 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 01:59:34,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:34,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481740004] [2022-12-13 01:59:34,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481740004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:34,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:34,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390301206] [2022-12-13 01:59:34,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:34,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:34,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:34,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:34,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:34,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:34,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:34,307 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:34,308 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:34,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:34,308 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:34,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:34,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:34,309 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:34,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:34,310 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:34,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:34,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:34,310 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:34,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:34,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,313 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:34,313 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:34,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:34,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:34,446 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:34,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:34,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:34,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:34,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:34,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable736 [2022-12-13 01:59:34,447 INFO L420 AbstractCegarLoop]: === Iteration 738 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:34,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:34,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1254985225, now seen corresponding path program 1 times [2022-12-13 01:59:34,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:34,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251483259] [2022-12-13 01:59:34,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:34,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:34,510 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 01:59:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:34,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251483259] [2022-12-13 01:59:34,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251483259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:34,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:34,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005142063] [2022-12-13 01:59:34,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:34,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:34,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:34,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:34,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:34,562 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:34,562 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:34,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:34,563 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:34,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:34,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:34,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:34,563 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:34,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:34,564 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:34,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:34,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:34,565 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:34,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:34,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,569 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:34,569 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:34,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:34,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:34,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:34,700 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:34,700 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:34,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:34,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:34,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable737 [2022-12-13 01:59:34,700 INFO L420 AbstractCegarLoop]: === Iteration 739 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1312243527, now seen corresponding path program 1 times [2022-12-13 01:59:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47975836] [2022-12-13 01:59:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:34,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:34,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47975836] [2022-12-13 01:59:34,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47975836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:34,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:34,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:34,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498177598] [2022-12-13 01:59:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:34,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:34,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:34,776 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:34,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:34,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:34,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:34,832 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:34,832 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:34,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:34,833 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:34,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:34,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:34,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:34,833 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:34,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:34,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:34,834 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:34,835 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:34,835 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:34,835 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:34,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:34,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:34,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,838 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:34,838 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:34,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:34,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:34,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:34,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:34,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:34,955 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:34,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:34,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:34,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable738 [2022-12-13 01:59:34,955 INFO L420 AbstractCegarLoop]: === Iteration 740 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1369501829, now seen corresponding path program 1 times [2022-12-13 01:59:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:34,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287669013] [2022-12-13 01:59:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,004 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 01:59:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:35,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287669013] [2022-12-13 01:59:35,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287669013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:35,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:35,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064471919] [2022-12-13 01:59:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:35,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:35,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:35,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:35,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:35,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:35,055 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:35,055 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:35,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:35,055 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:35,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:35,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:35,056 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:35,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:35,057 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:35,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:35,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:35,057 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:35,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:35,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,060 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:35,060 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:35,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:35,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:35,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:35,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:35,174 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:35,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:35,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable739 [2022-12-13 01:59:35,174 INFO L420 AbstractCegarLoop]: === Iteration 741 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1426760131, now seen corresponding path program 1 times [2022-12-13 01:59:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:35,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583164500] [2022-12-13 01:59:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,224 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 01:59:35,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:35,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583164500] [2022-12-13 01:59:35,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583164500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:35,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:35,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:35,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690911572] [2022-12-13 01:59:35,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:35,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:35,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:35,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:35,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:35,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:35,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:35,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:35,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:35,275 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:35,275 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:35,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:35,275 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:35,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:35,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:35,276 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:35,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:35,277 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:35,277 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:35,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:35,277 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:35,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:35,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,280 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:35,280 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:35,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:35,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:35,394 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:35,394 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:35,394 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:35,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,394 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:35,394 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:35,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable740 [2022-12-13 01:59:35,395 INFO L420 AbstractCegarLoop]: === Iteration 742 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:35,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:35,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1484018433, now seen corresponding path program 1 times [2022-12-13 01:59:35,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:35,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638471178] [2022-12-13 01:59:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:35,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,447 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 01:59:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:35,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638471178] [2022-12-13 01:59:35,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638471178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:35,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:35,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:35,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91389493] [2022-12-13 01:59:35,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:35,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:35,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:35,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:35,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:35,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:35,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:35,492 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:35,492 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:35,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:35,492 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:35,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:35,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:35,493 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:35,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:35,494 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:35,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:35,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:35,494 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:35,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:35,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,497 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:35,497 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:35,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:35,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:35,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:35,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:59:35,620 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:35,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:35,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:35,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable741 [2022-12-13 01:59:35,620 INFO L420 AbstractCegarLoop]: === Iteration 743 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1541276735, now seen corresponding path program 1 times [2022-12-13 01:59:35,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:35,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127160370] [2022-12-13 01:59:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:35,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,668 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 01:59:35,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:35,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127160370] [2022-12-13 01:59:35,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127160370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:35,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:35,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:35,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104755561] [2022-12-13 01:59:35,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:35,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:35,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:35,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:35,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:35,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:35,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:35,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:35,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:35,711 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:35,712 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:35,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:35,712 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:35,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:35,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:35,713 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:35,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:35,713 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,714 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:35,714 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:35,714 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:35,714 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:35,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:35,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,717 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:35,717 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:35,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:35,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:35,831 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:35,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:35,831 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:35,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:35,832 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:35,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable742 [2022-12-13 01:59:35,832 INFO L420 AbstractCegarLoop]: === Iteration 744 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1598535037, now seen corresponding path program 1 times [2022-12-13 01:59:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:35,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531073453] [2022-12-13 01:59:35,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:35,883 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 01:59:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:35,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531073453] [2022-12-13 01:59:35,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531073453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:35,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:35,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:35,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661694113] [2022-12-13 01:59:35,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:35,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:35,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:35,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:35,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:35,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:35,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:35,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:35,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:35,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:35,927 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:35,927 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:35,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:35,927 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:35,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:35,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:35,928 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:35,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:35,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:35,929 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:35,929 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:35,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:35,929 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:35,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:35,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:35,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,932 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:35,932 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:35,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:35,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:35,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:36,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:36,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:59:36,056 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:36,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:36,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:36,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable743 [2022-12-13 01:59:36,056 INFO L420 AbstractCegarLoop]: === Iteration 745 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:36,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:36,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1655793339, now seen corresponding path program 1 times [2022-12-13 01:59:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:36,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688988264] [2022-12-13 01:59:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:36,108 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 01:59:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688988264] [2022-12-13 01:59:36,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688988264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:36,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:36,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659907262] [2022-12-13 01:59:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:36,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:36,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:36,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:36,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:36,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:36,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:36,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:36,165 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:36,165 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:36,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:36,166 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:36,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:36,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:36,166 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:36,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:36,167 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:36,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:36,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:36,168 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:36,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:36,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,172 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:36,172 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:36,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:36,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:36,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:36,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:59:36,293 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:36,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:36,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:36,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable744 [2022-12-13 01:59:36,294 INFO L420 AbstractCegarLoop]: === Iteration 746 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:36,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1713051641, now seen corresponding path program 1 times [2022-12-13 01:59:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:36,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837208295] [2022-12-13 01:59:36,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:36,345 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 01:59:36,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:36,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837208295] [2022-12-13 01:59:36,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837208295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:36,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:36,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091811796] [2022-12-13 01:59:36,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:36,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:36,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:36,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:36,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:36,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:36,390 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:36,391 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:36,391 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:36,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:36,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:36,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:36,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:36,392 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:36,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:36,393 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,393 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:36,393 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:36,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:36,393 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,393 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:36,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:36,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,396 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:36,396 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:36,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:36,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:36,514 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:36,515 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:36,515 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:36,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:36,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable745 [2022-12-13 01:59:36,515 INFO L420 AbstractCegarLoop]: === Iteration 747 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1770309943, now seen corresponding path program 1 times [2022-12-13 01:59:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:36,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452526144] [2022-12-13 01:59:36,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:36,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:36,566 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 01:59:36,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:36,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452526144] [2022-12-13 01:59:36,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452526144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:36,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:36,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089846054] [2022-12-13 01:59:36,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:36,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:36,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:36,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:36,567 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:36,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:36,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:36,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:36,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:36,617 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:36,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:36,617 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:36,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:36,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:36,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:36,618 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:36,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:36,619 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:36,619 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:36,619 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:36,619 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:36,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:36,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,622 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:36,622 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:36,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:36,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:36,738 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:36,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:36,738 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:36,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:36,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:36,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable746 [2022-12-13 01:59:36,739 INFO L420 AbstractCegarLoop]: === Iteration 748 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:36,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:36,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1827568245, now seen corresponding path program 1 times [2022-12-13 01:59:36,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:36,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159070458] [2022-12-13 01:59:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:36,795 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 01:59:36,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:36,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159070458] [2022-12-13 01:59:36,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159070458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:36,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:36,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:36,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119450123] [2022-12-13 01:59:36,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:36,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:36,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:36,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:36,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:36,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:36,846 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:36,846 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:36,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:36,847 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:36,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:36,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:36,847 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:36,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:36,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:36,848 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:36,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:36,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:36,848 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:36,849 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:36,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:36,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,851 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:36,851 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:36,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:36,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:36,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:36,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:36,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:36,970 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:36,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:36,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:36,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:36,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable747 [2022-12-13 01:59:36,970 INFO L420 AbstractCegarLoop]: === Iteration 749 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:36,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1884826547, now seen corresponding path program 1 times [2022-12-13 01:59:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:36,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705265041] [2022-12-13 01:59:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:37,027 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 01:59:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:37,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705265041] [2022-12-13 01:59:37,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705265041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:37,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:37,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:37,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071810710] [2022-12-13 01:59:37,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:37,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:37,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:37,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:37,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:37,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:37,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:37,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:37,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:37,080 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:37,081 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:37,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:37,081 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:37,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:37,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:37,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:37,082 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:37,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:37,083 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:37,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:37,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:37,083 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:37,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:37,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,086 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:37,086 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:37,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:37,087 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,087 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:37,218 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:37,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:37,218 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:37,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:37,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:37,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable748 [2022-12-13 01:59:37,219 INFO L420 AbstractCegarLoop]: === Iteration 750 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1942084849, now seen corresponding path program 1 times [2022-12-13 01:59:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627284171] [2022-12-13 01:59:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:37,274 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 01:59:37,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:37,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627284171] [2022-12-13 01:59:37,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627284171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:37,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:37,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:37,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082605841] [2022-12-13 01:59:37,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:37,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:37,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:37,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:37,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:37,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:37,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:37,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:37,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:37,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:37,330 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:37,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:37,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:37,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:37,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:37,331 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:37,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:37,332 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:37,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:37,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:37,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:37,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:37,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:37,336 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:37,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:37,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:37,467 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:37,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:37,468 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:37,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:37,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:37,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable749 [2022-12-13 01:59:37,468 INFO L420 AbstractCegarLoop]: === Iteration 751 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1999343151, now seen corresponding path program 1 times [2022-12-13 01:59:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:37,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639841699] [2022-12-13 01:59:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:37,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:37,541 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 01:59:37,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:37,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639841699] [2022-12-13 01:59:37,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639841699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:37,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:37,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629295640] [2022-12-13 01:59:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:37,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:37,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:37,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:37,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:37,600 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:37,600 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:37,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:37,601 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:37,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:37,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:37,602 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:37,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:37,603 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:37,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:37,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:37,603 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:37,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:37,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,607 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:37,607 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:37,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:37,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:37,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:37,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:59:37,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:37,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:37,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:37,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable750 [2022-12-13 01:59:37,736 INFO L420 AbstractCegarLoop]: === Iteration 752 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:37,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:37,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2056601453, now seen corresponding path program 1 times [2022-12-13 01:59:37,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90381240] [2022-12-13 01:59:37,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:37,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:37,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:37,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90381240] [2022-12-13 01:59:37,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90381240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:37,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:37,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:37,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675144337] [2022-12-13 01:59:37,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:37,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:37,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:37,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:37,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:37,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:37,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:37,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:37,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:37,854 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:37,855 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:37,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:37,855 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:37,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:37,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:37,856 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:37,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:37,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:37,857 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:37,857 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:37,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:37,857 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:37,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:37,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:37,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,860 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:37,860 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:37,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:37,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:37,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:37,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:37,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:37,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:37,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:37,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:37,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:37,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable751 [2022-12-13 01:59:37,977 INFO L420 AbstractCegarLoop]: === Iteration 753 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2113859755, now seen corresponding path program 1 times [2022-12-13 01:59:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:37,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074386062] [2022-12-13 01:59:37,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:37,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:38,033 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 01:59:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074386062] [2022-12-13 01:59:38,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074386062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:38,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:38,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252779015] [2022-12-13 01:59:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:38,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:38,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:38,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:38,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:38,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:38,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:38,084 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:38,085 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:38,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:38,085 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:38,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:38,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:38,086 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:38,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:38,087 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:38,087 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:38,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:38,087 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:38,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:38,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,090 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:38,090 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:38,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:38,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:38,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:38,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:59:38,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:38,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:38,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:38,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable752 [2022-12-13 01:59:38,213 INFO L420 AbstractCegarLoop]: === Iteration 754 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:38,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:38,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2123849239, now seen corresponding path program 1 times [2022-12-13 01:59:38,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:38,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045833106] [2022-12-13 01:59:38,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:38,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:38,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 01:59:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:38,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045833106] [2022-12-13 01:59:38,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045833106] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:38,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:38,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:38,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919065037] [2022-12-13 01:59:38,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:38,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:38,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:38,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:38,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:38,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:38,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:38,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:38,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:38,326 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:38,326 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:38,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:38,326 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:38,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:38,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:38,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:38,327 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:38,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:38,328 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:38,328 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:38,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:38,328 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:38,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:38,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,331 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:38,331 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:38,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:38,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:38,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:38,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:38,445 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:38,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:38,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable753 [2022-12-13 01:59:38,445 INFO L420 AbstractCegarLoop]: === Iteration 755 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2066590937, now seen corresponding path program 1 times [2022-12-13 01:59:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:38,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954990707] [2022-12-13 01:59:38,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:38,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:38,494 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 01:59:38,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:38,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954990707] [2022-12-13 01:59:38,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954990707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:38,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:38,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:38,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828729914] [2022-12-13 01:59:38,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:38,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:38,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:38,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:38,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:38,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:38,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:38,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:38,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:38,544 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:38,545 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:38,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:38,545 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:38,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:38,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:38,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:38,546 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:38,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:38,546 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:38,547 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:38,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:38,547 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:38,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:38,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,550 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:38,550 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:38,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:38,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:38,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:38,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:38,664 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:38,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:38,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:38,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable754 [2022-12-13 01:59:38,664 INFO L420 AbstractCegarLoop]: === Iteration 756 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2009332635, now seen corresponding path program 1 times [2022-12-13 01:59:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155584458] [2022-12-13 01:59:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:38,713 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 01:59:38,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:38,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155584458] [2022-12-13 01:59:38,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155584458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:38,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:38,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957287477] [2022-12-13 01:59:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:38,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:38,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:38,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:38,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:38,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:38,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:38,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:38,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:38,764 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:38,764 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:38,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:38,764 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:38,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:38,765 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:38,765 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:38,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:38,765 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:38,766 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:38,766 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:38,766 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,766 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:38,766 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:38,766 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,769 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:38,769 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:38,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:38,769 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,769 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:38,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:38,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:38,885 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:38,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:38,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable755 [2022-12-13 01:59:38,885 INFO L420 AbstractCegarLoop]: === Iteration 757 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:38,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1952074333, now seen corresponding path program 1 times [2022-12-13 01:59:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:38,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386447335] [2022-12-13 01:59:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:38,935 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 01:59:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:38,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386447335] [2022-12-13 01:59:38,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386447335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:38,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:38,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374371471] [2022-12-13 01:59:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:38,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:38,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:38,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:38,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:38,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:38,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:38,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:38,978 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:38,978 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:38,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:38,979 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:38,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:38,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:38,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:38,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:38,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:38,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:38,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:38,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:38,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:38,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:38,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:38,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,983 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:38,983 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:38,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:38,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:38,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:39,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:39,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:39,100 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:39,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:39,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:39,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable756 [2022-12-13 01:59:39,100 INFO L420 AbstractCegarLoop]: === Iteration 758 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1894816031, now seen corresponding path program 1 times [2022-12-13 01:59:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:39,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781193522] [2022-12-13 01:59:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:39,174 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 01:59:39,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:39,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781193522] [2022-12-13 01:59:39,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781193522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:39,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:39,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:39,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590710916] [2022-12-13 01:59:39,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:39,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:39,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:39,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:39,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:39,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:39,223 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:39,223 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:39,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:39,223 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:39,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:39,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:39,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:39,224 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:39,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:39,225 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:39,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:39,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:39,225 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:39,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:39,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,228 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:39,228 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:39,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:39,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:39,347 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:39,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:39,347 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:39,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:39,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:39,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable757 [2022-12-13 01:59:39,348 INFO L420 AbstractCegarLoop]: === Iteration 759 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:39,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:39,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1837557729, now seen corresponding path program 1 times [2022-12-13 01:59:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:39,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619228985] [2022-12-13 01:59:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:39,399 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 01:59:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:39,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619228985] [2022-12-13 01:59:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619228985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:39,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:39,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854930623] [2022-12-13 01:59:39,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:39,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:39,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:39,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:39,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:39,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:39,444 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:39,444 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:39,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:39,444 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:39,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:39,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:39,445 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:39,446 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:39,446 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:39,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:39,446 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:39,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:39,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,449 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:39,449 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:39,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:39,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:39,564 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:39,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:39,564 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:39,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:39,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:39,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable758 [2022-12-13 01:59:39,565 INFO L420 AbstractCegarLoop]: === Iteration 760 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1780299427, now seen corresponding path program 1 times [2022-12-13 01:59:39,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:39,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926540751] [2022-12-13 01:59:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:39,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:39,616 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 01:59:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926540751] [2022-12-13 01:59:39,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926540751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:39,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:39,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349504984] [2022-12-13 01:59:39,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:39,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:39,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:39,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:39,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:39,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:39,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:39,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:39,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:39,666 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:39,666 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:39,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:39,667 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:39,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:39,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:39,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:39,667 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:39,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:39,668 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:39,668 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:39,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:39,668 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:39,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:39,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,671 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:39,671 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:39,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:39,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:39,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:39,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 01:59:39,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:39,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:39,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:39,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable759 [2022-12-13 01:59:39,786 INFO L420 AbstractCegarLoop]: === Iteration 761 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:39,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1723041125, now seen corresponding path program 1 times [2022-12-13 01:59:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:39,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116865792] [2022-12-13 01:59:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:39,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:39,836 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 01:59:39,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:39,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116865792] [2022-12-13 01:59:39,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116865792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:39,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:39,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:39,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799119749] [2022-12-13 01:59:39,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:39,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:39,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:39,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:39,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:39,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:39,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:39,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:39,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:39,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:39,886 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:39,886 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:39,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:39,887 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:39,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:39,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:39,887 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:39,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:39,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:39,888 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:39,888 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:39,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:39,888 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:39,888 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:39,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:39,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,891 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:39,891 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:39,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:39,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:39,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:40,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:40,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:59:40,018 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:40,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:40,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:40,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable760 [2022-12-13 01:59:40,018 INFO L420 AbstractCegarLoop]: === Iteration 762 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:40,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1665782823, now seen corresponding path program 1 times [2022-12-13 01:59:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:40,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659599331] [2022-12-13 01:59:40,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:40,072 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 01:59:40,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:40,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659599331] [2022-12-13 01:59:40,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659599331] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:40,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:40,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:40,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131946915] [2022-12-13 01:59:40,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:40,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:40,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:40,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:40,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:40,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:40,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:40,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:40,125 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:40,126 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:40,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:40,126 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:40,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:40,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:40,127 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:40,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:40,128 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:40,128 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:40,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:40,128 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:40,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:40,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,133 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:40,133 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:40,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:40,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:40,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:40,251 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:40,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:40,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:40,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable761 [2022-12-13 01:59:40,252 INFO L420 AbstractCegarLoop]: === Iteration 763 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:40,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1608524521, now seen corresponding path program 1 times [2022-12-13 01:59:40,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:40,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941759815] [2022-12-13 01:59:40,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:40,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:40,312 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 01:59:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:40,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941759815] [2022-12-13 01:59:40,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941759815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:40,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:40,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:40,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11639031] [2022-12-13 01:59:40,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:40,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:40,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:40,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:40,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:40,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:40,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:40,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:40,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:40,375 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:40,376 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:40,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:40,376 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:40,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:40,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:40,377 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:40,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:40,378 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:40,379 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:40,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:40,379 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:40,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:40,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,383 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:40,383 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:40,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:40,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:40,510 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:40,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:59:40,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:40,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:40,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:40,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable762 [2022-12-13 01:59:40,511 INFO L420 AbstractCegarLoop]: === Iteration 764 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:40,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:40,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1551266219, now seen corresponding path program 1 times [2022-12-13 01:59:40,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:40,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443648911] [2022-12-13 01:59:40,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:40,573 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 01:59:40,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:40,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443648911] [2022-12-13 01:59:40,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443648911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:40,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:40,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:40,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648977133] [2022-12-13 01:59:40,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:40,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:40,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:40,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:40,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:40,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:40,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:40,623 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:40,623 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:40,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:40,624 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:40,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:40,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:40,625 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:40,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:40,626 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:40,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:40,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:40,626 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:40,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:40,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,630 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:40,630 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:40,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:40,630 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:40,750 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:40,751 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 01:59:40,751 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,751 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:40,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:40,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable763 [2022-12-13 01:59:40,751 INFO L420 AbstractCegarLoop]: === Iteration 765 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:40,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1494007917, now seen corresponding path program 1 times [2022-12-13 01:59:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:40,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600476266] [2022-12-13 01:59:40,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:40,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:40,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:40,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600476266] [2022-12-13 01:59:40,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600476266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:40,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:40,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:40,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060962628] [2022-12-13 01:59:40,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:40,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:40,803 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:40,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:40,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:40,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:40,852 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:40,852 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:40,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:40,853 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:40,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:40,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:40,854 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:40,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:40,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:40,854 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:40,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:40,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:40,855 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:40,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:40,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:40,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,857 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:40,858 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:40,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:40,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:40,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:40,973 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:40,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:40,974 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:40,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:40,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:40,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:40,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable764 [2022-12-13 01:59:40,974 INFO L420 AbstractCegarLoop]: === Iteration 766 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1436749615, now seen corresponding path program 1 times [2022-12-13 01:59:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:40,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713220614] [2022-12-13 01:59:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:41,023 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 01:59:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:41,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713220614] [2022-12-13 01:59:41,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713220614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:41,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:41,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086207992] [2022-12-13 01:59:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:41,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:41,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:41,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:41,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:41,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:41,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:41,067 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:41,067 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:41,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:41,068 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:41,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:41,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:41,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:41,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:41,068 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:41,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:41,069 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:41,069 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:41,069 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:41,069 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:41,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:41,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,072 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:41,072 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:41,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:41,072 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,072 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:41,188 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:41,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:41,188 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:41,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:41,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:41,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable765 [2022-12-13 01:59:41,189 INFO L420 AbstractCegarLoop]: === Iteration 767 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:41,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1379491313, now seen corresponding path program 1 times [2022-12-13 01:59:41,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:41,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743852723] [2022-12-13 01:59:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:41,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:41,242 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 01:59:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743852723] [2022-12-13 01:59:41,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743852723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:41,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:41,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534463924] [2022-12-13 01:59:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:41,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:41,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:41,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:41,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:41,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:41,286 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:41,286 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:41,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:41,286 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:41,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:41,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:41,287 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:41,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:41,288 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:41,288 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:41,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:41,288 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:41,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:41,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,291 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:41,291 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:41,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:41,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:41,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:41,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 01:59:41,412 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:41,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:41,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:41,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable766 [2022-12-13 01:59:41,412 INFO L420 AbstractCegarLoop]: === Iteration 768 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:41,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1322233011, now seen corresponding path program 1 times [2022-12-13 01:59:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:41,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324424145] [2022-12-13 01:59:41,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:41,475 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 01:59:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:41,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324424145] [2022-12-13 01:59:41,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324424145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:41,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741053286] [2022-12-13 01:59:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:41,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:41,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:41,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:41,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:41,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:41,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:41,535 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:41,535 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:41,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:41,535 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:41,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:41,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:41,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:41,536 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:41,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:41,537 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:41,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:41,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:41,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:41,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:41,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,540 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:41,540 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:41,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:41,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:41,664 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:41,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:59:41,664 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:41,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:41,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable767 [2022-12-13 01:59:41,665 INFO L420 AbstractCegarLoop]: === Iteration 769 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:41,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1264974709, now seen corresponding path program 1 times [2022-12-13 01:59:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:41,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328724244] [2022-12-13 01:59:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:41,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:41,717 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 01:59:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:41,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328724244] [2022-12-13 01:59:41,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328724244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:41,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:41,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:41,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101747841] [2022-12-13 01:59:41,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:41,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:41,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:41,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:41,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:41,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:41,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:41,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:41,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:41,858 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:41,858 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:41,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:41,859 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:41,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:41,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:41,860 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:41,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:41,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:41,860 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:41,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:41,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:41,861 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:41,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:41,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:41,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,864 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:41,864 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:41,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:41,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:41,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:41,983 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:41,984 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:41,984 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:41,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:41,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:41,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:41,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768 [2022-12-13 01:59:41,984 INFO L420 AbstractCegarLoop]: === Iteration 770 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:41,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:41,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1207716407, now seen corresponding path program 1 times [2022-12-13 01:59:41,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:41,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418746542] [2022-12-13 01:59:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:42,040 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 01:59:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:42,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418746542] [2022-12-13 01:59:42,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418746542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:42,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:42,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:42,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36143709] [2022-12-13 01:59:42,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:42,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:42,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:42,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:42,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:42,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:42,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:42,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:42,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:42,091 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:42,091 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:42,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:42,092 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:42,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:42,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:42,092 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:42,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:42,093 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:42,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:42,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:42,094 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:42,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:42,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,096 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:42,096 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:42,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:42,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:42,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:42,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:42,212 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:42,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:42,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:42,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable769 [2022-12-13 01:59:42,213 INFO L420 AbstractCegarLoop]: === Iteration 771 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:42,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1150458105, now seen corresponding path program 1 times [2022-12-13 01:59:42,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:42,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548112593] [2022-12-13 01:59:42,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:42,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:42,272 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 01:59:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:42,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548112593] [2022-12-13 01:59:42,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548112593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:42,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:42,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134914240] [2022-12-13 01:59:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:42,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:42,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:42,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:42,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:42,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:42,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:42,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:42,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:42,323 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:42,324 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:42,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:42,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:42,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:42,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:42,325 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:42,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:42,325 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:42,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:42,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:42,326 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:42,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:42,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,328 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:42,329 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:42,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:42,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:42,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:42,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:42,446 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:42,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:42,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable770 [2022-12-13 01:59:42,446 INFO L420 AbstractCegarLoop]: === Iteration 772 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:42,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1093199803, now seen corresponding path program 1 times [2022-12-13 01:59:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937428129] [2022-12-13 01:59:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:42,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:42,503 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 01:59:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:42,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937428129] [2022-12-13 01:59:42,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937428129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:42,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:42,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:42,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552507561] [2022-12-13 01:59:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:42,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:42,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:42,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:42,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:42,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:42,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:42,555 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:42,555 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:42,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:42,555 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:42,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:42,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:42,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:42,556 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:42,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:42,557 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:42,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:42,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:42,557 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:42,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:42,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,560 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:42,560 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:42,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:42,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:42,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:42,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 01:59:42,685 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:42,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,686 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:42,686 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:42,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable771 [2022-12-13 01:59:42,686 INFO L420 AbstractCegarLoop]: === Iteration 773 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:42,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1035941501, now seen corresponding path program 1 times [2022-12-13 01:59:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:42,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142130275] [2022-12-13 01:59:42,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:42,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:42,753 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 01:59:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142130275] [2022-12-13 01:59:42,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142130275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:42,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:42,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169101495] [2022-12-13 01:59:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:42,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:42,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:42,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:42,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:42,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:42,804 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:42,804 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:42,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:42,805 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:42,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:42,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:42,805 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:42,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:42,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:42,806 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:42,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:42,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:42,807 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:42,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:42,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:42,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,809 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:42,810 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:42,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:42,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:42,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:42,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:42,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:42,927 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:42,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:42,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:42,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable772 [2022-12-13 01:59:42,927 INFO L420 AbstractCegarLoop]: === Iteration 774 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash -978683199, now seen corresponding path program 1 times [2022-12-13 01:59:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:42,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112084265] [2022-12-13 01:59:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:42,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 01:59:42,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:42,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112084265] [2022-12-13 01:59:42,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112084265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:42,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:42,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:42,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938154582] [2022-12-13 01:59:42,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:42,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:42,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:42,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:42,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:42,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:42,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:42,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:42,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:43,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:43,030 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:43,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:43,031 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:43,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:43,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:43,031 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:43,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:43,032 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:43,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:43,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:43,033 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:43,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:43,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,036 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:43,036 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:43,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:43,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:43,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:59:43,172 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:43,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:43,172 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:43,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable773 [2022-12-13 01:59:43,172 INFO L420 AbstractCegarLoop]: === Iteration 775 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:43,172 INFO L85 PathProgramCache]: Analyzing trace with hash -921424897, now seen corresponding path program 1 times [2022-12-13 01:59:43,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:43,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273216820] [2022-12-13 01:59:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:43,237 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 01:59:43,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:43,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273216820] [2022-12-13 01:59:43,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273216820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:43,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:43,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948792738] [2022-12-13 01:59:43,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:43,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:43,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:43,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:43,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:43,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:43,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:43,293 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:43,293 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:43,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:43,294 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:43,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:43,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:43,294 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:43,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:43,296 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,296 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:43,296 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:43,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:43,296 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:43,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:43,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,300 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:43,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:43,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:43,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:43,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:43,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:43,432 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:43,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:43,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:43,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable774 [2022-12-13 01:59:43,432 INFO L420 AbstractCegarLoop]: === Iteration 776 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash -864166595, now seen corresponding path program 1 times [2022-12-13 01:59:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:43,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38437239] [2022-12-13 01:59:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:43,495 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 01:59:43,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:43,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38437239] [2022-12-13 01:59:43,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38437239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:43,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:43,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:43,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482951796] [2022-12-13 01:59:43,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:43,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:43,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:43,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:43,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:43,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:43,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:43,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:43,553 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:43,553 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:43,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:43,554 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:43,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:43,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:43,554 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:43,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:43,555 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:43,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:43,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:43,556 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:43,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:43,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,560 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:43,560 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:43,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:43,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:43,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 01:59:43,689 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:43,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:43,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:43,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable775 [2022-12-13 01:59:43,689 INFO L420 AbstractCegarLoop]: === Iteration 777 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash -806908293, now seen corresponding path program 1 times [2022-12-13 01:59:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:43,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356938497] [2022-12-13 01:59:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:43,758 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 01:59:43,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:43,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356938497] [2022-12-13 01:59:43,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356938497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:43,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:43,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427431030] [2022-12-13 01:59:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:43,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:43,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:43,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:43,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:43,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:43,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:43,813 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:43,813 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:43,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:43,814 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:43,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:43,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:43,814 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:43,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:43,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:43,815 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:43,815 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:43,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:43,815 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:43,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:43,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:43,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:43,818 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:43,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:43,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:43,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:43,949 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:43,950 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:43,950 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:43,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:43,950 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:43,950 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:43,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable776 [2022-12-13 01:59:43,950 INFO L420 AbstractCegarLoop]: === Iteration 778 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash -749649991, now seen corresponding path program 1 times [2022-12-13 01:59:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:43,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931255986] [2022-12-13 01:59:43,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:43,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:44,025 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 01:59:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:44,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931255986] [2022-12-13 01:59:44,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931255986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:44,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:44,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:44,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276109772] [2022-12-13 01:59:44,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:44,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:44,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:44,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:44,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:44,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:44,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:44,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:44,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:44,088 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:44,088 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:44,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:44,089 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:44,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:44,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:44,090 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:44,091 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:44,091 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:44,091 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:44,091 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:44,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:44,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,094 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:44,094 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:44,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:44,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:44,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:44,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:44,227 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:44,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:44,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:44,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable777 [2022-12-13 01:59:44,227 INFO L420 AbstractCegarLoop]: === Iteration 779 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:44,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -692391689, now seen corresponding path program 1 times [2022-12-13 01:59:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:44,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125924815] [2022-12-13 01:59:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:44,283 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 01:59:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:44,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125924815] [2022-12-13 01:59:44,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125924815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:44,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:44,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:44,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122273702] [2022-12-13 01:59:44,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:44,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:44,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:44,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:44,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:44,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:44,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:44,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:44,337 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:44,338 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:44,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:44,338 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:44,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:44,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:44,339 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:44,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:44,340 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:44,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:44,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:44,340 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:44,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:44,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,343 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:44,343 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:44,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:44,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:44,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:44,479 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:59:44,479 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:44,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:44,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:44,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable778 [2022-12-13 01:59:44,480 INFO L420 AbstractCegarLoop]: === Iteration 780 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -635133387, now seen corresponding path program 1 times [2022-12-13 01:59:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:44,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137168775] [2022-12-13 01:59:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:44,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:44,545 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 01:59:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:44,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137168775] [2022-12-13 01:59:44,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137168775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:44,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:44,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833029037] [2022-12-13 01:59:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:44,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:44,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:44,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:44,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:44,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:44,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:44,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:44,601 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:44,601 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:44,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:44,602 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:44,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:44,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:44,602 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:44,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:44,603 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:44,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:44,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:44,603 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:44,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:44,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,606 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:44,606 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:44,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:44,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:44,739 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:44,739 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:44,739 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:44,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:44,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:44,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable779 [2022-12-13 01:59:44,740 INFO L420 AbstractCegarLoop]: === Iteration 781 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:44,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -577875085, now seen corresponding path program 1 times [2022-12-13 01:59:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:44,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48130707] [2022-12-13 01:59:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:44,800 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 01:59:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48130707] [2022-12-13 01:59:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48130707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:44,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:44,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632122950] [2022-12-13 01:59:44,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:44,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:44,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:44,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:44,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:44,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:44,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:44,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:44,861 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:44,861 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:44,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:44,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:44,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:44,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:44,863 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:44,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:44,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:44,864 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:44,864 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:44,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:44,864 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:44,864 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:44,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:44,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,867 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:44,867 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:44,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:44,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:44,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:44,999 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:44,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:44,999 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:44,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:44,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:44,999 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:45,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable780 [2022-12-13 01:59:45,000 INFO L420 AbstractCegarLoop]: === Iteration 782 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -520616783, now seen corresponding path program 1 times [2022-12-13 01:59:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:45,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111658658] [2022-12-13 01:59:45,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:45,056 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 01:59:45,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:45,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111658658] [2022-12-13 01:59:45,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111658658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:45,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:45,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:45,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569941384] [2022-12-13 01:59:45,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:45,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:45,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:45,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:45,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:45,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:45,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:45,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:45,118 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:45,118 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:45,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:45,119 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:45,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:45,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:45,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:45,119 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:45,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:45,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:45,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:45,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:45,120 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:45,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:45,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:45,123 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:45,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:45,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:45,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:45,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:45,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:45,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,255 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:45,255 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:45,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable781 [2022-12-13 01:59:45,255 INFO L420 AbstractCegarLoop]: === Iteration 783 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash -463358481, now seen corresponding path program 1 times [2022-12-13 01:59:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:45,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018690603] [2022-12-13 01:59:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:45,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:45,329 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 01:59:45,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:45,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018690603] [2022-12-13 01:59:45,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018690603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:45,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:45,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626589343] [2022-12-13 01:59:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:45,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:45,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:45,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:45,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:45,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:45,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:45,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:45,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:45,383 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:45,383 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:45,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:45,384 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:45,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:45,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:45,384 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:45,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:45,400 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:45,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:45,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:45,400 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:45,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:45,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,403 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:45,403 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:45,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:45,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:45,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:45,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:59:45,545 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:45,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:45,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:45,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable782 [2022-12-13 01:59:45,545 INFO L420 AbstractCegarLoop]: === Iteration 784 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash -406100179, now seen corresponding path program 1 times [2022-12-13 01:59:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:45,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915749711] [2022-12-13 01:59:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:45,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:45,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915749711] [2022-12-13 01:59:45,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915749711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:45,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:45,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281541164] [2022-12-13 01:59:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:45,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:45,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:45,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:45,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:45,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:45,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:45,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:45,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:45,659 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:45,659 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:45,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:45,660 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:45,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:45,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:45,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:45,660 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:45,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:45,661 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:45,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:45,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:45,661 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,662 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:45,662 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:45,662 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,664 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:45,664 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:45,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:45,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:45,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:45,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:45,782 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:45,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:45,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:45,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable783 [2022-12-13 01:59:45,782 INFO L420 AbstractCegarLoop]: === Iteration 785 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash -348841877, now seen corresponding path program 1 times [2022-12-13 01:59:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:45,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207495405] [2022-12-13 01:59:45,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:45,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:45,835 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 01:59:45,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:45,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207495405] [2022-12-13 01:59:45,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207495405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:45,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:45,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925865347] [2022-12-13 01:59:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:45,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:45,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:45,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:45,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:45,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:45,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:45,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:45,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:45,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:45,888 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:45,888 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:45,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:45,889 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:45,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:45,889 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:45,889 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:45,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:45,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:45,890 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:45,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:45,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:45,891 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:45,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:45,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:45,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,894 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:45,894 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:45,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:45,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:46,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:46,011 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:46,011 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:46,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:46,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:46,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable784 [2022-12-13 01:59:46,012 INFO L420 AbstractCegarLoop]: === Iteration 786 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:46,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash -291583575, now seen corresponding path program 1 times [2022-12-13 01:59:46,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:46,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475802308] [2022-12-13 01:59:46,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:46,064 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 01:59:46,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:46,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475802308] [2022-12-13 01:59:46,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475802308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:46,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:46,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084401605] [2022-12-13 01:59:46,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:46,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:46,065 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:46,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:46,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:46,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:46,108 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:46,109 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:46,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:46,109 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:46,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:46,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:46,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:46,110 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:46,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:46,111 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,111 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:46,111 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:46,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:46,111 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,111 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:46,111 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:46,111 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,114 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:46,114 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:46,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:46,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:46,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:46,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:46,234 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:46,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:46,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:46,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable785 [2022-12-13 01:59:46,235 INFO L420 AbstractCegarLoop]: === Iteration 787 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -234325273, now seen corresponding path program 1 times [2022-12-13 01:59:46,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107537041] [2022-12-13 01:59:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:46,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:46,286 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 01:59:46,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:46,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107537041] [2022-12-13 01:59:46,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107537041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:46,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:46,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140426866] [2022-12-13 01:59:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:46,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:46,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:46,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:46,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:46,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:46,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:46,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:46,331 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:46,331 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:46,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:46,332 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:46,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:46,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:46,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:46,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:46,333 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:46,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:46,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:46,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:46,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:46,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:46,336 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:46,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:46,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:46,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:46,455 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:46,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:46,455 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:46,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable786 [2022-12-13 01:59:46,455 INFO L420 AbstractCegarLoop]: === Iteration 788 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:46,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash -177066971, now seen corresponding path program 1 times [2022-12-13 01:59:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:46,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823207831] [2022-12-13 01:59:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:46,520 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 01:59:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:46,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823207831] [2022-12-13 01:59:46,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823207831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:46,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:46,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:46,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901412455] [2022-12-13 01:59:46,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:46,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:46,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:46,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:46,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:46,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:46,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:46,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:46,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:46,564 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:46,565 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:46,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:46,565 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:46,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:46,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:46,566 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:46,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:46,567 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:46,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:46,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:46,567 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:46,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:46,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,570 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:46,570 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:46,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:46,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:46,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:46,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:46,688 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:46,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:46,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:46,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable787 [2022-12-13 01:59:46,689 INFO L420 AbstractCegarLoop]: === Iteration 789 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:46,689 INFO L85 PathProgramCache]: Analyzing trace with hash -119808669, now seen corresponding path program 1 times [2022-12-13 01:59:46,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:46,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139815319] [2022-12-13 01:59:46,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:46,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:46,745 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 01:59:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:46,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139815319] [2022-12-13 01:59:46,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139815319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:46,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:46,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:46,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921413855] [2022-12-13 01:59:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:46,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:46,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:46,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:46,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:46,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:46,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:46,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:46,801 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:46,802 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:46,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:46,802 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:46,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:46,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:46,803 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:46,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:46,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:46,804 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,804 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:46,805 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:46,805 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:46,805 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,805 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:46,805 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:46,805 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:46,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,809 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:46,809 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:46,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:46,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:46,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:46,938 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:46,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 01:59:46,939 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:46,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:46,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:46,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:46,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable788 [2022-12-13 01:59:46,939 INFO L420 AbstractCegarLoop]: === Iteration 790 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash -62550367, now seen corresponding path program 1 times [2022-12-13 01:59:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:46,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086732847] [2022-12-13 01:59:46,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:46,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:47,000 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 01:59:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:47,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086732847] [2022-12-13 01:59:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086732847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:47,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:47,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200902924] [2022-12-13 01:59:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:47,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:47,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:47,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:47,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:47,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:47,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:47,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:47,062 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:47,063 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:47,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:47,063 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:47,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:47,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:47,064 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:47,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:47,065 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:47,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:47,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:47,066 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:47,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:47,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,069 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:47,069 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:47,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:47,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:47,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:47,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:59:47,197 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:47,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:47,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:47,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable789 [2022-12-13 01:59:47,197 INFO L420 AbstractCegarLoop]: === Iteration 791 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash -5292065, now seen corresponding path program 1 times [2022-12-13 01:59:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:47,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633531209] [2022-12-13 01:59:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:47,252 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 01:59:47,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633531209] [2022-12-13 01:59:47,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633531209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:47,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:47,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494831402] [2022-12-13 01:59:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:47,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:47,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:47,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:47,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:47,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:47,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:47,296 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:47,296 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:47,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:47,297 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:47,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:47,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:47,298 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:47,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:47,298 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:47,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:47,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:47,299 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:47,299 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:47,299 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,302 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:47,302 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:47,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:47,302 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:47,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:47,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 01:59:47,425 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:47,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:47,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:47,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable790 [2022-12-13 01:59:47,425 INFO L420 AbstractCegarLoop]: === Iteration 792 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash 51966237, now seen corresponding path program 1 times [2022-12-13 01:59:47,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:47,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991287928] [2022-12-13 01:59:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:47,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:47,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991287928] [2022-12-13 01:59:47,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991287928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:47,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:47,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345402926] [2022-12-13 01:59:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:47,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:47,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:47,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:47,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:47,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:47,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:47,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:47,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:47,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:47,522 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:47,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:47,522 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:47,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:47,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:47,523 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:47,524 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:47,524 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:47,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:47,524 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:47,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:47,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,527 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:47,527 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:47,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:47,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:47,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:47,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:47,643 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:47,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:47,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:47,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable791 [2022-12-13 01:59:47,643 INFO L420 AbstractCegarLoop]: === Iteration 793 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:47,643 INFO L85 PathProgramCache]: Analyzing trace with hash 109224539, now seen corresponding path program 1 times [2022-12-13 01:59:47,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:47,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305246467] [2022-12-13 01:59:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:47,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:47,700 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 01:59:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:47,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305246467] [2022-12-13 01:59:47,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305246467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:47,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:47,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748565578] [2022-12-13 01:59:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:47,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:47,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:47,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:47,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:47,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:47,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:47,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:47,744 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:47,744 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:47,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:47,745 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:47,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:47,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:47,746 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:47,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:47,746 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:47,747 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:47,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:47,747 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:47,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:47,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,749 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:47,750 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:47,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:47,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:47,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:47,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:47,865 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:47,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:47,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:47,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable792 [2022-12-13 01:59:47,866 INFO L420 AbstractCegarLoop]: === Iteration 794 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:47,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 166482841, now seen corresponding path program 1 times [2022-12-13 01:59:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734708083] [2022-12-13 01:59:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:47,916 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 01:59:47,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:47,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734708083] [2022-12-13 01:59:47,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734708083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:47,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:47,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:47,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827027475] [2022-12-13 01:59:47,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:47,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:47,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:47,917 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:47,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:47,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:47,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:47,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:47,960 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:47,961 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:47,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:47,961 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:47,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:47,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:47,962 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:47,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:47,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:47,963 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:47,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:47,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:47,963 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:47,963 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:47,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:47,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,966 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:47,966 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:47,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:47,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:47,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:48,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:48,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:48,081 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:48,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:48,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:48,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable793 [2022-12-13 01:59:48,081 INFO L420 AbstractCegarLoop]: === Iteration 795 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:48,081 INFO L85 PathProgramCache]: Analyzing trace with hash 223741143, now seen corresponding path program 1 times [2022-12-13 01:59:48,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:48,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975624449] [2022-12-13 01:59:48,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:48,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:48,131 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 01:59:48,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:48,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975624449] [2022-12-13 01:59:48,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975624449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:48,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:48,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732734106] [2022-12-13 01:59:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:48,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:48,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:48,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:48,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:48,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:48,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:48,184 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:48,184 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:48,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:48,185 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:48,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:48,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:48,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:48,185 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:48,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:48,186 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:48,186 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:48,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:48,186 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:48,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:48,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,189 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:48,189 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:48,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:48,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:48,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:48,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:48,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:48,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:48,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:48,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable794 [2022-12-13 01:59:48,305 INFO L420 AbstractCegarLoop]: === Iteration 796 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:48,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash 280999445, now seen corresponding path program 1 times [2022-12-13 01:59:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:48,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341467148] [2022-12-13 01:59:48,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:48,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:48,354 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 01:59:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:48,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341467148] [2022-12-13 01:59:48,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341467148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:48,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:48,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:48,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502813974] [2022-12-13 01:59:48,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:48,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:48,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:48,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:48,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:48,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:48,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:48,406 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:48,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:48,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:48,407 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:48,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:48,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:48,407 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:48,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:48,408 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:48,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:48,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:48,408 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:48,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:48,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,411 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:48,411 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:48,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:48,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:48,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:48,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:48,529 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:48,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:48,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:48,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable795 [2022-12-13 01:59:48,529 INFO L420 AbstractCegarLoop]: === Iteration 797 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:48,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:48,529 INFO L85 PathProgramCache]: Analyzing trace with hash 338257747, now seen corresponding path program 1 times [2022-12-13 01:59:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:48,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417305828] [2022-12-13 01:59:48,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:48,582 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 01:59:48,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:48,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417305828] [2022-12-13 01:59:48,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417305828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:48,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:48,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:48,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884956924] [2022-12-13 01:59:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:48,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:48,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:48,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:48,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:48,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:48,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:48,635 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:48,635 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:48,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:48,636 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:48,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:48,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:48,636 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:48,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:48,637 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:48,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:48,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:48,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,638 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:48,638 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:48,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,640 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:48,640 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:48,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:48,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:48,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:48,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 01:59:48,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:48,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:48,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:48,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable796 [2022-12-13 01:59:48,759 INFO L420 AbstractCegarLoop]: === Iteration 798 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:48,759 INFO L85 PathProgramCache]: Analyzing trace with hash 395516049, now seen corresponding path program 1 times [2022-12-13 01:59:48,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:48,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228356741] [2022-12-13 01:59:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:48,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:48,817 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 01:59:48,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:48,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228356741] [2022-12-13 01:59:48,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228356741] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:48,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:48,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713163848] [2022-12-13 01:59:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:48,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:48,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:48,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:48,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:48,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:48,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:48,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:48,868 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:48,869 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:48,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:48,869 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:48,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:48,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:48,870 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:48,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:48,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:48,870 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:48,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:48,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:48,871 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:48,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:48,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:48,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,874 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:48,874 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:48,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:48,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:48,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:48,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:48,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:48,989 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:48,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:48,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:48,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:48,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable797 [2022-12-13 01:59:48,989 INFO L420 AbstractCegarLoop]: === Iteration 799 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash 452774351, now seen corresponding path program 1 times [2022-12-13 01:59:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973767102] [2022-12-13 01:59:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:49,048 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 01:59:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:49,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973767102] [2022-12-13 01:59:49,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973767102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:49,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:49,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:49,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948714849] [2022-12-13 01:59:49,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:49,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:49,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:49,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:49,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:49,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:49,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:49,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:49,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:49,093 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:49,093 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:49,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:49,094 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:49,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:49,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:49,094 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:49,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:49,095 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,095 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:49,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:49,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:49,095 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,095 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:49,096 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:49,096 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,098 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:49,098 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:49,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:49,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,099 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:49,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:49,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:49,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:49,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:49,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:49,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable798 [2022-12-13 01:59:49,213 INFO L420 AbstractCegarLoop]: === Iteration 800 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:49,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:49,213 INFO L85 PathProgramCache]: Analyzing trace with hash 510032653, now seen corresponding path program 1 times [2022-12-13 01:59:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:49,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12185506] [2022-12-13 01:59:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:49,273 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 01:59:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:49,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12185506] [2022-12-13 01:59:49,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12185506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:49,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:49,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283889445] [2022-12-13 01:59:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:49,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:49,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:49,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:49,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:49,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:49,326 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:49,326 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:49,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:49,326 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:49,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:49,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:49,327 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:49,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:49,328 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:49,328 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:49,328 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:49,328 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,328 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:49,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:49,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,331 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:49,331 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:49,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:49,448 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:49,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 01:59:49,448 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:49,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:49,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:49,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable799 [2022-12-13 01:59:49,449 INFO L420 AbstractCegarLoop]: === Iteration 801 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:49,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:49,449 INFO L85 PathProgramCache]: Analyzing trace with hash 567290955, now seen corresponding path program 1 times [2022-12-13 01:59:49,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:49,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801457311] [2022-12-13 01:59:49,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:49,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:49,500 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 01:59:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:49,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801457311] [2022-12-13 01:59:49,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801457311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:49,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:49,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:49,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761049447] [2022-12-13 01:59:49,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:49,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:49,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:49,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:49,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:49,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:49,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:49,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:49,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:49,554 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:49,555 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:49,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:49,555 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:49,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:49,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:49,556 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:49,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:49,557 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:49,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:49,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:49,558 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:49,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:49,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,561 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:49,562 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:49,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:49,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:49,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:49,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 01:59:49,703 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:49,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:49,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:49,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable800 [2022-12-13 01:59:49,703 INFO L420 AbstractCegarLoop]: === Iteration 802 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash 624549257, now seen corresponding path program 1 times [2022-12-13 01:59:49,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:49,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033580163] [2022-12-13 01:59:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:49,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:49,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:49,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033580163] [2022-12-13 01:59:49,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033580163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:49,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:49,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575584099] [2022-12-13 01:59:49,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:49,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:49,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:49,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:49,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:49,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:49,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:49,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:49,814 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:49,814 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:49,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:49,815 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:49,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:49,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:49,815 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:49,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:49,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:49,816 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,816 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:49,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:49,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:49,816 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:49,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:49,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:49,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,819 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:49,819 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:49,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:49,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:49,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:49,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:49,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:49,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:49,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:49,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:49,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:49,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable801 [2022-12-13 01:59:49,952 INFO L420 AbstractCegarLoop]: === Iteration 803 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash 681807559, now seen corresponding path program 1 times [2022-12-13 01:59:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510392616] [2022-12-13 01:59:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:50,018 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 01:59:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:50,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510392616] [2022-12-13 01:59:50,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510392616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:50,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:50,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:50,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909387294] [2022-12-13 01:59:50,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:50,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:50,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:50,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:50,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:50,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:50,070 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:50,070 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:50,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:50,071 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:50,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:50,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:50,072 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:50,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:50,072 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:50,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:50,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:50,073 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:50,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:50,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,075 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:50,076 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:50,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:50,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:50,190 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:50,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:50,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:50,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:50,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:50,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable802 [2022-12-13 01:59:50,191 INFO L420 AbstractCegarLoop]: === Iteration 804 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 739065861, now seen corresponding path program 1 times [2022-12-13 01:59:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824668367] [2022-12-13 01:59:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:50,243 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 01:59:50,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824668367] [2022-12-13 01:59:50,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824668367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:50,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:50,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:50,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826766928] [2022-12-13 01:59:50,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:50,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:50,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:50,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:50,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:50,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:50,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:50,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:50,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:50,287 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:50,287 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:50,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:50,287 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:50,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:50,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:50,288 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:50,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:50,289 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:50,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:50,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:50,289 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:50,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:50,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,292 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:50,292 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:50,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:50,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:50,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:50,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:50,407 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:50,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:50,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:50,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable803 [2022-12-13 01:59:50,408 INFO L420 AbstractCegarLoop]: === Iteration 805 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:50,408 INFO L85 PathProgramCache]: Analyzing trace with hash 796324163, now seen corresponding path program 1 times [2022-12-13 01:59:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:50,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131130768] [2022-12-13 01:59:50,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:50,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131130768] [2022-12-13 01:59:50,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131130768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:50,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:50,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:50,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062639527] [2022-12-13 01:59:50,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:50,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:50,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:50,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:50,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:50,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:50,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:50,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:50,510 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:50,510 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:50,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:50,510 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:50,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:50,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:50,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:50,511 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:50,511 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:50,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:50,512 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:50,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:50,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:50,512 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:50,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:50,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,515 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:50,515 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:50,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:50,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:50,633 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:50,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:50,633 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:50,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:50,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:50,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable804 [2022-12-13 01:59:50,634 INFO L420 AbstractCegarLoop]: === Iteration 806 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash 853582465, now seen corresponding path program 1 times [2022-12-13 01:59:50,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:50,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972298025] [2022-12-13 01:59:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:50,685 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 01:59:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:50,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972298025] [2022-12-13 01:59:50,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972298025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:50,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:50,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843232321] [2022-12-13 01:59:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:50,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:50,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:50,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:50,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:50,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:50,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:50,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:50,736 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:50,736 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:50,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:50,737 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:50,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:50,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:50,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:50,737 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:50,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:50,738 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:50,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:50,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:50,738 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:50,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:50,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,741 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:50,741 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:50,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:50,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:50,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:50,856 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:50,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:50,856 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable805 [2022-12-13 01:59:50,857 INFO L420 AbstractCegarLoop]: === Iteration 807 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash 910840767, now seen corresponding path program 1 times [2022-12-13 01:59:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:50,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612584882] [2022-12-13 01:59:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:50,905 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 01:59:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:50,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612584882] [2022-12-13 01:59:50,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612584882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:50,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:50,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322093070] [2022-12-13 01:59:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:50,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:50,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:50,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:50,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:50,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:50,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:50,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:50,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:50,957 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:50,957 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:50,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:50,957 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:50,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:50,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:50,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:50,958 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:50,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:50,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:50,959 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:50,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:50,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:50,959 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:50,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:50,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:50,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,962 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:50,962 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:50,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:50,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:50,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:51,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:51,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:51,078 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:51,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:51,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:51,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable806 [2022-12-13 01:59:51,078 INFO L420 AbstractCegarLoop]: === Iteration 808 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:51,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash 968099069, now seen corresponding path program 1 times [2022-12-13 01:59:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209716172] [2022-12-13 01:59:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:51,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:51,136 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 01:59:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:51,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209716172] [2022-12-13 01:59:51,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209716172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:51,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:51,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:51,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090087694] [2022-12-13 01:59:51,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:51,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:51,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:51,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:51,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:51,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:51,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:51,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:51,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:51,190 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:51,190 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:51,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:51,191 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:51,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:51,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:51,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:51,191 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:51,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:51,192 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:51,192 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:51,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:51,192 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:51,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:51,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,195 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:51,195 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:51,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:51,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:51,321 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:51,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 01:59:51,321 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:51,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:51,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:51,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable807 [2022-12-13 01:59:51,322 INFO L420 AbstractCegarLoop]: === Iteration 809 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:51,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1025357371, now seen corresponding path program 1 times [2022-12-13 01:59:51,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:51,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468116792] [2022-12-13 01:59:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:51,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:51,375 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 01:59:51,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:51,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468116792] [2022-12-13 01:59:51,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468116792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:51,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:51,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617626987] [2022-12-13 01:59:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:51,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:51,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:51,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:51,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:51,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:51,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:51,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:51,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:51,421 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:51,421 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:51,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:51,422 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:51,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:51,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:51,422 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:51,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:51,423 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:51,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:51,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:51,424 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:51,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:51,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,426 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:51,426 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:51,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:51,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:51,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:51,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:51,545 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:51,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:51,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:51,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable808 [2022-12-13 01:59:51,545 INFO L420 AbstractCegarLoop]: === Iteration 810 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:51,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1082615673, now seen corresponding path program 1 times [2022-12-13 01:59:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:51,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455488847] [2022-12-13 01:59:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:51,595 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 01:59:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:51,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455488847] [2022-12-13 01:59:51,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455488847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:51,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:51,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685280887] [2022-12-13 01:59:51,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:51,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:51,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:51,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:51,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:51,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:51,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:51,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:51,639 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:51,639 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:51,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:51,640 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:51,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:51,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:51,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:51,640 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:51,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:51,641 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:51,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:51,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:51,641 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:51,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:51,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,644 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:51,644 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:51,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:51,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:51,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:51,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:51,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:51,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:51,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:51,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable809 [2022-12-13 01:59:51,759 INFO L420 AbstractCegarLoop]: === Iteration 811 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:51,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1139873975, now seen corresponding path program 1 times [2022-12-13 01:59:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:51,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780969845] [2022-12-13 01:59:51,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:51,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:51,807 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 01:59:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:51,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780969845] [2022-12-13 01:59:51,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780969845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:51,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:51,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:51,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272743628] [2022-12-13 01:59:51,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:51,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:51,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:51,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:51,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:51,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:51,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:51,852 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:51,852 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:51,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:51,853 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:51,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:51,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:51,853 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:51,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:51,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:51,854 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:51,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:51,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:51,854 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:51,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:51,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:51,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,857 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:51,857 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:51,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:51,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:51,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:51,973 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:51,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:51,973 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:51,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:51,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:51,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable810 [2022-12-13 01:59:51,973 INFO L420 AbstractCegarLoop]: === Iteration 812 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1197132277, now seen corresponding path program 1 times [2022-12-13 01:59:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:51,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686860880] [2022-12-13 01:59:51,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:51,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:52,027 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 01:59:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:52,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686860880] [2022-12-13 01:59:52,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686860880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:52,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:52,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:52,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935658429] [2022-12-13 01:59:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:52,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:52,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:52,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:52,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:52,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:52,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:52,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:52,081 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:52,081 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:52,082 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:52,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:52,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:52,082 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:52,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:52,083 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,083 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:52,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:52,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:52,083 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:52,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:52,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,092 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:52,092 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:52,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:52,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:52,244 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:52,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 01:59:52,245 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:52,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,245 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:52,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:52,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable811 [2022-12-13 01:59:52,245 INFO L420 AbstractCegarLoop]: === Iteration 813 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:52,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1254390579, now seen corresponding path program 1 times [2022-12-13 01:59:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381490921] [2022-12-13 01:59:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:52,310 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 01:59:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:52,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381490921] [2022-12-13 01:59:52,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381490921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:52,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:52,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:52,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316390420] [2022-12-13 01:59:52,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:52,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:52,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:52,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:52,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:52,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:52,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:52,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:52,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:52,365 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:52,365 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:52,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:52,366 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:52,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:52,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:52,366 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:52,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:52,367 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:52,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:52,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:52,368 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:52,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:52,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,370 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:52,371 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:52,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:52,371 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:52,503 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:52,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:52,504 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:52,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:52,504 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:52,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable812 [2022-12-13 01:59:52,504 INFO L420 AbstractCegarLoop]: === Iteration 814 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1311648881, now seen corresponding path program 1 times [2022-12-13 01:59:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:52,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528944315] [2022-12-13 01:59:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:52,570 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 01:59:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:52,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528944315] [2022-12-13 01:59:52,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528944315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:52,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:52,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721050846] [2022-12-13 01:59:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:52,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:52,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:52,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:52,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:52,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:52,630 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:52,630 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:52,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:52,630 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:52,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:52,631 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:52,631 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:52,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:52,632 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,632 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:52,632 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:52,632 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:52,632 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,632 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:52,632 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:52,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,636 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:52,636 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:52,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:52,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:52,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:52,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:52,768 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:52,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:52,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:52,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable813 [2022-12-13 01:59:52,768 INFO L420 AbstractCegarLoop]: === Iteration 815 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1368907183, now seen corresponding path program 1 times [2022-12-13 01:59:52,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:52,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252649377] [2022-12-13 01:59:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:52,831 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 01:59:52,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:52,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252649377] [2022-12-13 01:59:52,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252649377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:52,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:52,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:52,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623453542] [2022-12-13 01:59:52,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:52,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:52,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:52,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:52,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:52,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:52,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:52,881 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:52,881 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:52,882 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:52,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:52,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:52,883 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:52,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:52,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:52,883 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:52,884 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:52,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:52,884 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:52,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:52,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:52,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,887 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:52,887 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:52,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:52,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:53,002 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:53,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:53,003 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:53,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:53,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:53,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable814 [2022-12-13 01:59:53,003 INFO L420 AbstractCegarLoop]: === Iteration 816 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1426165485, now seen corresponding path program 1 times [2022-12-13 01:59:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:53,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71000250] [2022-12-13 01:59:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:53,055 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 01:59:53,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:53,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71000250] [2022-12-13 01:59:53,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71000250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:53,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:53,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776761470] [2022-12-13 01:59:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:53,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:53,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:53,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:53,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:53,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:53,106 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:53,107 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:53,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:53,107 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:53,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:53,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:53,108 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:53,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:53,108 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:53,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:53,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:53,109 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:53,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:53,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,112 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:53,112 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:53,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:53,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:53,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:53,228 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:53,228 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:53,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:53,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:53,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable815 [2022-12-13 01:59:53,228 INFO L420 AbstractCegarLoop]: === Iteration 817 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:53,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1483423787, now seen corresponding path program 1 times [2022-12-13 01:59:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:53,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490046033] [2022-12-13 01:59:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:53,279 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 01:59:53,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:53,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490046033] [2022-12-13 01:59:53,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490046033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:53,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:53,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:53,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808811121] [2022-12-13 01:59:53,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:53,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:53,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:53,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:53,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:53,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:53,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:53,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:53,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:53,331 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:53,331 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:53,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:53,332 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:53,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:53,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:53,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:53,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:53,333 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:53,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:53,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:53,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:53,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:53,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:53,336 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:53,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:53,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:53,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:53,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:53,452 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:53,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:53,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:53,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable816 [2022-12-13 01:59:53,453 INFO L420 AbstractCegarLoop]: === Iteration 818 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:53,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1540682089, now seen corresponding path program 1 times [2022-12-13 01:59:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:53,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43883945] [2022-12-13 01:59:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:53,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:53,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:53,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43883945] [2022-12-13 01:59:53,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43883945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:53,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:53,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:53,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139683997] [2022-12-13 01:59:53,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:53,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:53,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:53,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:53,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:53,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:53,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:53,569 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:53,570 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:53,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:53,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:53,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:53,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:53,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:53,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:53,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:53,571 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:53,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:53,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:53,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:53,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:53,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,574 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:53,574 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:53,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:53,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:53,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:53,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 01:59:53,702 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:53,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:53,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:53,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable817 [2022-12-13 01:59:53,702 INFO L420 AbstractCegarLoop]: === Iteration 819 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:53,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1597940391, now seen corresponding path program 1 times [2022-12-13 01:59:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:53,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921902388] [2022-12-13 01:59:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:53,752 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 01:59:53,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:53,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921902388] [2022-12-13 01:59:53,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921902388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:53,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:53,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:53,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100901204] [2022-12-13 01:59:53,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:53,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:53,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:53,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:53,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:53,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:53,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:53,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:53,806 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:53,806 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:53,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:53,807 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:53,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:53,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:53,807 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:53,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:53,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:53,808 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:53,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:53,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:53,808 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:53,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:53,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:53,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,811 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:53,811 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:53,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:53,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:53,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:53,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 01:59:53,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:53,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:53,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:53,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable818 [2022-12-13 01:59:53,935 INFO L420 AbstractCegarLoop]: === Iteration 820 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1655198693, now seen corresponding path program 1 times [2022-12-13 01:59:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:53,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536675616] [2022-12-13 01:59:53,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:53,984 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 01:59:53,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536675616] [2022-12-13 01:59:53,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536675616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:53,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:53,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:53,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734132452] [2022-12-13 01:59:53,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:53,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:53,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:53,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:53,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:53,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:53,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:54,039 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:54,039 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:54,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:54,040 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:54,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:54,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:54,040 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:54,041 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:54,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:54,041 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,041 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:54,042 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:54,042 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:54,042 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:54,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:54,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,045 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:54,045 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:54,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:54,045 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,045 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:54,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:54,165 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:54,165 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:54,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:54,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable819 [2022-12-13 01:59:54,166 INFO L420 AbstractCegarLoop]: === Iteration 821 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1712456995, now seen corresponding path program 1 times [2022-12-13 01:59:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803013045] [2022-12-13 01:59:54,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:54,226 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 01:59:54,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:54,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803013045] [2022-12-13 01:59:54,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803013045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:54,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:54,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494301689] [2022-12-13 01:59:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:54,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:54,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:54,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:54,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:54,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:54,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:54,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:54,272 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:54,272 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:54,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:54,273 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:54,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:54,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:54,273 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:54,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:54,274 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:54,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:54,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:54,274 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:54,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:54,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,277 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:54,277 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:54,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:54,278 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:54,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:54,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 01:59:54,405 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:54,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:54,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:54,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable820 [2022-12-13 01:59:54,405 INFO L420 AbstractCegarLoop]: === Iteration 822 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:54,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:54,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1769715297, now seen corresponding path program 1 times [2022-12-13 01:59:54,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:54,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853760683] [2022-12-13 01:59:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:54,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:54,461 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 01:59:54,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:54,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853760683] [2022-12-13 01:59:54,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853760683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:54,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:54,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:54,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615588502] [2022-12-13 01:59:54,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:54,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:54,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:54,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:54,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:54,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:54,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:54,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:54,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:54,516 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:54,516 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:54,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:54,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:54,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:54,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:54,517 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:54,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:54,518 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:54,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:54,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:54,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:54,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:54,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:54,521 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:54,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:54,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:54,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:54,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:54,654 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:54,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:54,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable821 [2022-12-13 01:59:54,654 INFO L420 AbstractCegarLoop]: === Iteration 823 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1826973599, now seen corresponding path program 1 times [2022-12-13 01:59:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:54,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699779195] [2022-12-13 01:59:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:54,733 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 01:59:54,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:54,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699779195] [2022-12-13 01:59:54,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699779195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:54,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:54,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914889515] [2022-12-13 01:59:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:54,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:54,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:54,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:54,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:54,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:54,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:54,795 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:54,795 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:54,796 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:54,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:54,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:54,796 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:54,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:54,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:54,799 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:54,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:54,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:54,799 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:54,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:54,800 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:54,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,802 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:54,802 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:54,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:54,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:54,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:54,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:54,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 01:59:54,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:54,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:54,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:54,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable822 [2022-12-13 01:59:54,940 INFO L420 AbstractCegarLoop]: === Iteration 824 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1884231901, now seen corresponding path program 1 times [2022-12-13 01:59:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915334937] [2022-12-13 01:59:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:54,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:54,993 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 01:59:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:54,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915334937] [2022-12-13 01:59:54,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915334937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:54,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:54,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:54,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316786076] [2022-12-13 01:59:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:54,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:54,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:54,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:54,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:54,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:54,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:54,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:54,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:55,046 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:55,046 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:55,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:55,047 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:55,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:55,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:55,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:55,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:55,047 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:55,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:55,048 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:55,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:55,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:55,049 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:55,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:55,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,051 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:55,051 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:55,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:55,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:55,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:55,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:55,171 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:55,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:55,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable823 [2022-12-13 01:59:55,171 INFO L420 AbstractCegarLoop]: === Iteration 825 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:55,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1941490203, now seen corresponding path program 1 times [2022-12-13 01:59:55,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441127902] [2022-12-13 01:59:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:55,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441127902] [2022-12-13 01:59:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441127902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:55,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:55,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108566194] [2022-12-13 01:59:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:55,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:55,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:55,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:55,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:55,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:55,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:55,274 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:55,274 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:55,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:55,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:55,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:55,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:55,275 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:55,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:55,276 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:55,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:55,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:55,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:55,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:55,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,279 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:55,279 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:55,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:55,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:55,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:55,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:55,395 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:55,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:55,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:55,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable824 [2022-12-13 01:59:55,396 INFO L420 AbstractCegarLoop]: === Iteration 826 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1998748505, now seen corresponding path program 1 times [2022-12-13 01:59:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:55,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047918102] [2022-12-13 01:59:55,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:55,446 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 01:59:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047918102] [2022-12-13 01:59:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047918102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:55,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:55,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114076263] [2022-12-13 01:59:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:55,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:55,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:55,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:55,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:55,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:55,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:55,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:55,490 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:55,490 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:55,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:55,491 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:55,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:55,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:55,491 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:55,491 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:55,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:55,492 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,492 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:55,492 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:55,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:55,493 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:55,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:55,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,495 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:55,495 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:55,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:55,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,496 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:55,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:55,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:55,612 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:55,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:55,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:55,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable825 [2022-12-13 01:59:55,613 INFO L420 AbstractCegarLoop]: === Iteration 827 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:55,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2056006807, now seen corresponding path program 1 times [2022-12-13 01:59:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822221193] [2022-12-13 01:59:55,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:55,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:55,676 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 01:59:55,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:55,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822221193] [2022-12-13 01:59:55,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822221193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:55,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:55,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829358930] [2022-12-13 01:59:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:55,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:55,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:55,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:55,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:55,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:55,730 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:55,730 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:55,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:55,731 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:55,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:55,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:55,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:55,731 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:55,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:55,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:55,732 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:55,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:55,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:55,733 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:55,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:55,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:55,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,735 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:55,736 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:55,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:55,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:55,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:55,886 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:55,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 01:59:55,887 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:55,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:55,887 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable826 [2022-12-13 01:59:55,887 INFO L420 AbstractCegarLoop]: === Iteration 828 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2113265109, now seen corresponding path program 1 times [2022-12-13 01:59:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:55,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622501860] [2022-12-13 01:59:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:55,966 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 01:59:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:55,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622501860] [2022-12-13 01:59:55,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622501860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:55,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:55,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:55,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793556464] [2022-12-13 01:59:55,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:55,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:55,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:55,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:55,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:55,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:55,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:55,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:55,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:55,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:56,029 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:56,029 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:56,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:56,030 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:56,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:56,030 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:56,030 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:56,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:56,031 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:56,031 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:56,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:56,032 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:56,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:56,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,034 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:56,034 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:56,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:56,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:56,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:56,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 01:59:56,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:56,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:56,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable827 [2022-12-13 01:59:56,169 INFO L420 AbstractCegarLoop]: === Iteration 829 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2124443885, now seen corresponding path program 1 times [2022-12-13 01:59:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:56,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689355150] [2022-12-13 01:59:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:56,229 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 01:59:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:56,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689355150] [2022-12-13 01:59:56,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689355150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:56,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:56,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904357057] [2022-12-13 01:59:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:56,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:56,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:56,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:56,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:56,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:56,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:56,290 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:56,290 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:56,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:56,291 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:56,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:56,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:56,292 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:56,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:56,293 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:56,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:56,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:56,293 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:56,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:56,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:56,297 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:56,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:56,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:56,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:56,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:56,428 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:56,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:56,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:56,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable828 [2022-12-13 01:59:56,428 INFO L420 AbstractCegarLoop]: === Iteration 830 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:56,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2067185583, now seen corresponding path program 1 times [2022-12-13 01:59:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:56,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696708021] [2022-12-13 01:59:56,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:56,483 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 01:59:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:56,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696708021] [2022-12-13 01:59:56,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696708021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:56,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:56,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924728860] [2022-12-13 01:59:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:56,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:56,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:56,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:56,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:56,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:56,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:56,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:56,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:56,528 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:56,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:56,529 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:56,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:56,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:56,529 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:56,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:56,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:56,530 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:56,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:56,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:56,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:56,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,533 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:56,533 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:56,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:56,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:56,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:56,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:56,651 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:56,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:56,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:56,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable829 [2022-12-13 01:59:56,651 INFO L420 AbstractCegarLoop]: === Iteration 831 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2009927281, now seen corresponding path program 1 times [2022-12-13 01:59:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:56,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292062103] [2022-12-13 01:59:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:56,702 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 01:59:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292062103] [2022-12-13 01:59:56,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292062103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:56,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:56,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26696966] [2022-12-13 01:59:56,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:56,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:56,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:56,703 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:56,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:56,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:56,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:56,746 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:56,746 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:56,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:56,747 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:56,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:56,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:56,747 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:56,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:56,748 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:56,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:56,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:56,748 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,749 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:56,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:56,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,751 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:56,751 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:56,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:56,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:56,868 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:56,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:56,871 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:56,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:56,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:56,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable830 [2022-12-13 01:59:56,871 INFO L420 AbstractCegarLoop]: === Iteration 832 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:56,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1952668979, now seen corresponding path program 1 times [2022-12-13 01:59:56,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:56,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173301681] [2022-12-13 01:59:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:56,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 01:59:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:56,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173301681] [2022-12-13 01:59:56,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173301681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:56,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:56,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389305719] [2022-12-13 01:59:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:56,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:56,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:56,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:56,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:56,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:56,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:56,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:56,975 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:56,976 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:56,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:56,976 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:56,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:56,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:56,977 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:56,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:56,978 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:56,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:56,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:56,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:56,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:56,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:56,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,981 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:56,981 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:56,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:56,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:56,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:57,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:57,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 01:59:57,099 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:57,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:57,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:57,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable831 [2022-12-13 01:59:57,100 INFO L420 AbstractCegarLoop]: === Iteration 833 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1895410677, now seen corresponding path program 1 times [2022-12-13 01:59:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229318655] [2022-12-13 01:59:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:57,162 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 01:59:57,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:57,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229318655] [2022-12-13 01:59:57,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229318655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:57,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:57,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535095702] [2022-12-13 01:59:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:57,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:57,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:57,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:57,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:57,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:57,216 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:57,216 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:57,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:57,217 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:57,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:57,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:57,217 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:57,217 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:57,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:57,218 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,218 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:57,218 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:57,218 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:57,218 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:57,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:57,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,221 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:57,221 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:57,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:57,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:57,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:57,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:57,354 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:57,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:57,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:57,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable832 [2022-12-13 01:59:57,355 INFO L420 AbstractCegarLoop]: === Iteration 834 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:57,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1838152375, now seen corresponding path program 1 times [2022-12-13 01:59:57,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:57,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815005976] [2022-12-13 01:59:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:57,410 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 01:59:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:57,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815005976] [2022-12-13 01:59:57,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815005976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:57,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:57,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180559232] [2022-12-13 01:59:57,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:57,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:57,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:57,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:57,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:57,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:57,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:57,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:57,473 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:57,474 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:57,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:57,474 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:57,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:57,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:57,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:57,475 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:57,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:57,476 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:57,476 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:57,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:57,476 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:57,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:57,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,479 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:57,479 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:57,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:57,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:57,613 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:57,614 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 01:59:57,614 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:57,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:57,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:57,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable833 [2022-12-13 01:59:57,614 INFO L420 AbstractCegarLoop]: === Iteration 835 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1780894073, now seen corresponding path program 1 times [2022-12-13 01:59:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:57,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212160960] [2022-12-13 01:59:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:57,675 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 01:59:57,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:57,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212160960] [2022-12-13 01:59:57,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212160960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:57,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:57,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:57,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789570938] [2022-12-13 01:59:57,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:57,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:57,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:57,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:57,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:57,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:57,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:57,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:57,729 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:57,729 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:57,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:57,730 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:57,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:57,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:57,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:57,730 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:57,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:57,731 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:57,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:57,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:57,732 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:57,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:57,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,736 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:57,736 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:57,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:57,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:57,870 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:57,871 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 01:59:57,871 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:57,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:57,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:57,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable834 [2022-12-13 01:59:57,872 INFO L420 AbstractCegarLoop]: === Iteration 836 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:57,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:57,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1723635771, now seen corresponding path program 1 times [2022-12-13 01:59:57,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:57,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531363661] [2022-12-13 01:59:57,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:57,927 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 01:59:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:57,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531363661] [2022-12-13 01:59:57,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531363661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:57,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:57,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829099801] [2022-12-13 01:59:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:57,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:57,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:57,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:57,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:57,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:57,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:57,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:57,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:57,981 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:57,982 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:57,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:57,982 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:57,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:57,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:57,983 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:57,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:57,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:57,984 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:57,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:57,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:57,984 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:57,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:57,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:57,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,987 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:57,987 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:57,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:57,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:57,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:58,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:58,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:58,120 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:58,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:58,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:58,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable835 [2022-12-13 01:59:58,120 INFO L420 AbstractCegarLoop]: === Iteration 837 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:58,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1666377469, now seen corresponding path program 1 times [2022-12-13 01:59:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:58,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762393324] [2022-12-13 01:59:58,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:58,175 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 01:59:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:58,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762393324] [2022-12-13 01:59:58,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762393324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:58,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:58,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449944315] [2022-12-13 01:59:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:58,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:58,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:58,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:58,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:58,176 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:58,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:58,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:58,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:58,220 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:58,220 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:58,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:58,221 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:58,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:58,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:58,221 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:58,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:58,222 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:58,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:58,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:58,223 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:58,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:58,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,225 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:58,226 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:58,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:58,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:58,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:58,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:58,345 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:58,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:58,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:58,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable836 [2022-12-13 01:59:58,345 INFO L420 AbstractCegarLoop]: === Iteration 838 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1609119167, now seen corresponding path program 1 times [2022-12-13 01:59:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:58,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253401395] [2022-12-13 01:59:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:58,405 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 01:59:58,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:58,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253401395] [2022-12-13 01:59:58,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253401395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:58,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:58,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259251166] [2022-12-13 01:59:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:58,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:58,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:58,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:58,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:58,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:58,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:58,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:58,461 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:58,461 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:58,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:58,462 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:58,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:58,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:58,463 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:58,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:58,463 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:58,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:58,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:58,464 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:58,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:58,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:58,467 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:58,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:58,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:58,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:58,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 01:59:58,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:58,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:58,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable837 [2022-12-13 01:59:58,587 INFO L420 AbstractCegarLoop]: === Iteration 839 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:58,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1551860865, now seen corresponding path program 1 times [2022-12-13 01:59:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:58,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870449411] [2022-12-13 01:59:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:58,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:58,638 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 01:59:58,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870449411] [2022-12-13 01:59:58,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870449411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:58,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:58,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:58,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692083236] [2022-12-13 01:59:58,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:58,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:58,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:58,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:58,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:58,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:58,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:58,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:58,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:58,682 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:58,682 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:58,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:58,683 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:58,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:58,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:58,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:58,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:58,684 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:58,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:58,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:58,684 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:58,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:58,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,687 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:58,687 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:58,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:58,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:58,802 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:58,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 01:59:58,802 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:58,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:58,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:58,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable838 [2022-12-13 01:59:58,803 INFO L420 AbstractCegarLoop]: === Iteration 840 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:58,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1494602563, now seen corresponding path program 1 times [2022-12-13 01:59:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:58,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433621187] [2022-12-13 01:59:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:58,861 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 01:59:58,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:58,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433621187] [2022-12-13 01:59:58,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433621187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:58,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:58,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721499932] [2022-12-13 01:59:58,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:58,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:58,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:58,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:58,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:58,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:58,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:58,906 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:58,907 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:58,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:58,907 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:58,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:58,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:58,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:58,908 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:58,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:58,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:58,908 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:58,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:58,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:58,909 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:58,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:58,909 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:58,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,912 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:58,912 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:58,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:58,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:58,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:59,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:59,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 01:59:59,029 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:59,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:59,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:59,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable839 [2022-12-13 01:59:59,029 INFO L420 AbstractCegarLoop]: === Iteration 841 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:59,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1437344261, now seen corresponding path program 1 times [2022-12-13 01:59:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:59,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109701095] [2022-12-13 01:59:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:59,081 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 01:59:59,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:59,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109701095] [2022-12-13 01:59:59,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109701095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:59,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:59,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212887462] [2022-12-13 01:59:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:59,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:59,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:59,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:59,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:59,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:59,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,082 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:59,082 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:59,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:59,127 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:59,127 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:59,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:59,128 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:59,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:59,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:59,128 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:59,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:59,129 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:59,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:59,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:59,129 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:59,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:59,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,132 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:59,132 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:59,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:59,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:59,264 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:59,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 01:59:59,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:59,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:59,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:59,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable840 [2022-12-13 01:59:59,265 INFO L420 AbstractCegarLoop]: === Iteration 842 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1380085959, now seen corresponding path program 1 times [2022-12-13 01:59:59,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:59,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643950471] [2022-12-13 01:59:59,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:59,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:59,320 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 01:59:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:59,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643950471] [2022-12-13 01:59:59,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643950471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:59,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:59,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014025860] [2022-12-13 01:59:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:59,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:59,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:59,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:59,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:59,371 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:59,372 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:59,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:59,372 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:59,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:59,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:59,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:59,373 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:59,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:59,373 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:59,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:59,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:59,374 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,374 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:59,374 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:59,374 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,377 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:59,377 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:59,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:59,377 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,377 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:59,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:59,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 01:59:59,506 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:59,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:59,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:59,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable841 [2022-12-13 01:59:59,506 INFO L420 AbstractCegarLoop]: === Iteration 843 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1322827657, now seen corresponding path program 1 times [2022-12-13 01:59:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:59,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868984117] [2022-12-13 01:59:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:59,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:59,570 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 01:59:59,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:59,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868984117] [2022-12-13 01:59:59,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868984117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:59,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:59,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604186631] [2022-12-13 01:59:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:59,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:59,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:59,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:59,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:59,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:59,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:59,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:59,632 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:59,632 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 01:59:59,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:59,633 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:59,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:59,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:59,634 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:59,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:59,635 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:59,635 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:59,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:59,635 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:59,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:59,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,639 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:59,639 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 01:59:59,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:59,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 01:59:59,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 01:59:59,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 01:59:59,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 01:59:59,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 01:59:59,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 01:59:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable842 [2022-12-13 01:59:59,770 INFO L420 AbstractCegarLoop]: === Iteration 844 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 01:59:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 01:59:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1265569355, now seen corresponding path program 1 times [2022-12-13 01:59:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 01:59:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265151071] [2022-12-13 01:59:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 01:59:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 01:59:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 01:59:59,842 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 01:59:59,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 01:59:59,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265151071] [2022-12-13 01:59:59,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265151071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 01:59:59,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 01:59:59,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 01:59:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811525635] [2022-12-13 01:59:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 01:59:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 01:59:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 01:59:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 01:59:59,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 01:59:59,843 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 01:59:59,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 01:59:59,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 01:59:59,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 01:59:59,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 01:59:59,891 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 01:59:59,891 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 01:59:59,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 01:59:59,891 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 01:59:59,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 01:59:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 01:59:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 01:59:59,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 01:59:59,892 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 01:59:59,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 01:59:59,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 01:59:59,893 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 01:59:59,893 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 01:59:59,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 01:59:59,893 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 01:59:59,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 01:59:59,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 01:59:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,896 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 01:59:59,896 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 01:59:59,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 01:59:59,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 01:59:59,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:00,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:00,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:00,012 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:00,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:00,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:00,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable843 [2022-12-13 02:00:00,012 INFO L420 AbstractCegarLoop]: === Iteration 845 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1208311053, now seen corresponding path program 1 times [2022-12-13 02:00:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:00,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840862097] [2022-12-13 02:00:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:00,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:00,065 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 02:00:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:00,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840862097] [2022-12-13 02:00:00,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840862097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:00,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:00,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:00,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488220555] [2022-12-13 02:00:00,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:00,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:00,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:00,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:00,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:00,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:00,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:00,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:00,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:00,110 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:00,110 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:00,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:00,110 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:00,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:00,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:00,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:00,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:00,111 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:00,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:00,115 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:00,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:00,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:00,115 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:00,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:00,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,118 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:00,119 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:00,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:00,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:00,248 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:00,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:00,249 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:00,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:00,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:00,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable844 [2022-12-13 02:00:00,249 INFO L420 AbstractCegarLoop]: === Iteration 846 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:00,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1151052751, now seen corresponding path program 1 times [2022-12-13 02:00:00,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:00,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205165941] [2022-12-13 02:00:00,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:00,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:00,299 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 02:00:00,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:00,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205165941] [2022-12-13 02:00:00,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205165941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:00,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:00,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:00,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322115535] [2022-12-13 02:00:00,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:00,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:00,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:00,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:00,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:00,350 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:00,350 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:00,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:00,350 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:00,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:00,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:00,351 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:00,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:00,352 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:00,352 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:00,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:00,352 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:00,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:00,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,355 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:00,355 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:00,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:00,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:00,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:00,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:00:00,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:00,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:00,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:00,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable845 [2022-12-13 02:00:00,495 INFO L420 AbstractCegarLoop]: === Iteration 847 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1093794449, now seen corresponding path program 1 times [2022-12-13 02:00:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:00,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038400484] [2022-12-13 02:00:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:00,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 02:00:00,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:00,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038400484] [2022-12-13 02:00:00,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038400484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:00,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:00,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196449115] [2022-12-13 02:00:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:00,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:00,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:00,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:00,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:00,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:00,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:00,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:00,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:00,600 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:00,600 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:00,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:00,601 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:00,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:00,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:00,601 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:00,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:00,602 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,602 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:00,602 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:00,602 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:00,602 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:00,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:00,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,605 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:00,605 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:00,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:00,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:00,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:00,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:00,721 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:00,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:00,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:00,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable846 [2022-12-13 02:00:00,721 INFO L420 AbstractCegarLoop]: === Iteration 848 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1036536147, now seen corresponding path program 1 times [2022-12-13 02:00:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:00,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666216211] [2022-12-13 02:00:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:00,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:00,789 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 02:00:00,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:00,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666216211] [2022-12-13 02:00:00,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666216211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:00,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:00,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700231803] [2022-12-13 02:00:00,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:00,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:00,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:00,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:00,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:00,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:00,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:00,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:00,842 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:00,842 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:00,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:00,843 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:00,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:00,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:00,843 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:00,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:00,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:00,844 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:00,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:00,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:00,845 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,845 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:00,845 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:00,845 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:00,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,847 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:00,847 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:00,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:00,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:00,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:00,963 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:00,964 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:00,964 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:00,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:00,964 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:00,964 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:00,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847 [2022-12-13 02:00:00,964 INFO L420 AbstractCegarLoop]: === Iteration 849 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash -979277845, now seen corresponding path program 1 times [2022-12-13 02:00:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:00,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398111553] [2022-12-13 02:00:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:01,015 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 02:00:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:01,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398111553] [2022-12-13 02:00:01,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398111553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:01,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664286679] [2022-12-13 02:00:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:01,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:01,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:01,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:01,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:01,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:01,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:01,061 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:01,061 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:01,062 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:01,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:01,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:01,062 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:01,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:01,063 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:01,063 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:01,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:01,063 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:01,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:01,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,066 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:01,066 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:01,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:01,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:01,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:01,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:01,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:01,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:01,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:01,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable848 [2022-12-13 02:00:01,183 INFO L420 AbstractCegarLoop]: === Iteration 850 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:01,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash -922019543, now seen corresponding path program 1 times [2022-12-13 02:00:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:01,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853805089] [2022-12-13 02:00:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:01,238 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 02:00:01,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:01,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853805089] [2022-12-13 02:00:01,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853805089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:01,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:01,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:01,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520143906] [2022-12-13 02:00:01,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:01,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:01,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:01,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:01,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:01,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:01,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:01,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:01,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:01,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:01,283 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:01,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:01,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:01,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:01,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:01,284 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:01,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:01,285 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:01,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:01,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:01,286 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:01,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:01,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,288 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:01,288 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:01,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:01,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:01,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:01,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:01,407 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:01,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:01,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:01,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable849 [2022-12-13 02:00:01,407 INFO L420 AbstractCegarLoop]: === Iteration 851 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash -864761241, now seen corresponding path program 1 times [2022-12-13 02:00:01,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:01,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312201367] [2022-12-13 02:00:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:01,457 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 02:00:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312201367] [2022-12-13 02:00:01,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312201367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:01,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:01,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030966554] [2022-12-13 02:00:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:01,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:01,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:01,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:01,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:01,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:01,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:01,509 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:01,509 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:01,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:01,510 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:01,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:01,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:01,510 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:01,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:01,511 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,511 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:01,511 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:01,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:01,512 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:01,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:01,512 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,514 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:01,514 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:01,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:01,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:01,634 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:01,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:00:01,635 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:01,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:01,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:01,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable850 [2022-12-13 02:00:01,635 INFO L420 AbstractCegarLoop]: === Iteration 852 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -807502939, now seen corresponding path program 1 times [2022-12-13 02:00:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873745970] [2022-12-13 02:00:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:01,687 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 02:00:01,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:01,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873745970] [2022-12-13 02:00:01,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873745970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:01,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:01,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:01,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66480821] [2022-12-13 02:00:01,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:01,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:01,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:01,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:01,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:01,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:01,739 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:01,739 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:01,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:01,740 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:01,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:01,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:01,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:01,740 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:01,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:01,741 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,741 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:01,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:01,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:01,742 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:01,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:01,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,744 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:01,745 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:01,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:01,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:01,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:01,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:00:01,880 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:01,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,881 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:01,881 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:01,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable851 [2022-12-13 02:00:01,881 INFO L420 AbstractCegarLoop]: === Iteration 853 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash -750244637, now seen corresponding path program 1 times [2022-12-13 02:00:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:01,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684306673] [2022-12-13 02:00:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:01,932 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 02:00:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:01,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684306673] [2022-12-13 02:00:01,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684306673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:01,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:01,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784624898] [2022-12-13 02:00:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:01,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:01,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:01,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:01,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:01,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:01,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:01,977 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:01,977 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:01,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:01,978 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:01,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:01,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:01,978 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:01,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:01,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:01,979 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:01,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:01,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:01,979 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:01,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:01,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:01,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,982 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:01,982 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:01,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:01,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:01,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:02,100 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:02,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:02,100 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:02,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:02,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:02,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable852 [2022-12-13 02:00:02,101 INFO L420 AbstractCegarLoop]: === Iteration 854 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash -692986335, now seen corresponding path program 1 times [2022-12-13 02:00:02,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:02,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186620684] [2022-12-13 02:00:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:02,154 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 02:00:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186620684] [2022-12-13 02:00:02,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186620684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:02,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:02,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:02,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735247838] [2022-12-13 02:00:02,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:02,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:02,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:02,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:02,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:02,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:02,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:02,200 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:02,200 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:02,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:02,201 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:02,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:02,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:02,201 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:02,202 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:02,202 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:02,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:02,202 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:02,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:02,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,205 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:02,205 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:02,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:02,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:02,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:02,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:02,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:02,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:02,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:02,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable853 [2022-12-13 02:00:02,324 INFO L420 AbstractCegarLoop]: === Iteration 855 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:02,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash -635728033, now seen corresponding path program 1 times [2022-12-13 02:00:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:02,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522544283] [2022-12-13 02:00:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:02,380 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 02:00:02,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:02,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522544283] [2022-12-13 02:00:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522544283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:02,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:02,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:02,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674780278] [2022-12-13 02:00:02,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:02,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:02,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:02,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:02,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:02,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:02,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:02,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:02,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:02,432 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:02,432 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:02,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:02,433 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:02,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:02,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:02,434 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:02,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:02,435 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:02,435 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:02,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:02,435 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:02,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:02,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,439 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:02,439 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:02,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:02,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,440 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:02,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:02,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:00:02,579 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:02,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:02,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable854 [2022-12-13 02:00:02,579 INFO L420 AbstractCegarLoop]: === Iteration 856 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash -578469731, now seen corresponding path program 1 times [2022-12-13 02:00:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:02,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097722582] [2022-12-13 02:00:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:02,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:02,643 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 02:00:02,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:02,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097722582] [2022-12-13 02:00:02,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097722582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:02,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:02,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097104286] [2022-12-13 02:00:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:02,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:02,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:02,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:02,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:02,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:02,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:02,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:02,696 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:02,697 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:02,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:02,697 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:02,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:02,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:02,698 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:02,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:02,699 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:02,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:02,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:02,700 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:02,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:02,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:02,704 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:02,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:02,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:02,832 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:02,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:00:02,832 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:02,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:02,832 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:02,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable855 [2022-12-13 02:00:02,832 INFO L420 AbstractCegarLoop]: === Iteration 857 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -521211429, now seen corresponding path program 1 times [2022-12-13 02:00:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:02,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745327992] [2022-12-13 02:00:02,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:02,884 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 02:00:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745327992] [2022-12-13 02:00:02,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745327992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:02,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:02,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969466901] [2022-12-13 02:00:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:02,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:02,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:02,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:02,885 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:02,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:02,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:02,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:02,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:02,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:02,929 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:02,930 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:02,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:02,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:02,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:02,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:02,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:02,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:02,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:02,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:02,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:02,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:02,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:02,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:02,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,934 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:02,934 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:02,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:02,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:02,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:03,066 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:03,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:03,067 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:03,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:03,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:03,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable856 [2022-12-13 02:00:03,067 INFO L420 AbstractCegarLoop]: === Iteration 858 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:03,067 INFO L85 PathProgramCache]: Analyzing trace with hash -463953127, now seen corresponding path program 1 times [2022-12-13 02:00:03,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:03,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503937088] [2022-12-13 02:00:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:03,119 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 02:00:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:03,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503937088] [2022-12-13 02:00:03,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503937088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:03,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:03,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:03,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920312146] [2022-12-13 02:00:03,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:03,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:03,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:03,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:03,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:03,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:03,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:03,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:03,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:03,189 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:03,190 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:03,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:03,190 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:03,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:03,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:03,191 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:03,191 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:03,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:03,191 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,192 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:03,192 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:03,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:03,192 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:03,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:03,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,195 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:03,195 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:03,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:03,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:03,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:03,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:03,313 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:03,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:03,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:03,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable857 [2022-12-13 02:00:03,313 INFO L420 AbstractCegarLoop]: === Iteration 859 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -406694825, now seen corresponding path program 1 times [2022-12-13 02:00:03,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:03,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093500394] [2022-12-13 02:00:03,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:03,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:03,365 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 02:00:03,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:03,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093500394] [2022-12-13 02:00:03,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093500394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:03,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:03,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:03,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139478147] [2022-12-13 02:00:03,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:03,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:03,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:03,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:03,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:03,366 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:03,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:03,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:03,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:03,418 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:03,419 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:03,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:03,419 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:03,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:03,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:03,420 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:03,421 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:03,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:03,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:03,421 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:03,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:03,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,424 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:03,424 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:03,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:03,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:03,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:03,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:03,542 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:03,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:03,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:03,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable858 [2022-12-13 02:00:03,542 INFO L420 AbstractCegarLoop]: === Iteration 860 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -349436523, now seen corresponding path program 1 times [2022-12-13 02:00:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:03,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623962207] [2022-12-13 02:00:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:03,601 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 02:00:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:03,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623962207] [2022-12-13 02:00:03,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623962207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:03,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:03,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078032594] [2022-12-13 02:00:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:03,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:03,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:03,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:03,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:03,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:03,653 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:03,653 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:03,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:03,654 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:03,654 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:03,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:03,654 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:03,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:03,655 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:03,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:03,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:03,655 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:03,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:03,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,658 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:03,658 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:03,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:03,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:03,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:03,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:03,774 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:03,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:03,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:03,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable859 [2022-12-13 02:00:03,774 INFO L420 AbstractCegarLoop]: === Iteration 861 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:03,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -292178221, now seen corresponding path program 1 times [2022-12-13 02:00:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:03,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677215116] [2022-12-13 02:00:03,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:03,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 02:00:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:03,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677215116] [2022-12-13 02:00:03,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677215116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:03,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:03,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:03,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840839357] [2022-12-13 02:00:03,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:03,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:03,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:03,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:03,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:03,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:03,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:03,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:03,877 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:03,877 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:03,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:03,878 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:03,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:03,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:03,878 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:03,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:03,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:03,879 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:03,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:03,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:03,879 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:03,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:03,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:03,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,882 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:03,882 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:03,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:03,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:03,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:03,998 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:03,999 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:03,999 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:03,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:03,999 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:03,999 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:03,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable860 [2022-12-13 02:00:03,999 INFO L420 AbstractCegarLoop]: === Iteration 862 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash -234919919, now seen corresponding path program 1 times [2022-12-13 02:00:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:04,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816371729] [2022-12-13 02:00:04,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:04,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:04,051 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 02:00:04,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:04,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816371729] [2022-12-13 02:00:04,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816371729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:04,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:04,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:04,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989801336] [2022-12-13 02:00:04,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:04,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:04,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:04,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:04,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:04,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:04,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:04,097 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:04,097 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:04,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:04,098 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:04,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:04,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:04,098 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:04,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:04,099 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:04,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:04,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:04,099 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:04,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:04,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,102 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:04,102 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:04,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:04,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:04,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:04,232 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:00:04,232 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:04,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:04,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:04,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable861 [2022-12-13 02:00:04,232 INFO L420 AbstractCegarLoop]: === Iteration 863 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:04,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:04,232 INFO L85 PathProgramCache]: Analyzing trace with hash -177661617, now seen corresponding path program 1 times [2022-12-13 02:00:04,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:04,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507733348] [2022-12-13 02:00:04,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:04,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:04,284 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 02:00:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:04,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507733348] [2022-12-13 02:00:04,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507733348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:04,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:04,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186100436] [2022-12-13 02:00:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:04,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:04,285 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:04,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:04,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:04,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:04,329 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:04,329 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:04,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:04,330 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:04,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:04,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:04,330 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:04,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:04,331 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:04,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:04,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:04,332 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,332 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:04,332 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:04,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,334 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:04,334 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:04,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:04,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:04,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:04,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:04,453 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:04,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:04,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:04,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable862 [2022-12-13 02:00:04,454 INFO L420 AbstractCegarLoop]: === Iteration 864 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -120403315, now seen corresponding path program 1 times [2022-12-13 02:00:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:04,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82060910] [2022-12-13 02:00:04,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:04,504 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 02:00:04,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:04,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82060910] [2022-12-13 02:00:04,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82060910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:04,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:04,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325890506] [2022-12-13 02:00:04,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:04,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:04,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:04,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:04,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:04,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:04,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:04,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:04,559 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:04,559 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:04,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:04,559 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:04,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:04,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:04,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:04,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:04,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:04,561 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:04,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:04,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:04,561 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:04,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:04,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:04,564 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:04,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:04,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:04,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:04,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:04,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:04,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:04,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:04,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable863 [2022-12-13 02:00:04,682 INFO L420 AbstractCegarLoop]: === Iteration 865 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:04,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:04,682 INFO L85 PathProgramCache]: Analyzing trace with hash -63145013, now seen corresponding path program 1 times [2022-12-13 02:00:04,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:04,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985555975] [2022-12-13 02:00:04,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:04,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:04,741 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 02:00:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:04,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985555975] [2022-12-13 02:00:04,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985555975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:04,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:04,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23347954] [2022-12-13 02:00:04,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:04,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:04,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:04,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:04,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:04,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:04,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:04,795 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:04,795 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:04,795 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:04,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:04,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:04,796 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:04,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:04,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:04,797 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:04,797 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:04,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:04,797 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:04,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:04,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:04,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,800 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:04,800 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:04,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:04,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:04,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:04,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:04,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:04,917 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:04,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:04,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:04,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable864 [2022-12-13 02:00:04,917 INFO L420 AbstractCegarLoop]: === Iteration 866 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:04,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:04,918 INFO L85 PathProgramCache]: Analyzing trace with hash -5886711, now seen corresponding path program 1 times [2022-12-13 02:00:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:04,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846718676] [2022-12-13 02:00:04,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:04,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:04,970 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 02:00:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846718676] [2022-12-13 02:00:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846718676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:04,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:04,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525572265] [2022-12-13 02:00:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:04,971 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:04,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:04,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:04,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:04,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:05,022 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:05,022 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:05,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:05,022 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:05,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:05,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:05,023 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:05,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:05,024 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:05,024 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:05,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:05,024 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:05,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:05,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,027 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:05,027 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:05,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:05,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:05,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:05,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:05,147 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:05,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:05,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:05,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable865 [2022-12-13 02:00:05,147 INFO L420 AbstractCegarLoop]: === Iteration 867 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:05,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:05,147 INFO L85 PathProgramCache]: Analyzing trace with hash 51371591, now seen corresponding path program 1 times [2022-12-13 02:00:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:05,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227847622] [2022-12-13 02:00:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:05,208 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 02:00:05,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:05,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227847622] [2022-12-13 02:00:05,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227847622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:05,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:05,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:05,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871466138] [2022-12-13 02:00:05,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:05,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:05,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:05,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:05,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:05,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:05,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:05,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:05,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:05,263 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:05,263 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:05,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:05,263 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:05,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:05,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:05,264 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:05,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:05,265 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:05,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:05,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:05,265 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:05,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:05,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,268 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:05,268 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:05,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:05,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:05,401 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:05,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:05,402 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:05,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,402 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:05,402 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable866 [2022-12-13 02:00:05,402 INFO L420 AbstractCegarLoop]: === Iteration 868 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:05,402 INFO L85 PathProgramCache]: Analyzing trace with hash 108629893, now seen corresponding path program 1 times [2022-12-13 02:00:05,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:05,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021724123] [2022-12-13 02:00:05,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:05,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:05,468 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 02:00:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:05,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021724123] [2022-12-13 02:00:05,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021724123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:05,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:05,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:05,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060268511] [2022-12-13 02:00:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:05,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:05,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:05,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:05,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:05,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:05,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:05,525 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:05,525 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:05,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:05,526 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:05,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:05,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:05,527 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:05,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:05,528 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:05,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:05,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:05,528 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:05,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:05,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,532 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:05,532 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:05,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:05,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:05,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:05,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:00:05,668 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:05,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:05,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:05,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable867 [2022-12-13 02:00:05,668 INFO L420 AbstractCegarLoop]: === Iteration 869 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 165888195, now seen corresponding path program 1 times [2022-12-13 02:00:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:05,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904228821] [2022-12-13 02:00:05,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:05,745 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 02:00:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904228821] [2022-12-13 02:00:05,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904228821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:05,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135063781] [2022-12-13 02:00:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:05,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:05,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:05,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:05,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:05,801 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:05,801 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:05,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:05,802 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:05,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:05,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:05,802 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:05,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:05,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:05,803 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:05,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:05,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:05,803 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:05,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:05,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:05,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,806 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:05,806 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:05,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:05,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:05,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:05,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:05,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:05,932 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:05,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:05,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:05,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable868 [2022-12-13 02:00:05,932 INFO L420 AbstractCegarLoop]: === Iteration 870 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash 223146497, now seen corresponding path program 1 times [2022-12-13 02:00:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:05,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926566672] [2022-12-13 02:00:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:05,990 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 02:00:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:05,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926566672] [2022-12-13 02:00:05,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926566672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:05,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:05,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52675912] [2022-12-13 02:00:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:05,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:05,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:05,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:05,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:05,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:05,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:06,051 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:06,051 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:06,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:06,052 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:06,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:06,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:06,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:06,052 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:06,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:06,053 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:06,053 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:06,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:06,054 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:06,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:06,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,057 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:06,057 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:06,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:06,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:06,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:06,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:06,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:06,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:06,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:06,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable869 [2022-12-13 02:00:06,183 INFO L420 AbstractCegarLoop]: === Iteration 871 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash 280404799, now seen corresponding path program 1 times [2022-12-13 02:00:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069241436] [2022-12-13 02:00:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:06,235 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 02:00:06,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:06,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069241436] [2022-12-13 02:00:06,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069241436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:06,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:06,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326958118] [2022-12-13 02:00:06,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:06,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:06,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:06,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:06,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:06,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:06,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:06,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:06,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:06,287 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:06,287 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:06,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:06,287 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:06,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:06,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:06,288 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:06,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:06,289 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:06,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:06,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:06,289 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:06,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:06,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,292 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:06,292 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:06,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:06,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:06,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:06,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:06,411 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:06,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:06,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:06,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable870 [2022-12-13 02:00:06,411 INFO L420 AbstractCegarLoop]: === Iteration 872 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash 337663101, now seen corresponding path program 1 times [2022-12-13 02:00:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533186325] [2022-12-13 02:00:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:06,465 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 02:00:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:06,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533186325] [2022-12-13 02:00:06,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533186325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:06,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:06,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:06,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585152583] [2022-12-13 02:00:06,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:06,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:06,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:06,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:06,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:06,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:06,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:06,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:06,529 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:06,529 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:06,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:06,529 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:06,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:06,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:06,530 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:06,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:06,531 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,531 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:06,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:06,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:06,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:06,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:06,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,534 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:06,534 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:06,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:06,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:06,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:06,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:06,653 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:06,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:06,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:06,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable871 [2022-12-13 02:00:06,653 INFO L420 AbstractCegarLoop]: === Iteration 873 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:06,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:06,653 INFO L85 PathProgramCache]: Analyzing trace with hash 394921403, now seen corresponding path program 1 times [2022-12-13 02:00:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:06,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969974951] [2022-12-13 02:00:06,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:06,708 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 02:00:06,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:06,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969974951] [2022-12-13 02:00:06,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969974951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:06,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:06,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:06,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092846050] [2022-12-13 02:00:06,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:06,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:06,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:06,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:06,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:06,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:06,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:06,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:06,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:06,762 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:06,762 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:06,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:06,762 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:06,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:06,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:06,763 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:06,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:06,764 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:06,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:06,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:06,764 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,764 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:06,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:06,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,767 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:06,767 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:06,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:06,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:06,885 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:06,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:06,886 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:06,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:06,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:06,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable872 [2022-12-13 02:00:06,886 INFO L420 AbstractCegarLoop]: === Iteration 874 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:06,886 INFO L85 PathProgramCache]: Analyzing trace with hash 452179705, now seen corresponding path program 1 times [2022-12-13 02:00:06,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:06,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923394121] [2022-12-13 02:00:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:06,938 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 02:00:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:06,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923394121] [2022-12-13 02:00:06,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923394121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:06,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:06,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:06,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252791602] [2022-12-13 02:00:06,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:06,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:06,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:06,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:06,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:06,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:06,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:06,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:06,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:06,990 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:06,991 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:06,991 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:06,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:06,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:06,992 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:06,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:06,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:06,993 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:06,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:06,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:06,993 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:06,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:06,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:06,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,996 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:06,996 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:06,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:06,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:07,114 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:07,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:07,115 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:07,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:07,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:07,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable873 [2022-12-13 02:00:07,115 INFO L420 AbstractCegarLoop]: === Iteration 875 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:07,115 INFO L85 PathProgramCache]: Analyzing trace with hash 509438007, now seen corresponding path program 1 times [2022-12-13 02:00:07,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:07,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699587633] [2022-12-13 02:00:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:07,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:07,171 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 02:00:07,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699587633] [2022-12-13 02:00:07,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699587633] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:07,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:07,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584107941] [2022-12-13 02:00:07,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:07,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:07,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:07,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:07,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:07,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:07,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:07,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:07,225 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:07,225 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:07,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:07,226 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:07,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:07,226 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:07,226 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:07,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:07,228 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:07,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:07,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:07,228 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:07,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:07,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,232 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:07,232 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:07,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:07,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:07,354 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:07,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:00:07,355 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:07,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:07,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:07,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable874 [2022-12-13 02:00:07,355 INFO L420 AbstractCegarLoop]: === Iteration 876 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash 566696309, now seen corresponding path program 1 times [2022-12-13 02:00:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:07,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533461007] [2022-12-13 02:00:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:07,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 02:00:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:07,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533461007] [2022-12-13 02:00:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533461007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:07,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:07,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699198034] [2022-12-13 02:00:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:07,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:07,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:07,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:07,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:07,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:07,472 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:07,472 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:07,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:07,473 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:07,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:07,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:07,473 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:07,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:07,474 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:07,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:07,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:07,474 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:07,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:07,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,477 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:07,477 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:07,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:07,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:07,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:07,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:07,596 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:07,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:07,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:07,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable875 [2022-12-13 02:00:07,597 INFO L420 AbstractCegarLoop]: === Iteration 877 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 623954611, now seen corresponding path program 1 times [2022-12-13 02:00:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:07,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480330316] [2022-12-13 02:00:07,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:07,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:07,647 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 02:00:07,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:07,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480330316] [2022-12-13 02:00:07,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480330316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:07,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:07,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929429684] [2022-12-13 02:00:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:07,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:07,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:07,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:07,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:07,699 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:07,700 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:07,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:07,700 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:07,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:07,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:07,701 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:07,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:07,701 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:07,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:07,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:07,702 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,702 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:07,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:07,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,705 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:07,705 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:07,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:07,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:07,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:07,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:07,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:07,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:07,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:07,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable876 [2022-12-13 02:00:07,821 INFO L420 AbstractCegarLoop]: === Iteration 878 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 681212913, now seen corresponding path program 1 times [2022-12-13 02:00:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:07,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744052603] [2022-12-13 02:00:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:07,870 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 02:00:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:07,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744052603] [2022-12-13 02:00:07,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744052603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:07,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:07,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:07,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331430137] [2022-12-13 02:00:07,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:07,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:07,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:07,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:07,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:07,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:07,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:07,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:07,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:07,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:07,924 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:07,924 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:07,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:07,924 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:07,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:07,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:07,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:07,925 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:07,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:07,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:07,926 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:07,926 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:07,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:07,926 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:07,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:07,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:07,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,929 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:07,929 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:07,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:07,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:07,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:08,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:08,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:08,055 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:08,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:08,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:08,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable877 [2022-12-13 02:00:08,056 INFO L420 AbstractCegarLoop]: === Iteration 879 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 738471215, now seen corresponding path program 1 times [2022-12-13 02:00:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:08,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57296703] [2022-12-13 02:00:08,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:08,118 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 02:00:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:08,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57296703] [2022-12-13 02:00:08,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57296703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:08,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:08,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248170374] [2022-12-13 02:00:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:08,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:08,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:08,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:08,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:08,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:08,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:08,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:08,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:08,166 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:08,167 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:08,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:08,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:08,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:08,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:08,168 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:08,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:08,169 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:08,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:08,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:08,169 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:08,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:08,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,172 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:08,172 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:08,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:08,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:08,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:08,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:08,290 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:08,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:08,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:08,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable878 [2022-12-13 02:00:08,291 INFO L420 AbstractCegarLoop]: === Iteration 880 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:08,291 INFO L85 PathProgramCache]: Analyzing trace with hash 795729517, now seen corresponding path program 1 times [2022-12-13 02:00:08,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:08,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065055042] [2022-12-13 02:00:08,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:08,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:08,343 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 02:00:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:08,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065055042] [2022-12-13 02:00:08,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065055042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:08,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:08,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:08,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760959229] [2022-12-13 02:00:08,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:08,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:08,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:08,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:08,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:08,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:08,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:08,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:08,395 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:08,395 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:08,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:08,396 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:08,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:08,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:08,396 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:08,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:08,397 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:08,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:08,398 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:08,398 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,398 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:08,398 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:08,398 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,400 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:08,401 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:08,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:08,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:08,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:08,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:00:08,531 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:08,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:08,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:08,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable879 [2022-12-13 02:00:08,531 INFO L420 AbstractCegarLoop]: === Iteration 881 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:08,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:08,531 INFO L85 PathProgramCache]: Analyzing trace with hash 852987819, now seen corresponding path program 1 times [2022-12-13 02:00:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:08,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646345131] [2022-12-13 02:00:08,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:08,591 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 02:00:08,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:08,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646345131] [2022-12-13 02:00:08,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646345131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:08,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:08,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:08,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681293964] [2022-12-13 02:00:08,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:08,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:08,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:08,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:08,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:08,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:08,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:08,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:08,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:08,644 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:08,645 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:08,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:08,645 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:08,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:08,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:08,646 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:08,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:08,647 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,647 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:08,648 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:08,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:08,648 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:08,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:08,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,651 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:08,651 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:08,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:08,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:08,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:08,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:08,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:08,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:08,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:08,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable880 [2022-12-13 02:00:08,786 INFO L420 AbstractCegarLoop]: === Iteration 882 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:08,786 INFO L85 PathProgramCache]: Analyzing trace with hash 910246121, now seen corresponding path program 1 times [2022-12-13 02:00:08,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:08,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170666165] [2022-12-13 02:00:08,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:08,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:08,858 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 02:00:08,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:08,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170666165] [2022-12-13 02:00:08,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170666165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:08,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:08,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:08,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029930476] [2022-12-13 02:00:08,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:08,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:08,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:08,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:08,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:08,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:08,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:08,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:08,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:08,934 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:08,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:08,935 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:08,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:08,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:08,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:08,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:08,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:08,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:08,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:08,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:08,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:08,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:08,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:08,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:08,939 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:08,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:08,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:08,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:09,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:09,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:09,055 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:09,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:09,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:09,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable881 [2022-12-13 02:00:09,055 INFO L420 AbstractCegarLoop]: === Iteration 883 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:09,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 967504423, now seen corresponding path program 1 times [2022-12-13 02:00:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:09,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50930681] [2022-12-13 02:00:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:09,105 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 02:00:09,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:09,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50930681] [2022-12-13 02:00:09,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50930681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:09,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:09,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716367461] [2022-12-13 02:00:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:09,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:09,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:09,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:09,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:09,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:09,151 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:09,151 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:09,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:09,152 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:09,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:09,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:09,152 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:09,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:09,153 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:09,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:09,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:09,154 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:09,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:09,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,156 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:09,156 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:09,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:09,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:09,275 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:09,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:09,276 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:09,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:09,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:09,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable882 [2022-12-13 02:00:09,276 INFO L420 AbstractCegarLoop]: === Iteration 884 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1024762725, now seen corresponding path program 1 times [2022-12-13 02:00:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:09,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290678348] [2022-12-13 02:00:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:09,327 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 02:00:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:09,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290678348] [2022-12-13 02:00:09,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290678348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:09,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:09,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:09,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781505685] [2022-12-13 02:00:09,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:09,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:09,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:09,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:09,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:09,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:09,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:09,372 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:09,372 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:09,372 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:09,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:09,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:09,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:09,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:09,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:09,380 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:09,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:09,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:09,381 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:09,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:09,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,383 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:09,383 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:09,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:09,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:09,510 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:09,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:09,510 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:09,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:09,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:09,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable883 [2022-12-13 02:00:09,511 INFO L420 AbstractCegarLoop]: === Iteration 885 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:09,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:09,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1082021027, now seen corresponding path program 1 times [2022-12-13 02:00:09,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:09,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438208921] [2022-12-13 02:00:09,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:09,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:09,562 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 02:00:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:09,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438208921] [2022-12-13 02:00:09,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438208921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:09,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:09,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582150294] [2022-12-13 02:00:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:09,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:09,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:09,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:09,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:09,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:09,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:09,613 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:09,613 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:09,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:09,614 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:09,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:09,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:09,615 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:09,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:09,615 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:09,616 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:09,616 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:09,616 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,616 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:09,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:09,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,618 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:09,619 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:09,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:09,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:09,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:09,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:09,736 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:09,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:09,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:09,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable884 [2022-12-13 02:00:09,736 INFO L420 AbstractCegarLoop]: === Iteration 886 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:09,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:09,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1139279329, now seen corresponding path program 1 times [2022-12-13 02:00:09,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:09,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649564506] [2022-12-13 02:00:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:09,787 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 02:00:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:09,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649564506] [2022-12-13 02:00:09,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649564506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:09,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:09,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026926406] [2022-12-13 02:00:09,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:09,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:09,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:09,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:09,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:09,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:09,832 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:09,832 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:09,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:09,832 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:09,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:09,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:09,833 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:09,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:09,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:09,834 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:09,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:09,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:09,834 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:09,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:09,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:09,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,837 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:09,837 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:09,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:09,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:09,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:09,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:09,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:09,955 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:09,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:09,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:09,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable885 [2022-12-13 02:00:09,955 INFO L420 AbstractCegarLoop]: === Iteration 887 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1196537631, now seen corresponding path program 1 times [2022-12-13 02:00:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:09,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6672071] [2022-12-13 02:00:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:09,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:10,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 02:00:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:10,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6672071] [2022-12-13 02:00:10,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6672071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:10,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:10,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411291645] [2022-12-13 02:00:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:10,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:10,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:10,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:10,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:10,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:10,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:10,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:10,070 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:10,070 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:10,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:10,071 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:10,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:10,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:10,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:10,071 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:10,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:10,072 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:10,072 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:10,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:10,072 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:10,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:10,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,075 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:10,075 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:10,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:10,076 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:10,198 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:10,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:10,198 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:10,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,198 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:10,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:10,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable886 [2022-12-13 02:00:10,199 INFO L420 AbstractCegarLoop]: === Iteration 888 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1253795933, now seen corresponding path program 1 times [2022-12-13 02:00:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:10,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467000221] [2022-12-13 02:00:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:10,254 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 02:00:10,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:10,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467000221] [2022-12-13 02:00:10,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467000221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:10,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:10,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798677482] [2022-12-13 02:00:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:10,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:10,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:10,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:10,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:10,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:10,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:10,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:10,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:10,309 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:10,309 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:10,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:10,310 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:10,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:10,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:10,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:10,310 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:10,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:10,311 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,311 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:10,311 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:10,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:10,311 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:10,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:10,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,314 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:10,314 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:10,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:10,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:10,435 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:10,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:10,436 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:10,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:10,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:10,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable887 [2022-12-13 02:00:10,436 INFO L420 AbstractCegarLoop]: === Iteration 889 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1311054235, now seen corresponding path program 1 times [2022-12-13 02:00:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167692438] [2022-12-13 02:00:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:10,487 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 02:00:10,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:10,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167692438] [2022-12-13 02:00:10,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167692438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:10,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:10,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663383994] [2022-12-13 02:00:10,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:10,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:10,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:10,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:10,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:10,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:10,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:10,538 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:10,538 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:10,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:10,539 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:10,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:10,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:10,539 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:10,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:10,540 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:10,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:10,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:10,540 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:10,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:10,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,543 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:10,543 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:10,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:10,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:10,661 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:10,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:10,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:10,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:10,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:10,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable888 [2022-12-13 02:00:10,662 INFO L420 AbstractCegarLoop]: === Iteration 890 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1368312537, now seen corresponding path program 1 times [2022-12-13 02:00:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:10,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651241612] [2022-12-13 02:00:10,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:10,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:10,714 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 02:00:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651241612] [2022-12-13 02:00:10,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651241612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:10,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:10,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773219010] [2022-12-13 02:00:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:10,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:10,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:10,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:10,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:10,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:10,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:10,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:10,757 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:10,758 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:10,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:10,758 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:10,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:10,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:10,758 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:10,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:10,759 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:10,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:10,759 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:10,759 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:10,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:10,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,762 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:10,762 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:10,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:10,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:10,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:10,880 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:10,880 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:10,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:10,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:10,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable889 [2022-12-13 02:00:10,881 INFO L420 AbstractCegarLoop]: === Iteration 891 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1425570839, now seen corresponding path program 1 times [2022-12-13 02:00:10,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436261921] [2022-12-13 02:00:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:10,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:10,934 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 02:00:10,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:10,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436261921] [2022-12-13 02:00:10,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436261921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:10,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:10,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:10,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295657988] [2022-12-13 02:00:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:10,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:10,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:10,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:10,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:10,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:10,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:10,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:10,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:10,978 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:10,978 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:10,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:10,979 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:10,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:10,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:10,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:10,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:10,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:10,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:10,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:10,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:10,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:10,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:10,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:10,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:10,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,983 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:10,983 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:10,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:10,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:10,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:11,101 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:11,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:11,101 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:11,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:11,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:11,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable890 [2022-12-13 02:00:11,102 INFO L420 AbstractCegarLoop]: === Iteration 892 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:11,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:11,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829141, now seen corresponding path program 1 times [2022-12-13 02:00:11,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:11,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394031842] [2022-12-13 02:00:11,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:11,155 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 02:00:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:11,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394031842] [2022-12-13 02:00:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394031842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:11,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:11,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633560635] [2022-12-13 02:00:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:11,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:11,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:11,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:11,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:11,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:11,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:11,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:11,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:11,219 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:11,220 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:11,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:11,220 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:11,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:11,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:11,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:11,221 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:11,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:11,222 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:11,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:11,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:11,222 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:11,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:11,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,225 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:11,225 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:11,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:11,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:11,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:11,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:11,345 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:11,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:11,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:11,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891 [2022-12-13 02:00:11,345 INFO L420 AbstractCegarLoop]: === Iteration 893 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:11,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1540087443, now seen corresponding path program 1 times [2022-12-13 02:00:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:11,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368904781] [2022-12-13 02:00:11,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:11,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:11,396 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 02:00:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368904781] [2022-12-13 02:00:11,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368904781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:11,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:11,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092834214] [2022-12-13 02:00:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:11,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:11,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:11,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:11,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:11,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:11,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:11,441 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:11,441 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:11,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:11,442 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:11,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:11,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:11,442 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:11,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:11,444 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,444 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:11,444 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:11,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:11,444 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,444 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:11,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:11,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,448 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:11,448 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:11,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:11,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:11,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:11,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:11,580 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:11,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:11,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:11,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable892 [2022-12-13 02:00:11,580 INFO L420 AbstractCegarLoop]: === Iteration 894 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:11,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1597345745, now seen corresponding path program 1 times [2022-12-13 02:00:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:11,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259718768] [2022-12-13 02:00:11,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:11,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:11,646 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 02:00:11,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:11,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259718768] [2022-12-13 02:00:11,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259718768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:11,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:11,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:11,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533459831] [2022-12-13 02:00:11,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:11,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:11,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:11,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:11,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:11,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:11,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:11,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:11,699 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:11,699 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:11,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:11,699 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:11,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:11,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:11,700 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:11,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:11,701 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:11,701 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:11,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:11,701 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:11,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:11,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,704 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:11,704 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:11,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:11,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:11,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:11,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:11,836 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:11,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:11,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:11,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable893 [2022-12-13 02:00:11,836 INFO L420 AbstractCegarLoop]: === Iteration 895 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1654604047, now seen corresponding path program 1 times [2022-12-13 02:00:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:11,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504922504] [2022-12-13 02:00:11,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:11,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:11,894 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 02:00:11,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:11,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504922504] [2022-12-13 02:00:11,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504922504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:11,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:11,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:11,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116835189] [2022-12-13 02:00:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:11,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:11,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:11,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:11,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:11,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:11,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:11,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:11,957 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:11,957 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:11,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:11,957 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:11,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:11,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:11,958 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:11,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:11,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:11,959 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:11,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:11,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:11,959 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:11,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:11,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:11,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,964 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:11,964 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:11,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:11,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:11,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:12,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:12,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:12,098 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:12,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:12,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:12,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable894 [2022-12-13 02:00:12,098 INFO L420 AbstractCegarLoop]: === Iteration 896 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:12,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1711862349, now seen corresponding path program 1 times [2022-12-13 02:00:12,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:12,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896128654] [2022-12-13 02:00:12,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:12,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:12,170 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 02:00:12,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:12,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896128654] [2022-12-13 02:00:12,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896128654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:12,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:12,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:12,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014577713] [2022-12-13 02:00:12,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:12,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:12,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:12,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:12,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:12,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:12,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:12,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:12,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:12,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:12,238 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:12,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:12,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:12,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:12,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:12,239 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:12,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:12,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:12,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:12,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:12,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,242 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:12,242 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:12,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:12,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:12,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:12,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:12,375 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:12,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:12,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable895 [2022-12-13 02:00:12,375 INFO L420 AbstractCegarLoop]: === Iteration 897 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1769120651, now seen corresponding path program 1 times [2022-12-13 02:00:12,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:12,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342980814] [2022-12-13 02:00:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:12,430 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 02:00:12,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:12,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342980814] [2022-12-13 02:00:12,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342980814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:12,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:12,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:12,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650087414] [2022-12-13 02:00:12,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:12,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:12,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:12,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:12,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:12,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:12,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:12,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:12,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:12,503 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:12,503 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:12,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:12,503 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:12,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:12,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:12,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:12,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:12,504 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:12,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:12,505 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:12,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:12,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:12,505 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:12,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:12,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,508 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:12,508 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:12,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:12,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:12,641 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:12,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:12,642 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:12,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:12,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:12,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable896 [2022-12-13 02:00:12,642 INFO L420 AbstractCegarLoop]: === Iteration 898 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:12,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:12,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1826378953, now seen corresponding path program 1 times [2022-12-13 02:00:12,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:12,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276588049] [2022-12-13 02:00:12,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:12,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:12,699 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 02:00:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:12,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276588049] [2022-12-13 02:00:12,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276588049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:12,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:12,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:12,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344409103] [2022-12-13 02:00:12,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:12,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:12,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:12,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:12,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:12,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:12,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:12,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:12,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:12,760 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:12,760 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:12,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:12,761 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:12,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:12,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:12,761 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:12,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:12,762 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,762 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:12,762 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:12,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:12,762 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,763 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:12,763 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:12,763 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,765 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:12,765 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:12,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:12,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:12,886 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:12,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:12,887 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:12,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:12,887 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:12,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable897 [2022-12-13 02:00:12,887 INFO L420 AbstractCegarLoop]: === Iteration 899 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1883637255, now seen corresponding path program 1 times [2022-12-13 02:00:12,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:12,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533469011] [2022-12-13 02:00:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:12,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:12,936 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 02:00:12,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:12,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533469011] [2022-12-13 02:00:12,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533469011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:12,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:12,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388006216] [2022-12-13 02:00:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:12,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:12,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:12,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:12,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:12,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:12,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:12,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:12,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:12,988 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:12,988 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:12,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:12,988 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:12,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:12,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:12,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:12,989 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:12,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:12,990 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:12,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:12,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:12,990 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:12,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:12,990 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,993 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:12,993 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:12,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:12,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:12,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:13,130 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:13,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:00:13,131 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:13,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:13,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:13,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable898 [2022-12-13 02:00:13,131 INFO L420 AbstractCegarLoop]: === Iteration 900 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1940895557, now seen corresponding path program 1 times [2022-12-13 02:00:13,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:13,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381011630] [2022-12-13 02:00:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:13,187 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 02:00:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:13,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381011630] [2022-12-13 02:00:13,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381011630] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:13,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:13,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716013145] [2022-12-13 02:00:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:13,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:13,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:13,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:13,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:13,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:13,248 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:13,248 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:13,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:13,249 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:13,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:13,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:13,249 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:13,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:13,250 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,250 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:13,250 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:13,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:13,250 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:13,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:13,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,253 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:13,253 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:13,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:13,254 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,254 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:13,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:13,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:13,384 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:13,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:13,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:13,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable899 [2022-12-13 02:00:13,384 INFO L420 AbstractCegarLoop]: === Iteration 901 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:13,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1998153859, now seen corresponding path program 1 times [2022-12-13 02:00:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:13,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796572144] [2022-12-13 02:00:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:13,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:13,440 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 02:00:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:13,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796572144] [2022-12-13 02:00:13,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796572144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:13,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:13,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981393211] [2022-12-13 02:00:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:13,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:13,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:13,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:13,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:13,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:13,495 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:13,495 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:13,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:13,496 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:13,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:13,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:13,496 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:13,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:13,497 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:13,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:13,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:13,497 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:13,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:13,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:13,500 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:13,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:13,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:13,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:13,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:13,626 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:13,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:13,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:13,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable900 [2022-12-13 02:00:13,627 INFO L420 AbstractCegarLoop]: === Iteration 902 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:13,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:13,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2055412161, now seen corresponding path program 1 times [2022-12-13 02:00:13,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:13,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760548695] [2022-12-13 02:00:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:13,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:13,696 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 02:00:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:13,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760548695] [2022-12-13 02:00:13,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760548695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:13,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:13,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:13,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295613575] [2022-12-13 02:00:13,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:13,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:13,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:13,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:13,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:13,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:13,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:13,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:13,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:13,740 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:13,740 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:13,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:13,741 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:13,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:13,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:13,741 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:13,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:13,742 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:13,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:13,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:13,742 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:13,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:13,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,745 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:13,745 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:13,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:13,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:13,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:13,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:13,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:13,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:13,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:13,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable901 [2022-12-13 02:00:13,865 INFO L420 AbstractCegarLoop]: === Iteration 903 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2112670463, now seen corresponding path program 1 times [2022-12-13 02:00:13,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822666684] [2022-12-13 02:00:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:13,913 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 02:00:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:13,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822666684] [2022-12-13 02:00:13,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822666684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:13,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:13,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424070127] [2022-12-13 02:00:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:13,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:13,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:13,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:13,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:13,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:13,965 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:13,965 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:13,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:13,965 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:13,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:13,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:13,966 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:13,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:13,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:13,966 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,967 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:13,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:13,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:13,967 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:13,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:13,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:13,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,969 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:13,970 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:13,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:13,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:14,083 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:14,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:00:14,083 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:14,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:14,084 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:14,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable902 [2022-12-13 02:00:14,084 INFO L420 AbstractCegarLoop]: === Iteration 904 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:14,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2125038531, now seen corresponding path program 1 times [2022-12-13 02:00:14,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:14,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406669525] [2022-12-13 02:00:14,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:14,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:14,133 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 02:00:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:14,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406669525] [2022-12-13 02:00:14,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406669525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:14,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:14,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416995752] [2022-12-13 02:00:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:14,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:14,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:14,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:14,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:14,177 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:14,177 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:14,178 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:14,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:14,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:14,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:14,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:14,179 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:14,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:14,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:14,179 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:14,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:14,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:14,182 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:14,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:14,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:14,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:14,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:14,299 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:14,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:14,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:14,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable903 [2022-12-13 02:00:14,300 INFO L420 AbstractCegarLoop]: === Iteration 905 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2067780229, now seen corresponding path program 1 times [2022-12-13 02:00:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:14,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780431081] [2022-12-13 02:00:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:14,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 02:00:14,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780431081] [2022-12-13 02:00:14,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780431081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:14,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:14,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:14,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241846315] [2022-12-13 02:00:14,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:14,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:14,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:14,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:14,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:14,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:14,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:14,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:14,426 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:14,426 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:14,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:14,427 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:14,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:14,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:14,427 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:14,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:14,428 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:14,428 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:14,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:14,428 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:14,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:14,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,431 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:14,431 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:14,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:14,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:14,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:14,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:14,565 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:14,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:14,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:14,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable904 [2022-12-13 02:00:14,566 INFO L420 AbstractCegarLoop]: === Iteration 906 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:14,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:14,566 INFO L85 PathProgramCache]: Analyzing trace with hash -2010521927, now seen corresponding path program 1 times [2022-12-13 02:00:14,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:14,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358848177] [2022-12-13 02:00:14,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:14,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:14,624 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 02:00:14,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:14,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358848177] [2022-12-13 02:00:14,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358848177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:14,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:14,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:14,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206355729] [2022-12-13 02:00:14,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:14,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:14,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:14,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:14,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:14,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:14,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:14,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:14,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:14,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:14,680 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:14,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:14,681 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:14,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:14,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:14,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:14,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:14,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:14,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:14,683 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:14,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:14,683 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:14,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:14,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,686 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:14,686 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:14,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:14,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:14,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:14,820 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:14,820 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:14,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:14,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:14,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable905 [2022-12-13 02:00:14,821 INFO L420 AbstractCegarLoop]: === Iteration 907 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:14,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:14,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1953263625, now seen corresponding path program 1 times [2022-12-13 02:00:14,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:14,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009634355] [2022-12-13 02:00:14,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:14,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:14,898 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 02:00:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009634355] [2022-12-13 02:00:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009634355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:14,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:14,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553500363] [2022-12-13 02:00:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:14,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:14,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:14,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:14,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:14,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:14,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:14,965 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:14,966 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:14,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:14,967 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:14,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:14,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:14,967 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:14,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:14,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:14,969 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:14,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:14,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:14,969 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,969 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:14,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:14,969 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:14,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,974 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:14,974 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:14,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:14,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:14,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:15,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:15,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:15,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:15,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:15,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:15,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable906 [2022-12-13 02:00:15,108 INFO L420 AbstractCegarLoop]: === Iteration 908 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1896005323, now seen corresponding path program 1 times [2022-12-13 02:00:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:15,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146469109] [2022-12-13 02:00:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:15,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 02:00:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:15,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146469109] [2022-12-13 02:00:15,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146469109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:15,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:15,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:15,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235331381] [2022-12-13 02:00:15,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:15,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:15,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:15,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:15,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:15,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:15,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:15,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:15,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:15,218 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:15,218 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:15,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:15,219 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:15,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:15,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:15,219 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:15,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:15,220 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:15,221 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:15,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:15,221 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:15,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:15,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,224 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:15,224 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:15,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:15,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:15,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:15,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:15,347 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:15,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:15,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:15,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable907 [2022-12-13 02:00:15,347 INFO L420 AbstractCegarLoop]: === Iteration 909 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:15,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:15,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1838747021, now seen corresponding path program 1 times [2022-12-13 02:00:15,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:15,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590868405] [2022-12-13 02:00:15,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:15,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:15,401 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 02:00:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590868405] [2022-12-13 02:00:15,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590868405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:15,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:15,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660682591] [2022-12-13 02:00:15,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:15,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:15,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:15,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:15,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:15,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:15,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:15,451 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:15,451 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:15,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:15,452 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:15,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:15,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:15,452 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:15,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:15,453 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:15,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:15,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:15,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:15,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:15,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:15,456 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:15,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:15,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:15,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:15,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:15,573 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:15,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:15,573 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:15,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable908 [2022-12-13 02:00:15,573 INFO L420 AbstractCegarLoop]: === Iteration 910 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:15,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:15,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1781488719, now seen corresponding path program 1 times [2022-12-13 02:00:15,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:15,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990581405] [2022-12-13 02:00:15,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:15,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:15,624 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 02:00:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990581405] [2022-12-13 02:00:15,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990581405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:15,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:15,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:15,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184916207] [2022-12-13 02:00:15,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:15,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:15,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:15,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:15,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:15,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:15,675 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:15,675 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:15,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:15,675 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:15,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:15,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:15,676 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:15,677 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:15,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:15,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:15,677 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:15,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:15,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,680 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:15,680 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:15,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:15,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:15,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:15,795 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:15,795 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:15,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:15,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable909 [2022-12-13 02:00:15,796 INFO L420 AbstractCegarLoop]: === Iteration 911 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:15,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1724230417, now seen corresponding path program 1 times [2022-12-13 02:00:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:15,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007878377] [2022-12-13 02:00:15,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:15,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:15,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:15,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 02:00:15,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:15,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007878377] [2022-12-13 02:00:15,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007878377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:15,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:15,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:15,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187648592] [2022-12-13 02:00:15,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:15,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:15,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:15,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:15,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:15,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:15,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:15,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:15,890 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:15,890 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:15,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:15,891 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:15,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:15,891 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:15,891 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:15,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:15,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:15,892 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,892 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:15,892 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:15,892 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:15,892 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,892 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:15,892 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:15,892 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:15,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,895 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:15,895 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:15,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:15,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:15,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:16,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:16,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:16,012 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:16,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:16,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:16,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable910 [2022-12-13 02:00:16,012 INFO L420 AbstractCegarLoop]: === Iteration 912 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1666972115, now seen corresponding path program 1 times [2022-12-13 02:00:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:16,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492695776] [2022-12-13 02:00:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:16,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:16,073 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 02:00:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:16,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492695776] [2022-12-13 02:00:16,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492695776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:16,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:16,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378943637] [2022-12-13 02:00:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:16,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:16,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:16,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:16,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:16,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:16,118 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:16,119 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:16,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:16,119 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:16,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:16,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:16,120 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:16,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:16,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:16,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:16,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:16,121 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:16,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:16,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,124 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:16,124 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:16,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:16,238 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:16,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:16,239 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:16,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:16,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:16,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable911 [2022-12-13 02:00:16,239 INFO L420 AbstractCegarLoop]: === Iteration 913 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:16,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1609713813, now seen corresponding path program 1 times [2022-12-13 02:00:16,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:16,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042129578] [2022-12-13 02:00:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:16,307 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 02:00:16,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:16,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042129578] [2022-12-13 02:00:16,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042129578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:16,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:16,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882151426] [2022-12-13 02:00:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:16,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:16,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:16,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:16,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:16,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:16,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:16,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:16,367 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:16,368 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:16,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:16,368 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:16,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:16,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:16,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:16,369 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:16,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:16,370 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:16,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:16,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:16,370 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,370 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:16,370 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:16,370 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,373 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:16,373 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:16,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:16,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:16,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:16,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:16,496 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:16,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:16,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:16,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable912 [2022-12-13 02:00:16,497 INFO L420 AbstractCegarLoop]: === Iteration 914 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1552455511, now seen corresponding path program 1 times [2022-12-13 02:00:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:16,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891715754] [2022-12-13 02:00:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:16,550 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 02:00:16,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:16,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891715754] [2022-12-13 02:00:16,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891715754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:16,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:16,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410394759] [2022-12-13 02:00:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:16,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:16,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:16,551 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:16,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:16,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:16,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:16,601 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:16,601 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:16,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:16,602 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:16,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:16,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:16,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:16,602 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:16,603 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:16,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:16,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:16,603 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,604 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:16,604 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:16,604 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,606 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:16,606 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:16,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:16,607 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,607 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:16,724 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:16,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:16,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:16,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:16,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:16,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable913 [2022-12-13 02:00:16,725 INFO L420 AbstractCegarLoop]: === Iteration 915 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:16,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1495197209, now seen corresponding path program 1 times [2022-12-13 02:00:16,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:16,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520850400] [2022-12-13 02:00:16,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:16,774 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 02:00:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:16,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520850400] [2022-12-13 02:00:16,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520850400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:16,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:16,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397802590] [2022-12-13 02:00:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:16,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:16,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:16,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:16,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:16,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:16,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:16,817 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:16,817 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:16,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:16,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:16,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:16,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:16,819 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:16,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:16,819 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:16,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:16,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:16,820 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:16,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:16,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:16,823 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:16,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:16,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:16,938 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:16,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:16,939 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:16,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:16,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:16,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable914 [2022-12-13 02:00:16,939 INFO L420 AbstractCegarLoop]: === Iteration 916 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1437938907, now seen corresponding path program 1 times [2022-12-13 02:00:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:16,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204173000] [2022-12-13 02:00:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:16,988 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 02:00:16,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:16,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204173000] [2022-12-13 02:00:16,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204173000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:16,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:16,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:16,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157033389] [2022-12-13 02:00:16,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:16,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:16,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:16,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:16,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:16,991 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:16,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:16,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:16,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:16,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:17,034 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:17,034 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:17,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:17,034 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:17,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:17,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:17,035 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:17,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:17,036 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,036 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:17,036 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:17,036 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:17,036 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:17,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:17,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,039 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:17,039 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:17,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:17,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:17,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:17,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:17,159 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:17,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:17,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:17,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable915 [2022-12-13 02:00:17,159 INFO L420 AbstractCegarLoop]: === Iteration 917 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:17,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1380680605, now seen corresponding path program 1 times [2022-12-13 02:00:17,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:17,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584168746] [2022-12-13 02:00:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:17,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:17,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584168746] [2022-12-13 02:00:17,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584168746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:17,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:17,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391207667] [2022-12-13 02:00:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:17,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:17,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:17,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:17,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:17,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:17,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:17,270 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:17,270 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:17,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:17,271 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:17,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:17,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:17,271 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:17,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:17,272 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:17,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:17,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:17,272 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:17,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:17,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,275 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:17,275 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:17,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:17,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:17,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:17,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:17,408 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:17,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:17,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:17,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable916 [2022-12-13 02:00:17,408 INFO L420 AbstractCegarLoop]: === Iteration 918 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:17,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1323422303, now seen corresponding path program 1 times [2022-12-13 02:00:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:17,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304601933] [2022-12-13 02:00:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:17,464 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 02:00:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:17,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304601933] [2022-12-13 02:00:17,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304601933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:17,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:17,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177639091] [2022-12-13 02:00:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:17,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:17,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:17,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:17,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:17,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:17,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:17,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:17,532 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:17,532 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:17,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:17,533 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:17,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:17,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:17,534 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:17,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:17,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:17,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:17,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:17,535 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:17,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:17,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,538 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:17,538 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:17,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:17,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:17,674 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:17,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:17,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:17,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:17,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:17,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable917 [2022-12-13 02:00:17,675 INFO L420 AbstractCegarLoop]: === Iteration 919 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1266164001, now seen corresponding path program 1 times [2022-12-13 02:00:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:17,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693420811] [2022-12-13 02:00:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:17,737 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 02:00:17,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:17,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693420811] [2022-12-13 02:00:17,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693420811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:17,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:17,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329111736] [2022-12-13 02:00:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:17,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:17,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:17,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:17,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:17,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:17,800 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:17,800 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:17,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:17,801 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:17,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:17,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:17,801 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:17,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:17,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:17,803 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:17,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:17,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:17,803 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:17,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:17,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:17,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,807 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:17,807 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:17,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:17,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:17,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:17,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:17,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:17,938 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:17,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:17,938 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:17,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:17,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable918 [2022-12-13 02:00:17,938 INFO L420 AbstractCegarLoop]: === Iteration 920 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1208905699, now seen corresponding path program 1 times [2022-12-13 02:00:17,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:17,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849032077] [2022-12-13 02:00:17,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:18,006 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 02:00:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:18,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849032077] [2022-12-13 02:00:18,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849032077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:18,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:18,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:18,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066510446] [2022-12-13 02:00:18,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:18,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:18,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:18,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:18,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:18,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:18,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:18,060 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:18,060 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:18,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:18,061 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:18,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:18,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:18,061 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:18,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:18,062 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:18,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:18,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:18,062 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:18,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:18,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,065 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:18,065 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:18,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:18,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:18,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:18,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:18,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:18,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:18,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:18,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable919 [2022-12-13 02:00:18,183 INFO L420 AbstractCegarLoop]: === Iteration 921 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:18,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1151647397, now seen corresponding path program 1 times [2022-12-13 02:00:18,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:18,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799937249] [2022-12-13 02:00:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:18,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 02:00:18,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:18,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799937249] [2022-12-13 02:00:18,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799937249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:18,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:18,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544919713] [2022-12-13 02:00:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:18,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:18,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:18,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:18,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:18,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:18,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:18,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:18,291 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:18,292 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:18,292 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:18,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:18,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:18,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:18,293 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:18,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:18,294 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:18,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:18,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:18,294 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:18,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:18,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:18,297 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:18,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:18,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:18,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:18,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:18,414 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:18,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:18,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:18,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable920 [2022-12-13 02:00:18,414 INFO L420 AbstractCegarLoop]: === Iteration 922 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1094389095, now seen corresponding path program 1 times [2022-12-13 02:00:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:18,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210553737] [2022-12-13 02:00:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:18,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:18,466 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 02:00:18,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:18,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210553737] [2022-12-13 02:00:18,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210553737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:18,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128703060] [2022-12-13 02:00:18,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:18,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:18,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:18,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:18,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:18,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:18,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:18,539 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:18,539 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:18,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:18,540 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:18,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:18,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:18,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:18,540 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:18,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:18,541 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:18,541 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:18,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:18,541 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:18,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:18,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,544 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:18,544 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:18,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:18,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:18,679 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:18,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:18,680 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:18,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:18,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:18,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable921 [2022-12-13 02:00:18,680 INFO L420 AbstractCegarLoop]: === Iteration 923 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1037130793, now seen corresponding path program 1 times [2022-12-13 02:00:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:18,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377380768] [2022-12-13 02:00:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:18,736 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 02:00:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377380768] [2022-12-13 02:00:18,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377380768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:18,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:18,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145380450] [2022-12-13 02:00:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:18,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:18,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:18,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:18,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:18,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:18,789 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:18,789 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:18,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:18,790 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:18,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:18,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:18,790 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:18,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:18,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:18,791 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:18,791 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:18,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:18,791 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:18,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:18,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:18,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,794 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:18,794 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:18,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:18,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:18,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:18,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:18,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:00:18,929 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:18,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:18,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:18,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable922 [2022-12-13 02:00:18,930 INFO L420 AbstractCegarLoop]: === Iteration 924 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:18,930 INFO L85 PathProgramCache]: Analyzing trace with hash -979872491, now seen corresponding path program 1 times [2022-12-13 02:00:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:18,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363336839] [2022-12-13 02:00:18,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:18,986 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 02:00:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:18,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363336839] [2022-12-13 02:00:18,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363336839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:18,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:18,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598337904] [2022-12-13 02:00:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:18,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:18,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:18,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:18,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:18,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:18,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:19,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:19,049 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:19,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:19,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:19,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:19,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:19,050 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:19,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:19,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:19,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:19,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:19,052 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:19,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:19,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,055 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:19,055 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:19,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:19,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:19,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:19,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:19,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:19,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:19,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable923 [2022-12-13 02:00:19,192 INFO L420 AbstractCegarLoop]: === Iteration 925 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:19,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:19,192 INFO L85 PathProgramCache]: Analyzing trace with hash -922614189, now seen corresponding path program 1 times [2022-12-13 02:00:19,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:19,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929340750] [2022-12-13 02:00:19,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:19,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:19,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:19,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929340750] [2022-12-13 02:00:19,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929340750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:19,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:19,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099134296] [2022-12-13 02:00:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:19,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:19,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:19,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:19,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:19,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:19,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:19,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:19,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:19,337 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:19,338 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:19,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:19,338 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:19,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:19,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:19,339 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:19,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:19,339 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:19,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:19,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:19,340 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:19,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:19,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,343 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:19,343 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:19,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:19,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:19,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:19,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:19,465 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:19,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:19,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:19,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable924 [2022-12-13 02:00:19,465 INFO L420 AbstractCegarLoop]: === Iteration 926 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:19,465 INFO L85 PathProgramCache]: Analyzing trace with hash -865355887, now seen corresponding path program 1 times [2022-12-13 02:00:19,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:19,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991558655] [2022-12-13 02:00:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:19,522 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 02:00:19,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:19,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991558655] [2022-12-13 02:00:19,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991558655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:19,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:19,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:19,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349579941] [2022-12-13 02:00:19,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:19,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:19,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:19,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:19,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:19,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:19,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:19,578 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:19,578 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:19,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:19,579 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:19,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:19,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:19,580 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:19,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:19,581 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,581 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:19,581 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:19,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:19,581 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:19,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:19,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,584 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:19,584 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:19,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:19,585 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,585 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:19,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:19,709 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:00:19,709 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:19,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,709 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:19,709 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:19,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable925 [2022-12-13 02:00:19,710 INFO L420 AbstractCegarLoop]: === Iteration 927 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -808097585, now seen corresponding path program 1 times [2022-12-13 02:00:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231970968] [2022-12-13 02:00:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:19,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 02:00:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231970968] [2022-12-13 02:00:19,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231970968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:19,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:19,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:19,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79826887] [2022-12-13 02:00:19,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:19,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:19,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:19,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:19,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:19,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:19,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:19,828 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:19,828 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:19,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:19,829 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:19,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:19,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:19,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:19,829 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:19,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:19,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:19,830 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:19,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:19,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:19,831 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:19,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:19,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:19,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,833 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:19,834 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:19,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:19,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:19,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:19,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:19,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:19,954 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:19,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:19,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:19,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable926 [2022-12-13 02:00:19,955 INFO L420 AbstractCegarLoop]: === Iteration 928 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:19,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:19,955 INFO L85 PathProgramCache]: Analyzing trace with hash -750839283, now seen corresponding path program 1 times [2022-12-13 02:00:19,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:19,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90787034] [2022-12-13 02:00:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:19,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:20,008 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 02:00:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:20,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90787034] [2022-12-13 02:00:20,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90787034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:20,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:20,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120723620] [2022-12-13 02:00:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:20,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:20,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:20,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:20,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:20,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:20,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:20,059 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:20,060 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:20,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:20,060 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:20,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:20,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:20,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:20,061 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:20,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:20,062 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:20,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:20,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:20,062 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:20,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:20,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,065 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:20,065 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:20,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:20,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:20,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:20,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:20,180 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:20,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:20,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable927 [2022-12-13 02:00:20,180 INFO L420 AbstractCegarLoop]: === Iteration 929 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:20,180 INFO L85 PathProgramCache]: Analyzing trace with hash -693580981, now seen corresponding path program 1 times [2022-12-13 02:00:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:20,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162901524] [2022-12-13 02:00:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:20,232 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 02:00:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162901524] [2022-12-13 02:00:20,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162901524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:20,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:20,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982579431] [2022-12-13 02:00:20,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:20,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:20,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:20,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:20,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:20,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:20,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:20,282 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:20,282 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:20,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:20,283 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:20,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:20,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:20,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:20,283 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:20,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:20,284 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:20,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:20,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:20,284 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:20,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:20,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,287 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:20,287 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:20,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:20,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:20,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:20,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:20,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:20,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:20,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:20,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable928 [2022-12-13 02:00:20,404 INFO L420 AbstractCegarLoop]: === Iteration 930 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash -636322679, now seen corresponding path program 1 times [2022-12-13 02:00:20,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:20,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13507485] [2022-12-13 02:00:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:20,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:20,461 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 02:00:20,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:20,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13507485] [2022-12-13 02:00:20,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13507485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:20,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:20,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:20,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723684511] [2022-12-13 02:00:20,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:20,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:20,462 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:20,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:20,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:20,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:20,515 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:20,516 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:20,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:20,516 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:20,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:20,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:20,517 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:20,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:20,518 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:20,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:20,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:20,518 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:20,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:20,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:20,521 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:20,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:20,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:20,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:20,654 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:20,654 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:20,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:20,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:20,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable929 [2022-12-13 02:00:20,654 INFO L420 AbstractCegarLoop]: === Iteration 931 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash -579064377, now seen corresponding path program 1 times [2022-12-13 02:00:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911284092] [2022-12-13 02:00:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:20,721 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 02:00:20,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:20,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911284092] [2022-12-13 02:00:20,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911284092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:20,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:20,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:20,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659986968] [2022-12-13 02:00:20,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:20,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:20,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:20,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:20,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:20,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:20,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:20,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:20,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:20,770 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:20,771 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:20,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:20,771 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:20,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:20,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:20,772 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:20,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:20,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:20,773 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:20,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:20,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:20,773 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:20,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:20,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:20,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,776 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:20,776 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:20,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:20,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:20,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:20,897 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:20,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:20,898 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:20,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:20,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:20,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable930 [2022-12-13 02:00:20,898 INFO L420 AbstractCegarLoop]: === Iteration 932 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:20,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash -521806075, now seen corresponding path program 1 times [2022-12-13 02:00:20,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:20,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289808664] [2022-12-13 02:00:20,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:20,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:20,962 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 02:00:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289808664] [2022-12-13 02:00:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289808664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:20,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:20,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501750593] [2022-12-13 02:00:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:20,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:20,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:20,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:20,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:20,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:20,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:20,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:21,011 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:21,012 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:21,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:21,012 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:21,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:21,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:21,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:21,013 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:21,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:21,013 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:21,014 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:21,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:21,014 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:21,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:21,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,017 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:21,017 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:21,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:21,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:21,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:21,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 02:00:21,166 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:21,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:21,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:21,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable931 [2022-12-13 02:00:21,167 INFO L420 AbstractCegarLoop]: === Iteration 933 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:21,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -464547773, now seen corresponding path program 1 times [2022-12-13 02:00:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:21,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589583089] [2022-12-13 02:00:21,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:21,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:21,229 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 02:00:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:21,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589583089] [2022-12-13 02:00:21,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589583089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:21,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:21,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:21,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605147071] [2022-12-13 02:00:21,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:21,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:21,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:21,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:21,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:21,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:21,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:21,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:21,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:21,297 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:21,297 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:21,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:21,298 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:21,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:21,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:21,298 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:21,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:21,299 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:21,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:21,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:21,299 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,299 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:21,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:21,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,302 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:21,302 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:21,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:21,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:21,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:21,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:21,419 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:21,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:21,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:21,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable932 [2022-12-13 02:00:21,419 INFO L420 AbstractCegarLoop]: === Iteration 934 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:21,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:21,419 INFO L85 PathProgramCache]: Analyzing trace with hash -407289471, now seen corresponding path program 1 times [2022-12-13 02:00:21,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:21,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57494645] [2022-12-13 02:00:21,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:21,472 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 02:00:21,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57494645] [2022-12-13 02:00:21,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57494645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:21,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:21,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703553115] [2022-12-13 02:00:21,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:21,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:21,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:21,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:21,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:21,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:21,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:21,516 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:21,516 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:21,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:21,516 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:21,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:21,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:21,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:21,517 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:21,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:21,518 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:21,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:21,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:21,518 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:21,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:21,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:21,521 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:21,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:21,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:21,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:21,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:21,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:21,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:21,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:21,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable933 [2022-12-13 02:00:21,639 INFO L420 AbstractCegarLoop]: === Iteration 935 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash -350031169, now seen corresponding path program 1 times [2022-12-13 02:00:21,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:21,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021168948] [2022-12-13 02:00:21,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:21,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:21,690 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 02:00:21,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:21,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021168948] [2022-12-13 02:00:21,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021168948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:21,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:21,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:21,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715374639] [2022-12-13 02:00:21,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:21,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:21,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:21,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:21,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:21,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:21,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:21,733 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:21,733 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:21,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:21,734 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:21,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:21,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:21,734 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:21,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:21,735 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:21,735 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:21,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:21,736 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:21,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:21,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,738 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:21,738 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:21,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:21,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:21,857 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:21,858 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:21,858 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:21,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:21,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:21,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable934 [2022-12-13 02:00:21,858 INFO L420 AbstractCegarLoop]: === Iteration 936 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -292772867, now seen corresponding path program 1 times [2022-12-13 02:00:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:21,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804177955] [2022-12-13 02:00:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:21,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804177955] [2022-12-13 02:00:21,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804177955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:21,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:21,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:21,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701393612] [2022-12-13 02:00:21,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:21,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:21,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:21,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:21,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:21,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:21,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:21,951 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:21,952 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:21,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:21,952 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:21,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:21,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:21,953 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:21,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:21,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:21,953 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:21,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:21,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:21,954 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:21,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:21,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:21,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,956 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:21,956 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:21,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:21,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:22,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:22,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:22,074 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:22,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:22,074 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:22,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable935 [2022-12-13 02:00:22,074 INFO L420 AbstractCegarLoop]: === Iteration 937 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:22,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash -235514565, now seen corresponding path program 1 times [2022-12-13 02:00:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:22,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66307601] [2022-12-13 02:00:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:22,132 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 02:00:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:22,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66307601] [2022-12-13 02:00:22,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66307601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:22,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:22,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699377913] [2022-12-13 02:00:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:22,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:22,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:22,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:22,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:22,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:22,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:22,176 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:22,176 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:22,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:22,177 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:22,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:22,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:22,177 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:22,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:22,178 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:22,178 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:22,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:22,178 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:22,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:22,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,181 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:22,181 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:22,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:22,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:22,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:22,299 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:22,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:22,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:22,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable936 [2022-12-13 02:00:22,300 INFO L420 AbstractCegarLoop]: === Iteration 938 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -178256263, now seen corresponding path program 1 times [2022-12-13 02:00:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:22,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391255704] [2022-12-13 02:00:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:22,351 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 02:00:22,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:22,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391255704] [2022-12-13 02:00:22,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391255704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:22,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:22,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517321621] [2022-12-13 02:00:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:22,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:22,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:22,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:22,352 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:22,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:22,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:22,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:22,395 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:22,395 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:22,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:22,395 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:22,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:22,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:22,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:22,396 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:22,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:22,397 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:22,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:22,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:22,397 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:22,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:22,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,400 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:22,400 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:22,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:22,400 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,400 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:22,520 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:22,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:22,520 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:22,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:22,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:22,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable937 [2022-12-13 02:00:22,520 INFO L420 AbstractCegarLoop]: === Iteration 939 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash -120997961, now seen corresponding path program 1 times [2022-12-13 02:00:22,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:22,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154248213] [2022-12-13 02:00:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:22,572 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 02:00:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:22,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154248213] [2022-12-13 02:00:22,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154248213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:22,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:22,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:22,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849551416] [2022-12-13 02:00:22,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:22,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:22,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:22,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:22,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:22,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:22,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:22,617 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:22,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:22,618 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:22,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:22,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:22,618 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:22,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:22,619 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:22,619 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:22,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:22,620 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:22,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:22,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,622 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:22,622 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:22,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:22,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:22,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:22,743 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:22,744 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:22,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:22,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:22,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable938 [2022-12-13 02:00:22,744 INFO L420 AbstractCegarLoop]: === Iteration 940 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash -63739659, now seen corresponding path program 1 times [2022-12-13 02:00:22,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:22,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842637050] [2022-12-13 02:00:22,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:22,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:22,811 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 02:00:22,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:22,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842637050] [2022-12-13 02:00:22,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842637050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:22,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:22,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:22,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740527921] [2022-12-13 02:00:22,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:22,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:22,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:22,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:22,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:22,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:22,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:22,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:22,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:22,867 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:22,867 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:22,868 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:22,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:22,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:22,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:22,869 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:22,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:22,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:22,869 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,869 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:22,870 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:22,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:22,870 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:22,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:22,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:22,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,873 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:22,873 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:22,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:22,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:22,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:22,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:22,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:22,990 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:22,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:22,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:22,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:22,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable939 [2022-12-13 02:00:22,990 INFO L420 AbstractCegarLoop]: === Iteration 941 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:22,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash -6481357, now seen corresponding path program 1 times [2022-12-13 02:00:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:22,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776847272] [2022-12-13 02:00:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:23,043 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 02:00:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:23,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776847272] [2022-12-13 02:00:23,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776847272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:23,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:23,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461834303] [2022-12-13 02:00:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:23,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:23,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:23,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:23,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:23,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:23,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:23,094 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:23,095 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:23,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:23,095 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:23,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:23,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:23,096 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:23,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:23,096 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:23,097 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:23,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:23,097 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,097 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:23,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:23,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,100 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:23,100 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:23,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:23,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:23,217 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:23,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:23,218 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:23,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:23,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:23,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable940 [2022-12-13 02:00:23,218 INFO L420 AbstractCegarLoop]: === Iteration 942 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 50776945, now seen corresponding path program 1 times [2022-12-13 02:00:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:23,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139133986] [2022-12-13 02:00:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:23,270 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 02:00:23,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:23,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139133986] [2022-12-13 02:00:23,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139133986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:23,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:23,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:23,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002707774] [2022-12-13 02:00:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:23,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:23,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:23,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:23,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:23,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:23,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:23,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:23,320 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:23,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:23,321 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:23,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:23,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:23,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:23,321 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:23,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:23,322 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:23,322 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:23,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:23,322 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:23,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:23,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,325 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:23,325 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:23,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:23,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:23,442 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:23,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:23,443 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:23,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:23,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:23,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable941 [2022-12-13 02:00:23,443 INFO L420 AbstractCegarLoop]: === Iteration 943 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:23,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash 108035247, now seen corresponding path program 1 times [2022-12-13 02:00:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:23,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879383990] [2022-12-13 02:00:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:23,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:23,501 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 02:00:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:23,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879383990] [2022-12-13 02:00:23,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879383990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:23,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:23,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881739270] [2022-12-13 02:00:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:23,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:23,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:23,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:23,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:23,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:23,553 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:23,554 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:23,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:23,554 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:23,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:23,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:23,555 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:23,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:23,555 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:23,556 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:23,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:23,556 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:23,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:23,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,559 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:23,559 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:23,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:23,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:23,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:23,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:23,675 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:23,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:23,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable942 [2022-12-13 02:00:23,676 INFO L420 AbstractCegarLoop]: === Iteration 944 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 165293549, now seen corresponding path program 1 times [2022-12-13 02:00:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613350595] [2022-12-13 02:00:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:23,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:23,751 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 02:00:23,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:23,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613350595] [2022-12-13 02:00:23,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613350595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:23,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:23,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778316954] [2022-12-13 02:00:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:23,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:23,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:23,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:23,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:23,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:23,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:23,806 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:23,807 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:23,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:23,807 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:23,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:23,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:23,808 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:23,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:23,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:23,808 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:23,809 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:23,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:23,809 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:23,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:23,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,812 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:23,812 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:23,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:23,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:23,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:23,940 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:23,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:23,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:23,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:23,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:23,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:23,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable943 [2022-12-13 02:00:23,941 INFO L420 AbstractCegarLoop]: === Iteration 945 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:23,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:23,941 INFO L85 PathProgramCache]: Analyzing trace with hash 222551851, now seen corresponding path program 1 times [2022-12-13 02:00:23,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:23,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30519931] [2022-12-13 02:00:23,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:23,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:24,001 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 02:00:24,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:24,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30519931] [2022-12-13 02:00:24,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30519931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:24,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:24,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298123324] [2022-12-13 02:00:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:24,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:24,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:24,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:24,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:24,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:24,065 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:24,065 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:24,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:24,066 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:24,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:24,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:24,067 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:24,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:24,067 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:24,068 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:24,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:24,068 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:24,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:24,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,070 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:24,071 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:24,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:24,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:24,187 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:24,188 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:24,188 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:24,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:24,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:24,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable944 [2022-12-13 02:00:24,188 INFO L420 AbstractCegarLoop]: === Iteration 946 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 279810153, now seen corresponding path program 1 times [2022-12-13 02:00:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:24,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138369502] [2022-12-13 02:00:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:24,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:24,241 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 02:00:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:24,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138369502] [2022-12-13 02:00:24,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138369502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:24,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:24,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:24,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480524126] [2022-12-13 02:00:24,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:24,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:24,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:24,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:24,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:24,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:24,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:24,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:24,292 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:24,292 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:24,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:24,293 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:24,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:24,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:24,293 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:24,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:24,294 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:24,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:24,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:24,294 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:24,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:24,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:24,297 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:24,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:24,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:24,415 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:24,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:24,416 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:24,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,416 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:24,416 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:24,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable945 [2022-12-13 02:00:24,416 INFO L420 AbstractCegarLoop]: === Iteration 947 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 337068455, now seen corresponding path program 1 times [2022-12-13 02:00:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:24,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851881008] [2022-12-13 02:00:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:24,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:24,468 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 02:00:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:24,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851881008] [2022-12-13 02:00:24,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851881008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:24,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:24,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:24,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155983360] [2022-12-13 02:00:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:24,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:24,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:24,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:24,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:24,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:24,512 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:24,512 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:24,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:24,513 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:24,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:24,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:24,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:24,513 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:24,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:24,514 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:24,514 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:24,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:24,514 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:24,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:24,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,517 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:24,517 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:24,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:24,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:24,633 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:24,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:24,634 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:24,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:24,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:24,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable946 [2022-12-13 02:00:24,634 INFO L420 AbstractCegarLoop]: === Iteration 948 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:24,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 394326757, now seen corresponding path program 1 times [2022-12-13 02:00:24,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:24,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262169436] [2022-12-13 02:00:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:24,684 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 02:00:24,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:24,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262169436] [2022-12-13 02:00:24,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262169436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:24,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673183296] [2022-12-13 02:00:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:24,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:24,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:24,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:24,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:24,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:24,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:24,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:24,728 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:24,728 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:24,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:24,729 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:24,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:24,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:24,729 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:24,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:24,730 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:24,730 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:24,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:24,730 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:24,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:24,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,733 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:24,733 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:24,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:24,733 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,733 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:24,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:24,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:00:24,862 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:24,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:24,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:24,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable947 [2022-12-13 02:00:24,862 INFO L420 AbstractCegarLoop]: === Iteration 949 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash 451585059, now seen corresponding path program 1 times [2022-12-13 02:00:24,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:24,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346464530] [2022-12-13 02:00:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:24,913 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 02:00:24,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:24,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346464530] [2022-12-13 02:00:24,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346464530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:24,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:24,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:24,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188032605] [2022-12-13 02:00:24,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:24,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:24,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:24,914 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:24,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:24,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:24,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:24,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:24,958 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:24,958 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:24,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:24,958 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:24,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:24,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:24,959 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:24,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:24,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:24,960 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:24,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:24,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:24,960 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:24,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:24,960 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:24,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,963 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:24,963 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:24,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:24,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:24,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:25,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:25,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:25,080 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:25,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:25,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:25,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable948 [2022-12-13 02:00:25,081 INFO L420 AbstractCegarLoop]: === Iteration 950 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:25,081 INFO L85 PathProgramCache]: Analyzing trace with hash 508843361, now seen corresponding path program 1 times [2022-12-13 02:00:25,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:25,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765285481] [2022-12-13 02:00:25,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:25,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:25,132 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 02:00:25,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:25,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765285481] [2022-12-13 02:00:25,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765285481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:25,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:25,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:25,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929122604] [2022-12-13 02:00:25,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:25,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:25,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:25,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:25,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:25,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:25,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:25,177 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:25,177 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:25,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:25,178 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:25,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:25,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:25,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:25,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:25,179 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:25,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:25,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:25,179 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:25,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:25,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:25,182 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:25,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:25,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:25,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:25,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:25,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:25,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:25,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable949 [2022-12-13 02:00:25,302 INFO L420 AbstractCegarLoop]: === Iteration 951 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:25,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash 566101663, now seen corresponding path program 1 times [2022-12-13 02:00:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:25,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491392132] [2022-12-13 02:00:25,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:25,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:25,355 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 02:00:25,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:25,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491392132] [2022-12-13 02:00:25,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491392132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:25,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:25,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:25,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719796888] [2022-12-13 02:00:25,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:25,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:25,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:25,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:25,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:25,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:25,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:25,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:25,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:25,399 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:25,399 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:25,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:25,399 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:25,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:25,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:25,400 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:25,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:25,401 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:25,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:25,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:25,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:25,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:25,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,404 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:25,404 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:25,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:25,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:25,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:25,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:25,522 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:25,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:25,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:25,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable950 [2022-12-13 02:00:25,523 INFO L420 AbstractCegarLoop]: === Iteration 952 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash 623359965, now seen corresponding path program 1 times [2022-12-13 02:00:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:25,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000300116] [2022-12-13 02:00:25,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:25,591 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 02:00:25,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:25,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000300116] [2022-12-13 02:00:25,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000300116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:25,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:25,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666371554] [2022-12-13 02:00:25,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:25,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:25,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:25,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:25,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:25,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:25,643 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:25,643 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:25,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 487 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:25,643 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:25,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:25,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:25,644 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:25,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:25,645 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:25,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:25,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:25,645 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:25,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:25,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,648 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:25,648 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:25,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:25,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:25,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:25,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:00:25,769 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:25,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:25,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable951 [2022-12-13 02:00:25,770 INFO L420 AbstractCegarLoop]: === Iteration 953 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:25,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash 680618267, now seen corresponding path program 1 times [2022-12-13 02:00:25,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:25,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686178056] [2022-12-13 02:00:25,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:25,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:25,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:25,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686178056] [2022-12-13 02:00:25,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686178056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:25,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:25,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393022367] [2022-12-13 02:00:25,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:25,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:25,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:25,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:25,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:25,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:25,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:25,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:25,873 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:25,873 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:25,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:25,874 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:25,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:25,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:25,874 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:25,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:25,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:25,875 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:25,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:25,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:25,875 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:25,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:25,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:25,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,878 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:25,878 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:25,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:25,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:25,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:25,995 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:25,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:25,996 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:25,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:25,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:25,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:25,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable952 [2022-12-13 02:00:25,996 INFO L420 AbstractCegarLoop]: === Iteration 954 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 737876569, now seen corresponding path program 1 times [2022-12-13 02:00:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:25,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606187080] [2022-12-13 02:00:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:26,048 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 02:00:26,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:26,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606187080] [2022-12-13 02:00:26,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606187080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:26,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:26,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953695574] [2022-12-13 02:00:26,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:26,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:26,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:26,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:26,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:26,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:26,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:26,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:26,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:26,104 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:26,104 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:26,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:26,105 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:26,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:26,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:26,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:26,105 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:26,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:26,106 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:26,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:26,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:26,106 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,107 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:26,107 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:26,107 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,109 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:26,109 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:26,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:26,110 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,110 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:26,235 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:26,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:26,235 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:26,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:26,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:26,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable953 [2022-12-13 02:00:26,236 INFO L420 AbstractCegarLoop]: === Iteration 955 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:26,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 795134871, now seen corresponding path program 1 times [2022-12-13 02:00:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:26,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984753782] [2022-12-13 02:00:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:26,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:26,287 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 02:00:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:26,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984753782] [2022-12-13 02:00:26,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984753782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:26,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:26,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:26,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016125002] [2022-12-13 02:00:26,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:26,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:26,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:26,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:26,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:26,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:26,331 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:26,332 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:26,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:26,332 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:26,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:26,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:26,333 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:26,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:26,334 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:26,334 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:26,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:26,334 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,334 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:26,334 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:26,334 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,337 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:26,337 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:26,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:26,337 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,337 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:26,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:26,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:26,454 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:26,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:26,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:26,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable954 [2022-12-13 02:00:26,454 INFO L420 AbstractCegarLoop]: === Iteration 956 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:26,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:26,455 INFO L85 PathProgramCache]: Analyzing trace with hash 852393173, now seen corresponding path program 1 times [2022-12-13 02:00:26,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:26,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975663415] [2022-12-13 02:00:26,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:26,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:26,506 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 02:00:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975663415] [2022-12-13 02:00:26,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975663415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:26,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838250814] [2022-12-13 02:00:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:26,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:26,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:26,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:26,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:26,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:26,561 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:26,561 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:26,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:26,562 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:26,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:26,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:26,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:26,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:26,563 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:26,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:26,564 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:26,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:26,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:26,564 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:26,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:26,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,568 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:26,568 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:26,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:26,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:26,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:26,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:26,698 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:26,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:26,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:26,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable955 [2022-12-13 02:00:26,699 INFO L420 AbstractCegarLoop]: === Iteration 957 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 909651475, now seen corresponding path program 1 times [2022-12-13 02:00:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:26,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869225173] [2022-12-13 02:00:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:26,761 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 02:00:26,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:26,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869225173] [2022-12-13 02:00:26,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869225173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:26,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:26,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:26,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482852096] [2022-12-13 02:00:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:26,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:26,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:26,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:26,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:26,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:26,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:26,813 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:26,813 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:26,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:26,814 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:26,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:26,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:26,814 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:26,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:26,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:26,815 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:26,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:26,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:26,816 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,816 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:26,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:26,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:26,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:26,818 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:26,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:26,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:26,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:26,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:26,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:00:26,948 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:26,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:26,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:26,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:26,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable956 [2022-12-13 02:00:26,949 INFO L420 AbstractCegarLoop]: === Iteration 958 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:26,949 INFO L85 PathProgramCache]: Analyzing trace with hash 966909777, now seen corresponding path program 1 times [2022-12-13 02:00:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:26,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116765385] [2022-12-13 02:00:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:27,000 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 02:00:27,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:27,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116765385] [2022-12-13 02:00:27,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116765385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:27,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:27,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94528920] [2022-12-13 02:00:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:27,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:27,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:27,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:27,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:27,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:27,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:27,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:27,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:27,047 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:27,047 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:27,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:27,047 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:27,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:27,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:27,048 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:27,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:27,049 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,049 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:27,049 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:27,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:27,049 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:27,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:27,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,052 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:27,052 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:27,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:27,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:27,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:27,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:27,170 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:27,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:27,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:27,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable957 [2022-12-13 02:00:27,170 INFO L420 AbstractCegarLoop]: === Iteration 959 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1024168079, now seen corresponding path program 1 times [2022-12-13 02:00:27,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:27,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682809238] [2022-12-13 02:00:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:27,228 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 02:00:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682809238] [2022-12-13 02:00:27,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682809238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:27,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:27,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:27,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665754241] [2022-12-13 02:00:27,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:27,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:27,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:27,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:27,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:27,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:27,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:27,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:27,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:27,272 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:27,272 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:27,273 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:27,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:27,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:27,273 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:27,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:27,274 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:27,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:27,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:27,274 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:27,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:27,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,277 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:27,277 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:27,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:27,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:27,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:27,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:27,396 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:27,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:27,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:27,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable958 [2022-12-13 02:00:27,396 INFO L420 AbstractCegarLoop]: === Iteration 960 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1081426381, now seen corresponding path program 1 times [2022-12-13 02:00:27,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:27,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047237058] [2022-12-13 02:00:27,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:27,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047237058] [2022-12-13 02:00:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047237058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:27,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:27,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056219963] [2022-12-13 02:00:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:27,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:27,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:27,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:27,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:27,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:27,495 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:27,495 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:27,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:27,495 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:27,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:27,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:27,496 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:27,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:27,497 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:27,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:27,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:27,497 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:27,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:27,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:27,500 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:27,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:27,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:27,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:27,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:00:27,626 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:27,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:27,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:27,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable959 [2022-12-13 02:00:27,627 INFO L420 AbstractCegarLoop]: === Iteration 961 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:27,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1138684683, now seen corresponding path program 1 times [2022-12-13 02:00:27,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:27,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320108285] [2022-12-13 02:00:27,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:27,678 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 02:00:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:27,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320108285] [2022-12-13 02:00:27,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320108285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:27,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:27,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704891367] [2022-12-13 02:00:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:27,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:27,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:27,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:27,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:27,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:27,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:27,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:27,732 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:27,732 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:27,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:27,732 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:27,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:27,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:27,733 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:27,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:27,734 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,734 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:27,734 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:27,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:27,734 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:27,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:27,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,737 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:27,737 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:27,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:27,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:27,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:27,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:27,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:27,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:27,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:27,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable960 [2022-12-13 02:00:27,854 INFO L420 AbstractCegarLoop]: === Iteration 962 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:27,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:27,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1195942985, now seen corresponding path program 1 times [2022-12-13 02:00:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:27,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820038992] [2022-12-13 02:00:27,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:27,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:27,906 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 02:00:27,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:27,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820038992] [2022-12-13 02:00:27,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820038992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:27,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:27,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:27,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500408438] [2022-12-13 02:00:27,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:27,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:27,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:27,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:27,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:27,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:27,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:27,958 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:27,958 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:27,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:27,959 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:27,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:27,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:27,959 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:27,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:27,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:27,960 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:27,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:27,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:27,960 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:27,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:27,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,963 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:27,963 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:27,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:27,963 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:27,963 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:28,081 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:28,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:28,082 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:28,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:28,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:28,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable961 [2022-12-13 02:00:28,082 INFO L420 AbstractCegarLoop]: === Iteration 963 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1253201287, now seen corresponding path program 1 times [2022-12-13 02:00:28,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:28,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390070874] [2022-12-13 02:00:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:28,135 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 02:00:28,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:28,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390070874] [2022-12-13 02:00:28,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390070874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:28,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:28,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242181974] [2022-12-13 02:00:28,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:28,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:28,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:28,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:28,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:28,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:28,195 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:28,195 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:28,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:28,196 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:28,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:28,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:28,196 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:28,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:28,197 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:28,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:28,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:28,198 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:28,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:28,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,201 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:28,201 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:28,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:28,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:28,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:28,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:00:28,326 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:28,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:28,326 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:28,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable962 [2022-12-13 02:00:28,326 INFO L420 AbstractCegarLoop]: === Iteration 964 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1310459589, now seen corresponding path program 1 times [2022-12-13 02:00:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:28,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971202222] [2022-12-13 02:00:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:28,379 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 02:00:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:28,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971202222] [2022-12-13 02:00:28,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971202222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:28,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:28,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:28,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968841377] [2022-12-13 02:00:28,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:28,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:28,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:28,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:28,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:28,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:28,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:28,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:28,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:28,424 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:28,424 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:28,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:28,425 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:28,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:28,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:28,425 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:28,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:28,426 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,426 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:28,426 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:28,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:28,426 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:28,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:28,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,429 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:28,429 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:28,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:28,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:28,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:28,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:28,557 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:28,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:28,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:28,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable963 [2022-12-13 02:00:28,558 INFO L420 AbstractCegarLoop]: === Iteration 965 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:28,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1367717891, now seen corresponding path program 1 times [2022-12-13 02:00:28,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:28,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875331293] [2022-12-13 02:00:28,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:28,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:28,618 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 02:00:28,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:28,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875331293] [2022-12-13 02:00:28,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875331293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:28,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:28,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:28,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830218501] [2022-12-13 02:00:28,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:28,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:28,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:28,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:28,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:28,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:28,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:28,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:28,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:28,663 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:28,663 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:28,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:28,664 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:28,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:28,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:28,664 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:28,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:28,665 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:28,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:28,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:28,665 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:28,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:28,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,668 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:28,668 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:28,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:28,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:28,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:28,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:28,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:28,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:28,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:28,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable964 [2022-12-13 02:00:28,785 INFO L420 AbstractCegarLoop]: === Iteration 966 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:28,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1424976193, now seen corresponding path program 1 times [2022-12-13 02:00:28,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:28,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658163035] [2022-12-13 02:00:28,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:28,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:28,836 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 02:00:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:28,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658163035] [2022-12-13 02:00:28,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658163035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:28,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:28,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621512965] [2022-12-13 02:00:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:28,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:28,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:28,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:28,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:28,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:28,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:28,905 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:28,905 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:28,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:28,906 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:28,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:28,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:28,907 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:28,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:28,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:28,907 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:28,908 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:28,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:28,908 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:28,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:28,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:28,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,911 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:28,911 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:28,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:28,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:28,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:29,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:29,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:29,029 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:29,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:29,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable965 [2022-12-13 02:00:29,030 INFO L420 AbstractCegarLoop]: === Iteration 967 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:29,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1482234495, now seen corresponding path program 1 times [2022-12-13 02:00:29,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:29,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139154501] [2022-12-13 02:00:29,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:29,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:29,089 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 02:00:29,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139154501] [2022-12-13 02:00:29,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139154501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:29,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:29,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030305302] [2022-12-13 02:00:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:29,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:29,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:29,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:29,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:29,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:29,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:29,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:29,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:29,134 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:29,134 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:29,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:29,135 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:29,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:29,135 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:29,135 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:29,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:29,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:29,136 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,136 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:29,136 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:29,136 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:29,136 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:29,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:29,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:29,139 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:29,139 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:29,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:29,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:29,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:29,258 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:29,259 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:29,259 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,259 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:29,259 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:29,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable966 [2022-12-13 02:00:29,259 INFO L420 AbstractCegarLoop]: === Iteration 968 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1539492797, now seen corresponding path program 1 times [2022-12-13 02:00:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:29,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231904044] [2022-12-13 02:00:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:29,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:29,311 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 02:00:29,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231904044] [2022-12-13 02:00:29,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231904044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:29,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:29,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197191129] [2022-12-13 02:00:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:29,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:29,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:29,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:29,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:29,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:29,364 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:29,364 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:29,364 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:29,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:29,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:29,365 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:29,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:29,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:29,366 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:29,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:29,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:29,366 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:29,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:29,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:29,369 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:29,369 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:29,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:29,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:29,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:29,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:29,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:29,502 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:29,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:29,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:29,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable967 [2022-12-13 02:00:29,502 INFO L420 AbstractCegarLoop]: === Iteration 969 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:29,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1596751099, now seen corresponding path program 1 times [2022-12-13 02:00:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:29,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141874727] [2022-12-13 02:00:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:29,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:29,561 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 02:00:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:29,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141874727] [2022-12-13 02:00:29,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141874727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:29,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:29,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257152629] [2022-12-13 02:00:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:29,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:29,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:29,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:29,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:29,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:29,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:29,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:29,616 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:29,616 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:29,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:29,617 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:29,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:29,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:29,617 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:29,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:29,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:29,618 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:29,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:29,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:29,619 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:29,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:29,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:29,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:29,621 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:29,622 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:29,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:29,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:29,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:29,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:29,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 359 [2022-12-13 02:00:29,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:29,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:29,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:29,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:29,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable968 [2022-12-13 02:00:29,977 INFO L420 AbstractCegarLoop]: === Iteration 970 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:29,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:29,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1654009401, now seen corresponding path program 1 times [2022-12-13 02:00:29,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:29,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447081546] [2022-12-13 02:00:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:29,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:30,029 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 02:00:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447081546] [2022-12-13 02:00:30,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447081546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:30,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:30,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364147854] [2022-12-13 02:00:30,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:30,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:30,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:30,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:30,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:30,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:30,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:30,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:30,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:30,074 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:30,074 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:30,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:30,074 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:30,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:30,075 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:30,075 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:30,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:30,076 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,076 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:30,076 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:30,076 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:30,076 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,076 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:30,076 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:30,076 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,079 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:30,079 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:30,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:30,079 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:30,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:30,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:30,196 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:30,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:30,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:30,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable969 [2022-12-13 02:00:30,196 INFO L420 AbstractCegarLoop]: === Iteration 971 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:30,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1711267703, now seen corresponding path program 1 times [2022-12-13 02:00:30,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:30,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559144594] [2022-12-13 02:00:30,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:30,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:30,248 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 02:00:30,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:30,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559144594] [2022-12-13 02:00:30,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559144594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:30,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:30,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745226698] [2022-12-13 02:00:30,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:30,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:30,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:30,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:30,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:30,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:30,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:30,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:30,293 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:30,293 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:30,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:30,294 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:30,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:30,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:30,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:30,294 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:30,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:30,295 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:30,296 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:30,296 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:30,296 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:30,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:30,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,299 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:30,299 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:30,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:30,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:30,422 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:30,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:30,422 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:30,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:30,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:30,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable970 [2022-12-13 02:00:30,423 INFO L420 AbstractCegarLoop]: === Iteration 972 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1768526005, now seen corresponding path program 1 times [2022-12-13 02:00:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:30,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736771420] [2022-12-13 02:00:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:30,474 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 02:00:30,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:30,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736771420] [2022-12-13 02:00:30,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736771420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:30,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:30,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322141326] [2022-12-13 02:00:30,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:30,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:30,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:30,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:30,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:30,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:30,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:30,533 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:30,533 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:30,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:30,534 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:30,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:30,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:30,534 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:30,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:30,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:30,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:30,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:30,536 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:30,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:30,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,538 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:30,539 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:30,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:30,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:30,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:30,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:30,658 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:30,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:30,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:30,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable971 [2022-12-13 02:00:30,659 INFO L420 AbstractCegarLoop]: === Iteration 973 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:30,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:30,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1825784307, now seen corresponding path program 1 times [2022-12-13 02:00:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:30,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605679184] [2022-12-13 02:00:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:30,711 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 02:00:30,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:30,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605679184] [2022-12-13 02:00:30,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605679184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:30,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:30,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:30,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691500074] [2022-12-13 02:00:30,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:30,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:30,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:30,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:30,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:30,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:30,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:30,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:30,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:30,757 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:30,758 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:30,758 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:30,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:30,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:30,759 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:30,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:30,759 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:30,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:30,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:30,760 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:30,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:30,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,763 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:30,763 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:30,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:30,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:30,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:30,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:30,885 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:30,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:30,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:30,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable972 [2022-12-13 02:00:30,885 INFO L420 AbstractCegarLoop]: === Iteration 974 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:30,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1883042609, now seen corresponding path program 1 times [2022-12-13 02:00:30,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:30,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042835890] [2022-12-13 02:00:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:30,935 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 02:00:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042835890] [2022-12-13 02:00:30,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042835890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:30,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:30,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669129970] [2022-12-13 02:00:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:30,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:30,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:30,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:30,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:30,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:30,988 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:30,988 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:30,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:30,989 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:30,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:30,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:30,989 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:30,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:30,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:30,990 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:30,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:30,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:30,990 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,990 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:30,990 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:30,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:30,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,993 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:30,993 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:30,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:30,993 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:30,993 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:31,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:31,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:00:31,120 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:31,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:31,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:31,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable973 [2022-12-13 02:00:31,120 INFO L420 AbstractCegarLoop]: === Iteration 975 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1940300911, now seen corresponding path program 1 times [2022-12-13 02:00:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:31,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100335493] [2022-12-13 02:00:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:31,173 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 02:00:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:31,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100335493] [2022-12-13 02:00:31,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100335493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:31,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:31,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:31,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582669866] [2022-12-13 02:00:31,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:31,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:31,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:31,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:31,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:31,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:31,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:31,219 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:31,219 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:31,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:31,219 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:31,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:31,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:31,220 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:31,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:31,221 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:31,221 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:31,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:31,221 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:31,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:31,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,224 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:31,224 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:31,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:31,224 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:31,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:31,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:31,347 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:31,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:31,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:31,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable974 [2022-12-13 02:00:31,347 INFO L420 AbstractCegarLoop]: === Iteration 976 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:31,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1997559213, now seen corresponding path program 1 times [2022-12-13 02:00:31,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:31,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550706226] [2022-12-13 02:00:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:31,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:31,401 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 02:00:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:31,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550706226] [2022-12-13 02:00:31,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550706226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:31,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:31,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419340156] [2022-12-13 02:00:31,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:31,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:31,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:31,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:31,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:31,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:31,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:31,447 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:31,447 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:31,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:31,447 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:31,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:31,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:31,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:31,448 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:31,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:31,449 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:31,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:31,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:31,449 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:31,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:31,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:31,452 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:31,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:31,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:31,568 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:31,569 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:31,569 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:31,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:31,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:31,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable975 [2022-12-13 02:00:31,569 INFO L420 AbstractCegarLoop]: === Iteration 977 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2054817515, now seen corresponding path program 1 times [2022-12-13 02:00:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:31,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849694044] [2022-12-13 02:00:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:31,622 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 02:00:31,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:31,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849694044] [2022-12-13 02:00:31,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849694044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:31,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:31,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:31,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980332456] [2022-12-13 02:00:31,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:31,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:31,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:31,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:31,623 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:31,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:31,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:31,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:31,674 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:31,675 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:31,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:31,675 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:31,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:31,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:31,676 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:31,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:31,677 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:31,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:31,677 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:31,677 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,677 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:31,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:31,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,680 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:31,680 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:31,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:31,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:31,797 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:31,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:31,797 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:31,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:31,798 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:31,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable976 [2022-12-13 02:00:31,798 INFO L420 AbstractCegarLoop]: === Iteration 978 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2112075817, now seen corresponding path program 1 times [2022-12-13 02:00:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:31,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516386848] [2022-12-13 02:00:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:31,866 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 02:00:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:31,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516386848] [2022-12-13 02:00:31,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516386848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:31,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:31,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683527812] [2022-12-13 02:00:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:31,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:31,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:31,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:31,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:31,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:31,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:31,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:31,930 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:31,930 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:31,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:31,931 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:31,931 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:31,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:31,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:31,932 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,932 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:31,932 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:31,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:31,932 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:31,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:31,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:31,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,935 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:31,935 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:31,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:31,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:31,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:32,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:32,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:32,068 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:32,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:32,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:32,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable977 [2022-12-13 02:00:32,069 INFO L420 AbstractCegarLoop]: === Iteration 979 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:32,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:32,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2125633177, now seen corresponding path program 1 times [2022-12-13 02:00:32,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:32,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202158815] [2022-12-13 02:00:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:32,126 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 02:00:32,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:32,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202158815] [2022-12-13 02:00:32,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202158815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:32,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:32,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:32,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900637478] [2022-12-13 02:00:32,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:32,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:32,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:32,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:32,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:32,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:32,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:32,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:32,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:32,182 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:32,182 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:32,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:32,183 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:32,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:32,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:32,184 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:32,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:32,184 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,184 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:32,185 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:32,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:32,185 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:32,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:32,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,188 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:32,188 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:32,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:32,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:32,321 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:32,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:32,322 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:32,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:32,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:32,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable978 [2022-12-13 02:00:32,323 INFO L420 AbstractCegarLoop]: === Iteration 980 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:32,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2068374875, now seen corresponding path program 1 times [2022-12-13 02:00:32,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:32,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544801945] [2022-12-13 02:00:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:32,396 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 02:00:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:32,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544801945] [2022-12-13 02:00:32,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544801945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:32,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:32,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575544628] [2022-12-13 02:00:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:32,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:32,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:32,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:32,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:32,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:32,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:32,446 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:32,446 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:32,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:32,447 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:32,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:32,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:32,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:32,447 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:32,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:32,448 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:32,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:32,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:32,449 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:32,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:32,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,453 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:32,453 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:32,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:32,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:32,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:32,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:32,586 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:32,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable979 [2022-12-13 02:00:32,586 INFO L420 AbstractCegarLoop]: === Iteration 981 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -2011116573, now seen corresponding path program 1 times [2022-12-13 02:00:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:32,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324768412] [2022-12-13 02:00:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:32,653 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 02:00:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:32,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324768412] [2022-12-13 02:00:32,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324768412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:32,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:32,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666740747] [2022-12-13 02:00:32,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:32,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:32,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:32,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:32,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:32,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:32,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:32,711 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:32,711 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:32,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:32,712 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:32,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:32,712 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:32,713 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:32,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:32,713 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:32,714 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:32,714 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:32,714 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:32,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:32,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,717 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:32,717 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:32,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:32,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:32,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:32,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:32,836 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:32,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:32,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:32,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable980 [2022-12-13 02:00:32,836 INFO L420 AbstractCegarLoop]: === Iteration 982 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1953858271, now seen corresponding path program 1 times [2022-12-13 02:00:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:32,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840848725] [2022-12-13 02:00:32,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:32,888 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 02:00:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:32,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840848725] [2022-12-13 02:00:32,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840848725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:32,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:32,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:32,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931223043] [2022-12-13 02:00:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:32,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:32,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:32,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:32,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:32,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:32,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:32,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:32,934 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:32,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:32,934 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:32,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:32,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:32,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:32,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:32,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:32,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:32,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:32,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:32,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:32,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:32,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:32,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:32,939 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:32,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:32,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:32,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:33,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:33,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:33,058 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:33,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:33,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:33,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable981 [2022-12-13 02:00:33,058 INFO L420 AbstractCegarLoop]: === Iteration 983 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:33,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1896599969, now seen corresponding path program 1 times [2022-12-13 02:00:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:33,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903386553] [2022-12-13 02:00:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:33,113 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 02:00:33,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903386553] [2022-12-13 02:00:33,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903386553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:33,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:33,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801544409] [2022-12-13 02:00:33,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:33,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:33,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:33,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:33,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:33,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:33,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:33,166 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:33,166 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:33,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:33,166 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:33,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:33,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:33,167 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:33,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:33,168 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:33,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:33,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:33,168 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:33,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:33,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,171 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:33,171 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:33,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:33,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:33,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:33,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:33,291 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:33,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:33,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:33,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable982 [2022-12-13 02:00:33,291 INFO L420 AbstractCegarLoop]: === Iteration 984 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1839341667, now seen corresponding path program 1 times [2022-12-13 02:00:33,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:33,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305875974] [2022-12-13 02:00:33,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:33,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:33,357 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 02:00:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:33,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305875974] [2022-12-13 02:00:33,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305875974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:33,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:33,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611195821] [2022-12-13 02:00:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:33,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:33,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:33,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:33,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:33,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:33,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:33,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:33,402 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:33,402 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:33,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:33,403 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:33,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:33,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:33,403 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:33,404 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,404 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:33,404 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:33,405 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:33,405 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:33,405 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:33,405 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,407 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:33,408 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:33,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:33,408 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,408 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:33,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:33,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:00:33,538 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:33,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:33,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:33,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable983 [2022-12-13 02:00:33,538 INFO L420 AbstractCegarLoop]: === Iteration 985 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1782083365, now seen corresponding path program 1 times [2022-12-13 02:00:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:33,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221505802] [2022-12-13 02:00:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:33,595 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 02:00:33,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:33,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221505802] [2022-12-13 02:00:33,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221505802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:33,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:33,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:33,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422075261] [2022-12-13 02:00:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:33,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:33,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:33,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:33,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:33,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:33,650 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:33,650 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:33,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:33,651 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:33,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:33,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:33,651 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:33,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:33,652 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:33,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:33,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:33,652 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:33,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:33,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,655 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:33,655 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:33,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:33,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:33,790 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:33,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:00:33,790 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:33,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:33,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable984 [2022-12-13 02:00:33,791 INFO L420 AbstractCegarLoop]: === Iteration 986 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:33,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:33,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1724825063, now seen corresponding path program 1 times [2022-12-13 02:00:33,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:33,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407697237] [2022-12-13 02:00:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:33,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:33,855 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 02:00:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407697237] [2022-12-13 02:00:33,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407697237] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:33,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:33,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:33,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478701768] [2022-12-13 02:00:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:33,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:33,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:33,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:33,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:33,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:33,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:33,918 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:33,918 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:33,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:33,919 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:33,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:33,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:33,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:33,920 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:33,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:33,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:33,920 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:33,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:33,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:33,921 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:33,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:33,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:33,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,924 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:33,924 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:33,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:33,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:33,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:34,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:34,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:34,057 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:34,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:34,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:34,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable985 [2022-12-13 02:00:34,058 INFO L420 AbstractCegarLoop]: === Iteration 987 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1667566761, now seen corresponding path program 1 times [2022-12-13 02:00:34,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:34,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260540545] [2022-12-13 02:00:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:34,115 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 02:00:34,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:34,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260540545] [2022-12-13 02:00:34,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260540545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:34,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:34,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011578986] [2022-12-13 02:00:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:34,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:34,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:34,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:34,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:34,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:34,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:34,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:34,168 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:34,168 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:34,169 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:34,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:34,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:34,169 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:34,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:34,170 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:34,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:34,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:34,170 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:34,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:34,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,173 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:34,173 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:34,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:34,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:34,306 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:34,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:34,307 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:34,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:34,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:34,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable986 [2022-12-13 02:00:34,307 INFO L420 AbstractCegarLoop]: === Iteration 988 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:34,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:34,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1610308459, now seen corresponding path program 1 times [2022-12-13 02:00:34,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:34,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368278907] [2022-12-13 02:00:34,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:34,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:34,360 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 02:00:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:34,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368278907] [2022-12-13 02:00:34,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368278907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:34,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:34,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:34,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083186418] [2022-12-13 02:00:34,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:34,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:34,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:34,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:34,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:34,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:34,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:34,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:34,405 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:34,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:34,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:34,406 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:34,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:34,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:34,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:34,406 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:34,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:34,407 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:34,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:34,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:34,408 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:34,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:34,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,410 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:34,410 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:34,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:34,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:34,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:34,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:34,542 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:34,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:34,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:34,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable987 [2022-12-13 02:00:34,542 INFO L420 AbstractCegarLoop]: === Iteration 989 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:34,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:34,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1553050157, now seen corresponding path program 1 times [2022-12-13 02:00:34,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:34,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107891634] [2022-12-13 02:00:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:34,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 02:00:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:34,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107891634] [2022-12-13 02:00:34,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107891634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:34,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:34,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774650688] [2022-12-13 02:00:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:34,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:34,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:34,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:34,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:34,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:34,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:34,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:34,641 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:34,641 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:34,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:34,641 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:34,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:34,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:34,642 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:34,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:34,643 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,643 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:34,643 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:34,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:34,643 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:34,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:34,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,647 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:34,647 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:34,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:34,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:34,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:34,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:34,768 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:34,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:34,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:34,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable988 [2022-12-13 02:00:34,768 INFO L420 AbstractCegarLoop]: === Iteration 990 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:34,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:34,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1495791855, now seen corresponding path program 1 times [2022-12-13 02:00:34,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:34,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401487264] [2022-12-13 02:00:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:34,832 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 02:00:34,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:34,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401487264] [2022-12-13 02:00:34,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401487264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:34,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:34,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:34,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297585841] [2022-12-13 02:00:34,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:34,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:34,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:34,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:34,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:34,833 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:34,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:34,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:34,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:34,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:34,884 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:34,884 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:34,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:34,885 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:34,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:34,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:34,885 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:34,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:34,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:34,886 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,886 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:34,886 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:34,886 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:34,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:34,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:34,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:34,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,889 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:34,889 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:34,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:34,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:34,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:35,006 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:35,007 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:35,007 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:35,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:35,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:35,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable989 [2022-12-13 02:00:35,007 INFO L420 AbstractCegarLoop]: === Iteration 991 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1438533553, now seen corresponding path program 1 times [2022-12-13 02:00:35,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:35,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475139404] [2022-12-13 02:00:35,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:35,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:35,058 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 02:00:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:35,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475139404] [2022-12-13 02:00:35,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475139404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:35,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:35,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644568107] [2022-12-13 02:00:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:35,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:35,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:35,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:35,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:35,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:35,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:35,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:35,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:35,110 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:35,110 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:35,110 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:35,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:35,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:35,111 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:35,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:35,112 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:35,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:35,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:35,112 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:35,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:35,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,115 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:35,115 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:35,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:35,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:35,231 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:35,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:35,232 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:35,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,232 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:35,232 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:35,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable990 [2022-12-13 02:00:35,232 INFO L420 AbstractCegarLoop]: === Iteration 992 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:35,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:35,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1381275251, now seen corresponding path program 1 times [2022-12-13 02:00:35,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:35,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12311885] [2022-12-13 02:00:35,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:35,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:35,293 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 02:00:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:35,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12311885] [2022-12-13 02:00:35,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12311885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:35,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:35,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114139664] [2022-12-13 02:00:35,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:35,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:35,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:35,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:35,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:35,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:35,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:35,349 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:35,349 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:35,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:35,350 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:35,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:35,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:35,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:35,350 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:35,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:35,351 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:35,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:35,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:35,351 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:35,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:35,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,354 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:35,354 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:35,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:35,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:35,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:35,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:35,485 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:35,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:35,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable991 [2022-12-13 02:00:35,486 INFO L420 AbstractCegarLoop]: === Iteration 993 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:35,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1324016949, now seen corresponding path program 1 times [2022-12-13 02:00:35,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:35,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814531571] [2022-12-13 02:00:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:35,541 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 02:00:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814531571] [2022-12-13 02:00:35,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814531571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:35,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:35,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226490277] [2022-12-13 02:00:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:35,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:35,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:35,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:35,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:35,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:35,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:35,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:35,605 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:35,606 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:35,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:35,606 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:35,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:35,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:35,607 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:35,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:35,608 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:35,608 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:35,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:35,608 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:35,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:35,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,611 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:35,611 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:35,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:35,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:35,744 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:35,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:35,744 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:35,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:35,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable992 [2022-12-13 02:00:35,745 INFO L420 AbstractCegarLoop]: === Iteration 994 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1266758647, now seen corresponding path program 1 times [2022-12-13 02:00:35,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:35,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862465377] [2022-12-13 02:00:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:35,811 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 02:00:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:35,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862465377] [2022-12-13 02:00:35,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862465377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:35,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:35,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787975522] [2022-12-13 02:00:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:35,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:35,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:35,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:35,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:35,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:35,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:35,859 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:35,859 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:35,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:35,860 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:35,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:35,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:35,860 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:35,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:35,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:35,861 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:35,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:35,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:35,861 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:35,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:35,862 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:35,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,865 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:35,865 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:35,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:35,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:35,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:36,005 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:36,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:00:36,006 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:36,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:36,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable993 [2022-12-13 02:00:36,006 INFO L420 AbstractCegarLoop]: === Iteration 995 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1209500345, now seen corresponding path program 1 times [2022-12-13 02:00:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:36,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009566520] [2022-12-13 02:00:36,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:36,090 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 02:00:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:36,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009566520] [2022-12-13 02:00:36,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009566520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:36,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:36,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814952656] [2022-12-13 02:00:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:36,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:36,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:36,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:36,143 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:36,143 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:36,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:36,143 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:36,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:36,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:36,144 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:36,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:36,145 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:36,145 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:36,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:36,145 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:36,145 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:36,145 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,148 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:36,148 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:36,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:36,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:36,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:36,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:00:36,288 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:36,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:36,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:36,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable994 [2022-12-13 02:00:36,288 INFO L420 AbstractCegarLoop]: === Iteration 996 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1152242043, now seen corresponding path program 1 times [2022-12-13 02:00:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:36,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223300371] [2022-12-13 02:00:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:36,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:36,359 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 02:00:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223300371] [2022-12-13 02:00:36,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223300371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:36,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:36,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265723932] [2022-12-13 02:00:36,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:36,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:36,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:36,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:36,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:36,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:36,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:36,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:36,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:36,412 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:36,413 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:36,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:36,413 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:36,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:36,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:36,414 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:36,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:36,415 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:36,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:36,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:36,415 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:36,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:36,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,418 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:36,418 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:36,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:36,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:36,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:36,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:36,551 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:36,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:36,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:36,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable995 [2022-12-13 02:00:36,551 INFO L420 AbstractCegarLoop]: === Iteration 997 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1094983741, now seen corresponding path program 1 times [2022-12-13 02:00:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:36,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344749328] [2022-12-13 02:00:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:36,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:36,612 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 02:00:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:36,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344749328] [2022-12-13 02:00:36,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344749328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:36,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:36,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117548810] [2022-12-13 02:00:36,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:36,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:36,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:36,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:36,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:36,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:36,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:36,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:36,667 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:36,668 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:36,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:36,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:36,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:36,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:36,669 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:36,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:36,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:36,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:36,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:36,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:36,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:36,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,673 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:36,673 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:36,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:36,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:36,809 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:36,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:36,809 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:36,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:36,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:36,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable996 [2022-12-13 02:00:36,810 INFO L420 AbstractCegarLoop]: === Iteration 998 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1037725439, now seen corresponding path program 1 times [2022-12-13 02:00:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:36,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100500304] [2022-12-13 02:00:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:36,861 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 02:00:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100500304] [2022-12-13 02:00:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100500304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:36,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635296199] [2022-12-13 02:00:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:36,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:36,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:36,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:36,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:36,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:36,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:36,915 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:36,915 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:36,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:36,916 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:36,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:36,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:36,917 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:36,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:36,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:36,918 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,918 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:36,918 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:36,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:36,918 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:36,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:36,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:36,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,921 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:36,921 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:36,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:36,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:36,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:37,056 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:37,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:00:37,056 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:37,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:37,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:37,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable997 [2022-12-13 02:00:37,057 INFO L420 AbstractCegarLoop]: === Iteration 999 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash -980467137, now seen corresponding path program 1 times [2022-12-13 02:00:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:37,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923449395] [2022-12-13 02:00:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:37,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:37,122 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 02:00:37,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:37,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923449395] [2022-12-13 02:00:37,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923449395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:37,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:37,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:37,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975534184] [2022-12-13 02:00:37,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:37,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:37,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:37,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:37,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:37,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:37,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:37,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:37,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:37,177 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:37,177 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:37,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:37,178 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:37,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:37,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:37,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:37,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:37,179 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:37,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:37,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:37,179 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:37,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:37,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:37,182 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:37,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:37,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:37,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:37,316 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:37,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:37,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:37,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable998 [2022-12-13 02:00:37,316 INFO L420 AbstractCegarLoop]: === Iteration 1000 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:37,316 INFO L85 PathProgramCache]: Analyzing trace with hash -923208835, now seen corresponding path program 1 times [2022-12-13 02:00:37,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:37,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554861905] [2022-12-13 02:00:37,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:37,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:37,372 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 02:00:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554861905] [2022-12-13 02:00:37,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554861905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:37,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:37,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426389240] [2022-12-13 02:00:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:37,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:37,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:37,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:37,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:37,427 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:37,427 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:37,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:37,428 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:37,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:37,428 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:37,428 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:37,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:37,429 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:37,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:37,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:37,429 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:37,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:37,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,432 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:37,432 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:37,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:37,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:37,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:37,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:37,550 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:37,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:37,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:37,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable999 [2022-12-13 02:00:37,550 INFO L420 AbstractCegarLoop]: === Iteration 1001 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:37,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash -865950533, now seen corresponding path program 1 times [2022-12-13 02:00:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:37,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755837720] [2022-12-13 02:00:37,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:37,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:37,604 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 02:00:37,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:37,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755837720] [2022-12-13 02:00:37,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755837720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:37,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:37,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:37,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789687212] [2022-12-13 02:00:37,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:37,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:37,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:37,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:37,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:37,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:37,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:37,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:37,656 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:37,656 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:37,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:37,657 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:37,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:37,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:37,657 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:37,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:37,658 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:37,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:37,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:37,659 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:37,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:37,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,662 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:37,662 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:37,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:37,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:37,783 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:37,784 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:37,784 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:37,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,784 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:37,784 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:37,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1000 [2022-12-13 02:00:37,784 INFO L420 AbstractCegarLoop]: === Iteration 1002 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -808692231, now seen corresponding path program 1 times [2022-12-13 02:00:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:37,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814800689] [2022-12-13 02:00:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:37,850 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 02:00:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:37,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814800689] [2022-12-13 02:00:37,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814800689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:37,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:37,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467415885] [2022-12-13 02:00:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:37,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:37,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:37,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:37,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:37,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:37,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:37,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:37,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:37,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:37,902 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:37,902 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:37,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:37,903 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:37,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:37,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:37,903 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:37,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:37,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:37,904 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:37,904 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:37,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:37,905 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:37,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:37,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:37,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,907 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:37,908 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:37,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:37,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:37,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:38,030 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:38,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:38,031 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:38,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:38,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:38,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1001 [2022-12-13 02:00:38,031 INFO L420 AbstractCegarLoop]: === Iteration 1003 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash -751433929, now seen corresponding path program 1 times [2022-12-13 02:00:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:38,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356120548] [2022-12-13 02:00:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:38,084 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 02:00:38,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:38,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356120548] [2022-12-13 02:00:38,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356120548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:38,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:38,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846907640] [2022-12-13 02:00:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:38,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:38,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:38,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:38,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:38,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:38,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:38,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:38,135 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:38,136 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:38,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:38,136 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:38,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:38,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:38,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:38,137 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:38,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:38,138 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:38,138 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:38,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:38,138 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:38,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:38,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,141 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:38,141 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:38,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:38,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:38,258 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:38,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:38,258 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:38,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:38,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:38,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1002 [2022-12-13 02:00:38,258 INFO L420 AbstractCegarLoop]: === Iteration 1004 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:38,259 INFO L85 PathProgramCache]: Analyzing trace with hash -694175627, now seen corresponding path program 1 times [2022-12-13 02:00:38,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:38,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593840021] [2022-12-13 02:00:38,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:38,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:38,310 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 02:00:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:38,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593840021] [2022-12-13 02:00:38,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593840021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:38,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:38,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102620114] [2022-12-13 02:00:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:38,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:38,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:38,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:38,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:38,363 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:38,363 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:38,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:38,364 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:38,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:38,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:38,364 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:38,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:38,365 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,365 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:38,365 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:38,365 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:38,366 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:38,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:38,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,368 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:38,368 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:38,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:38,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:38,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:38,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:38,485 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:38,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:38,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:38,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1003 [2022-12-13 02:00:38,486 INFO L420 AbstractCegarLoop]: === Iteration 1005 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash -636917325, now seen corresponding path program 1 times [2022-12-13 02:00:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:38,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654065843] [2022-12-13 02:00:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:38,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:38,539 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 02:00:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:38,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654065843] [2022-12-13 02:00:38,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654065843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:38,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:38,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:38,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686457049] [2022-12-13 02:00:38,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:38,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:38,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:38,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:38,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:38,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:38,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:38,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:38,590 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:38,590 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:38,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:38,591 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:38,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:38,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:38,591 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:38,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:38,592 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:38,592 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:38,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:38,592 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:38,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:38,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,595 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:38,595 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:38,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:38,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,596 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:38,712 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:38,712 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:38,713 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:38,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:38,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:38,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1004 [2022-12-13 02:00:38,713 INFO L420 AbstractCegarLoop]: === Iteration 1006 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -579659023, now seen corresponding path program 1 times [2022-12-13 02:00:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209944839] [2022-12-13 02:00:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:38,765 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 02:00:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:38,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209944839] [2022-12-13 02:00:38,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209944839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:38,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:38,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:38,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371425450] [2022-12-13 02:00:38,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:38,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:38,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:38,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:38,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:38,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:38,820 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:38,821 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:38,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:38,821 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:38,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:38,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:38,822 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:38,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:38,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:38,823 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,823 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:38,823 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:38,823 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:38,823 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,823 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:38,823 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:38,823 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:38,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,826 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:38,826 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:38,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:38,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:38,826 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:38,947 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:38,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:00:38,947 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:38,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:38,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:38,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:38,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1005 [2022-12-13 02:00:38,948 INFO L420 AbstractCegarLoop]: === Iteration 1007 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -522400721, now seen corresponding path program 1 times [2022-12-13 02:00:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:38,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156310598] [2022-12-13 02:00:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:38,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:39,000 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 02:00:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:39,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156310598] [2022-12-13 02:00:39,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156310598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:39,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:39,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620166717] [2022-12-13 02:00:39,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:39,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:39,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:39,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:39,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:39,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:39,055 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:39,055 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:39,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:39,056 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:39,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:39,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:39,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:39,057 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:39,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:39,058 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:39,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:39,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:39,058 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:39,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:39,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,062 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:39,062 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:39,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:39,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:39,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:39,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:00:39,202 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:39,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:39,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:39,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1006 [2022-12-13 02:00:39,203 INFO L420 AbstractCegarLoop]: === Iteration 1008 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -465142419, now seen corresponding path program 1 times [2022-12-13 02:00:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:39,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048455474] [2022-12-13 02:00:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:39,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:39,266 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 02:00:39,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:39,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048455474] [2022-12-13 02:00:39,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048455474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:39,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:39,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186534119] [2022-12-13 02:00:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:39,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:39,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:39,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:39,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:39,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:39,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:39,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:39,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:39,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:39,320 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:39,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:39,321 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:39,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:39,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:39,321 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:39,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:39,322 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:39,323 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:39,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:39,323 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:39,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:39,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,326 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:39,326 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:39,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:39,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:39,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:39,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:39,454 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:39,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:39,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:39,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1007 [2022-12-13 02:00:39,455 INFO L420 AbstractCegarLoop]: === Iteration 1009 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -407884117, now seen corresponding path program 1 times [2022-12-13 02:00:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:39,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119042369] [2022-12-13 02:00:39,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:39,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:39,509 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 02:00:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:39,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119042369] [2022-12-13 02:00:39,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119042369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:39,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:39,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331886327] [2022-12-13 02:00:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:39,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:39,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:39,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:39,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:39,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:39,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:39,553 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:39,554 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:39,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:39,554 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:39,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:39,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:39,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:39,555 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:39,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:39,556 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:39,556 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:39,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:39,556 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:39,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:39,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,559 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:39,559 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:39,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 184 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:39,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:39,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:39,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:39,676 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:39,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:39,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:39,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1008 [2022-12-13 02:00:39,677 INFO L420 AbstractCegarLoop]: === Iteration 1010 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash -350625815, now seen corresponding path program 1 times [2022-12-13 02:00:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:39,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827322207] [2022-12-13 02:00:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:39,728 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 02:00:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:39,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827322207] [2022-12-13 02:00:39,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827322207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:39,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:39,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835461701] [2022-12-13 02:00:39,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:39,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:39,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:39,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:39,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:39,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:39,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:39,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:39,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:39,779 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:39,780 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:39,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:39,780 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:39,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:39,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:39,781 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:39,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:39,781 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,781 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:39,781 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:39,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:39,782 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,782 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:39,782 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:39,782 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,784 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:39,784 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:39,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:39,785 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:39,785 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:39,900 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:39,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:39,900 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:39,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,901 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:39,901 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:39,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1009 [2022-12-13 02:00:39,901 INFO L420 AbstractCegarLoop]: === Iteration 1011 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:39,901 INFO L85 PathProgramCache]: Analyzing trace with hash -293367513, now seen corresponding path program 1 times [2022-12-13 02:00:39,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:39,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863468169] [2022-12-13 02:00:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:39,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:39,953 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 02:00:39,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:39,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863468169] [2022-12-13 02:00:39,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863468169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:39,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:39,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:39,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693972237] [2022-12-13 02:00:39,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:39,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:39,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:39,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:39,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:39,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:39,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:39,997 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:39,997 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:39,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:39,998 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:39,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:39,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:39,998 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:39,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:39,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:39,999 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:39,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:39,999 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:39,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:40,000 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:40,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:40,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,002 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:40,002 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:40,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:40,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:40,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:40,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:40,119 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:40,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:40,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1010 [2022-12-13 02:00:40,120 INFO L420 AbstractCegarLoop]: === Iteration 1012 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash -236109211, now seen corresponding path program 1 times [2022-12-13 02:00:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:40,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071492464] [2022-12-13 02:00:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:40,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:40,171 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 02:00:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:40,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071492464] [2022-12-13 02:00:40,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071492464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:40,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:40,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637266171] [2022-12-13 02:00:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:40,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:40,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:40,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:40,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:40,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:40,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:40,222 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:40,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:40,222 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:40,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:40,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:40,223 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:40,223 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:40,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:40,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:40,224 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:40,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:40,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,226 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:40,227 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:40,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:40,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:40,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:40,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:40,342 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:40,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:40,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1011 [2022-12-13 02:00:40,342 INFO L420 AbstractCegarLoop]: === Iteration 1013 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:40,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash -178850909, now seen corresponding path program 1 times [2022-12-13 02:00:40,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:40,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74815842] [2022-12-13 02:00:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:40,403 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 02:00:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:40,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74815842] [2022-12-13 02:00:40,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74815842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:40,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:40,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943276023] [2022-12-13 02:00:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:40,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:40,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:40,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:40,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:40,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:40,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:40,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:40,449 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:40,449 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:40,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:40,450 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:40,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:40,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:40,451 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:40,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:40,451 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:40,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:40,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:40,452 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:40,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:40,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,463 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:40,463 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:40,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:40,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:40,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:40,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:40,588 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:40,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:40,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:40,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1012 [2022-12-13 02:00:40,589 INFO L420 AbstractCegarLoop]: === Iteration 1014 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:40,589 INFO L85 PathProgramCache]: Analyzing trace with hash -121592607, now seen corresponding path program 1 times [2022-12-13 02:00:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566409603] [2022-12-13 02:00:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:40,650 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 02:00:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:40,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566409603] [2022-12-13 02:00:40,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566409603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:40,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:40,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003222960] [2022-12-13 02:00:40,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:40,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:40,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:40,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:40,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:40,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:40,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:40,704 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:40,704 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:40,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:40,705 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:40,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:40,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:40,705 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:40,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:40,706 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,706 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:40,706 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:40,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:40,706 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:40,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:40,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,709 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:40,709 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:40,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:40,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:40,836 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:40,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:40,837 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:40,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:40,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:40,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1013 [2022-12-13 02:00:40,837 INFO L420 AbstractCegarLoop]: === Iteration 1015 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:40,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:40,837 INFO L85 PathProgramCache]: Analyzing trace with hash -64334305, now seen corresponding path program 1 times [2022-12-13 02:00:40,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:40,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203040025] [2022-12-13 02:00:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:40,890 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 02:00:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:40,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203040025] [2022-12-13 02:00:40,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203040025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:40,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:40,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:40,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616537488] [2022-12-13 02:00:40,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:40,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:40,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:40,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:40,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:40,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:40,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:40,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:40,938 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:40,938 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:40,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:40,939 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:40,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:40,939 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:40,939 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:40,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:40,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:40,940 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,940 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:40,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:40,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:40,940 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:40,941 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:40,941 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:40,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,943 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:40,943 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:40,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:40,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:40,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:41,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:41,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:41,065 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:41,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:41,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:41,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1014 [2022-12-13 02:00:41,065 INFO L420 AbstractCegarLoop]: === Iteration 1016 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:41,065 INFO L85 PathProgramCache]: Analyzing trace with hash -7076003, now seen corresponding path program 1 times [2022-12-13 02:00:41,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:41,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424704437] [2022-12-13 02:00:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:41,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:41,117 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 02:00:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424704437] [2022-12-13 02:00:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424704437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:41,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:41,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448709974] [2022-12-13 02:00:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:41,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:41,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:41,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:41,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:41,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:41,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:41,163 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:41,163 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:41,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 485 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:41,164 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:41,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:41,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:41,165 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:41,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:41,165 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,165 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:41,166 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:41,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:41,166 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:41,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:41,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,169 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:41,169 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:41,169 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,169 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:41,285 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:41,286 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:41,286 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:41,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,286 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:41,286 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:41,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1015 [2022-12-13 02:00:41,286 INFO L420 AbstractCegarLoop]: === Iteration 1017 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash 50182299, now seen corresponding path program 1 times [2022-12-13 02:00:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:41,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063216756] [2022-12-13 02:00:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:41,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:41,340 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 02:00:41,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:41,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063216756] [2022-12-13 02:00:41,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063216756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:41,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:41,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62836624] [2022-12-13 02:00:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:41,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:41,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:41,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:41,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:41,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:41,393 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:41,393 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:41,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:41,394 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:41,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:41,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:41,394 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:41,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:41,395 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,395 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:41,395 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:41,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:41,395 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:41,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:41,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,398 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:41,398 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:41,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:41,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:41,518 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:41,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:41,518 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:41,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:41,519 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:41,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1016 [2022-12-13 02:00:41,519 INFO L420 AbstractCegarLoop]: === Iteration 1018 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash 107440601, now seen corresponding path program 1 times [2022-12-13 02:00:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642017885] [2022-12-13 02:00:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:41,570 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 02:00:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:41,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642017885] [2022-12-13 02:00:41,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642017885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:41,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:41,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199113787] [2022-12-13 02:00:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:41,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:41,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:41,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:41,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:41,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:41,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:41,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:41,627 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:41,627 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:41,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:41,628 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:41,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:41,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:41,628 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:41,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:41,629 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:41,629 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:41,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:41,629 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:41,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:41,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,632 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:41,632 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:41,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:41,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:41,749 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:41,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:41,750 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:41,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:41,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:41,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1017 [2022-12-13 02:00:41,750 INFO L420 AbstractCegarLoop]: === Iteration 1019 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash 164698903, now seen corresponding path program 1 times [2022-12-13 02:00:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:41,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311657911] [2022-12-13 02:00:41,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:41,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:41,803 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 02:00:41,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:41,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311657911] [2022-12-13 02:00:41,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311657911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:41,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:41,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761603485] [2022-12-13 02:00:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:41,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:41,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:41,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:41,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:41,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:41,858 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:41,858 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:41,858 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:41,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:41,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:41,859 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:41,859 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:41,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:41,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:41,860 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,860 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:41,860 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:41,860 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:41,860 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:41,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:41,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:41,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,863 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:41,863 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:41,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:41,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:41,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:41,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:41,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:41,995 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:41,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:41,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:41,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:41,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1018 [2022-12-13 02:00:41,995 INFO L420 AbstractCegarLoop]: === Iteration 1020 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:41,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:41,995 INFO L85 PathProgramCache]: Analyzing trace with hash 221957205, now seen corresponding path program 1 times [2022-12-13 02:00:41,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:41,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922872785] [2022-12-13 02:00:41,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:41,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:42,052 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 02:00:42,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:42,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922872785] [2022-12-13 02:00:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922872785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:42,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:42,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215075075] [2022-12-13 02:00:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:42,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:42,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:42,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:42,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:42,114 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:42,114 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:42,114 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:42,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:42,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:42,115 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:42,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:42,116 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:42,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:42,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:42,116 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:42,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:42,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,120 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:42,120 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:42,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:42,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:42,254 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:42,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:42,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:42,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:42,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:42,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1019 [2022-12-13 02:00:42,256 INFO L420 AbstractCegarLoop]: === Iteration 1021 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:42,256 INFO L85 PathProgramCache]: Analyzing trace with hash 279215507, now seen corresponding path program 1 times [2022-12-13 02:00:42,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:42,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691822556] [2022-12-13 02:00:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:42,312 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 02:00:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:42,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691822556] [2022-12-13 02:00:42,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691822556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:42,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:42,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943228117] [2022-12-13 02:00:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:42,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:42,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:42,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:42,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:42,365 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:42,366 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:42,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:42,366 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:42,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:42,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:42,367 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:42,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:42,367 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,368 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:42,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:42,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:42,368 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:42,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:42,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,371 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:42,371 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:42,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:42,371 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:42,504 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:42,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:42,505 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:42,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:42,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1020 [2022-12-13 02:00:42,505 INFO L420 AbstractCegarLoop]: === Iteration 1022 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:42,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash 336473809, now seen corresponding path program 1 times [2022-12-13 02:00:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:42,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357052688] [2022-12-13 02:00:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:42,569 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 02:00:42,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:42,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357052688] [2022-12-13 02:00:42,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357052688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:42,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:42,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911032099] [2022-12-13 02:00:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:42,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:42,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:42,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:42,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:42,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:42,631 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:42,631 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:42,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:42,632 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:42,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:42,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:42,632 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:42,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:42,633 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:42,633 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:42,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:42,633 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:42,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:42,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,636 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:42,636 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:42,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:42,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:42,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:42,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:42,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:42,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:42,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:42,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1021 [2022-12-13 02:00:42,770 INFO L420 AbstractCegarLoop]: === Iteration 1023 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash 393732111, now seen corresponding path program 1 times [2022-12-13 02:00:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:42,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933179902] [2022-12-13 02:00:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:42,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 02:00:42,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:42,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933179902] [2022-12-13 02:00:42,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933179902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:42,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:42,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625656782] [2022-12-13 02:00:42,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:42,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:42,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:42,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:42,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:42,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:42,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:42,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:42,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:42,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:42,889 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:42,889 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:42,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:42,889 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:42,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:42,890 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:42,890 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:42,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:42,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:42,891 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:42,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:42,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:42,891 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:42,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:42,891 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:42,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,894 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:42,894 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:42,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:42,894 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:42,894 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:43,026 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:43,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:43,027 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:43,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:43,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:43,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1022 [2022-12-13 02:00:43,028 INFO L420 AbstractCegarLoop]: === Iteration 1024 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 450990413, now seen corresponding path program 1 times [2022-12-13 02:00:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563734625] [2022-12-13 02:00:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:43,094 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 02:00:43,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:43,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563734625] [2022-12-13 02:00:43,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563734625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:43,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:43,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:43,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496826594] [2022-12-13 02:00:43,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:43,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:43,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:43,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:43,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:43,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:43,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:43,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:43,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:43,162 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:43,162 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:43,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:43,163 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:43,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:43,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:43,163 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:43,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:43,164 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,164 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:43,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:43,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:43,164 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,165 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:43,165 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:43,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,167 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:43,167 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:43,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:43,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:43,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:43,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:00:43,304 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:43,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:43,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:43,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1023 [2022-12-13 02:00:43,305 INFO L420 AbstractCegarLoop]: === Iteration 1025 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash 508248715, now seen corresponding path program 1 times [2022-12-13 02:00:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:43,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352415795] [2022-12-13 02:00:43,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:43,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:43,378 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 02:00:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:43,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352415795] [2022-12-13 02:00:43,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352415795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:43,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:43,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897656100] [2022-12-13 02:00:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:43,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:43,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:43,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:43,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:43,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:43,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:43,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:43,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:43,439 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:43,439 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:43,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:43,440 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:43,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:43,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:43,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:43,440 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:43,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:43,441 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:43,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:43,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:43,442 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,442 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:43,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:43,442 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,444 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:43,445 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:43,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:43,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:43,576 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:43,577 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:43,577 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:43,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:43,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1024 [2022-12-13 02:00:43,577 INFO L420 AbstractCegarLoop]: === Iteration 1026 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:43,577 INFO L85 PathProgramCache]: Analyzing trace with hash 565507017, now seen corresponding path program 1 times [2022-12-13 02:00:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:43,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870404840] [2022-12-13 02:00:43,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:43,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:43,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:43,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870404840] [2022-12-13 02:00:43,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870404840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:43,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:43,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:43,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112902340] [2022-12-13 02:00:43,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:43,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:43,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:43,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:43,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:43,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:43,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:43,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:43,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:43,695 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:43,695 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:43,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:43,696 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:43,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:43,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:43,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:43,696 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:43,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:43,697 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:43,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:43,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:43,697 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:43,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:43,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,700 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:43,700 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:43,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:43,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:43,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:43,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:43,834 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:43,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:43,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:43,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1025 [2022-12-13 02:00:43,834 INFO L420 AbstractCegarLoop]: === Iteration 1027 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 622765319, now seen corresponding path program 1 times [2022-12-13 02:00:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:43,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553052880] [2022-12-13 02:00:43,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:43,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:43,890 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 02:00:43,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:43,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553052880] [2022-12-13 02:00:43,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553052880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:43,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:43,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:43,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531699562] [2022-12-13 02:00:43,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:43,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:43,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:43,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:43,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:43,891 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:43,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:43,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:43,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:43,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:43,933 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:43,933 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:43,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:43,934 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:43,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:43,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:43,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:43,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:43,934 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:43,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:43,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:43,935 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:43,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:43,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:43,935 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:43,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:43,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:43,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:43,939 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:43,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:43,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:43,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:44,076 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:44,077 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:00:44,077 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:44,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:44,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:44,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1026 [2022-12-13 02:00:44,077 INFO L420 AbstractCegarLoop]: === Iteration 1028 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:44,077 INFO L85 PathProgramCache]: Analyzing trace with hash 680023621, now seen corresponding path program 1 times [2022-12-13 02:00:44,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:44,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347912056] [2022-12-13 02:00:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:44,129 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 02:00:44,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:44,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347912056] [2022-12-13 02:00:44,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347912056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:44,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:44,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:44,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480053912] [2022-12-13 02:00:44,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:44,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:44,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:44,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:44,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:44,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:44,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:44,175 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:44,175 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:44,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:44,176 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:44,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:44,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:44,176 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:44,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:44,177 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:44,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:44,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:44,177 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:44,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:44,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,180 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:44,180 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:44,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:44,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:44,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:44,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:44,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:44,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:44,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:44,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1027 [2022-12-13 02:00:44,302 INFO L420 AbstractCegarLoop]: === Iteration 1029 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash 737281923, now seen corresponding path program 1 times [2022-12-13 02:00:44,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:44,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944832504] [2022-12-13 02:00:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:44,354 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 02:00:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:44,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944832504] [2022-12-13 02:00:44,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944832504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:44,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:44,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532718408] [2022-12-13 02:00:44,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:44,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:44,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:44,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:44,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:44,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:44,399 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:44,399 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:44,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:44,400 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:44,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:44,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:44,400 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:44,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:44,401 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:44,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:44,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:44,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:44,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:44,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,404 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:44,404 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:44,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:44,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:44,520 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:44,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:44,520 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:44,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:44,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:44,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1028 [2022-12-13 02:00:44,520 INFO L420 AbstractCegarLoop]: === Iteration 1030 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:44,521 INFO L85 PathProgramCache]: Analyzing trace with hash 794540225, now seen corresponding path program 1 times [2022-12-13 02:00:44,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:44,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902320909] [2022-12-13 02:00:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:44,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:44,572 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 02:00:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902320909] [2022-12-13 02:00:44,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902320909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:44,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:44,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973631382] [2022-12-13 02:00:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:44,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:44,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:44,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:44,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:44,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:44,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:44,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:44,624 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:44,624 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:44,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:44,625 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:44,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:44,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:44,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:44,625 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:44,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:44,626 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,626 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:44,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:44,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:44,626 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:44,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:44,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,629 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:44,629 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:44,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:44,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:44,748 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:44,748 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:44,748 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:44,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:44,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:44,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1029 [2022-12-13 02:00:44,749 INFO L420 AbstractCegarLoop]: === Iteration 1031 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:44,749 INFO L85 PathProgramCache]: Analyzing trace with hash 851798527, now seen corresponding path program 1 times [2022-12-13 02:00:44,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:44,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844446651] [2022-12-13 02:00:44,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:44,815 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 02:00:44,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:44,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844446651] [2022-12-13 02:00:44,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844446651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:44,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:44,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:44,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165828364] [2022-12-13 02:00:44,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:44,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:44,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:44,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:44,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:44,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:44,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:44,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:44,878 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:44,878 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:44,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:44,879 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:44,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:44,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:44,879 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:44,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:44,880 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,880 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:44,880 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:44,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:44,880 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:44,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:44,881 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:44,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,883 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:44,883 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:44,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:44,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:44,884 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:45,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:45,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:45,017 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:45,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:45,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:45,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1030 [2022-12-13 02:00:45,017 INFO L420 AbstractCegarLoop]: === Iteration 1032 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:45,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:45,017 INFO L85 PathProgramCache]: Analyzing trace with hash 909056829, now seen corresponding path program 1 times [2022-12-13 02:00:45,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:45,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755208415] [2022-12-13 02:00:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:45,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:45,083 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 02:00:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:45,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755208415] [2022-12-13 02:00:45,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755208415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:45,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:45,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:45,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360402708] [2022-12-13 02:00:45,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:45,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:45,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:45,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:45,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:45,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:45,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:45,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:45,145 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:45,146 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:45,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:45,146 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:45,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:45,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:45,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:45,147 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:45,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:45,148 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:45,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:45,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:45,148 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:45,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:45,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,151 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:45,151 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:45,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:45,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:45,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:45,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:45,284 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:45,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:45,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:45,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1031 [2022-12-13 02:00:45,284 INFO L420 AbstractCegarLoop]: === Iteration 1033 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:45,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash 966315131, now seen corresponding path program 1 times [2022-12-13 02:00:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:45,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125931607] [2022-12-13 02:00:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:45,342 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 02:00:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:45,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125931607] [2022-12-13 02:00:45,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125931607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:45,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:45,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169323551] [2022-12-13 02:00:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:45,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:45,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:45,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:45,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:45,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:45,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:45,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:45,394 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:45,394 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:45,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:45,395 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:45,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:45,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:45,395 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:45,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:45,397 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,397 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:45,397 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:45,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:45,397 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,397 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:45,397 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:45,397 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,400 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:45,401 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:45,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:45,401 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,401 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:45,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:45,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:45,534 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:45,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:45,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:45,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1032 [2022-12-13 02:00:45,534 INFO L420 AbstractCegarLoop]: === Iteration 1034 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1023573433, now seen corresponding path program 1 times [2022-12-13 02:00:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:45,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110143511] [2022-12-13 02:00:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:45,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:45,608 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 02:00:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:45,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110143511] [2022-12-13 02:00:45,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110143511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:45,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:45,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771207630] [2022-12-13 02:00:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:45,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:45,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:45,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:45,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:45,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:45,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:45,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:45,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:45,661 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:45,661 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:45,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:45,661 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:45,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:45,662 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:45,662 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:45,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:45,663 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,663 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:45,663 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:45,663 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:45,663 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:45,663 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:45,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,666 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:45,666 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:45,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:45,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:45,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:45,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:45,799 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:45,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:45,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:45,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1033 [2022-12-13 02:00:45,799 INFO L420 AbstractCegarLoop]: === Iteration 1035 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:45,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:45,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1080831735, now seen corresponding path program 1 times [2022-12-13 02:00:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:45,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039887837] [2022-12-13 02:00:45,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:45,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:45,861 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 02:00:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:45,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039887837] [2022-12-13 02:00:45,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039887837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:45,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:45,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:45,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245642306] [2022-12-13 02:00:45,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:45,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:45,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:45,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:45,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:45,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:45,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:45,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:45,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:45,914 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:45,914 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:45,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:45,915 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:45,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:45,915 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:45,915 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:45,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:45,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:45,916 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,916 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:45,916 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:45,916 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:45,916 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,916 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:45,916 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:45,917 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:45,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,919 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:45,919 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:45,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:45,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:45,919 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:46,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:46,050 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:46,050 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:46,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:46,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1034 [2022-12-13 02:00:46,050 INFO L420 AbstractCegarLoop]: === Iteration 1036 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:46,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1138090037, now seen corresponding path program 1 times [2022-12-13 02:00:46,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:46,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207185889] [2022-12-13 02:00:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:46,106 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 02:00:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:46,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207185889] [2022-12-13 02:00:46,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207185889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:46,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:46,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:46,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980651660] [2022-12-13 02:00:46,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:46,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:46,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:46,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:46,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:46,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:46,167 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:46,167 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:46,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:46,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:46,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:46,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:46,168 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:46,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:46,169 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:46,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:46,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:46,169 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:46,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:46,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,172 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:46,172 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:46,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:46,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:46,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:46,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:46,290 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:46,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:46,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:46,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1035 [2022-12-13 02:00:46,290 INFO L420 AbstractCegarLoop]: === Iteration 1037 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1195348339, now seen corresponding path program 1 times [2022-12-13 02:00:46,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:46,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2568320] [2022-12-13 02:00:46,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:46,353 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 02:00:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2568320] [2022-12-13 02:00:46,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2568320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:46,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:46,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719879614] [2022-12-13 02:00:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:46,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:46,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:46,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:46,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:46,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:46,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:46,404 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:46,404 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:46,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:46,405 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:46,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:46,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:46,405 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:46,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:46,406 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:46,406 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:46,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:46,406 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,406 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:46,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:46,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,409 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:46,409 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:46,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:46,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:46,531 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:46,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:46,532 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:46,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:46,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:46,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1036 [2022-12-13 02:00:46,533 INFO L420 AbstractCegarLoop]: === Iteration 1038 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:46,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1252606641, now seen corresponding path program 1 times [2022-12-13 02:00:46,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976230061] [2022-12-13 02:00:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:46,588 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 02:00:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:46,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976230061] [2022-12-13 02:00:46,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976230061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:46,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:46,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:46,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406552557] [2022-12-13 02:00:46,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:46,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:46,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:46,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:46,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:46,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:46,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:46,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:46,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:46,641 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:46,641 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:46,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:46,642 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:46,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:46,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:46,643 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:46,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:46,643 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:46,644 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:46,644 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:46,644 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:46,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:46,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,647 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:46,647 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:46,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:46,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:46,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:46,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:46,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:46,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:46,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:46,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1037 [2022-12-13 02:00:46,782 INFO L420 AbstractCegarLoop]: === Iteration 1039 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1309864943, now seen corresponding path program 1 times [2022-12-13 02:00:46,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:46,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728662173] [2022-12-13 02:00:46,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728662173] [2022-12-13 02:00:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728662173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:46,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:46,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:46,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257811092] [2022-12-13 02:00:46,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:46,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:46,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:46,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:46,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:46,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:46,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:46,907 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:46,907 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:46,908 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:46,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:46,908 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:46,908 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:46,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:46,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:46,909 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:46,909 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:46,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:46,909 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,909 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:46,909 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:46,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:46,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,912 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:46,912 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:46,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:46,912 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:46,912 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:47,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:47,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:47,045 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:47,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:47,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:47,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1038 [2022-12-13 02:00:47,045 INFO L420 AbstractCegarLoop]: === Iteration 1040 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1367123245, now seen corresponding path program 1 times [2022-12-13 02:00:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661876377] [2022-12-13 02:00:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:47,098 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 02:00:47,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:47,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661876377] [2022-12-13 02:00:47,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661876377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:47,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:47,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:47,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325596409] [2022-12-13 02:00:47,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:47,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:47,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:47,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:47,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:47,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:47,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:47,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:47,151 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:47,151 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:47,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:47,152 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:47,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:47,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:47,152 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:47,153 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,153 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:47,153 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:47,153 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:47,153 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:47,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:47,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,156 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:47,156 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:47,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:47,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:47,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:47,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:00:47,283 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:47,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:47,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:47,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1039 [2022-12-13 02:00:47,283 INFO L420 AbstractCegarLoop]: === Iteration 1041 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:47,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1424381547, now seen corresponding path program 1 times [2022-12-13 02:00:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:47,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636125832] [2022-12-13 02:00:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:47,338 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 02:00:47,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:47,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636125832] [2022-12-13 02:00:47,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636125832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:47,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:47,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127771563] [2022-12-13 02:00:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:47,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:47,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:47,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:47,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:47,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:47,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:47,383 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:47,383 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:47,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:47,383 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:47,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:47,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:47,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:47,384 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:47,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:47,385 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:47,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:47,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:47,385 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:47,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:47,385 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,388 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:47,388 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:47,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:47,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:47,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:47,506 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:47,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:47,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:47,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1040 [2022-12-13 02:00:47,506 INFO L420 AbstractCegarLoop]: === Iteration 1042 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1481639849, now seen corresponding path program 1 times [2022-12-13 02:00:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991490234] [2022-12-13 02:00:47,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:47,557 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 02:00:47,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:47,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991490234] [2022-12-13 02:00:47,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991490234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:47,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:47,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370394637] [2022-12-13 02:00:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:47,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:47,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:47,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:47,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:47,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:47,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:47,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:47,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:47,609 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:47,609 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:47,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:47,609 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:47,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:47,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:47,610 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:47,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:47,611 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:47,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:47,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:47,611 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:47,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:47,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,614 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:47,614 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:47,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:47,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,614 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:47,733 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:47,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:47,734 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:47,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:47,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:47,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1041 [2022-12-13 02:00:47,734 INFO L420 AbstractCegarLoop]: === Iteration 1043 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:47,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:47,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1538898151, now seen corresponding path program 1 times [2022-12-13 02:00:47,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:47,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100465325] [2022-12-13 02:00:47,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:47,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:47,794 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 02:00:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:47,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100465325] [2022-12-13 02:00:47,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100465325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:47,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:47,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:47,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540002053] [2022-12-13 02:00:47,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:47,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:47,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:47,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:47,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:47,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:47,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:47,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:47,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:47,839 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:47,839 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:47,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:47,839 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:47,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:47,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:47,840 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:47,840 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:47,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:47,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:47,841 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,841 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:47,841 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:47,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:47,841 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:47,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:47,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:47,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,844 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:47,844 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:47,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:47,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:47,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:47,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:47,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:47,961 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:47,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:47,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:47,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:47,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1042 [2022-12-13 02:00:47,961 INFO L420 AbstractCegarLoop]: === Iteration 1044 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:47,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1596156453, now seen corresponding path program 1 times [2022-12-13 02:00:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:47,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921739417] [2022-12-13 02:00:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:47,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:48,012 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 02:00:48,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:48,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921739417] [2022-12-13 02:00:48,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921739417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:48,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:48,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:48,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140127398] [2022-12-13 02:00:48,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:48,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:48,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:48,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:48,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:48,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:48,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:48,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:48,063 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:48,063 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:48,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:48,064 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:48,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:48,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:48,064 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:48,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:48,065 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:48,065 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:48,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:48,065 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:48,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:48,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,068 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:48,068 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:48,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:48,185 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:48,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:48,185 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:48,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:48,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:48,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1043 [2022-12-13 02:00:48,186 INFO L420 AbstractCegarLoop]: === Iteration 1045 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:48,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1653414755, now seen corresponding path program 1 times [2022-12-13 02:00:48,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:48,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017649436] [2022-12-13 02:00:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:48,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:48,249 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 02:00:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:48,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017649436] [2022-12-13 02:00:48,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017649436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:48,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:48,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724586022] [2022-12-13 02:00:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:48,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:48,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:48,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:48,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:48,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:48,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:48,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:48,303 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:48,303 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:48,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:48,304 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:48,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:48,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:48,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:48,305 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:48,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:48,306 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:48,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:48,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:48,306 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:48,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:48,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,309 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:48,309 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:48,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:48,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,309 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:48,440 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:48,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:48,441 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:48,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:48,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:48,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1044 [2022-12-13 02:00:48,441 INFO L420 AbstractCegarLoop]: === Iteration 1046 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:48,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1710673057, now seen corresponding path program 1 times [2022-12-13 02:00:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:48,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055185861] [2022-12-13 02:00:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:48,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:48,508 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 02:00:48,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:48,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055185861] [2022-12-13 02:00:48,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055185861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:48,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:48,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:48,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293082094] [2022-12-13 02:00:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:48,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:48,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:48,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:48,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:48,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:48,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:48,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:48,558 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:48,558 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:48,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:48,559 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:48,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:48,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:48,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:48,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:48,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:48,560 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:48,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:48,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:48,561 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:48,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:48,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:48,564 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:48,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:48,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:48,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:48,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:48,696 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:48,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:48,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:48,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1045 [2022-12-13 02:00:48,697 INFO L420 AbstractCegarLoop]: === Iteration 1047 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:48,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:48,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1767931359, now seen corresponding path program 1 times [2022-12-13 02:00:48,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:48,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030011260] [2022-12-13 02:00:48,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:48,761 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 02:00:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:48,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030011260] [2022-12-13 02:00:48,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030011260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:48,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:48,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848794782] [2022-12-13 02:00:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:48,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:48,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:48,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:48,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:48,818 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:48,818 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:48,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:48,819 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:48,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:48,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:48,819 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:48,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:48,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:48,820 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:48,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:48,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:48,820 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:48,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:48,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:48,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,823 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:48,823 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:48,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:48,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:48,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:48,938 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:48,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:48,939 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:48,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:48,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:48,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1046 [2022-12-13 02:00:48,939 INFO L420 AbstractCegarLoop]: === Iteration 1048 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1825189661, now seen corresponding path program 1 times [2022-12-13 02:00:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:48,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073467752] [2022-12-13 02:00:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:48,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073467752] [2022-12-13 02:00:48,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073467752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:48,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:48,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:48,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427391132] [2022-12-13 02:00:48,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:48,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:48,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:48,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:48,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:48,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:48,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:48,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:48,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:48,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:49,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:49,043 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:49,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:49,043 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:49,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:49,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:49,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:49,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:49,045 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:49,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:49,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:49,045 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:49,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:49,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,048 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:49,048 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:49,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:49,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:49,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:49,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:49,176 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:49,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:49,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:49,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1047 [2022-12-13 02:00:49,176 INFO L420 AbstractCegarLoop]: === Iteration 1049 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:49,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1882447963, now seen corresponding path program 1 times [2022-12-13 02:00:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:49,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070720341] [2022-12-13 02:00:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:49,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:49,228 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 02:00:49,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:49,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070720341] [2022-12-13 02:00:49,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070720341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:49,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:49,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:49,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584574961] [2022-12-13 02:00:49,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:49,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:49,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:49,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:49,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:49,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:49,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:49,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:49,280 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:49,280 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:49,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:49,280 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:49,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:49,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:49,281 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:49,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:49,282 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:49,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:49,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:49,282 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:49,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:49,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,285 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:49,285 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:49,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:49,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:49,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:49,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:49,404 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:49,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:49,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1048 [2022-12-13 02:00:49,404 INFO L420 AbstractCegarLoop]: === Iteration 1050 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1939706265, now seen corresponding path program 1 times [2022-12-13 02:00:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974034250] [2022-12-13 02:00:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:49,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:49,463 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 02:00:49,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:49,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974034250] [2022-12-13 02:00:49,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974034250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:49,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:49,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131661662] [2022-12-13 02:00:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:49,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:49,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:49,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:49,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:49,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:49,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:49,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:49,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:49,516 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:49,516 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:49,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:49,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:49,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:49,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:49,518 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:49,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:49,518 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:49,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:49,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:49,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:49,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:49,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:49,522 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:49,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:49,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:49,639 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:49,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:49,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:49,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:49,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:49,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1049 [2022-12-13 02:00:49,639 INFO L420 AbstractCegarLoop]: === Iteration 1051 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1996964567, now seen corresponding path program 1 times [2022-12-13 02:00:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:49,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457970606] [2022-12-13 02:00:49,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:49,692 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 02:00:49,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:49,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457970606] [2022-12-13 02:00:49,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457970606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:49,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:49,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382954286] [2022-12-13 02:00:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:49,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:49,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:49,693 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:49,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:49,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:49,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:49,743 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:49,743 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:49,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:49,744 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:49,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:49,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:49,744 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:49,744 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:49,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:49,745 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,745 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:49,745 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:49,745 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:49,745 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:49,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:49,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,748 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:49,748 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:49,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:49,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:49,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:49,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:49,863 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:49,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:49,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1050 [2022-12-13 02:00:49,864 INFO L420 AbstractCegarLoop]: === Iteration 1052 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:49,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2054222869, now seen corresponding path program 1 times [2022-12-13 02:00:49,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:49,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307385626] [2022-12-13 02:00:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:49,918 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 02:00:49,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:49,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307385626] [2022-12-13 02:00:49,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307385626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:49,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:49,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:49,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097248897] [2022-12-13 02:00:49,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:49,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:49,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:49,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:49,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:49,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:49,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:49,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:49,971 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:49,971 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:49,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:49,972 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:49,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:49,972 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:49,972 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:49,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:49,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:49,973 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:49,973 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:49,973 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:49,973 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:49,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:49,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:49,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,976 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:49,976 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:49,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:49,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:49,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:50,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:50,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:50,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:50,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:50,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:50,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1051 [2022-12-13 02:00:50,108 INFO L420 AbstractCegarLoop]: === Iteration 1053 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:50,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:50,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2111481171, now seen corresponding path program 1 times [2022-12-13 02:00:50,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:50,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024583004] [2022-12-13 02:00:50,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:50,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:50,165 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 02:00:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:50,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024583004] [2022-12-13 02:00:50,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024583004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:50,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:50,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:50,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233774936] [2022-12-13 02:00:50,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:50,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:50,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:50,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:50,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:50,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:50,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:50,226 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:50,226 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:50,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:50,227 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:50,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:50,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:50,227 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:50,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:50,229 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:50,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:50,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:50,229 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:50,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:50,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,233 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:50,233 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:50,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:50,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:50,355 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:50,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:00:50,356 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:50,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:50,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:50,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1052 [2022-12-13 02:00:50,356 INFO L420 AbstractCegarLoop]: === Iteration 1054 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2126227823, now seen corresponding path program 1 times [2022-12-13 02:00:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:50,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036390198] [2022-12-13 02:00:50,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:50,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:50,409 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 02:00:50,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:50,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036390198] [2022-12-13 02:00:50,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036390198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:50,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:50,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263522973] [2022-12-13 02:00:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:50,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:50,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:50,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:50,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:50,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:50,454 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:50,454 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:50,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:50,454 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:50,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:50,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:50,455 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:50,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:50,464 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:50,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:50,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:50,464 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:50,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:50,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:50,467 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:50,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:50,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:50,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:50,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:50,585 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:50,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:50,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:50,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1053 [2022-12-13 02:00:50,585 INFO L420 AbstractCegarLoop]: === Iteration 1055 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:50,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash -2068969521, now seen corresponding path program 1 times [2022-12-13 02:00:50,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:50,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396095188] [2022-12-13 02:00:50,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:50,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:50,638 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 02:00:50,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:50,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396095188] [2022-12-13 02:00:50,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396095188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:50,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:50,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:50,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571458478] [2022-12-13 02:00:50,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:50,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:50,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:50,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:50,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:50,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:50,690 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:50,691 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:50,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:50,691 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:50,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:50,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:50,692 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:50,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:50,692 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,692 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:50,693 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:50,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:50,693 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:50,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:50,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,695 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:50,696 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:50,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:50,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:50,813 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:50,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:50,814 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:50,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:50,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:50,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1054 [2022-12-13 02:00:50,814 INFO L420 AbstractCegarLoop]: === Iteration 1056 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2011711219, now seen corresponding path program 1 times [2022-12-13 02:00:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:50,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594277340] [2022-12-13 02:00:50,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:50,865 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 02:00:50,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:50,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594277340] [2022-12-13 02:00:50,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594277340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:50,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:50,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:50,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766047984] [2022-12-13 02:00:50,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:50,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:50,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:50,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:50,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:50,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:50,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:50,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:50,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:50,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:50,910 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:50,911 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:50,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:50,911 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:50,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:50,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:50,912 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:50,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:50,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:50,912 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:50,913 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:50,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:50,913 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,913 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:50,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:50,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:50,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,916 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:50,916 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:50,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:50,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:50,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:51,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:51,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:00:51,046 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:51,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:51,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:51,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1055 [2022-12-13 02:00:51,046 INFO L420 AbstractCegarLoop]: === Iteration 1057 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:51,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1954452917, now seen corresponding path program 1 times [2022-12-13 02:00:51,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:51,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058675656] [2022-12-13 02:00:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:51,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:51,099 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 02:00:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:51,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058675656] [2022-12-13 02:00:51,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058675656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:51,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:51,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115277254] [2022-12-13 02:00:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:51,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:51,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:51,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:51,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:51,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:51,161 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:51,161 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:51,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:51,162 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:51,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:51,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:51,163 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:51,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:51,164 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,164 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:51,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:51,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:51,164 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:51,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:51,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,167 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:51,167 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:51,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:51,167 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,167 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:51,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:51,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:51,300 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:51,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:51,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1056 [2022-12-13 02:00:51,300 INFO L420 AbstractCegarLoop]: === Iteration 1058 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:51,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1897194615, now seen corresponding path program 1 times [2022-12-13 02:00:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:51,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761027603] [2022-12-13 02:00:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:51,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:51,358 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 02:00:51,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761027603] [2022-12-13 02:00:51,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761027603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:51,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:51,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:51,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716517601] [2022-12-13 02:00:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:51,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:51,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:51,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:51,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:51,359 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:51,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:51,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:51,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:51,420 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:51,421 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:51,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:51,421 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:51,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:51,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:51,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:51,422 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:51,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:51,423 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:51,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:51,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:51,423 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:51,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:51,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,426 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:51,426 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:51,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:51,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:51,561 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:51,562 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:00:51,562 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:51,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,562 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:51,562 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:51,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1057 [2022-12-13 02:00:51,562 INFO L420 AbstractCegarLoop]: === Iteration 1059 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:51,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1839936313, now seen corresponding path program 1 times [2022-12-13 02:00:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:51,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214536255] [2022-12-13 02:00:51,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:51,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:51,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:51,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214536255] [2022-12-13 02:00:51,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214536255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:51,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:51,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:51,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751071028] [2022-12-13 02:00:51,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:51,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:51,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:51,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:51,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:51,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:51,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:51,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:51,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:51,684 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:51,684 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:51,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:51,685 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:51,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:51,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:51,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:51,685 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:51,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:51,686 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:51,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:51,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:51,686 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:51,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:51,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,689 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:51,689 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:51,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:51,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:51,821 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:51,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:00:51,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:51,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:51,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:51,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1058 [2022-12-13 02:00:51,822 INFO L420 AbstractCegarLoop]: === Iteration 1060 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:51,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1782678011, now seen corresponding path program 1 times [2022-12-13 02:00:51,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:51,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543975336] [2022-12-13 02:00:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:51,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:51,877 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 02:00:51,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:51,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543975336] [2022-12-13 02:00:51,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543975336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:51,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:51,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:51,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174574648] [2022-12-13 02:00:51,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:51,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:51,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:51,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:51,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:51,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:51,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:51,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:51,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:51,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:51,929 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:51,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:51,930 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:51,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:51,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:51,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:51,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:51,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:51,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:51,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:51,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:51,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:51,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:51,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:51,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,934 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:51,934 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:51,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:51,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:51,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:52,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:52,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:52,051 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:52,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:52,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:52,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1059 [2022-12-13 02:00:52,051 INFO L420 AbstractCegarLoop]: === Iteration 1061 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:52,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1725419709, now seen corresponding path program 1 times [2022-12-13 02:00:52,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:52,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394222238] [2022-12-13 02:00:52,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:52,105 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 02:00:52,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:52,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394222238] [2022-12-13 02:00:52,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394222238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:52,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:52,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:52,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542399636] [2022-12-13 02:00:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:52,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:52,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:52,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:52,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:52,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:52,152 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:52,153 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:52,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:52,153 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:52,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:52,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:52,154 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:52,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:52,154 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:52,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:52,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:52,155 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:52,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:52,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,158 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:52,158 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:52,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:52,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:52,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:52,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:52,273 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:52,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:52,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:52,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1060 [2022-12-13 02:00:52,274 INFO L420 AbstractCegarLoop]: === Iteration 1062 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:52,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1668161407, now seen corresponding path program 1 times [2022-12-13 02:00:52,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:52,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769554468] [2022-12-13 02:00:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:52,324 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 02:00:52,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769554468] [2022-12-13 02:00:52,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769554468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:52,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:52,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207416939] [2022-12-13 02:00:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:52,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:52,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:52,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:52,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:52,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:52,376 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:52,376 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:52,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:52,377 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:52,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:52,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:52,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:52,377 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:52,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:52,378 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:52,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:52,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:52,378 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:52,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:52,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,381 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:52,381 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:52,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:52,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:52,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:00:52,499 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:52,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:52,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:52,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1061 [2022-12-13 02:00:52,500 INFO L420 AbstractCegarLoop]: === Iteration 1063 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1610903105, now seen corresponding path program 1 times [2022-12-13 02:00:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:52,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280529749] [2022-12-13 02:00:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:52,552 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 02:00:52,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:52,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280529749] [2022-12-13 02:00:52,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280529749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:52,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:52,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:52,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146389675] [2022-12-13 02:00:52,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:52,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:52,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:52,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:52,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:52,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:52,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:52,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:52,597 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:52,597 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:52,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:52,597 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:52,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:52,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:52,598 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:52,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:52,599 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:52,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:52,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:52,599 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:52,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:52,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,602 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:52,602 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:52,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:52,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:52,717 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:52,718 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:52,718 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:52,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:52,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:52,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1062 [2022-12-13 02:00:52,718 INFO L420 AbstractCegarLoop]: === Iteration 1064 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:52,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1553644803, now seen corresponding path program 1 times [2022-12-13 02:00:52,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:52,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230220080] [2022-12-13 02:00:52,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:52,768 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 02:00:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:52,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230220080] [2022-12-13 02:00:52,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230220080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:52,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:52,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010805433] [2022-12-13 02:00:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:52,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:52,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:52,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:52,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:52,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:52,820 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:52,820 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:52,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:52,820 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:52,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:52,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:52,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:52,821 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:52,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:52,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:52,822 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,822 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:52,822 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:52,822 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:52,822 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,822 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:52,822 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:52,822 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:52,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,825 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:52,825 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:52,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:52,825 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:52,825 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:52,940 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:52,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:52,941 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:52,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:52,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:52,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:52,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1063 [2022-12-13 02:00:52,942 INFO L420 AbstractCegarLoop]: === Iteration 1065 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1496386501, now seen corresponding path program 1 times [2022-12-13 02:00:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:52,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092658524] [2022-12-13 02:00:52,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:52,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:52,999 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 02:00:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:52,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092658524] [2022-12-13 02:00:52,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092658524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:52,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:52,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699706906] [2022-12-13 02:00:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:52,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:53,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:53,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:53,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:53,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:53,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:53,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:53,052 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:53,052 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:53,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:53,053 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:53,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:53,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:53,053 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:53,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:53,054 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:53,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:53,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:53,054 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:53,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:53,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,057 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:53,057 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:53,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:53,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:53,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:53,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:00:53,182 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:53,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:53,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:53,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1064 [2022-12-13 02:00:53,182 INFO L420 AbstractCegarLoop]: === Iteration 1066 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:53,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1439128199, now seen corresponding path program 1 times [2022-12-13 02:00:53,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:53,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430368720] [2022-12-13 02:00:53,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:53,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:00:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:53,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430368720] [2022-12-13 02:00:53,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430368720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:53,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:53,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:53,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222093489] [2022-12-13 02:00:53,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:53,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:53,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:53,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:53,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:53,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:53,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:53,299 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:53,299 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:53,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:53,300 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:53,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:53,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:53,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:53,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:53,300 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:53,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:53,301 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,301 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:53,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:53,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:53,301 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:53,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:53,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,304 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:53,304 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:53,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:53,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:53,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:53,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:53,423 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:53,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:53,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:53,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1065 [2022-12-13 02:00:53,424 INFO L420 AbstractCegarLoop]: === Iteration 1067 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1381869897, now seen corresponding path program 1 times [2022-12-13 02:00:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:53,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424436831] [2022-12-13 02:00:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:53,479 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 02:00:53,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:53,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424436831] [2022-12-13 02:00:53,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424436831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:53,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:53,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:53,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498333566] [2022-12-13 02:00:53,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:53,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:53,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:53,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:53,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:53,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:53,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:53,531 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:53,531 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:53,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:53,532 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:53,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:53,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:53,532 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:53,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:53,533 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,533 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:53,533 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:53,533 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:53,533 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:53,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:53,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,536 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:53,536 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:53,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:53,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:53,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:53,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:53,651 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:53,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:53,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:53,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1066 [2022-12-13 02:00:53,651 INFO L420 AbstractCegarLoop]: === Iteration 1068 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1324611595, now seen corresponding path program 1 times [2022-12-13 02:00:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:53,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200594516] [2022-12-13 02:00:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:53,703 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 02:00:53,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:53,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200594516] [2022-12-13 02:00:53,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200594516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:53,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:53,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545308249] [2022-12-13 02:00:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:53,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:53,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:53,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:53,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:53,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:53,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:53,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:53,746 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:53,746 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:53,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:53,747 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:53,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:53,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:53,747 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:53,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:53,748 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:53,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:53,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:53,748 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:53,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:53,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,751 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:53,751 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:53,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:53,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:53,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:53,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:53,866 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:53,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,866 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:53,866 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:53,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1067 [2022-12-13 02:00:53,866 INFO L420 AbstractCegarLoop]: === Iteration 1069 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:53,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1267353293, now seen corresponding path program 1 times [2022-12-13 02:00:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:53,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960990715] [2022-12-13 02:00:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:53,919 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 02:00:53,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:53,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960990715] [2022-12-13 02:00:53,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960990715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:53,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:53,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558432714] [2022-12-13 02:00:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:53,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:53,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:53,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:53,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:53,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:53,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:53,969 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:53,969 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:53,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:53,970 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:53,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:53,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:53,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:53,970 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:53,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:53,971 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:53,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:53,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:53,971 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:53,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:53,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:53,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,974 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:53,974 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:53,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:53,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:53,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:54,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:54,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:54,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:54,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:54,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:54,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1068 [2022-12-13 02:00:54,108 INFO L420 AbstractCegarLoop]: === Iteration 1070 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:54,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:54,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1210094991, now seen corresponding path program 1 times [2022-12-13 02:00:54,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:54,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757228292] [2022-12-13 02:00:54,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:54,166 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 02:00:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:54,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757228292] [2022-12-13 02:00:54,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757228292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:54,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:54,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539302496] [2022-12-13 02:00:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:54,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:54,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:54,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:54,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:54,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:54,215 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:54,215 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:54,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:54,215 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:54,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:54,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:54,216 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:54,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:54,217 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:54,217 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:54,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:54,217 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,217 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:54,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:54,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,220 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:54,220 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:54,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:54,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:54,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:54,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:54,339 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:54,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:54,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:54,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1069 [2022-12-13 02:00:54,339 INFO L420 AbstractCegarLoop]: === Iteration 1071 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:54,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1152836689, now seen corresponding path program 1 times [2022-12-13 02:00:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:54,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490429635] [2022-12-13 02:00:54,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:54,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:54,406 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 02:00:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:54,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490429635] [2022-12-13 02:00:54,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490429635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:54,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:54,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331281219] [2022-12-13 02:00:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:54,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:54,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:54,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:54,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:54,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:54,455 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:54,455 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:54,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:54,455 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:54,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:54,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:54,456 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:54,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:54,457 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:54,457 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:54,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:54,457 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:54,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:54,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,460 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:54,460 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:54,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:54,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:54,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:54,588 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:54,589 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:54,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:54,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:54,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1070 [2022-12-13 02:00:54,589 INFO L420 AbstractCegarLoop]: === Iteration 1072 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1095578387, now seen corresponding path program 1 times [2022-12-13 02:00:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507335070] [2022-12-13 02:00:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:54,675 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 02:00:54,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:54,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507335070] [2022-12-13 02:00:54,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507335070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:54,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:54,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905103825] [2022-12-13 02:00:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:54,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:54,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:54,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:54,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:54,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:54,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:54,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:54,728 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:54,728 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:54,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:54,728 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:54,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:54,729 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:54,729 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:54,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:54,730 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,730 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:54,730 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:54,730 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:54,731 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:54,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:54,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,734 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:54,734 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:54,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:54,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:54,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:54,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:54,850 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:54,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:54,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:54,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1071 [2022-12-13 02:00:54,850 INFO L420 AbstractCegarLoop]: === Iteration 1073 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:54,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:54,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1038320085, now seen corresponding path program 1 times [2022-12-13 02:00:54,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:54,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381012659] [2022-12-13 02:00:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:54,901 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 02:00:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:54,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381012659] [2022-12-13 02:00:54,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381012659] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:54,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:54,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986179770] [2022-12-13 02:00:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:54,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:54,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:54,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:54,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:54,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:54,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:54,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:54,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:54,943 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:54,944 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:54,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:54,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:54,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:54,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:54,945 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:54,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:54,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:54,945 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:54,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:54,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:54,946 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:54,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:54,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:54,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,949 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:54,949 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:54,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:54,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:54,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:55,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:55,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:00:55,071 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:55,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:55,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:55,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1072 [2022-12-13 02:00:55,071 INFO L420 AbstractCegarLoop]: === Iteration 1074 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:55,071 INFO L85 PathProgramCache]: Analyzing trace with hash -981061783, now seen corresponding path program 1 times [2022-12-13 02:00:55,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:55,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329680943] [2022-12-13 02:00:55,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:55,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:55,122 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 02:00:55,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:55,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329680943] [2022-12-13 02:00:55,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329680943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:55,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:55,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117087785] [2022-12-13 02:00:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:55,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:55,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:55,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:55,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:55,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:55,175 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:55,175 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:55,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:55,176 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:55,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:55,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:55,176 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:55,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:55,177 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:55,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:55,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:55,177 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:55,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:55,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,180 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:55,180 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:55,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:55,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:55,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:55,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:00:55,299 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:55,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:55,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:55,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1073 [2022-12-13 02:00:55,300 INFO L420 AbstractCegarLoop]: === Iteration 1075 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -923803481, now seen corresponding path program 1 times [2022-12-13 02:00:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303304177] [2022-12-13 02:00:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:55,354 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 02:00:55,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:55,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303304177] [2022-12-13 02:00:55,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303304177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:55,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:55,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655486640] [2022-12-13 02:00:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:55,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:55,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:55,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:55,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:55,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:55,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:55,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:55,404 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:55,405 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:55,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:55,405 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:55,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:55,406 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:55,406 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:55,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:55,406 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,406 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:55,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:55,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:55,407 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:55,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:55,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,409 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:55,409 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:55,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:55,410 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,410 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:55,524 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:55,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:55,525 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:55,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,525 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:55,525 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:55,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1074 [2022-12-13 02:00:55,525 INFO L420 AbstractCegarLoop]: === Iteration 1076 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash -866545179, now seen corresponding path program 1 times [2022-12-13 02:00:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:55,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667861255] [2022-12-13 02:00:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:55,590 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 02:00:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:55,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667861255] [2022-12-13 02:00:55,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667861255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:55,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:55,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767041897] [2022-12-13 02:00:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:55,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:55,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:55,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:55,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:55,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:55,644 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:55,644 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:55,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:55,645 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:55,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:55,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:55,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:55,649 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:55,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:55,650 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:55,650 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:55,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:55,650 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:55,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:55,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,653 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:55,653 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:55,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:55,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:55,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:55,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:00:55,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:55,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:55,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1075 [2022-12-13 02:00:55,770 INFO L420 AbstractCegarLoop]: === Iteration 1077 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -809286877, now seen corresponding path program 1 times [2022-12-13 02:00:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:55,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613591675] [2022-12-13 02:00:55,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:55,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:55,830 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 02:00:55,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:55,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613591675] [2022-12-13 02:00:55,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613591675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:55,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:55,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:55,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671080001] [2022-12-13 02:00:55,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:55,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:55,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:55,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:55,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:55,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:55,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:55,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:55,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:55,875 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:55,876 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:55,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:55,876 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:55,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:55,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:55,877 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:55,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:55,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:55,878 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:55,878 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:55,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:55,878 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:55,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:55,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:55,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,881 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:55,881 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:55,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:55,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:55,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:56,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:56,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:00:56,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:56,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:56,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1076 [2022-12-13 02:00:56,012 INFO L420 AbstractCegarLoop]: === Iteration 1078 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:56,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:56,013 INFO L85 PathProgramCache]: Analyzing trace with hash -752028575, now seen corresponding path program 1 times [2022-12-13 02:00:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:56,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439776723] [2022-12-13 02:00:56,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:56,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:56,079 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 02:00:56,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:56,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439776723] [2022-12-13 02:00:56,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439776723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:56,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:56,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540079590] [2022-12-13 02:00:56,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:56,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:56,080 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:56,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:56,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:56,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:56,132 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:56,133 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:56,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:56,133 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:56,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:56,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:56,134 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:56,135 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:56,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:56,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:56,135 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,135 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:56,135 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:56,135 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,138 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:56,138 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:56,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:56,138 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,138 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:56,257 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:56,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:00:56,258 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:56,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:56,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:56,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1077 [2022-12-13 02:00:56,258 INFO L420 AbstractCegarLoop]: === Iteration 1079 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -694770273, now seen corresponding path program 1 times [2022-12-13 02:00:56,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304036581] [2022-12-13 02:00:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:56,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:56,312 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 02:00:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:56,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304036581] [2022-12-13 02:00:56,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304036581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:56,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:56,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669236753] [2022-12-13 02:00:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:56,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:56,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:56,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:56,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:56,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:56,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:56,362 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:56,362 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:56,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:56,363 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:56,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:56,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:56,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:56,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:56,363 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:56,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:56,364 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:56,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:56,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:56,364 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:56,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:56,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,367 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:56,367 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:56,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:56,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:56,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:56,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:56,482 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:56,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,482 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:56,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:56,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1078 [2022-12-13 02:00:56,483 INFO L420 AbstractCegarLoop]: === Iteration 1080 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:56,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash -637511971, now seen corresponding path program 1 times [2022-12-13 02:00:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:56,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661074802] [2022-12-13 02:00:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:56,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 02:00:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:56,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661074802] [2022-12-13 02:00:56,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661074802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:56,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:56,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529878633] [2022-12-13 02:00:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:56,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:56,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:56,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:56,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:56,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:56,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:56,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:56,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:56,577 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:56,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:56,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:56,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:56,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:56,578 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:56,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:56,579 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:56,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:56,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:56,579 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:56,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:56,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:56,582 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:56,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:56,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:56,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:56,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:00:56,697 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:56,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:56,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:56,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1079 [2022-12-13 02:00:56,697 INFO L420 AbstractCegarLoop]: === Iteration 1081 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:56,697 INFO L85 PathProgramCache]: Analyzing trace with hash -580253669, now seen corresponding path program 1 times [2022-12-13 02:00:56,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:56,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830936901] [2022-12-13 02:00:56,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:56,748 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 02:00:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830936901] [2022-12-13 02:00:56,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830936901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:56,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:56,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:56,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093558667] [2022-12-13 02:00:56,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:56,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:56,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:56,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:56,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:56,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:56,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:56,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:56,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:56,799 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:56,799 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:56,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:56,799 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:56,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:56,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:56,800 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:56,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:56,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:56,801 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,801 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:56,801 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:56,801 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:56,801 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,801 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:56,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:56,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,804 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:56,804 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:56,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:56,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:56,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:56,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:56,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 02:00:56,976 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:56,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:56,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:56,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:56,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1080 [2022-12-13 02:00:56,977 INFO L420 AbstractCegarLoop]: === Iteration 1082 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -522995367, now seen corresponding path program 1 times [2022-12-13 02:00:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:56,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678489300] [2022-12-13 02:00:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:57,046 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 02:00:57,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:57,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678489300] [2022-12-13 02:00:57,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678489300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:57,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:57,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:57,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918494044] [2022-12-13 02:00:57,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:57,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:57,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:57,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:57,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:57,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:57,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:57,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:57,101 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:57,101 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:57,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:57,102 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:57,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:57,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:57,102 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:57,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:57,103 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:57,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:57,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:57,103 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:57,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:57,104 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,106 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:57,106 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:57,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:57,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:57,239 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:57,240 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:57,240 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:57,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:57,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:57,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1081 [2022-12-13 02:00:57,240 INFO L420 AbstractCegarLoop]: === Iteration 1083 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:57,240 INFO L85 PathProgramCache]: Analyzing trace with hash -465737065, now seen corresponding path program 1 times [2022-12-13 02:00:57,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:57,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44753859] [2022-12-13 02:00:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:57,298 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 02:00:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:57,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44753859] [2022-12-13 02:00:57,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44753859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:57,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:57,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:57,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593330631] [2022-12-13 02:00:57,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:57,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:57,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:57,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:57,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:57,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:57,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:57,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:57,360 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:57,360 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:57,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:57,361 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:57,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:57,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:57,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:57,361 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:57,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:57,362 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:57,362 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:57,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:57,362 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:57,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:57,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,365 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:57,365 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:57,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:57,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:57,506 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:57,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:00:57,507 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:57,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:57,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:57,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1082 [2022-12-13 02:00:57,507 INFO L420 AbstractCegarLoop]: === Iteration 1084 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:57,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -408478763, now seen corresponding path program 1 times [2022-12-13 02:00:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:57,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313403719] [2022-12-13 02:00:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:57,565 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 02:00:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:57,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313403719] [2022-12-13 02:00:57,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313403719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:57,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:57,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064033628] [2022-12-13 02:00:57,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:57,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:57,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:57,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:57,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:57,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:57,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:57,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:57,618 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:57,618 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:57,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:57,619 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:57,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:57,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:57,620 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:57,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:57,621 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:57,621 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:57,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:57,621 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:57,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:57,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,625 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:57,625 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:57,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:57,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:57,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:57,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:00:57,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:57,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:57,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:57,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1083 [2022-12-13 02:00:57,759 INFO L420 AbstractCegarLoop]: === Iteration 1085 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:57,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -351220461, now seen corresponding path program 1 times [2022-12-13 02:00:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:57,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464610510] [2022-12-13 02:00:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:57,821 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 02:00:57,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:57,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464610510] [2022-12-13 02:00:57,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464610510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:57,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:57,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:57,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461095035] [2022-12-13 02:00:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:57,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:57,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:57,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:57,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:57,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:57,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:57,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:57,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:57,883 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:57,883 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:57,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:57,884 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:57,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:57,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:57,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:57,884 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:57,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:57,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:57,885 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:57,885 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:57,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:57,885 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:57,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:57,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:57,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,888 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:57,888 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:57,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:57,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:57,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:58,021 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:58,021 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:58,021 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:58,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,021 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:58,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:58,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1084 [2022-12-13 02:00:58,022 INFO L420 AbstractCegarLoop]: === Iteration 1086 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:58,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -293962159, now seen corresponding path program 1 times [2022-12-13 02:00:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:58,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888508352] [2022-12-13 02:00:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:58,088 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 02:00:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:58,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888508352] [2022-12-13 02:00:58,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888508352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:58,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:58,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873449937] [2022-12-13 02:00:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:58,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:58,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:58,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:58,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:58,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:58,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:58,140 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:58,141 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:58,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:58,141 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:58,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:58,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:58,142 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:58,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:58,142 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,143 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:58,143 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:58,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:58,143 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:58,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:58,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,146 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:58,146 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:58,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:58,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:58,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:58,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:58,277 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:58,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:58,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:58,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1085 [2022-12-13 02:00:58,278 INFO L420 AbstractCegarLoop]: === Iteration 1087 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash -236703857, now seen corresponding path program 1 times [2022-12-13 02:00:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763921357] [2022-12-13 02:00:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:58,334 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 02:00:58,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:58,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763921357] [2022-12-13 02:00:58,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763921357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:58,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:58,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451473087] [2022-12-13 02:00:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:58,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:58,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:58,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:58,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:58,396 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:58,396 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:58,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:58,397 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:58,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:58,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:58,398 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:58,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:58,398 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,399 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:58,399 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:58,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:58,399 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,399 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:58,399 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:58,399 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,402 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:58,402 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:58,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:58,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:58,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:58,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:58,535 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:58,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,535 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:58,535 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:58,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1086 [2022-12-13 02:00:58,535 INFO L420 AbstractCegarLoop]: === Iteration 1088 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -179445555, now seen corresponding path program 1 times [2022-12-13 02:00:58,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:58,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557079670] [2022-12-13 02:00:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:58,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:58,602 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 02:00:58,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:58,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557079670] [2022-12-13 02:00:58,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557079670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:58,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:58,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:58,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605760023] [2022-12-13 02:00:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:58,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:58,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:58,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:58,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:58,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:58,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:58,655 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:58,655 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:58,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:58,656 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:58,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:58,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:58,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:58,656 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:58,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:58,657 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:58,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:58,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:58,658 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:58,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:58,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,662 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:58,662 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:58,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:58,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:58,794 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:58,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:00:58,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:58,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:58,795 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1087 [2022-12-13 02:00:58,795 INFO L420 AbstractCegarLoop]: === Iteration 1089 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:58,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -122187253, now seen corresponding path program 1 times [2022-12-13 02:00:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:58,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123039109] [2022-12-13 02:00:58,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:58,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 02:00:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:58,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123039109] [2022-12-13 02:00:58,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123039109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:58,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:58,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176647148] [2022-12-13 02:00:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:58,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:58,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:58,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:58,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:58,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:58,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:58,904 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:58,904 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:58,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:58,904 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:58,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:58,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:58,905 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:58,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:58,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:58,906 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:58,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:58,906 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:58,907 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:58,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:58,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:58,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,911 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:58,911 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:58,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:58,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:58,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:59,043 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:59,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:00:59,043 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:59,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:59,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1088 [2022-12-13 02:00:59,044 INFO L420 AbstractCegarLoop]: === Iteration 1090 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:59,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -64928951, now seen corresponding path program 1 times [2022-12-13 02:00:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599565098] [2022-12-13 02:00:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:59,106 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 02:00:59,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:59,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599565098] [2022-12-13 02:00:59,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599565098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:59,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:59,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:59,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992572217] [2022-12-13 02:00:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:59,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:59,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:59,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:59,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:59,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:59,169 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:59,169 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:59,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:59,169 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:59,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:59,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:59,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:59,170 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:59,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:59,171 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:59,171 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:59,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:59,171 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:59,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:59,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,174 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:59,174 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:59,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:59,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:59,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:59,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:00:59,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:59,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:59,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:59,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1089 [2022-12-13 02:00:59,306 INFO L420 AbstractCegarLoop]: === Iteration 1091 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:59,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash -7670649, now seen corresponding path program 1 times [2022-12-13 02:00:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:59,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479490807] [2022-12-13 02:00:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:59,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 02:00:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479490807] [2022-12-13 02:00:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479490807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:59,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:59,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:59,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327021592] [2022-12-13 02:00:59,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:59,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:59,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:59,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:59,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:59,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:59,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:59,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:59,415 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:59,415 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:59,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:59,416 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:59,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:59,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:59,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:59,416 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:59,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:59,418 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,418 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:59,418 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:59,418 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:59,418 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:59,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:59,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,422 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:59,422 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:59,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:59,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:59,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:59,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:00:59,549 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:59,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:59,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:59,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1090 [2022-12-13 02:00:59,549 INFO L420 AbstractCegarLoop]: === Iteration 1092 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash 49587653, now seen corresponding path program 1 times [2022-12-13 02:00:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:59,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072724805] [2022-12-13 02:00:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:59,603 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 02:00:59,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:59,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072724805] [2022-12-13 02:00:59,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072724805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:59,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:59,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:59,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116441487] [2022-12-13 02:00:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:59,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:59,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:59,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:59,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:59,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:59,648 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:59,648 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:00:59,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:59,648 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:59,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:59,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:59,649 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:59,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:59,650 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:59,650 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:59,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:59,650 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:59,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:59,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,653 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:59,653 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:00:59,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:59,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:59,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:59,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:00:59,774 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:59,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:59,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:59,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1091 [2022-12-13 02:00:59,774 INFO L420 AbstractCegarLoop]: === Iteration 1093 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:59,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash 106845955, now seen corresponding path program 1 times [2022-12-13 02:00:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781285857] [2022-12-13 02:00:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:00:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:00:59,829 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 02:00:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:00:59,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781285857] [2022-12-13 02:00:59,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781285857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:00:59,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:00:59,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:00:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922927499] [2022-12-13 02:00:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:00:59,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:00:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:00:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:00:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:00:59,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:00:59,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:00:59,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:00:59,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:00:59,874 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:00:59,874 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:00:59,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:00:59,874 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:00:59,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:00:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:00:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:00:59,875 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:00:59,875 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:00:59,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:00:59,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:00:59,876 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,876 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:00:59,876 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:00:59,876 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:00:59,876 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:00:59,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:00:59,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:00:59,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,879 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:00:59,879 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:00:59,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:00:59,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:00:59,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:00:59,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:00:59,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:00:59,995 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:00:59,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:00:59,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:00:59,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:00:59,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1092 [2022-12-13 02:00:59,995 INFO L420 AbstractCegarLoop]: === Iteration 1094 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:00:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:00:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 164104257, now seen corresponding path program 1 times [2022-12-13 02:00:59,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:00:59,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547141017] [2022-12-13 02:00:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:00:59,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:00,049 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 02:01:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:00,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547141017] [2022-12-13 02:01:00,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547141017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:00,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:00,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517940013] [2022-12-13 02:01:00,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:00,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:00,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:00,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:00,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:00,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:00,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:00,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:00,099 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:00,099 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:00,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:00,100 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:00,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:00,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:00,100 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:00,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:00,101 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:00,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:00,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:00,101 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:00,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:00,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,104 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:00,104 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:00,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:00,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:00,218 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:00,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:01:00,218 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:00,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,219 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:00,219 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:00,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1093 [2022-12-13 02:01:00,219 INFO L420 AbstractCegarLoop]: === Iteration 1095 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:00,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 221362559, now seen corresponding path program 1 times [2022-12-13 02:01:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:00,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633294115] [2022-12-13 02:01:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:00,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:00,270 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 02:01:00,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:00,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633294115] [2022-12-13 02:01:00,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633294115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:00,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:00,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:00,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045799033] [2022-12-13 02:01:00,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:00,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:00,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:00,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:00,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:00,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:00,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:00,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:00,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:00,331 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:00,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:00,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:00,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:00,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:00,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:00,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:00,333 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:00,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:00,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:00,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:00,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:00,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:00,336 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:00,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:00,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:00,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:00,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:00,452 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:00,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:00,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:00,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1094 [2022-12-13 02:01:00,452 INFO L420 AbstractCegarLoop]: === Iteration 1096 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash 278620861, now seen corresponding path program 1 times [2022-12-13 02:01:00,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:00,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346008181] [2022-12-13 02:01:00,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:00,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:00,503 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 02:01:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:00,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346008181] [2022-12-13 02:01:00,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346008181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:00,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:00,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183805474] [2022-12-13 02:01:00,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:00,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:00,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:00,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:00,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:00,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:00,547 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:00,547 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:00,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:00,548 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:00,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:00,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:00,548 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:00,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:00,549 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:00,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:00,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:00,550 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:00,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:00,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,554 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:00,554 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:00,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:00,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:00,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:00,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:00,685 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:00,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:00,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:00,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1095 [2022-12-13 02:01:00,685 INFO L420 AbstractCegarLoop]: === Iteration 1097 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:00,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash 335879163, now seen corresponding path program 1 times [2022-12-13 02:01:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:00,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70808462] [2022-12-13 02:01:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:00,746 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 02:01:00,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:00,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70808462] [2022-12-13 02:01:00,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70808462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:00,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:00,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227202154] [2022-12-13 02:01:00,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:00,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:00,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:00,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:00,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:00,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:00,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:00,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:00,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:00,793 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:00,794 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:00,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:00,794 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:00,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:00,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:00,795 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:00,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:00,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:00,795 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:00,796 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:00,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:00,796 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:00,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:00,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:00,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,798 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:00,799 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:00,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:00,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:00,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:00,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:00,934 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:00,934 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:00,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:00,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:00,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1096 [2022-12-13 02:01:00,935 INFO L420 AbstractCegarLoop]: === Iteration 1098 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash 393137465, now seen corresponding path program 1 times [2022-12-13 02:01:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:00,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166813513] [2022-12-13 02:01:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:00,998 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 02:01:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:00,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166813513] [2022-12-13 02:01:00,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166813513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:00,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:00,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346274621] [2022-12-13 02:01:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:00,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:00,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:00,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:00,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:00,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:00,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:00,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:00,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:01,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:01,043 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:01,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:01,044 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:01,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:01,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:01,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:01,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:01,045 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:01,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:01,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:01,046 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:01,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:01,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,049 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:01,049 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:01,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:01,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:01,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:01,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:01,166 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:01,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:01,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:01,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1097 [2022-12-13 02:01:01,166 INFO L420 AbstractCegarLoop]: === Iteration 1099 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 450395767, now seen corresponding path program 1 times [2022-12-13 02:01:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:01,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735454042] [2022-12-13 02:01:01,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:01,226 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 02:01:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:01,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735454042] [2022-12-13 02:01:01,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735454042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:01,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:01,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828377105] [2022-12-13 02:01:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:01,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:01,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:01,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:01,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:01,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:01,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:01,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:01,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:01,274 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:01,275 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:01,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:01,275 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:01,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:01,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:01,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:01,276 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:01,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:01,277 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:01,277 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:01,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:01,277 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:01,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:01,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,280 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:01,280 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:01,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:01,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:01,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:01,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:01,399 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:01,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:01,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:01,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1098 [2022-12-13 02:01:01,399 INFO L420 AbstractCegarLoop]: === Iteration 1100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash 507654069, now seen corresponding path program 1 times [2022-12-13 02:01:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:01,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143042034] [2022-12-13 02:01:01,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:01,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:01,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:01,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143042034] [2022-12-13 02:01:01,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143042034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:01,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:01,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:01,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883305608] [2022-12-13 02:01:01,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:01,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:01,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:01,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:01,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:01,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:01,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:01,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:01,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:01,502 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:01,502 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:01,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:01,502 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:01,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:01,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:01,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:01,503 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:01,504 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:01,504 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:01,504 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:01,504 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,504 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:01,504 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:01,504 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,507 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:01,507 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:01,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:01,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,507 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:01,624 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:01,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:01,625 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:01,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:01,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:01,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1099 [2022-12-13 02:01:01,625 INFO L420 AbstractCegarLoop]: === Iteration 1101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:01,625 INFO L85 PathProgramCache]: Analyzing trace with hash 564912371, now seen corresponding path program 1 times [2022-12-13 02:01:01,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:01,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197118951] [2022-12-13 02:01:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:01,698 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 02:01:01,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:01,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197118951] [2022-12-13 02:01:01,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197118951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:01,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:01,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129724692] [2022-12-13 02:01:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:01,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:01,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:01,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:01,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:01,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:01,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:01,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:01,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:01,747 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:01,747 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:01,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:01,748 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:01,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:01,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:01,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:01,748 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:01,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:01,749 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,749 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:01,749 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:01,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:01,750 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:01,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:01,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,753 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:01,753 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:01,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:01,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:01,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:01,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:01,870 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:01,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:01,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:01,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1100 [2022-12-13 02:01:01,870 INFO L420 AbstractCegarLoop]: === Iteration 1102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:01,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash 622170673, now seen corresponding path program 1 times [2022-12-13 02:01:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:01,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276321686] [2022-12-13 02:01:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:01,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:01,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:01,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276321686] [2022-12-13 02:01:01,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276321686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:01,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:01,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130443904] [2022-12-13 02:01:01,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:01,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:01,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:01,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:01,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:01,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:01,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:01,976 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:01,976 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:01,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:01,977 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:01,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:01,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:01,977 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:01,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:01,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:01,978 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:01,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:01,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:01,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:01,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:01,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:01,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,981 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:01,981 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:01,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:01,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:01,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:02,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:02,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:02,100 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:02,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:02,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:02,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1101 [2022-12-13 02:01:02,100 INFO L420 AbstractCegarLoop]: === Iteration 1103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:02,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:02,100 INFO L85 PathProgramCache]: Analyzing trace with hash 679428975, now seen corresponding path program 1 times [2022-12-13 02:01:02,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:02,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199791840] [2022-12-13 02:01:02,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:02,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:02,154 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 02:01:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:02,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199791840] [2022-12-13 02:01:02,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199791840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:02,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:02,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:02,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848161885] [2022-12-13 02:01:02,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:02,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:02,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:02,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:02,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:02,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:02,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,155 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:02,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:02,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:02,200 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:02,200 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:02,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:02,200 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:02,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:02,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:02,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:02,201 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:02,202 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:02,202 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:02,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:02,202 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:02,202 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:02,202 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,205 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:02,205 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:02,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:02,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:02,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:02,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:01:02,325 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:02,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:02,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:02,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1102 [2022-12-13 02:01:02,325 INFO L420 AbstractCegarLoop]: === Iteration 1104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:02,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 736687277, now seen corresponding path program 1 times [2022-12-13 02:01:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:02,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47538508] [2022-12-13 02:01:02,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47538508] [2022-12-13 02:01:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47538508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:02,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:02,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:02,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731178996] [2022-12-13 02:01:02,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:02,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:02,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:02,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:02,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:02,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:02,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:02,421 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:02,422 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:02,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:02,422 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:02,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:02,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:02,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:02,423 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:02,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:02,424 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:02,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:02,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:02,424 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:02,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:02,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,427 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:02,427 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:02,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:02,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:02,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:02,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:01:02,547 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:02,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:02,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:02,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1103 [2022-12-13 02:01:02,547 INFO L420 AbstractCegarLoop]: === Iteration 1105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:02,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash 793945579, now seen corresponding path program 1 times [2022-12-13 02:01:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:02,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070417882] [2022-12-13 02:01:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:02,601 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 02:01:02,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:02,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070417882] [2022-12-13 02:01:02,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070417882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:02,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:02,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:02,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698968815] [2022-12-13 02:01:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:02,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:02,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:02,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:02,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:02,602 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:02,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:02,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:02,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:02,646 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:02,646 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:02,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:02,647 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:02,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:02,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:02,647 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:02,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:02,648 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:02,648 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:02,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:02,648 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:02,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:02,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,651 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:02,651 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:02,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:02,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:02,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:02,770 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:02,770 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:02,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:02,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:02,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1104 [2022-12-13 02:01:02,770 INFO L420 AbstractCegarLoop]: === Iteration 1106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash 851203881, now seen corresponding path program 1 times [2022-12-13 02:01:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:02,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263967728] [2022-12-13 02:01:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:02,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263967728] [2022-12-13 02:01:02,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263967728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:02,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:02,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203085471] [2022-12-13 02:01:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:02,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:02,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:02,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:02,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:02,826 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:02,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:02,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:02,876 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:02,876 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:02,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:02,876 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:02,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:02,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:02,877 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:02,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:02,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:02,878 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:02,878 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:02,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:02,878 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:02,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:02,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:02,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,881 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:02,881 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:02,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:02,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:02,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:02,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:02,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:02,996 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:02,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:02,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:02,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:02,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1105 [2022-12-13 02:01:02,997 INFO L420 AbstractCegarLoop]: === Iteration 1107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:02,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:02,997 INFO L85 PathProgramCache]: Analyzing trace with hash 908462183, now seen corresponding path program 1 times [2022-12-13 02:01:02,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:02,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824067004] [2022-12-13 02:01:02,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:02,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:03,060 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 02:01:03,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:03,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824067004] [2022-12-13 02:01:03,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824067004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:03,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:03,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622567344] [2022-12-13 02:01:03,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:03,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:03,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:03,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:03,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:03,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:03,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:03,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:03,104 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:03,104 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:03,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:03,104 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:03,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:03,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:03,105 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:03,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:03,106 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:03,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:03,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:03,106 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,106 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:03,106 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:03,106 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,109 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:03,109 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:03,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:03,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:03,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:03,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:03,225 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:03,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:03,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:03,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1106 [2022-12-13 02:01:03,225 INFO L420 AbstractCegarLoop]: === Iteration 1108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash 965720485, now seen corresponding path program 1 times [2022-12-13 02:01:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:03,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726228655] [2022-12-13 02:01:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:03,276 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 02:01:03,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:03,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726228655] [2022-12-13 02:01:03,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726228655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:03,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:03,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570680227] [2022-12-13 02:01:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:03,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:03,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:03,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:03,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:03,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:03,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:03,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:03,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:03,320 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:03,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:03,321 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:03,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:03,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:03,321 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:03,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:03,322 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:03,323 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:03,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:03,323 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:03,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:03,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,326 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:03,326 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:03,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:03,326 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:03,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:03,452 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:01:03,452 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:03,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:03,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:03,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1107 [2022-12-13 02:01:03,452 INFO L420 AbstractCegarLoop]: === Iteration 1109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1022978787, now seen corresponding path program 1 times [2022-12-13 02:01:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:03,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539428155] [2022-12-13 02:01:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:03,519 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 02:01:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:03,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539428155] [2022-12-13 02:01:03,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539428155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:03,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:03,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631551406] [2022-12-13 02:01:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:03,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:03,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:03,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:03,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:03,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:03,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:03,575 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:03,575 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:03,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:03,575 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:03,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:03,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:03,576 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:03,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:03,576 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:03,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:03,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:03,577 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:03,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:03,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,580 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:03,580 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:03,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:03,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:03,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:03,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:01:03,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:03,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:03,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:03,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1108 [2022-12-13 02:01:03,726 INFO L420 AbstractCegarLoop]: === Iteration 1110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:03,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:03,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1080237089, now seen corresponding path program 1 times [2022-12-13 02:01:03,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:03,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062788181] [2022-12-13 02:01:03,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:03,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:03,796 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 02:01:03,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062788181] [2022-12-13 02:01:03,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062788181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:03,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:03,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97084176] [2022-12-13 02:01:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:03,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:03,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:03,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:03,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:03,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:03,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:03,849 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:03,849 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:03,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:03,850 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:03,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:03,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:03,851 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:03,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:03,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:03,851 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:03,852 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:03,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:03,852 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:03,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:03,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:03,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,854 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:03,855 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:03,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:03,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:03,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:03,985 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:03,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:03,986 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:03,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:03,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:03,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:03,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1109 [2022-12-13 02:01:03,987 INFO L420 AbstractCegarLoop]: === Iteration 1111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1137495391, now seen corresponding path program 1 times [2022-12-13 02:01:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:03,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012800869] [2022-12-13 02:01:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:04,043 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 02:01:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012800869] [2022-12-13 02:01:04,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012800869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:04,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:04,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530740483] [2022-12-13 02:01:04,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:04,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:04,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:04,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:04,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:04,096 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:04,097 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:04,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:04,097 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:04,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:04,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:04,098 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:04,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:04,099 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:04,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:04,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:04,099 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:04,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:04,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,102 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:04,102 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:04,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:04,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:04,235 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:04,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:04,236 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:04,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:04,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:04,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1110 [2022-12-13 02:01:04,236 INFO L420 AbstractCegarLoop]: === Iteration 1112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1194753693, now seen corresponding path program 1 times [2022-12-13 02:01:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:04,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183531982] [2022-12-13 02:01:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:04,305 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 02:01:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183531982] [2022-12-13 02:01:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183531982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:04,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:04,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:04,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306191107] [2022-12-13 02:01:04,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:04,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:04,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:04,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:04,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:04,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:04,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:04,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:04,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:04,359 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:04,359 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:04,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:04,360 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:04,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:04,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:04,361 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:04,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:04,361 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:04,362 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:04,362 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:04,362 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,362 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:04,362 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:04,362 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,365 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:04,365 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:04,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:04,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:04,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:04,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:04,499 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:04,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:04,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:04,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1111 [2022-12-13 02:01:04,499 INFO L420 AbstractCegarLoop]: === Iteration 1113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:04,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1252011995, now seen corresponding path program 1 times [2022-12-13 02:01:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:04,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533627243] [2022-12-13 02:01:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:04,581 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 02:01:04,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:04,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533627243] [2022-12-13 02:01:04,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533627243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:04,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:04,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:04,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090574881] [2022-12-13 02:01:04,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:04,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:04,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:04,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:04,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:04,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:04,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:04,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:04,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:04,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:04,635 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:04,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:04,635 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:04,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:04,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:04,636 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:04,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:04,637 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:04,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:04,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:04,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:04,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:04,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,640 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:04,640 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:04,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:04,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:04,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:04,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:04,774 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:04,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:04,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:04,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1112 [2022-12-13 02:01:04,775 INFO L420 AbstractCegarLoop]: === Iteration 1114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:04,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1309270297, now seen corresponding path program 1 times [2022-12-13 02:01:04,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:04,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028347853] [2022-12-13 02:01:04,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:04,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:04,834 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 02:01:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028347853] [2022-12-13 02:01:04,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028347853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:04,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:04,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350301552] [2022-12-13 02:01:04,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:04,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:04,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:04,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:04,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:04,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:04,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:04,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:04,896 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:04,896 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:04,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:04,897 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:04,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:04,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:04,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:04,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:04,898 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:04,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:04,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:04,898 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:04,899 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:04,899 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:04,899 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,899 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:04,899 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:04,899 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:04,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,901 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:04,902 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:04,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:04,902 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:04,902 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:05,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:05,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:05,035 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:05,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:05,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:05,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1113 [2022-12-13 02:01:05,035 INFO L420 AbstractCegarLoop]: === Iteration 1115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1366528599, now seen corresponding path program 1 times [2022-12-13 02:01:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:05,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457072663] [2022-12-13 02:01:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:05,100 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 02:01:05,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:05,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457072663] [2022-12-13 02:01:05,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457072663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:05,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:05,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:05,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584948668] [2022-12-13 02:01:05,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:05,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:05,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:05,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:05,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:05,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:05,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:05,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:05,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:05,166 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:05,166 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:05,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:05,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:05,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:05,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:05,167 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:05,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:05,168 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:05,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:05,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:05,168 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:05,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:05,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,171 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:05,171 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:05,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:05,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:05,303 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:05,304 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:05,304 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:05,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:05,304 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:05,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1114 [2022-12-13 02:01:05,304 INFO L420 AbstractCegarLoop]: === Iteration 1116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:05,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1423786901, now seen corresponding path program 1 times [2022-12-13 02:01:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972420689] [2022-12-13 02:01:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:05,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 02:01:05,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972420689] [2022-12-13 02:01:05,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972420689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:05,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:05,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:05,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080952402] [2022-12-13 02:01:05,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:05,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:05,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:05,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:05,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:05,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:05,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:05,429 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:05,429 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:05,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:05,430 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:05,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:05,431 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:05,431 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:05,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:05,432 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:05,432 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:05,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:05,432 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:05,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:05,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,435 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:05,435 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:05,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:05,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:05,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:05,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:05,554 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:05,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:05,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:05,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1115 [2022-12-13 02:01:05,554 INFO L420 AbstractCegarLoop]: === Iteration 1117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:05,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1481045203, now seen corresponding path program 1 times [2022-12-13 02:01:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:05,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57249455] [2022-12-13 02:01:05,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:05,615 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 02:01:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:05,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57249455] [2022-12-13 02:01:05,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57249455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:05,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:05,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165179820] [2022-12-13 02:01:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:05,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:05,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:05,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:05,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:05,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:05,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:05,662 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:05,662 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:05,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:05,663 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:05,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:05,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:05,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:05,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:05,664 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:05,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:05,664 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,664 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:05,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:05,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:05,665 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:05,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:05,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,668 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:05,668 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:05,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:05,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:05,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:05,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:05,786 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:05,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:05,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:05,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1116 [2022-12-13 02:01:05,786 INFO L420 AbstractCegarLoop]: === Iteration 1118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:05,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1538303505, now seen corresponding path program 1 times [2022-12-13 02:01:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:05,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115241607] [2022-12-13 02:01:05,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:05,841 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 02:01:05,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:05,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115241607] [2022-12-13 02:01:05,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115241607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:05,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:05,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200487476] [2022-12-13 02:01:05,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:05,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:05,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:05,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:05,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:05,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:05,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:05,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:05,893 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:05,893 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:05,894 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:05,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:05,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:05,894 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:05,895 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:05,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:05,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:05,895 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,895 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:05,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:05,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:05,896 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:05,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:05,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:05,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,898 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:05,899 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:05,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:05,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:05,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:06,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:06,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:06,030 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:06,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:06,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:06,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1117 [2022-12-13 02:01:06,030 INFO L420 AbstractCegarLoop]: === Iteration 1119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:06,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:06,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1595561807, now seen corresponding path program 1 times [2022-12-13 02:01:06,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025804167] [2022-12-13 02:01:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:06,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:06,082 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 02:01:06,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:06,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025804167] [2022-12-13 02:01:06,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025804167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:06,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:06,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024867073] [2022-12-13 02:01:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:06,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:06,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:06,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:06,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:06,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:06,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:06,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:06,148 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:06,148 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:06,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:06,148 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:06,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:06,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:06,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:06,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:06,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:06,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:06,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:06,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:06,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:06,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,153 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:06,153 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:06,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:06,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:06,275 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:06,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:06,276 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:06,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:06,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:06,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1118 [2022-12-13 02:01:06,276 INFO L420 AbstractCegarLoop]: === Iteration 1120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:06,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1652820109, now seen corresponding path program 1 times [2022-12-13 02:01:06,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:06,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881283572] [2022-12-13 02:01:06,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:06,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:06,337 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 02:01:06,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881283572] [2022-12-13 02:01:06,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881283572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:06,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:06,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:06,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37945307] [2022-12-13 02:01:06,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:06,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:06,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:06,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:06,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:06,338 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:06,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:06,381 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:06,381 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:06,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:06,381 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:06,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:06,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:06,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:06,382 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:06,382 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:06,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:06,383 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,383 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:06,383 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:06,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:06,383 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:06,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:06,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,386 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:06,387 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:06,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:06,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:06,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:06,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:06,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:06,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:06,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:06,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1119 [2022-12-13 02:01:06,501 INFO L420 AbstractCegarLoop]: === Iteration 1121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1710078411, now seen corresponding path program 1 times [2022-12-13 02:01:06,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:06,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957762007] [2022-12-13 02:01:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:06,563 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 02:01:06,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:06,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957762007] [2022-12-13 02:01:06,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957762007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:06,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:06,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580324856] [2022-12-13 02:01:06,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:06,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:06,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:06,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:06,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:06,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:06,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:06,620 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:06,620 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:06,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:06,621 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:06,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:06,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:06,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:06,621 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:06,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:06,622 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,622 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:06,623 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:06,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:06,623 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:06,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:06,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,626 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:06,626 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:06,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:06,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:06,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:06,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:06,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:06,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:06,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:06,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1120 [2022-12-13 02:01:06,759 INFO L420 AbstractCegarLoop]: === Iteration 1122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:06,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1767336713, now seen corresponding path program 1 times [2022-12-13 02:01:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018573321] [2022-12-13 02:01:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:06,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 02:01:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:06,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018573321] [2022-12-13 02:01:06,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018573321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:06,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:06,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:06,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654381051] [2022-12-13 02:01:06,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:06,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:06,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:06,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:06,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:06,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:06,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:06,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:06,875 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:06,875 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:06,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:06,875 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:06,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:06,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:06,876 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:06,876 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:06,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:06,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:06,877 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,877 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:06,877 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:06,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:06,878 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:06,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:06,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:06,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,881 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:06,881 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:06,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:06,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:06,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:07,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:07,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:01:07,005 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:07,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:07,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:07,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1121 [2022-12-13 02:01:07,005 INFO L420 AbstractCegarLoop]: === Iteration 1123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:07,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:07,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1824595015, now seen corresponding path program 1 times [2022-12-13 02:01:07,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:07,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716573542] [2022-12-13 02:01:07,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:07,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:07,060 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 02:01:07,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:07,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716573542] [2022-12-13 02:01:07,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716573542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:07,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:07,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771527100] [2022-12-13 02:01:07,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:07,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:07,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:07,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:07,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:07,061 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:07,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:07,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:07,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:07,110 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:07,110 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:07,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:07,111 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:07,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:07,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:07,112 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:07,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:07,112 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:07,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:07,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:07,113 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:07,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:07,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,116 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:07,116 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:07,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:07,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:07,232 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:07,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:07,233 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:07,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:07,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1122 [2022-12-13 02:01:07,233 INFO L420 AbstractCegarLoop]: === Iteration 1124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:07,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1881853317, now seen corresponding path program 1 times [2022-12-13 02:01:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:07,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134607228] [2022-12-13 02:01:07,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:07,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:07,297 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 02:01:07,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:07,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134607228] [2022-12-13 02:01:07,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134607228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:07,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:07,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334754990] [2022-12-13 02:01:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:07,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:07,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:07,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:07,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:07,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:07,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:07,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:07,360 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:07,361 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:07,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:07,361 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:07,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:07,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:07,361 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:07,362 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:07,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:07,362 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:07,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:07,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:07,363 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:07,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:07,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,365 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:07,366 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:07,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:07,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:07,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:07,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:07,483 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:07,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:07,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:07,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1123 [2022-12-13 02:01:07,483 INFO L420 AbstractCegarLoop]: === Iteration 1125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1939111619, now seen corresponding path program 1 times [2022-12-13 02:01:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136136861] [2022-12-13 02:01:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:07,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 02:01:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136136861] [2022-12-13 02:01:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136136861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:07,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:07,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:07,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814168505] [2022-12-13 02:01:07,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:07,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:07,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:07,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:07,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:07,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:07,585 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:07,585 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:07,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:07,586 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:07,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:07,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:07,587 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:07,587 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:07,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:07,587 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:07,588 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:07,588 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:07,588 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:07,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:07,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,591 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:07,591 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:07,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:07,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:07,706 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:07,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:07,707 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:07,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,707 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:07,707 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:07,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1124 [2022-12-13 02:01:07,707 INFO L420 AbstractCegarLoop]: === Iteration 1126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:07,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1996369921, now seen corresponding path program 1 times [2022-12-13 02:01:07,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:07,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189855969] [2022-12-13 02:01:07,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:07,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:07,758 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 02:01:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:07,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189855969] [2022-12-13 02:01:07,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189855969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:07,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:07,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711190554] [2022-12-13 02:01:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:07,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:07,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:07,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:07,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:07,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:07,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:07,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:07,810 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:07,810 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:07,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:07,811 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:07,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:07,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:07,811 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:07,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:07,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:07,812 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:07,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:07,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:07,812 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:07,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:07,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:07,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,815 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:07,815 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:07,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:07,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:07,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:07,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:07,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:07,949 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:07,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:07,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:07,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:07,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1125 [2022-12-13 02:01:07,949 INFO L420 AbstractCegarLoop]: === Iteration 1127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:07,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2053628223, now seen corresponding path program 1 times [2022-12-13 02:01:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633695913] [2022-12-13 02:01:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:08,000 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 02:01:08,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:08,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633695913] [2022-12-13 02:01:08,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633695913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:08,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:08,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086977985] [2022-12-13 02:01:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:08,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:08,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:08,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:08,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:08,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:08,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:08,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:08,052 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:08,053 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:08,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:08,053 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:08,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:08,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:08,054 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:08,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:08,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:08,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:08,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:08,055 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:08,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:08,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,058 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:08,058 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:08,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:08,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:08,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:08,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:01:08,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:08,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:08,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:08,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1126 [2022-12-13 02:01:08,183 INFO L420 AbstractCegarLoop]: === Iteration 1128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2110886525, now seen corresponding path program 1 times [2022-12-13 02:01:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:08,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671957814] [2022-12-13 02:01:08,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:08,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:08,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:08,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671957814] [2022-12-13 02:01:08,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671957814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:08,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:08,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378457430] [2022-12-13 02:01:08,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:08,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:08,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:08,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:08,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:08,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:08,291 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:08,291 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:08,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:08,292 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:08,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:08,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:08,292 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:08,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:08,293 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:08,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:08,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:08,293 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:08,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:08,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,296 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:08,296 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:08,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:08,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:08,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:08,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:01:08,434 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:08,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:08,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1127 [2022-12-13 02:01:08,434 INFO L420 AbstractCegarLoop]: === Iteration 1129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:08,434 INFO L85 PathProgramCache]: Analyzing trace with hash -2126822469, now seen corresponding path program 1 times [2022-12-13 02:01:08,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:08,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436012780] [2022-12-13 02:01:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:08,497 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 02:01:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:08,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436012780] [2022-12-13 02:01:08,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436012780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:08,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:08,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:08,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322395185] [2022-12-13 02:01:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:08,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:08,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:08,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:08,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:08,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:08,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:08,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:08,554 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:08,554 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:08,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:08,554 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:08,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:08,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:08,555 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:08,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:08,556 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,556 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:08,556 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:08,556 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:08,556 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:08,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:08,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,559 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:08,559 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:08,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:08,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:08,679 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:08,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:01:08,680 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:08,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:08,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:08,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1128 [2022-12-13 02:01:08,680 INFO L420 AbstractCegarLoop]: === Iteration 1130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:08,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:08,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2069564167, now seen corresponding path program 1 times [2022-12-13 02:01:08,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:08,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608263791] [2022-12-13 02:01:08,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:08,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:08,754 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 02:01:08,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:08,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608263791] [2022-12-13 02:01:08,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608263791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:08,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:08,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:08,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855347097] [2022-12-13 02:01:08,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:08,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:08,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:08,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:08,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:08,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:08,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:08,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:08,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:08,806 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:08,806 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:08,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:08,807 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:08,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:08,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:08,807 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:08,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:08,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:08,808 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:08,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:08,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:08,808 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:08,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:08,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:08,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,811 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:08,811 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:08,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:08,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:08,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:08,926 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:08,927 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:08,927 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:08,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:08,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:08,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1129 [2022-12-13 02:01:08,927 INFO L420 AbstractCegarLoop]: === Iteration 1131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:08,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2012305865, now seen corresponding path program 1 times [2022-12-13 02:01:08,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:08,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127833763] [2022-12-13 02:01:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:08,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:08,981 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 02:01:08,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:08,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127833763] [2022-12-13 02:01:08,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127833763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:08,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:08,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877676589] [2022-12-13 02:01:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:08,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:08,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:08,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:08,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:08,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:08,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:09,025 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:09,025 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:09,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:09,026 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:09,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:09,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:09,027 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:09,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:09,027 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:09,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:09,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:09,028 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:09,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:09,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,030 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:09,031 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:09,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:09,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:09,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:09,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:09,147 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:09,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:09,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:09,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1130 [2022-12-13 02:01:09,147 INFO L420 AbstractCegarLoop]: === Iteration 1132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:09,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1955047563, now seen corresponding path program 1 times [2022-12-13 02:01:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:09,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850959179] [2022-12-13 02:01:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:09,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:09,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:09,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850959179] [2022-12-13 02:01:09,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850959179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:09,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:09,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256512245] [2022-12-13 02:01:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:09,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:09,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:09,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:09,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:09,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:09,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:09,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:09,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:09,279 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:09,279 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:09,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:09,280 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:09,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:09,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:09,281 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:09,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:09,281 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:09,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:09,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:09,282 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:09,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:09,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,285 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:09,285 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:09,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:09,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:09,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:09,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:09,419 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:09,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:09,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:09,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1131 [2022-12-13 02:01:09,419 INFO L420 AbstractCegarLoop]: === Iteration 1133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:09,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:09,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1897789261, now seen corresponding path program 1 times [2022-12-13 02:01:09,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:09,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377118346] [2022-12-13 02:01:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:09,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:09,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:09,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377118346] [2022-12-13 02:01:09,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377118346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:09,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:09,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:09,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257050330] [2022-12-13 02:01:09,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:09,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:09,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:09,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:09,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:09,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:09,533 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:09,533 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:09,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:09,534 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:09,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:09,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:09,535 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:09,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:09,536 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:09,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:09,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:09,536 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:09,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:09,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,539 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:09,539 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:09,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:09,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:09,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:09,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:09,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:09,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:09,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:09,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1132 [2022-12-13 02:01:09,674 INFO L420 AbstractCegarLoop]: === Iteration 1134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:09,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:09,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1840530959, now seen corresponding path program 1 times [2022-12-13 02:01:09,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:09,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761653658] [2022-12-13 02:01:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:09,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:09,737 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 02:01:09,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:09,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761653658] [2022-12-13 02:01:09,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761653658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:09,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:09,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:09,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158715722] [2022-12-13 02:01:09,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:09,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:09,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:09,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:09,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:09,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:09,801 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:09,801 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:09,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:09,802 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:09,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:09,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:09,802 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:09,802 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:09,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:09,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:09,803 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,803 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:09,803 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:09,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:09,804 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,804 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:09,804 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:09,804 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:09,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,807 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:09,807 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:09,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:09,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:09,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:09,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:09,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:09,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:09,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:09,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:09,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:09,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1133 [2022-12-13 02:01:09,942 INFO L420 AbstractCegarLoop]: === Iteration 1135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1783272657, now seen corresponding path program 1 times [2022-12-13 02:01:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:09,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870672675] [2022-12-13 02:01:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:10,004 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 02:01:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:10,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870672675] [2022-12-13 02:01:10,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870672675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:10,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:10,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:10,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003755407] [2022-12-13 02:01:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:10,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:10,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:10,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:10,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:10,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:10,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:10,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:10,059 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:10,059 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:10,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:10,060 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:10,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:10,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:10,061 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:10,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:10,063 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:10,063 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:10,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:10,063 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:10,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:10,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,066 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:10,067 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:10,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:10,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:10,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:10,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:10,197 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:10,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:10,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:10,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1134 [2022-12-13 02:01:10,197 INFO L420 AbstractCegarLoop]: === Iteration 1136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:10,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1726014355, now seen corresponding path program 1 times [2022-12-13 02:01:10,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:10,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675291684] [2022-12-13 02:01:10,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:10,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:10,273 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 02:01:10,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:10,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675291684] [2022-12-13 02:01:10,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675291684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:10,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:10,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380852837] [2022-12-13 02:01:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:10,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:10,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:10,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:10,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:10,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:10,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:10,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:10,326 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:10,326 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:10,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:10,327 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:10,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:10,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:10,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:10,328 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:10,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:10,328 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:10,329 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:10,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:10,329 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:10,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:10,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,332 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:10,332 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:10,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:10,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:10,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:10,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:10,463 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:10,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:10,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:10,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1135 [2022-12-13 02:01:10,464 INFO L420 AbstractCegarLoop]: === Iteration 1137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:10,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1668756053, now seen corresponding path program 1 times [2022-12-13 02:01:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:10,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683212770] [2022-12-13 02:01:10,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:10,520 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 02:01:10,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:10,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683212770] [2022-12-13 02:01:10,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683212770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:10,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:10,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984643587] [2022-12-13 02:01:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:10,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:10,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:10,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:10,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:10,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:10,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:10,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:10,582 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:10,582 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:10,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:10,582 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:10,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:10,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:10,583 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:10,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:10,584 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:10,585 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:10,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:10,585 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:10,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:10,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,589 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:10,589 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:10,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:10,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:10,722 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:10,723 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:10,723 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:10,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:10,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:10,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1136 [2022-12-13 02:01:10,723 INFO L420 AbstractCegarLoop]: === Iteration 1138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:10,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1611497751, now seen corresponding path program 1 times [2022-12-13 02:01:10,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:10,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440433904] [2022-12-13 02:01:10,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:10,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:10,782 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 02:01:10,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440433904] [2022-12-13 02:01:10,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440433904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:10,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:10,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:10,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907114635] [2022-12-13 02:01:10,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:10,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:10,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:10,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:10,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:10,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:10,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:10,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:10,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:10,843 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:10,843 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:10,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:10,844 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:10,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:10,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:10,845 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:10,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:10,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:10,845 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,845 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:10,846 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:10,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:10,846 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,846 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:10,846 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:10,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:10,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,849 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:10,849 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:10,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:10,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:10,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:10,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:10,985 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:01:10,985 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:10,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:10,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:10,985 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:10,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1137 [2022-12-13 02:01:10,985 INFO L420 AbstractCegarLoop]: === Iteration 1139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:10,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1554239449, now seen corresponding path program 1 times [2022-12-13 02:01:10,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:10,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49044503] [2022-12-13 02:01:10,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:10,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:11,048 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 02:01:11,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:11,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49044503] [2022-12-13 02:01:11,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49044503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:11,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:11,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:11,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300176783] [2022-12-13 02:01:11,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:11,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:11,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:11,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:11,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:11,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:11,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:11,109 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:11,110 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:11,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:11,110 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:11,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:11,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:11,111 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:11,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:11,112 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:11,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:11,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:11,112 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:11,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:11,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,115 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:11,115 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:11,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:11,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:11,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:11,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:11,234 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:11,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:11,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1138 [2022-12-13 02:01:11,234 INFO L420 AbstractCegarLoop]: === Iteration 1140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1496981147, now seen corresponding path program 1 times [2022-12-13 02:01:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:11,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571081192] [2022-12-13 02:01:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:11,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571081192] [2022-12-13 02:01:11,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571081192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:11,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:11,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:11,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783267585] [2022-12-13 02:01:11,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:11,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:11,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:11,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:11,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:11,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:11,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:11,331 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:11,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:11,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:11,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:11,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:11,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:11,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:11,332 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:11,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:11,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:11,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:11,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:11,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:11,336 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:11,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:11,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:11,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:11,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:11,453 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:11,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:11,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:11,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1139 [2022-12-13 02:01:11,454 INFO L420 AbstractCegarLoop]: === Iteration 1141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:11,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:11,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1439722845, now seen corresponding path program 1 times [2022-12-13 02:01:11,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:11,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365324914] [2022-12-13 02:01:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:11,507 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 02:01:11,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:11,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365324914] [2022-12-13 02:01:11,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365324914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:11,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:11,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914776914] [2022-12-13 02:01:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:11,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:11,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:11,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:11,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:11,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:11,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:11,552 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:11,552 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:11,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:11,552 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:11,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:11,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:11,553 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:11,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:11,554 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:11,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:11,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:11,554 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:11,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:11,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,557 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:11,557 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:11,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:11,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:11,689 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:11,690 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:11,690 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:11,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:11,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:11,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1140 [2022-12-13 02:01:11,702 INFO L420 AbstractCegarLoop]: === Iteration 1142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1382464543, now seen corresponding path program 1 times [2022-12-13 02:01:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91636283] [2022-12-13 02:01:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:11,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 02:01:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91636283] [2022-12-13 02:01:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91636283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:11,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:11,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581937715] [2022-12-13 02:01:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:11,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:11,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:11,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:11,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:11,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:11,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:11,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:11,817 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:11,817 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:11,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:11,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:11,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:11,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:11,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:11,819 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:11,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:11,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:11,820 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:11,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:11,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:11,820 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:11,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:11,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:11,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,823 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:11,823 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:11,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:11,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:11,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:11,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:11,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:11,946 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:11,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:11,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:11,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:11,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1141 [2022-12-13 02:01:11,946 INFO L420 AbstractCegarLoop]: === Iteration 1143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1325206241, now seen corresponding path program 1 times [2022-12-13 02:01:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:11,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691758450] [2022-12-13 02:01:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:11,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,001 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 02:01:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:12,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691758450] [2022-12-13 02:01:12,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691758450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:12,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:12,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744413312] [2022-12-13 02:01:12,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:12,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:12,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:12,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:12,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:12,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:12,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:12,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:12,052 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:12,052 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:12,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:12,053 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:12,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:12,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:12,053 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:12,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:12,054 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:12,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:12,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:12,054 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:12,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:12,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,057 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:12,057 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:12,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:12,175 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:12,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:12,176 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:12,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:12,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:12,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1142 [2022-12-13 02:01:12,176 INFO L420 AbstractCegarLoop]: === Iteration 1144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1267947939, now seen corresponding path program 1 times [2022-12-13 02:01:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:12,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747577672] [2022-12-13 02:01:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,229 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 02:01:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:12,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747577672] [2022-12-13 02:01:12,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747577672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:12,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:12,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786313975] [2022-12-13 02:01:12,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:12,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:12,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:12,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:12,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:12,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:12,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:12,274 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:12,274 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:12,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:12,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:12,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:12,275 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:12,275 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:12,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:12,276 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,276 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:12,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:12,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:12,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:12,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:12,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,279 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:12,279 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:12,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:12,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:12,395 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:12,396 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:12,396 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:12,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:12,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:12,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1143 [2022-12-13 02:01:12,396 INFO L420 AbstractCegarLoop]: === Iteration 1145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:12,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1210689637, now seen corresponding path program 1 times [2022-12-13 02:01:12,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:12,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281876146] [2022-12-13 02:01:12,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:12,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:12,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:12,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281876146] [2022-12-13 02:01:12,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281876146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:12,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:12,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811322307] [2022-12-13 02:01:12,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:12,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:12,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:12,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:12,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:12,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:12,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:12,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:12,502 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:12,503 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:12,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:12,503 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:12,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:12,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:12,504 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:12,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:12,504 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:12,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:12,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:12,505 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:12,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:12,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,508 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:12,508 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:12,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:12,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:12,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:12,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:12,623 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:12,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:12,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:12,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1144 [2022-12-13 02:01:12,623 INFO L420 AbstractCegarLoop]: === Iteration 1146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1153431335, now seen corresponding path program 1 times [2022-12-13 02:01:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:12,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182742101] [2022-12-13 02:01:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,677 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 02:01:12,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182742101] [2022-12-13 02:01:12,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182742101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:12,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:12,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:12,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19733189] [2022-12-13 02:01:12,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:12,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:12,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:12,678 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:12,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:12,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:12,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:12,734 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:12,735 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:12,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:12,735 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:12,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:12,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:12,736 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:12,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:12,737 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:12,737 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:12,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:12,737 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:12,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:12,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:12,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,740 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:12,740 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:12,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:12,740 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:12,740 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:12,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:12,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:12,872 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:12,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:12,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:12,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1145 [2022-12-13 02:01:12,873 INFO L420 AbstractCegarLoop]: === Iteration 1147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1096173033, now seen corresponding path program 1 times [2022-12-13 02:01:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:12,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236795315] [2022-12-13 02:01:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:12,930 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 02:01:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:12,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236795315] [2022-12-13 02:01:12,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236795315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:12,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:12,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567076657] [2022-12-13 02:01:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:12,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:12,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:12,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:12,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:12,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:12,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:12,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:12,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:12,992 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:12,992 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:12,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:12,993 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:12,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:12,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:12,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:12,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:12,994 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:12,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:13,005 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:13,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:13,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:13,005 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:13,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:13,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,008 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:13,008 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:13,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:13,009 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,009 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:13,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:13,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:13,143 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:13,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:13,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:13,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1146 [2022-12-13 02:01:13,143 INFO L420 AbstractCegarLoop]: === Iteration 1148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1038914731, now seen corresponding path program 1 times [2022-12-13 02:01:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:13,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795617141] [2022-12-13 02:01:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:13,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:13,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795617141] [2022-12-13 02:01:13,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795617141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:13,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:13,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049315005] [2022-12-13 02:01:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:13,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:13,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:13,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:13,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:13,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:13,264 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:13,264 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:13,265 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:13,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:13,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:13,265 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:13,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:13,266 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:13,266 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:13,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:13,267 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:13,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:13,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,269 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:13,269 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:13,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:13,270 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:13,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:13,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:13,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:13,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:13,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:13,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1147 [2022-12-13 02:01:13,403 INFO L420 AbstractCegarLoop]: === Iteration 1149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:13,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash -981656429, now seen corresponding path program 1 times [2022-12-13 02:01:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:13,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186261542] [2022-12-13 02:01:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:13,469 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 02:01:13,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186261542] [2022-12-13 02:01:13,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186261542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:13,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:13,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467864177] [2022-12-13 02:01:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:13,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:13,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:13,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:13,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:13,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:13,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:13,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:13,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:13,536 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:13,537 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:13,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:13,537 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:13,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:13,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:13,538 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:13,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:13,539 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:13,539 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:13,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:13,539 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:13,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:13,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,542 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:13,542 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:13,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:13,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:13,664 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:01:13,664 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:13,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:13,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:13,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1148 [2022-12-13 02:01:13,664 INFO L420 AbstractCegarLoop]: === Iteration 1150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:13,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash -924398127, now seen corresponding path program 1 times [2022-12-13 02:01:13,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:13,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519399] [2022-12-13 02:01:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:13,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:13,715 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 02:01:13,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:13,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519399] [2022-12-13 02:01:13,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:13,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:13,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043876574] [2022-12-13 02:01:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:13,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:13,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:13,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:13,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:13,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:13,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:13,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:13,760 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:13,760 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:13,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:13,761 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:13,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:13,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:13,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:13,761 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:13,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:13,762 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,762 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:13,762 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:13,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:13,762 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:13,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:13,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,765 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:13,765 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:13,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:13,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:13,882 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:13,883 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:13,883 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:13,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,883 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:13,883 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:13,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1149 [2022-12-13 02:01:13,883 INFO L420 AbstractCegarLoop]: === Iteration 1151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -867139825, now seen corresponding path program 1 times [2022-12-13 02:01:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829771556] [2022-12-13 02:01:13,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:13,934 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 02:01:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:13,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829771556] [2022-12-13 02:01:13,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829771556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:13,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:13,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178974689] [2022-12-13 02:01:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:13,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:13,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:13,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:13,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:13,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:13,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:13,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:13,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:13,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:13,977 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:13,977 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:13,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:13,978 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:13,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:13,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:13,978 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:13,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:13,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:13,979 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:13,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:13,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:13,979 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:13,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:13,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:13,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,982 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:13,982 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:13,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:13,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:13,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:14,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:14,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:14,098 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:14,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:14,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:14,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1150 [2022-12-13 02:01:14,098 INFO L420 AbstractCegarLoop]: === Iteration 1152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:14,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash -809881523, now seen corresponding path program 1 times [2022-12-13 02:01:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:14,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547404402] [2022-12-13 02:01:14,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:14,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:14,150 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 02:01:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:14,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547404402] [2022-12-13 02:01:14,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547404402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:14,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:14,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589937342] [2022-12-13 02:01:14,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:14,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:14,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:14,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:14,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:14,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:14,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:14,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:14,195 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:14,195 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:14,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:14,195 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:14,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:14,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:14,196 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:14,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:14,197 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:14,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:14,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:14,197 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:14,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:14,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,200 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:14,200 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:14,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:14,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:14,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:14,315 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:14,316 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:14,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:14,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:14,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1151 [2022-12-13 02:01:14,316 INFO L420 AbstractCegarLoop]: === Iteration 1153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -752623221, now seen corresponding path program 1 times [2022-12-13 02:01:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:14,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492681378] [2022-12-13 02:01:14,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:14,378 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 02:01:14,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:14,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492681378] [2022-12-13 02:01:14,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492681378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:14,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:14,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:14,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002208126] [2022-12-13 02:01:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:14,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:14,388 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:14,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:14,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:14,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:14,438 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:14,438 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:14,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:14,439 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:14,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:14,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:14,439 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:14,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:14,440 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,440 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:14,440 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:14,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:14,440 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,440 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:14,440 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:14,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,443 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:14,443 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:14,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:14,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:14,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:14,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:14,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:14,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:14,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1152 [2022-12-13 02:01:14,559 INFO L420 AbstractCegarLoop]: === Iteration 1154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:14,559 INFO L85 PathProgramCache]: Analyzing trace with hash -695364919, now seen corresponding path program 1 times [2022-12-13 02:01:14,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:14,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038094018] [2022-12-13 02:01:14,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:14,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:14,612 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 02:01:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:14,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038094018] [2022-12-13 02:01:14,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038094018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:14,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:14,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586999891] [2022-12-13 02:01:14,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:14,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:14,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:14,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:14,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:14,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:14,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:14,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:14,658 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:14,658 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:14,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:14,658 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:14,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:14,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:14,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:14,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:14,660 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:14,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:14,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:14,660 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:14,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:14,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,663 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:14,663 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:14,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:14,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:14,778 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:14,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:14,779 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:14,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:14,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:14,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1153 [2022-12-13 02:01:14,779 INFO L420 AbstractCegarLoop]: === Iteration 1155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash -638106617, now seen corresponding path program 1 times [2022-12-13 02:01:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:14,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70653285] [2022-12-13 02:01:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:14,831 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 02:01:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:14,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70653285] [2022-12-13 02:01:14,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70653285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:14,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:14,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217645674] [2022-12-13 02:01:14,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:14,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:14,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:14,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:14,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:14,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:14,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:14,893 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:14,893 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:14,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:14,894 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:14,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:14,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:14,895 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:14,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:14,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:14,896 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:14,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:14,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:14,896 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:14,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:14,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:14,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,899 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:14,899 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:14,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:14,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:14,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:15,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:15,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:15,022 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:15,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:15,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:15,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1154 [2022-12-13 02:01:15,023 INFO L420 AbstractCegarLoop]: === Iteration 1156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:15,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:15,023 INFO L85 PathProgramCache]: Analyzing trace with hash -580848315, now seen corresponding path program 1 times [2022-12-13 02:01:15,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:15,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337227010] [2022-12-13 02:01:15,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:15,084 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 02:01:15,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:15,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337227010] [2022-12-13 02:01:15,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337227010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:15,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:15,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:15,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368960923] [2022-12-13 02:01:15,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:15,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:15,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:15,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:15,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:15,136 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:15,136 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:15,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:15,137 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:15,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:15,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:15,137 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:15,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:15,138 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:15,138 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:15,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:15,138 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:15,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:15,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,141 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:15,141 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:15,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:15,269 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:15,270 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:01:15,270 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:15,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:15,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:15,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1155 [2022-12-13 02:01:15,270 INFO L420 AbstractCegarLoop]: === Iteration 1157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:15,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash -523590013, now seen corresponding path program 1 times [2022-12-13 02:01:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:15,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475963384] [2022-12-13 02:01:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:15,325 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 02:01:15,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:15,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475963384] [2022-12-13 02:01:15,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475963384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:15,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:15,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768892573] [2022-12-13 02:01:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:15,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:15,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:15,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:15,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:15,377 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:15,377 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:15,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:15,378 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:15,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:15,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:15,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:15,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:15,379 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:15,379 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:15,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:15,380 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:15,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:15,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,382 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:15,382 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:15,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:15,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:15,498 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:15,499 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:15,499 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:15,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,499 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:15,499 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:15,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1156 [2022-12-13 02:01:15,499 INFO L420 AbstractCegarLoop]: === Iteration 1158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:15,499 INFO L85 PathProgramCache]: Analyzing trace with hash -466331711, now seen corresponding path program 1 times [2022-12-13 02:01:15,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:15,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307980357] [2022-12-13 02:01:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:15,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:15,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 02:01:15,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:15,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307980357] [2022-12-13 02:01:15,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307980357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:15,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:15,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:15,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700712562] [2022-12-13 02:01:15,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:15,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:15,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:15,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:15,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:15,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:15,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:15,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:15,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:15,596 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:15,596 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:15,596 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:15,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:15,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:15,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:15,597 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:15,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:15,597 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:15,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:15,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:15,598 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:15,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:15,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,600 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:15,601 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:15,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:15,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:15,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:15,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:15,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:15,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:15,725 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:15,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1157 [2022-12-13 02:01:15,725 INFO L420 AbstractCegarLoop]: === Iteration 1159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:15,725 INFO L85 PathProgramCache]: Analyzing trace with hash -409073409, now seen corresponding path program 1 times [2022-12-13 02:01:15,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:15,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817291089] [2022-12-13 02:01:15,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:15,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:15,795 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 02:01:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817291089] [2022-12-13 02:01:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817291089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:15,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:15,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116858848] [2022-12-13 02:01:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:15,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:15,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:15,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:15,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:15,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:15,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:15,857 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:15,857 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:15,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:15,858 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:15,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:15,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:15,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:15,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:15,858 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:15,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:15,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:15,859 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:15,859 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:15,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:15,859 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,860 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:15,860 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:15,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:15,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,862 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:15,862 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:15,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:15,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:15,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:15,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:15,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:15,995 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:15,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:15,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:15,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:15,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1158 [2022-12-13 02:01:15,996 INFO L420 AbstractCegarLoop]: === Iteration 1160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:15,996 INFO L85 PathProgramCache]: Analyzing trace with hash -351815107, now seen corresponding path program 1 times [2022-12-13 02:01:15,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:15,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700572171] [2022-12-13 02:01:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:16,054 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 02:01:16,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:16,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700572171] [2022-12-13 02:01:16,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700572171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:16,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:16,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:16,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327313671] [2022-12-13 02:01:16,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:16,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:16,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:16,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:16,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:16,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:16,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:16,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:16,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:16,116 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:16,116 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:16,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:16,117 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:16,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:16,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:16,117 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:16,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:16,118 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,118 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:16,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:16,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:16,119 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:16,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:16,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,121 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:16,121 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:16,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:16,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:16,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:16,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:16,253 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:16,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:16,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:16,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1159 [2022-12-13 02:01:16,254 INFO L420 AbstractCegarLoop]: === Iteration 1161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:16,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:16,254 INFO L85 PathProgramCache]: Analyzing trace with hash -294556805, now seen corresponding path program 1 times [2022-12-13 02:01:16,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:16,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968424654] [2022-12-13 02:01:16,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:16,313 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 02:01:16,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:16,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968424654] [2022-12-13 02:01:16,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968424654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:16,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:16,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616946131] [2022-12-13 02:01:16,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:16,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:16,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:16,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:16,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:16,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:16,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:16,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:16,376 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:16,376 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:16,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:16,376 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:16,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:16,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:16,377 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:16,377 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:16,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:16,378 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,378 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:16,378 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:16,378 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:16,378 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:16,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:16,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,381 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:16,381 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:16,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:16,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:16,510 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:16,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:01:16,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:16,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:16,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:16,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1160 [2022-12-13 02:01:16,511 INFO L420 AbstractCegarLoop]: === Iteration 1162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -237298503, now seen corresponding path program 1 times [2022-12-13 02:01:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:16,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529555085] [2022-12-13 02:01:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:16,573 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 02:01:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:16,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529555085] [2022-12-13 02:01:16,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529555085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:16,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:16,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:16,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806482009] [2022-12-13 02:01:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:16,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:16,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:16,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:16,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:16,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:16,627 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:16,627 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:16,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:16,628 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:16,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:16,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:16,628 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:16,628 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:16,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:16,629 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,629 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:16,629 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:16,629 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:16,629 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:16,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:16,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,632 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:16,632 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:16,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:16,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:16,766 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:16,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:16,767 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:16,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:16,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:16,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1161 [2022-12-13 02:01:16,767 INFO L420 AbstractCegarLoop]: === Iteration 1163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash -180040201, now seen corresponding path program 1 times [2022-12-13 02:01:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:16,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478640016] [2022-12-13 02:01:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:16,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478640016] [2022-12-13 02:01:16,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478640016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:16,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:16,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620766592] [2022-12-13 02:01:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:16,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:16,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:16,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:16,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:16,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:16,876 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:16,877 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:16,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:16,877 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:16,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:16,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:16,878 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:16,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:16,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:16,879 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:16,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:16,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:16,879 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:16,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:16,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:16,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,882 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:16,882 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:16,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:16,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:16,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:17,015 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:17,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:17,016 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:17,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:17,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:17,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1162 [2022-12-13 02:01:17,017 INFO L420 AbstractCegarLoop]: === Iteration 1164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:17,017 INFO L85 PathProgramCache]: Analyzing trace with hash -122781899, now seen corresponding path program 1 times [2022-12-13 02:01:17,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:17,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231473653] [2022-12-13 02:01:17,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:17,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:17,076 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 02:01:17,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:17,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231473653] [2022-12-13 02:01:17,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231473653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:17,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:17,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:17,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571349504] [2022-12-13 02:01:17,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:17,077 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:17,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:17,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:17,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:17,130 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:17,130 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:17,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:17,131 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:17,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:17,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:17,131 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:17,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:17,132 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,132 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:17,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:17,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:17,132 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:17,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:17,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,135 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:17,135 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:17,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:17,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:17,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:17,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:17,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:17,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:17,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:17,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1163 [2022-12-13 02:01:17,267 INFO L420 AbstractCegarLoop]: === Iteration 1165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:17,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -65523597, now seen corresponding path program 1 times [2022-12-13 02:01:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:17,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661042689] [2022-12-13 02:01:17,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:17,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:17,334 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 02:01:17,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661042689] [2022-12-13 02:01:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661042689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:17,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:17,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159115872] [2022-12-13 02:01:17,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:17,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:17,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:17,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:17,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:17,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:17,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:17,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:17,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:17,386 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:17,387 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:17,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:17,387 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:17,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:17,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:17,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:17,388 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:17,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:17,389 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:17,389 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:17,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:17,389 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:17,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:17,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,392 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:17,392 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:17,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:17,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:17,523 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:17,524 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:17,524 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:17,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,524 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:17,524 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:17,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1164 [2022-12-13 02:01:17,525 INFO L420 AbstractCegarLoop]: === Iteration 1166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:17,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash -8265295, now seen corresponding path program 1 times [2022-12-13 02:01:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:17,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507058880] [2022-12-13 02:01:17,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:17,580 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 02:01:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:17,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507058880] [2022-12-13 02:01:17,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507058880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:17,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:17,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488012346] [2022-12-13 02:01:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:17,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:17,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:17,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:17,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:17,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:17,642 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:17,642 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:17,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:17,643 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:17,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:17,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:17,644 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:17,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:17,644 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:17,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:17,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:17,645 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:17,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:17,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,647 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:17,648 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:17,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:17,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:17,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:17,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:17,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:17,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:17,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:17,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1165 [2022-12-13 02:01:17,781 INFO L420 AbstractCegarLoop]: === Iteration 1167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 48993007, now seen corresponding path program 1 times [2022-12-13 02:01:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:17,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516462092] [2022-12-13 02:01:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:17,847 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 02:01:17,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:17,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516462092] [2022-12-13 02:01:17,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516462092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:17,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:17,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630554678] [2022-12-13 02:01:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:17,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:17,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:17,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:17,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:17,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:17,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:17,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:17,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:17,901 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:17,901 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:17,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:17,902 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:17,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:17,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:17,902 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:17,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:17,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:17,903 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:17,903 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:17,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:17,903 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:17,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:17,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:17,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,906 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:17,906 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:17,907 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:17,907 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:18,039 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:18,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:18,040 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:18,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:18,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:18,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1166 [2022-12-13 02:01:18,040 INFO L420 AbstractCegarLoop]: === Iteration 1168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash 106251309, now seen corresponding path program 1 times [2022-12-13 02:01:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:18,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310971462] [2022-12-13 02:01:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:18,097 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 02:01:18,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:18,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310971462] [2022-12-13 02:01:18,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310971462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:18,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:18,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:18,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767156729] [2022-12-13 02:01:18,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:18,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:18,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:18,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:18,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:18,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:18,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:18,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:18,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:18,150 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:18,150 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:18,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:18,151 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:18,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:18,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:18,151 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:18,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:18,152 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:18,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:18,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:18,152 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:18,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:18,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,155 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:18,155 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:18,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:18,156 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,156 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:18,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:18,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:18,278 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:18,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:18,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:18,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1167 [2022-12-13 02:01:18,279 INFO L420 AbstractCegarLoop]: === Iteration 1169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash 163509611, now seen corresponding path program 1 times [2022-12-13 02:01:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:18,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524856821] [2022-12-13 02:01:18,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:18,334 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 02:01:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:18,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524856821] [2022-12-13 02:01:18,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524856821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:18,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:18,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769905900] [2022-12-13 02:01:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:18,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:18,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:18,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:18,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:18,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:18,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:18,378 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:18,378 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:18,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:18,379 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:18,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:18,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:18,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:18,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:18,380 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:18,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:18,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:18,380 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:18,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:18,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,384 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:18,384 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:18,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:18,385 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,385 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:18,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:18,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:01:18,503 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:18,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:18,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:18,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1168 [2022-12-13 02:01:18,503 INFO L420 AbstractCegarLoop]: === Iteration 1170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:18,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash 220767913, now seen corresponding path program 1 times [2022-12-13 02:01:18,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:18,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19036429] [2022-12-13 02:01:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:18,564 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 02:01:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:18,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19036429] [2022-12-13 02:01:18,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19036429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:18,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:18,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:18,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541017687] [2022-12-13 02:01:18,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:18,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:18,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:18,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:18,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:18,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:18,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:18,616 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:18,616 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:18,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:18,616 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:18,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:18,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:18,617 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:18,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:18,618 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:18,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:18,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:18,618 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:18,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:18,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,621 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:18,621 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:18,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:18,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:18,745 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:18,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:01:18,746 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:18,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:18,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:18,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1169 [2022-12-13 02:01:18,746 INFO L420 AbstractCegarLoop]: === Iteration 1171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:18,746 INFO L85 PathProgramCache]: Analyzing trace with hash 278026215, now seen corresponding path program 1 times [2022-12-13 02:01:18,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:18,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731176147] [2022-12-13 02:01:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:18,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:18,799 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 02:01:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731176147] [2022-12-13 02:01:18,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731176147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:18,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:18,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714527609] [2022-12-13 02:01:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:18,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:18,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:18,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:18,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:18,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:18,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:18,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:18,849 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:18,849 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:18,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:18,850 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:18,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:18,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:18,850 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:18,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:18,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:18,851 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:18,851 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:18,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:18,851 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:18,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:18,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:18,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,854 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:18,854 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:18,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:18,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:18,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:18,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:18,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:18,970 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:18,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:18,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:18,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:18,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1170 [2022-12-13 02:01:18,970 INFO L420 AbstractCegarLoop]: === Iteration 1172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 335284517, now seen corresponding path program 1 times [2022-12-13 02:01:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:18,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294985935] [2022-12-13 02:01:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:19,022 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 02:01:19,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:19,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294985935] [2022-12-13 02:01:19,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294985935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:19,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:19,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891548763] [2022-12-13 02:01:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:19,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:19,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:19,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:19,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:19,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:19,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:19,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:19,072 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:19,073 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:19,073 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:19,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:19,074 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:19,074 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:19,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:19,074 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:19,075 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:19,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:19,075 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:19,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:19,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,077 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:19,077 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:19,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:19,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:19,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:19,194 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:19,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:19,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:19,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1171 [2022-12-13 02:01:19,194 INFO L420 AbstractCegarLoop]: === Iteration 1173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:19,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 392542819, now seen corresponding path program 1 times [2022-12-13 02:01:19,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:19,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628875416] [2022-12-13 02:01:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:19,250 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 02:01:19,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:19,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628875416] [2022-12-13 02:01:19,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628875416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:19,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:19,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233582234] [2022-12-13 02:01:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:19,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:19,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:19,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:19,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:19,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:19,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:19,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:19,312 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:19,312 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:19,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:19,313 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:19,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:19,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:19,313 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:19,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:19,314 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:19,314 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:19,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:19,314 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:19,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:19,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,317 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:19,317 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:19,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:19,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:19,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:19,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:19,450 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:19,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:19,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1172 [2022-12-13 02:01:19,450 INFO L420 AbstractCegarLoop]: === Iteration 1174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:19,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 449801121, now seen corresponding path program 1 times [2022-12-13 02:01:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:19,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638884943] [2022-12-13 02:01:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:19,527 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 02:01:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638884943] [2022-12-13 02:01:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638884943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927980780] [2022-12-13 02:01:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:19,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:19,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:19,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:19,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:19,582 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:19,582 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:19,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:19,583 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:19,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:19,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:19,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:19,583 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:19,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:19,584 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:19,584 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:19,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:19,584 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:19,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:19,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,587 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:19,587 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:19,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:19,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:19,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:19,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:19,719 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:19,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:19,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:19,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1173 [2022-12-13 02:01:19,719 INFO L420 AbstractCegarLoop]: === Iteration 1175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:19,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:19,720 INFO L85 PathProgramCache]: Analyzing trace with hash 507059423, now seen corresponding path program 1 times [2022-12-13 02:01:19,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:19,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009663924] [2022-12-13 02:01:19,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:19,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:19,784 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 02:01:19,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:19,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009663924] [2022-12-13 02:01:19,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009663924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:19,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:19,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:19,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975837020] [2022-12-13 02:01:19,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:19,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:19,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:19,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:19,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:19,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:19,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:19,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:19,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:19,839 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:19,839 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:19,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:19,840 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:19,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:19,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:19,841 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:19,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:19,842 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:19,842 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:19,842 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:19,843 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:19,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:19,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:19,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,846 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:19,846 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:19,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:19,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:19,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:19,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:19,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:19,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:19,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:19,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:19,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:19,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1174 [2022-12-13 02:01:19,978 INFO L420 AbstractCegarLoop]: === Iteration 1176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash 564317725, now seen corresponding path program 1 times [2022-12-13 02:01:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928107337] [2022-12-13 02:01:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:20,040 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 02:01:20,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:20,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928107337] [2022-12-13 02:01:20,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928107337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:20,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:20,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:20,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504092032] [2022-12-13 02:01:20,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:20,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:20,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:20,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:20,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:20,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:20,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:20,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:20,094 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:20,094 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:20,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:20,095 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:20,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:20,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:20,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:20,095 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:20,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:20,096 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:20,096 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:20,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:20,096 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,096 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:20,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:20,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,099 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:20,099 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:20,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:20,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:20,216 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:20,217 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:20,217 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:20,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,217 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:20,217 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:20,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1175 [2022-12-13 02:01:20,217 INFO L420 AbstractCegarLoop]: === Iteration 1177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 621576027, now seen corresponding path program 1 times [2022-12-13 02:01:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:20,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143760197] [2022-12-13 02:01:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:20,270 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 02:01:20,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:20,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143760197] [2022-12-13 02:01:20,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143760197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:20,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:20,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741427427] [2022-12-13 02:01:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:20,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:20,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:20,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:20,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:20,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:20,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:20,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:20,323 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:20,323 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:20,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:20,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:20,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:20,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:20,324 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:20,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:20,325 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:20,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:20,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:20,325 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:20,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:20,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,328 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:20,328 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:20,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:20,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:20,446 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:20,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:20,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:20,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:20,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:20,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1176 [2022-12-13 02:01:20,447 INFO L420 AbstractCegarLoop]: === Iteration 1178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:20,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:20,447 INFO L85 PathProgramCache]: Analyzing trace with hash 678834329, now seen corresponding path program 1 times [2022-12-13 02:01:20,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:20,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748617167] [2022-12-13 02:01:20,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:20,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:20,507 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 02:01:20,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:20,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748617167] [2022-12-13 02:01:20,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748617167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:20,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:20,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499908962] [2022-12-13 02:01:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:20,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:20,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:20,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:20,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:20,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:20,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:20,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:20,553 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:20,553 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:20,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:20,554 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:20,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:20,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:20,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:20,554 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:20,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:20,555 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:20,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:20,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:20,555 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:20,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:20,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,558 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:20,558 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:20,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:20,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:20,674 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:20,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:20,675 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:20,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:20,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1177 [2022-12-13 02:01:20,675 INFO L420 AbstractCegarLoop]: === Iteration 1179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 736092631, now seen corresponding path program 1 times [2022-12-13 02:01:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189990465] [2022-12-13 02:01:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:20,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:20,728 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 02:01:20,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:20,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189990465] [2022-12-13 02:01:20,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189990465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:20,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:20,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321172344] [2022-12-13 02:01:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:20,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:20,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:20,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:20,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:20,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:20,772 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:20,772 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:20,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:20,772 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:20,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:20,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:20,773 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:20,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:20,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:20,774 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:20,774 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:20,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:20,774 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:20,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:20,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:20,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,777 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:20,777 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:20,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:20,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:20,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:20,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:20,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:20,892 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:20,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:20,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:20,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1178 [2022-12-13 02:01:20,892 INFO L420 AbstractCegarLoop]: === Iteration 1180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:20,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:20,892 INFO L85 PathProgramCache]: Analyzing trace with hash 793350933, now seen corresponding path program 1 times [2022-12-13 02:01:20,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:20,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905235114] [2022-12-13 02:01:20,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:20,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:20,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905235114] [2022-12-13 02:01:20,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905235114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:20,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:20,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777359815] [2022-12-13 02:01:20,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:20,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:20,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:20,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:20,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:20,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:20,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:21,010 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:21,010 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:21,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:21,010 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:21,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:21,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:21,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:21,011 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:21,012 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:21,012 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:21,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:21,012 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:21,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:21,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,015 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:21,015 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:21,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:21,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:21,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:21,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:21,150 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:21,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:21,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:21,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1179 [2022-12-13 02:01:21,150 INFO L420 AbstractCegarLoop]: === Iteration 1181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:21,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 850609235, now seen corresponding path program 1 times [2022-12-13 02:01:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:21,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782899688] [2022-12-13 02:01:21,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:21,219 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 02:01:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:21,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782899688] [2022-12-13 02:01:21,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782899688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:21,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:21,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566082306] [2022-12-13 02:01:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:21,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:21,220 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:21,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:21,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:21,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:21,272 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:21,272 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:21,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:21,272 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:21,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:21,273 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:21,273 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:21,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:21,274 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,274 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:21,274 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:21,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:21,274 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:21,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:21,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,277 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:21,277 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:21,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:21,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,278 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:21,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:21,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:01:21,398 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:21,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:21,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:21,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1180 [2022-12-13 02:01:21,398 INFO L420 AbstractCegarLoop]: === Iteration 1182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:21,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 907867537, now seen corresponding path program 1 times [2022-12-13 02:01:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:21,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015265818] [2022-12-13 02:01:21,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:21,468 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 02:01:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:21,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015265818] [2022-12-13 02:01:21,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015265818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:21,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:21,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918119617] [2022-12-13 02:01:21,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:21,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:21,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:21,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:21,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:21,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:21,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:21,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:21,521 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:21,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:21,522 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:21,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:21,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:21,523 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:21,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:21,526 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:21,527 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:21,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:21,527 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:21,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:21,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,529 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:21,530 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:21,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:21,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:21,648 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:21,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:21,648 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:21,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:21,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:21,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1181 [2022-12-13 02:01:21,649 INFO L420 AbstractCegarLoop]: === Iteration 1183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:21,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash 965125839, now seen corresponding path program 1 times [2022-12-13 02:01:21,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:21,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467194519] [2022-12-13 02:01:21,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:21,711 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 02:01:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:21,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467194519] [2022-12-13 02:01:21,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467194519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:21,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:21,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138141423] [2022-12-13 02:01:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:21,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:21,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:21,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:21,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:21,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:21,764 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:21,764 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:21,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:21,765 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:21,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:21,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:21,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:21,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:21,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:21,766 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:21,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:21,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:21,767 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:21,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:21,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:21,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,770 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:21,770 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:21,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:21,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:21,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:21,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:21,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:01:21,899 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:21,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:21,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:21,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1182 [2022-12-13 02:01:21,899 INFO L420 AbstractCegarLoop]: === Iteration 1184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:21,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1022384141, now seen corresponding path program 1 times [2022-12-13 02:01:21,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:21,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600266069] [2022-12-13 02:01:21,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:21,952 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 02:01:21,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:21,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600266069] [2022-12-13 02:01:21,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600266069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:21,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:21,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531464420] [2022-12-13 02:01:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:21,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:21,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:21,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:21,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:21,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:21,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:21,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:22,002 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:22,002 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:22,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:22,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:22,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:22,004 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:22,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:22,004 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:22,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:22,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:22,005 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:22,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:22,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,008 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:22,008 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:22,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:22,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:22,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:22,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:22,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:22,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:22,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:22,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1183 [2022-12-13 02:01:22,125 INFO L420 AbstractCegarLoop]: === Iteration 1185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:22,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1079642443, now seen corresponding path program 1 times [2022-12-13 02:01:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:22,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464901690] [2022-12-13 02:01:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:22,186 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 02:01:22,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:22,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464901690] [2022-12-13 02:01:22,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464901690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:22,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:22,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100067271] [2022-12-13 02:01:22,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:22,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:22,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:22,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:22,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:22,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:22,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:22,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:22,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:22,239 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:22,239 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:22,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:22,240 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:22,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:22,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:22,240 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:22,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:22,241 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:22,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:22,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:22,241 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:22,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:22,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,244 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:22,244 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:22,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:22,245 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:22,365 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:22,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:01:22,365 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:22,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,366 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:22,366 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:22,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1184 [2022-12-13 02:01:22,366 INFO L420 AbstractCegarLoop]: === Iteration 1186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1136900745, now seen corresponding path program 1 times [2022-12-13 02:01:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974773279] [2022-12-13 02:01:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:22,419 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 02:01:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:22,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974773279] [2022-12-13 02:01:22,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974773279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:22,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:22,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604363016] [2022-12-13 02:01:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:22,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:22,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:22,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:22,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:22,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:22,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:22,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:22,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:22,469 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:22,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:22,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:22,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:22,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:22,470 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:22,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:22,471 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:22,471 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:22,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:22,472 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:22,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:22,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,474 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:22,474 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:22,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:22,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:22,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:22,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:22,606 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:22,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:22,607 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:22,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1185 [2022-12-13 02:01:22,607 INFO L420 AbstractCegarLoop]: === Iteration 1187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1194159047, now seen corresponding path program 1 times [2022-12-13 02:01:22,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:22,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973630584] [2022-12-13 02:01:22,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:22,674 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 02:01:22,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:22,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973630584] [2022-12-13 02:01:22,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973630584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:22,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:22,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008173721] [2022-12-13 02:01:22,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:22,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:22,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:22,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:22,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:22,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:22,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:22,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:22,726 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:22,727 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:22,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:22,727 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:22,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:22,728 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:22,728 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:22,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:22,728 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,729 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:22,729 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:22,729 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:22,729 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:22,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:22,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,732 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:22,732 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:22,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:22,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:22,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:22,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:01:22,878 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:22,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:22,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:22,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1186 [2022-12-13 02:01:22,878 INFO L420 AbstractCegarLoop]: === Iteration 1188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:22,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1251417349, now seen corresponding path program 1 times [2022-12-13 02:01:22,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:22,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150968179] [2022-12-13 02:01:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:22,934 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 02:01:22,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:22,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150968179] [2022-12-13 02:01:22,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150968179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:22,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:22,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109392337] [2022-12-13 02:01:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:22,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:22,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:22,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:22,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:22,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:22,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:22,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:22,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:22,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:22,987 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:22,987 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:22,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:22,988 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:22,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:22,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:22,989 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:22,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:22,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:22,990 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:22,990 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:22,990 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:22,990 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:22,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:22,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:22,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,994 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:22,995 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:22,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:22,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:22,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:23,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:23,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:23,127 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:23,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:23,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:23,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1187 [2022-12-13 02:01:23,128 INFO L420 AbstractCegarLoop]: === Iteration 1189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:23,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:23,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1308675651, now seen corresponding path program 1 times [2022-12-13 02:01:23,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:23,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118847117] [2022-12-13 02:01:23,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:23,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:23,187 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 02:01:23,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:23,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118847117] [2022-12-13 02:01:23,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118847117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:23,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:23,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:23,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130336600] [2022-12-13 02:01:23,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:23,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:23,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:23,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:23,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:23,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:23,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:23,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:23,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:23,242 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:23,242 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:23,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:23,243 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:23,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:23,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:23,244 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:23,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:23,245 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:23,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:23,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:23,245 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:23,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:23,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,249 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:23,249 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:23,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:23,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:23,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:23,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:01:23,377 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:23,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:23,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:23,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1188 [2022-12-13 02:01:23,377 INFO L420 AbstractCegarLoop]: === Iteration 1190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1365933953, now seen corresponding path program 1 times [2022-12-13 02:01:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:23,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987927417] [2022-12-13 02:01:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:23,428 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 02:01:23,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:23,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987927417] [2022-12-13 02:01:23,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987927417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:23,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:23,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:23,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449707531] [2022-12-13 02:01:23,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:23,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:23,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:23,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:23,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:23,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:23,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:23,471 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:23,471 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:23,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:23,471 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:23,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:23,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:23,472 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:23,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:23,473 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:23,473 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:23,473 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:23,473 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,473 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:23,473 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:23,473 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,476 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:23,476 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:23,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:23,476 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,476 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:23,610 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:23,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:23,610 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:23,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:23,611 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:23,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1189 [2022-12-13 02:01:23,611 INFO L420 AbstractCegarLoop]: === Iteration 1191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:23,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1423192255, now seen corresponding path program 1 times [2022-12-13 02:01:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:23,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474557403] [2022-12-13 02:01:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:23,664 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 02:01:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474557403] [2022-12-13 02:01:23,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474557403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:23,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:23,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328005669] [2022-12-13 02:01:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:23,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:23,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:23,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:23,665 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:23,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:23,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:23,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:23,710 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:23,711 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:23,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:23,711 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:23,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:23,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:23,712 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:23,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:23,712 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:23,712 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:23,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:23,713 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:23,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:23,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,715 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:23,715 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:23,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:23,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,716 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:23,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:23,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:23,834 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:23,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:23,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:23,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1190 [2022-12-13 02:01:23,834 INFO L420 AbstractCegarLoop]: === Iteration 1192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:23,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1480450557, now seen corresponding path program 1 times [2022-12-13 02:01:23,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:23,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030139402] [2022-12-13 02:01:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:23,895 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 02:01:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030139402] [2022-12-13 02:01:23,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030139402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:23,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:23,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397304966] [2022-12-13 02:01:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:23,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:23,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:23,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:23,896 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:23,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:23,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:23,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:23,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:23,948 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:23,949 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:23,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:23,949 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:23,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:23,950 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:23,950 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:23,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:23,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:23,950 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:23,951 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:23,951 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:23,951 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:23,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:23,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:23,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,953 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:23,954 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:23,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:23,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:23,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:24,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:24,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:01:24,069 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:24,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:24,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1191 [2022-12-13 02:01:24,069 INFO L420 AbstractCegarLoop]: === Iteration 1193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1537708859, now seen corresponding path program 1 times [2022-12-13 02:01:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:24,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422048671] [2022-12-13 02:01:24,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:24,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:24,123 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 02:01:24,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:24,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422048671] [2022-12-13 02:01:24,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422048671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:24,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:24,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:24,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982504749] [2022-12-13 02:01:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:24,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:24,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:24,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:24,124 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:24,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:24,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:24,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:24,174 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:24,174 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:24,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:24,174 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:24,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:24,175 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:24,175 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:24,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:24,175 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,176 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:24,176 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:24,176 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:24,176 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,176 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:24,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:24,176 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,187 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:24,187 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:24,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:24,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:24,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:24,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:24,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:24,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:24,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:24,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1192 [2022-12-13 02:01:24,302 INFO L420 AbstractCegarLoop]: === Iteration 1194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:24,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1594967161, now seen corresponding path program 1 times [2022-12-13 02:01:24,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:24,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137618956] [2022-12-13 02:01:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:24,356 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 02:01:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:24,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137618956] [2022-12-13 02:01:24,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137618956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:24,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:24,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:24,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167192407] [2022-12-13 02:01:24,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:24,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:24,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:24,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:24,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:24,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:24,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:24,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:24,405 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:24,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:24,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:24,406 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:24,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:24,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:24,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:24,407 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:24,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:24,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:24,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:24,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:24,409 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:24,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:24,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,412 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:24,412 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:24,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:24,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:24,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:24,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:24,530 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:24,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:24,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:24,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1193 [2022-12-13 02:01:24,530 INFO L420 AbstractCegarLoop]: === Iteration 1195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1652225463, now seen corresponding path program 1 times [2022-12-13 02:01:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:24,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847069583] [2022-12-13 02:01:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:24,582 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 02:01:24,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:24,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847069583] [2022-12-13 02:01:24,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847069583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:24,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:24,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128395276] [2022-12-13 02:01:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:24,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:24,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:24,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:24,583 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:24,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:24,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:24,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:24,632 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:24,632 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:24,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:24,633 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:24,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:24,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:24,634 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:24,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:24,634 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,635 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:24,635 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:24,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:24,635 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:24,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:24,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,638 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:24,638 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:24,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:24,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:24,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:24,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:01:24,762 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:24,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:24,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:24,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1194 [2022-12-13 02:01:24,763 INFO L420 AbstractCegarLoop]: === Iteration 1196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1709483765, now seen corresponding path program 1 times [2022-12-13 02:01:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:24,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890215871] [2022-12-13 02:01:24,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:24,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:24,817 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 02:01:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:24,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890215871] [2022-12-13 02:01:24,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890215871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:24,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:24,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454807355] [2022-12-13 02:01:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:24,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:24,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:24,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:24,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:24,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:24,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:24,862 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:24,862 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:24,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:24,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:24,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:24,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:24,863 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:24,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:24,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:24,864 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:24,864 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:24,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:24,864 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:24,864 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:24,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:24,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,867 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:24,867 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:24,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:24,867 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:24,867 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:24,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:24,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:01:24,980 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:24,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:24,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:24,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:24,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1195 [2022-12-13 02:01:24,980 INFO L420 AbstractCegarLoop]: === Iteration 1197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1766742067, now seen corresponding path program 1 times [2022-12-13 02:01:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:24,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981220587] [2022-12-13 02:01:24,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:25,033 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 02:01:25,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:25,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981220587] [2022-12-13 02:01:25,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981220587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:25,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:25,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:25,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121202791] [2022-12-13 02:01:25,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:25,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:25,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:25,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:25,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:25,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:25,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:25,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:25,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:25,085 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:25,085 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:25,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:25,086 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:25,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:25,086 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:25,086 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:25,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:25,087 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,087 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:25,087 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:25,087 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:25,087 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:25,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:25,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,090 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:25,090 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:25,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:25,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,091 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:25,206 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:25,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:25,206 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:25,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:25,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:25,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1196 [2022-12-13 02:01:25,207 INFO L420 AbstractCegarLoop]: === Iteration 1198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1824000369, now seen corresponding path program 1 times [2022-12-13 02:01:25,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:25,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011175587] [2022-12-13 02:01:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:25,259 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 02:01:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:25,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011175587] [2022-12-13 02:01:25,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011175587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:25,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:25,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:25,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883279696] [2022-12-13 02:01:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:25,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:25,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:25,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:25,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:25,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:25,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:25,302 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:25,302 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:25,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:25,302 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:25,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:25,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:25,303 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:25,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:25,304 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:25,304 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:25,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:25,304 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:25,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:25,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,307 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:25,307 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:25,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:25,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:25,422 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:25,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:25,423 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:25,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:25,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:25,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1197 [2022-12-13 02:01:25,423 INFO L420 AbstractCegarLoop]: === Iteration 1199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:25,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1881258671, now seen corresponding path program 1 times [2022-12-13 02:01:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:25,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082252203] [2022-12-13 02:01:25,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:25,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:25,494 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 02:01:25,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:25,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082252203] [2022-12-13 02:01:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082252203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:25,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685138032] [2022-12-13 02:01:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:25,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:25,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:25,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:25,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:25,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:25,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:25,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:25,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:25,547 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:25,548 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:25,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:25,548 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:25,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:25,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:25,549 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:25,549 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:25,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:25,550 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,550 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:25,550 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:25,550 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:25,550 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,550 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:25,550 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:25,550 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,553 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:25,553 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:25,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:25,553 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,553 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:25,682 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:25,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:01:25,682 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:25,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,683 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:25,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:25,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1198 [2022-12-13 02:01:25,683 INFO L420 AbstractCegarLoop]: === Iteration 1200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:25,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1938516973, now seen corresponding path program 1 times [2022-12-13 02:01:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:25,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253970413] [2022-12-13 02:01:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:25,749 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 02:01:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:25,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253970413] [2022-12-13 02:01:25,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253970413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:25,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:25,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:25,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538385524] [2022-12-13 02:01:25,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:25,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:25,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:25,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:25,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:25,750 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:25,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:25,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:25,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:25,804 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:25,804 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:25,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:25,805 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:25,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:25,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:25,806 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:25,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:25,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:25,806 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:25,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:25,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:25,807 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:25,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:25,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:25,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,810 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:25,810 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:25,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:25,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:25,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:25,946 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:25,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:01:25,947 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:25,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:25,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:25,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:25,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1199 [2022-12-13 02:01:25,948 INFO L420 AbstractCegarLoop]: === Iteration 1201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1995775275, now seen corresponding path program 1 times [2022-12-13 02:01:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:25,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798878215] [2022-12-13 02:01:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:25,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:26,006 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 02:01:26,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:26,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798878215] [2022-12-13 02:01:26,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798878215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:26,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:26,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:26,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647726043] [2022-12-13 02:01:26,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:26,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:26,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:26,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:26,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:26,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:26,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:26,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:26,070 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:26,070 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:26,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:26,071 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:26,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:26,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:26,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:26,071 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:26,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:26,073 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:26,073 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:26,073 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:26,073 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,073 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:26,073 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:26,073 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,077 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:26,077 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:26,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:26,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:26,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:26,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:01:26,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:26,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:26,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:26,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1200 [2022-12-13 02:01:26,205 INFO L420 AbstractCegarLoop]: === Iteration 1202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:26,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2053033577, now seen corresponding path program 1 times [2022-12-13 02:01:26,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:26,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550874845] [2022-12-13 02:01:26,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:26,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:26,279 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 02:01:26,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:26,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550874845] [2022-12-13 02:01:26,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550874845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:26,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:26,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:26,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039479678] [2022-12-13 02:01:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:26,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:26,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:26,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:26,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:26,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:26,326 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:26,326 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:26,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:26,327 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:26,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:26,327 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:26,327 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:26,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:26,328 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,328 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:26,329 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:26,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:26,329 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:26,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:26,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,332 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:26,332 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:26,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:26,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:26,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:26,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:26,450 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:26,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:26,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:26,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1201 [2022-12-13 02:01:26,451 INFO L420 AbstractCegarLoop]: === Iteration 1203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:26,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2110291879, now seen corresponding path program 1 times [2022-12-13 02:01:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:26,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238566] [2022-12-13 02:01:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:26,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:26,502 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 02:01:26,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:26,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238566] [2022-12-13 02:01:26,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:26,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:26,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:26,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834250283] [2022-12-13 02:01:26,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:26,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:26,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:26,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:26,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:26,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:26,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:26,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:26,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:26,546 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:26,546 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:26,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:26,547 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:26,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:26,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:26,547 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:26,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:26,548 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:26,548 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:26,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:26,548 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:26,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:26,549 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,551 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:26,551 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:26,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:26,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:26,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:26,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:26,667 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:26,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:26,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:26,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1202 [2022-12-13 02:01:26,667 INFO L420 AbstractCegarLoop]: === Iteration 1204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:26,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:26,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2127417115, now seen corresponding path program 1 times [2022-12-13 02:01:26,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:26,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354937966] [2022-12-13 02:01:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:26,720 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 02:01:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:26,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354937966] [2022-12-13 02:01:26,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354937966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:26,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:26,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961349503] [2022-12-13 02:01:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:26,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:26,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:26,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:26,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:26,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:26,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:26,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:26,765 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:26,765 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:26,765 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:26,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:26,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:26,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:26,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:26,767 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:26,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:26,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:26,767 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:26,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:26,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,770 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:26,770 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:26,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:26,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:26,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:26,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:26,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:26,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:26,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:26,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:26,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1203 [2022-12-13 02:01:26,889 INFO L420 AbstractCegarLoop]: === Iteration 1205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:26,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:26,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2070158813, now seen corresponding path program 1 times [2022-12-13 02:01:26,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:26,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970929047] [2022-12-13 02:01:26,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:26,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:26,952 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 02:01:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:26,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970929047] [2022-12-13 02:01:26,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970929047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:26,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:26,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842647725] [2022-12-13 02:01:26,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:26,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:26,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:26,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:26,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:26,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:26,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:26,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:26,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:26,997 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:26,997 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:26,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:26,997 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:26,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:26,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:26,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:26,998 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:26,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:26,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:26,999 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:26,999 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:26,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:26,999 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:26,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:26,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:26,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,002 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:27,002 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:27,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:27,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:27,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:27,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:27,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:27,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:27,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:27,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1204 [2022-12-13 02:01:27,125 INFO L420 AbstractCegarLoop]: === Iteration 1206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:27,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:27,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2012900511, now seen corresponding path program 1 times [2022-12-13 02:01:27,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:27,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967466859] [2022-12-13 02:01:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:27,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:27,178 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 02:01:27,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967466859] [2022-12-13 02:01:27,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967466859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:27,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:27,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:27,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795064153] [2022-12-13 02:01:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:27,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:27,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:27,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:27,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:27,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:27,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:27,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:27,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:27,229 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:27,229 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:27,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:27,230 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:27,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:27,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:27,230 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:27,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:27,231 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:27,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:27,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:27,231 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:27,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:27,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,234 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:27,234 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:27,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:27,235 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,235 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:27,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:27,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:27,353 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:27,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:27,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:27,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1205 [2022-12-13 02:01:27,353 INFO L420 AbstractCegarLoop]: === Iteration 1207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:27,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1955642209, now seen corresponding path program 1 times [2022-12-13 02:01:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:27,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027090188] [2022-12-13 02:01:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:27,408 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 02:01:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:27,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027090188] [2022-12-13 02:01:27,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027090188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:27,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:27,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127458658] [2022-12-13 02:01:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:27,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:27,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:27,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:27,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:27,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:27,459 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:27,459 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:27,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:27,459 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:27,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:27,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:27,460 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:27,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:27,461 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:27,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:27,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:27,461 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,461 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:27,461 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:27,461 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,464 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:27,464 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:27,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:27,464 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:27,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:27,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:27,580 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:27,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:27,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:27,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1206 [2022-12-13 02:01:27,581 INFO L420 AbstractCegarLoop]: === Iteration 1208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:27,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:27,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1898383907, now seen corresponding path program 1 times [2022-12-13 02:01:27,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:27,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634983563] [2022-12-13 02:01:27,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:27,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:27,636 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 02:01:27,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:27,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634983563] [2022-12-13 02:01:27,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634983563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:27,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:27,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435751895] [2022-12-13 02:01:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:27,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:27,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:27,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:27,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:27,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:27,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:27,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:27,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:27,680 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:27,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:27,680 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:27,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:27,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:27,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:27,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:27,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:27,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:27,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:27,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:27,682 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:27,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:27,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,685 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:27,685 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:27,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:27,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:27,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:27,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:27,801 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:27,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:27,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:27,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1207 [2022-12-13 02:01:27,801 INFO L420 AbstractCegarLoop]: === Iteration 1209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:27,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:27,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1841125605, now seen corresponding path program 1 times [2022-12-13 02:01:27,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:27,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122919811] [2022-12-13 02:01:27,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:27,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:27,865 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 02:01:27,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:27,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122919811] [2022-12-13 02:01:27,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122919811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:27,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:27,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:27,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54040413] [2022-12-13 02:01:27,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:27,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:27,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:27,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:27,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:27,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:27,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:27,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:27,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:27,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:27,911 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:27,911 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:27,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:27,912 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:27,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:27,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:27,912 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:27,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:27,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:27,913 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:27,913 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:27,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:27,914 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:27,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:27,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:27,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,916 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:27,916 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:27,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:27,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:27,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:28,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:28,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:28,034 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:28,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:28,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:28,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1208 [2022-12-13 02:01:28,034 INFO L420 AbstractCegarLoop]: === Iteration 1210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:28,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:28,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1783867303, now seen corresponding path program 1 times [2022-12-13 02:01:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:28,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68007807] [2022-12-13 02:01:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:28,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:28,088 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 02:01:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:28,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68007807] [2022-12-13 02:01:28,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68007807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:28,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:28,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311492074] [2022-12-13 02:01:28,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:28,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:28,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:28,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:28,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:28,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:28,139 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:28,139 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:28,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:28,140 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:28,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:28,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:28,140 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:28,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:28,141 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:28,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:28,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:28,141 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:28,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:28,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,144 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:28,144 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:28,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:28,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:28,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:28,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:01:28,271 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:28,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:28,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:28,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1209 [2022-12-13 02:01:28,271 INFO L420 AbstractCegarLoop]: === Iteration 1211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1726609001, now seen corresponding path program 1 times [2022-12-13 02:01:28,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:28,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4512458] [2022-12-13 02:01:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:28,328 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 02:01:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:28,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4512458] [2022-12-13 02:01:28,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4512458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:28,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:28,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957507423] [2022-12-13 02:01:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:28,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:28,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:28,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:28,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:28,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:28,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:28,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:28,374 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:28,374 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:28,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:28,375 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:28,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:28,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:28,375 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:28,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:28,376 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:28,376 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:28,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:28,376 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:28,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:28,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,379 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:28,379 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:28,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:28,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:28,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:28,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:01:28,500 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:28,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:28,500 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:28,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1210 [2022-12-13 02:01:28,500 INFO L420 AbstractCegarLoop]: === Iteration 1212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:28,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:28,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350699, now seen corresponding path program 1 times [2022-12-13 02:01:28,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:28,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577488567] [2022-12-13 02:01:28,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:28,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:28,564 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 02:01:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:28,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577488567] [2022-12-13 02:01:28,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577488567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:28,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:28,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549737589] [2022-12-13 02:01:28,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:28,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:28,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:28,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:28,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:28,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:28,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:28,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:28,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:28,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:28,617 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:28,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:28,618 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:28,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:28,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:28,619 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:28,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:28,620 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:28,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:28,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:28,620 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:28,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:28,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,624 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:28,624 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:28,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:28,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:28,755 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:28,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:28,756 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:28,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:28,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:28,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1211 [2022-12-13 02:01:28,757 INFO L420 AbstractCegarLoop]: === Iteration 1213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:28,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:28,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1612092397, now seen corresponding path program 1 times [2022-12-13 02:01:28,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:28,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642447677] [2022-12-13 02:01:28,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:28,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:28,817 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 02:01:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:28,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642447677] [2022-12-13 02:01:28,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642447677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:28,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512021433] [2022-12-13 02:01:28,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:28,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:28,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:28,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:28,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:28,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:28,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:28,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:28,873 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:28,873 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:28,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:28,874 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:28,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:28,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:28,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:28,874 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:28,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:28,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:28,875 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:28,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:28,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:28,875 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,876 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:28,876 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:28,876 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:28,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,878 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:28,878 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:28,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:28,879 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:28,879 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:29,012 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:29,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:29,013 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:29,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:29,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:29,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1212 [2022-12-13 02:01:29,013 INFO L420 AbstractCegarLoop]: === Iteration 1214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:29,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:29,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1554834095, now seen corresponding path program 1 times [2022-12-13 02:01:29,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:29,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853890838] [2022-12-13 02:01:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:29,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:29,082 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 02:01:29,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853890838] [2022-12-13 02:01:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853890838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:29,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056185871] [2022-12-13 02:01:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:29,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:29,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:29,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:29,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:29,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:29,136 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:29,136 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:29,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:29,137 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:29,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:29,137 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:29,137 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:29,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:29,138 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,138 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:29,138 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:29,138 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:29,138 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:29,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:29,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,141 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:29,141 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:29,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:29,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:29,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:29,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:29,275 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:29,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:29,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:29,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1213 [2022-12-13 02:01:29,276 INFO L420 AbstractCegarLoop]: === Iteration 1215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:29,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1497575793, now seen corresponding path program 1 times [2022-12-13 02:01:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:29,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604632503] [2022-12-13 02:01:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:29,330 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 02:01:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:29,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604632503] [2022-12-13 02:01:29,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604632503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:29,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:29,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883099821] [2022-12-13 02:01:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:29,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:29,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:29,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:29,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:29,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:29,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:29,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:29,385 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:29,386 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:29,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:29,386 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:29,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:29,387 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:29,387 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:29,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:29,388 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:29,388 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:29,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:29,389 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:29,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:29,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,392 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:29,393 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:29,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:29,516 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:29,517 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:01:29,517 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:29,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:29,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:29,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1214 [2022-12-13 02:01:29,517 INFO L420 AbstractCegarLoop]: === Iteration 1216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:29,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:29,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1440317491, now seen corresponding path program 1 times [2022-12-13 02:01:29,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:29,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152161500] [2022-12-13 02:01:29,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:29,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:29,581 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 02:01:29,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:29,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152161500] [2022-12-13 02:01:29,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152161500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:29,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:29,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:29,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380104818] [2022-12-13 02:01:29,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:29,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:29,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:29,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:29,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:29,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:29,636 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:29,637 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:29,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:29,637 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:29,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:29,637 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:29,638 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:29,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:29,638 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,638 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:29,638 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:29,639 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:29,639 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,639 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:29,639 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:29,639 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,641 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:29,641 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:29,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:29,642 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,642 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:29,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:29,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:29,758 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:29,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:29,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:29,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1215 [2022-12-13 02:01:29,759 INFO L420 AbstractCegarLoop]: === Iteration 1217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1383059189, now seen corresponding path program 1 times [2022-12-13 02:01:29,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:29,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736395791] [2022-12-13 02:01:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:29,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:29,810 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 02:01:29,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:29,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736395791] [2022-12-13 02:01:29,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736395791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:29,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:29,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:29,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082343880] [2022-12-13 02:01:29,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:29,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:29,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:29,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:29,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:29,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:29,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:29,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:29,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:29,900 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:29,900 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:29,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:29,900 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:29,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:29,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:29,901 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:29,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:29,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:29,902 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:29,902 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:29,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:29,902 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:29,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:29,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:29,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,905 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:29,905 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:29,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:29,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:29,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:30,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:30,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:30,024 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:30,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:30,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:30,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1216 [2022-12-13 02:01:30,024 INFO L420 AbstractCegarLoop]: === Iteration 1218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1325800887, now seen corresponding path program 1 times [2022-12-13 02:01:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107506249] [2022-12-13 02:01:30,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:30,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:30,080 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 02:01:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:30,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107506249] [2022-12-13 02:01:30,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107506249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:30,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:30,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115618955] [2022-12-13 02:01:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:30,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:30,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:30,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:30,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:30,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:30,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:30,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:30,132 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:30,132 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:30,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:30,132 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:30,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:30,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:30,133 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:30,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:30,134 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:30,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:30,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:30,134 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:30,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:30,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,137 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:30,137 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:30,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:30,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:30,253 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:30,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:30,254 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:30,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:30,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:30,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1217 [2022-12-13 02:01:30,255 INFO L420 AbstractCegarLoop]: === Iteration 1219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:30,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1268542585, now seen corresponding path program 1 times [2022-12-13 02:01:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:30,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278632102] [2022-12-13 02:01:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:30,307 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 02:01:30,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:30,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278632102] [2022-12-13 02:01:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278632102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:30,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:30,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746107603] [2022-12-13 02:01:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:30,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:30,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:30,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:30,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:30,361 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:30,361 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:30,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:30,362 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:30,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:30,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:30,362 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:30,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:30,363 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:30,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:30,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:30,364 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:30,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:30,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,366 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:30,367 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:30,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:30,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:30,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:30,485 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:30,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:30,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:30,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1218 [2022-12-13 02:01:30,486 INFO L420 AbstractCegarLoop]: === Iteration 1220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1211284283, now seen corresponding path program 1 times [2022-12-13 02:01:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:30,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224015447] [2022-12-13 02:01:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:30,537 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 02:01:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:30,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224015447] [2022-12-13 02:01:30,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224015447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:30,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:30,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887179158] [2022-12-13 02:01:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:30,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:30,538 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:30,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:30,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:30,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:30,581 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:30,581 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:30,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:30,582 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:30,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:30,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:30,582 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:30,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:30,583 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:30,583 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:30,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:30,583 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:30,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:30,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,586 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:30,586 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:30,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:30,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:30,711 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:30,711 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:01:30,711 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:30,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,712 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:30,712 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:30,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1219 [2022-12-13 02:01:30,712 INFO L420 AbstractCegarLoop]: === Iteration 1221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1154025981, now seen corresponding path program 1 times [2022-12-13 02:01:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711508374] [2022-12-13 02:01:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:30,765 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 02:01:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:30,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711508374] [2022-12-13 02:01:30,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711508374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:30,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:30,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:30,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369900722] [2022-12-13 02:01:30,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:30,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:30,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:30,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:30,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:30,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:30,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:30,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:30,809 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:30,809 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:30,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:30,810 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:30,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:30,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:30,811 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:30,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:30,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:30,811 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:30,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:30,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:30,812 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:30,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:30,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:30,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,814 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:30,815 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:30,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:30,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:30,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:30,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:30,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:30,932 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:30,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:30,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:30,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1220 [2022-12-13 02:01:30,932 INFO L420 AbstractCegarLoop]: === Iteration 1222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1096767679, now seen corresponding path program 1 times [2022-12-13 02:01:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:30,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469802772] [2022-12-13 02:01:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:30,996 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 02:01:30,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:30,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469802772] [2022-12-13 02:01:30,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469802772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:30,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:30,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005530291] [2022-12-13 02:01:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:30,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:30,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:30,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:30,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:30,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:30,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:30,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:30,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:30,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:31,042 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:31,042 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:31,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:31,042 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:31,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:31,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:31,043 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:31,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:31,044 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:31,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:31,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:31,044 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:31,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:31,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,047 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:31,047 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:31,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:31,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:31,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:31,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:31,163 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:31,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:31,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:31,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1221 [2022-12-13 02:01:31,164 INFO L420 AbstractCegarLoop]: === Iteration 1223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1039509377, now seen corresponding path program 1 times [2022-12-13 02:01:31,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:31,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928328876] [2022-12-13 02:01:31,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:31,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:31,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:31,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928328876] [2022-12-13 02:01:31,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928328876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:31,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:31,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:31,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216603186] [2022-12-13 02:01:31,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:31,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:31,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:31,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:31,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:31,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:31,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:31,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:31,261 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:31,261 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:31,262 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:31,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:31,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:31,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:31,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:31,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:31,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:31,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:31,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:31,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:31,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:31,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:31,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:31,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:31,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:31,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:31,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:31,383 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:31,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:31,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:31,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1222 [2022-12-13 02:01:31,384 INFO L420 AbstractCegarLoop]: === Iteration 1224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -982251075, now seen corresponding path program 1 times [2022-12-13 02:01:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:31,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835634556] [2022-12-13 02:01:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:31,434 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 02:01:31,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:31,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835634556] [2022-12-13 02:01:31,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835634556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:31,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:31,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569073378] [2022-12-13 02:01:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:31,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:31,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:31,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:31,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:31,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:31,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:31,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:31,477 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:31,478 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:31,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:31,478 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:31,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:31,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:31,479 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:31,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:31,480 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:31,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:31,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:31,480 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:31,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:31,481 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,484 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:31,484 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:31,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:31,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:31,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:31,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:31,615 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:31,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:31,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:31,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1223 [2022-12-13 02:01:31,615 INFO L420 AbstractCegarLoop]: === Iteration 1225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:31,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -924992773, now seen corresponding path program 1 times [2022-12-13 02:01:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:31,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31498435] [2022-12-13 02:01:31,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:31,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:31,669 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 02:01:31,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:31,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31498435] [2022-12-13 02:01:31,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31498435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:31,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:31,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:31,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051669454] [2022-12-13 02:01:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:31,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:31,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:31,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:31,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:31,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:31,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:31,723 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:31,723 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:31,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:31,724 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:31,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:31,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:31,724 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:31,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:31,725 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,725 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:31,725 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:31,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:31,725 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:31,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:31,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,728 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:31,728 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:31,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:31,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:31,856 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:31,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:01:31,857 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:31,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:31,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:31,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1224 [2022-12-13 02:01:31,857 INFO L420 AbstractCegarLoop]: === Iteration 1226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:31,857 INFO L85 PathProgramCache]: Analyzing trace with hash -867734471, now seen corresponding path program 1 times [2022-12-13 02:01:31,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873548737] [2022-12-13 02:01:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:31,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:31,908 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 02:01:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:31,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873548737] [2022-12-13 02:01:31,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873548737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:31,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:31,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060468445] [2022-12-13 02:01:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:31,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:31,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:31,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:31,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:31,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:31,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:31,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:31,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:31,959 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:31,959 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:31,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:31,960 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:31,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:31,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:31,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:31,961 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:31,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:31,961 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:31,962 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:31,962 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:31,962 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:31,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:31,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:31,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,964 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:31,965 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:31,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:31,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:31,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:32,079 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:32,080 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:32,080 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:32,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:32,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:32,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1225 [2022-12-13 02:01:32,080 INFO L420 AbstractCegarLoop]: === Iteration 1227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:32,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:32,080 INFO L85 PathProgramCache]: Analyzing trace with hash -810476169, now seen corresponding path program 1 times [2022-12-13 02:01:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:32,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934385088] [2022-12-13 02:01:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:32,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:32,131 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 02:01:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:32,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934385088] [2022-12-13 02:01:32,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934385088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:32,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:32,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544974725] [2022-12-13 02:01:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:32,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:32,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:32,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:32,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:32,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:32,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:32,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:32,183 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:32,183 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:32,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:32,183 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:32,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:32,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:32,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:32,184 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:32,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:32,185 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:32,185 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:32,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:32,185 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,185 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:32,185 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:32,185 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,188 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:32,188 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:32,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:32,188 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,188 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:32,302 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:32,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:32,303 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:32,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:32,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:32,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1226 [2022-12-13 02:01:32,303 INFO L420 AbstractCegarLoop]: === Iteration 1228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -753217867, now seen corresponding path program 1 times [2022-12-13 02:01:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:32,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761315227] [2022-12-13 02:01:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:32,374 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 02:01:32,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:32,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761315227] [2022-12-13 02:01:32,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761315227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:32,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:32,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294544739] [2022-12-13 02:01:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:32,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:32,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:32,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:32,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:32,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:32,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:32,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:32,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:32,420 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:32,421 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:32,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:32,421 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:32,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:32,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:32,422 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:32,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:32,423 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:32,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:32,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:32,423 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:32,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:32,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,426 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:32,426 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:32,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:32,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:32,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:32,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:32,546 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:32,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:32,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:32,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1227 [2022-12-13 02:01:32,546 INFO L420 AbstractCegarLoop]: === Iteration 1229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:32,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash -695959565, now seen corresponding path program 1 times [2022-12-13 02:01:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:32,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494759313] [2022-12-13 02:01:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:32,600 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 02:01:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494759313] [2022-12-13 02:01:32,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494759313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:32,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:32,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:32,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979314457] [2022-12-13 02:01:32,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:32,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:32,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:32,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:32,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:32,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:32,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:32,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:32,644 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:32,644 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:32,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:32,645 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:32,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:32,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:32,646 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:32,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:32,646 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:32,647 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:32,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:32,647 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:32,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:32,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,650 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:32,650 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:32,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:32,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:32,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:32,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:32,769 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:32,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,770 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:32,770 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:32,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1228 [2022-12-13 02:01:32,770 INFO L420 AbstractCegarLoop]: === Iteration 1230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash -638701263, now seen corresponding path program 1 times [2022-12-13 02:01:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:32,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114910369] [2022-12-13 02:01:32,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:32,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:32,835 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 02:01:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:32,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114910369] [2022-12-13 02:01:32,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114910369] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:32,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:32,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060422894] [2022-12-13 02:01:32,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:32,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:32,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:32,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:32,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:32,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:32,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:32,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:32,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:32,901 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:32,901 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:32,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:32,902 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:32,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:32,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:32,903 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:32,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:32,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:32,904 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,904 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:32,904 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:32,904 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:32,904 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:32,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:32,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:32,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,908 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:32,909 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:32,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:32,909 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:32,909 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:33,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:33,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:01:33,035 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:33,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:33,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:33,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1229 [2022-12-13 02:01:33,036 INFO L420 AbstractCegarLoop]: === Iteration 1231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -581442961, now seen corresponding path program 1 times [2022-12-13 02:01:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:33,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458779573] [2022-12-13 02:01:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:33,102 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 02:01:33,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:33,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458779573] [2022-12-13 02:01:33,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458779573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:33,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:33,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:33,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694594244] [2022-12-13 02:01:33,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:33,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:33,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:33,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:33,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:33,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:33,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:33,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:33,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:33,161 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:33,161 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:33,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:33,162 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:33,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:33,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:33,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:33,162 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:33,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:33,163 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:33,164 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:33,164 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:33,164 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,164 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:33,164 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:33,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,168 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:33,168 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:33,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:33,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:33,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:33,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:33,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:33,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:33,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:33,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1230 [2022-12-13 02:01:33,302 INFO L420 AbstractCegarLoop]: === Iteration 1232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:33,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:33,302 INFO L85 PathProgramCache]: Analyzing trace with hash -524184659, now seen corresponding path program 1 times [2022-12-13 02:01:33,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:33,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610176383] [2022-12-13 02:01:33,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:33,355 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 02:01:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:33,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610176383] [2022-12-13 02:01:33,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610176383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:33,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:33,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476436876] [2022-12-13 02:01:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:33,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:33,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:33,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:33,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:33,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:33,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:33,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:33,408 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:33,408 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:33,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:33,409 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:33,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:33,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:33,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:33,409 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:33,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:33,410 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:33,410 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:33,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:33,411 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:33,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:33,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,413 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:33,413 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:33,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:33,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:33,531 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:33,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:33,532 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:33,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:33,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:33,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1231 [2022-12-13 02:01:33,532 INFO L420 AbstractCegarLoop]: === Iteration 1233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:33,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash -466926357, now seen corresponding path program 1 times [2022-12-13 02:01:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:33,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626621828] [2022-12-13 02:01:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:33,586 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 02:01:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:33,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626621828] [2022-12-13 02:01:33,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626621828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:33,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:33,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777610444] [2022-12-13 02:01:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:33,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:33,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:33,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:33,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:33,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:33,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:33,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:33,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:33,637 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:33,638 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:33,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:33,638 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:33,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:33,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:33,639 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:33,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:33,639 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:33,640 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:33,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:33,640 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:33,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:33,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,643 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:33,643 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:33,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:33,643 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,643 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:33,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:33,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:01:33,768 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:33,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:33,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1232 [2022-12-13 02:01:33,769 INFO L420 AbstractCegarLoop]: === Iteration 1234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:33,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash -409668055, now seen corresponding path program 1 times [2022-12-13 02:01:33,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:33,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891284527] [2022-12-13 02:01:33,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:33,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:33,821 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 02:01:33,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:33,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891284527] [2022-12-13 02:01:33,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891284527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:33,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:33,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137515175] [2022-12-13 02:01:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:33,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:33,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:33,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:33,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:33,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:33,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:33,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:33,865 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:33,865 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:33,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:33,865 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:33,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:33,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:33,866 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:33,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:33,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:33,867 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:33,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:33,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:33,867 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:33,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:33,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:33,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,870 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:33,870 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:33,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:33,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:33,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:33,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:33,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:33,987 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:33,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:33,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:33,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:33,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1233 [2022-12-13 02:01:33,987 INFO L420 AbstractCegarLoop]: === Iteration 1235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:33,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash -352409753, now seen corresponding path program 1 times [2022-12-13 02:01:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:33,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922866469] [2022-12-13 02:01:33,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:34,044 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 02:01:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922866469] [2022-12-13 02:01:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922866469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:34,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537192219] [2022-12-13 02:01:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:34,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:34,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:34,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:34,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:34,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:34,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:34,088 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:34,088 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:34,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:34,089 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:34,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:34,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:34,089 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:34,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:34,090 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:34,090 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:34,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:34,090 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,090 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:34,090 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:34,090 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,093 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:34,093 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:34,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:34,093 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:34,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:34,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:34,209 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:34,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:34,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:34,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1234 [2022-12-13 02:01:34,209 INFO L420 AbstractCegarLoop]: === Iteration 1236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:34,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash -295151451, now seen corresponding path program 1 times [2022-12-13 02:01:34,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:34,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663712148] [2022-12-13 02:01:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:34,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 02:01:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:34,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663712148] [2022-12-13 02:01:34,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663712148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:34,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:34,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149240921] [2022-12-13 02:01:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:34,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:34,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:34,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:34,264 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:34,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:34,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:34,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:34,313 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:34,313 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:34,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:34,313 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:34,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:34,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:34,314 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:34,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:34,315 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:34,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:34,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:34,315 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:34,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:34,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,318 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:34,318 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:34,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:34,318 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,318 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:34,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:34,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:34,435 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:34,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:34,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:34,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1235 [2022-12-13 02:01:34,435 INFO L420 AbstractCegarLoop]: === Iteration 1237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash -237893149, now seen corresponding path program 1 times [2022-12-13 02:01:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:34,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806617800] [2022-12-13 02:01:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:34,489 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 02:01:34,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:34,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806617800] [2022-12-13 02:01:34,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806617800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:34,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:34,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:34,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035949066] [2022-12-13 02:01:34,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:34,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:34,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:34,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:34,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:34,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:34,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:34,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:34,533 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:34,534 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:34,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:34,534 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:34,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:34,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:34,535 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:34,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:34,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:34,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:34,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:34,536 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:34,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:34,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,539 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:34,539 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:34,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:34,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:34,655 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:34,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:34,655 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:34,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:34,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:34,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1236 [2022-12-13 02:01:34,656 INFO L420 AbstractCegarLoop]: === Iteration 1238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash -180634847, now seen corresponding path program 1 times [2022-12-13 02:01:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:34,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306959895] [2022-12-13 02:01:34,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:34,710 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 02:01:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:34,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306959895] [2022-12-13 02:01:34,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306959895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:34,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:34,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824737724] [2022-12-13 02:01:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:34,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:34,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:34,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:34,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:34,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:34,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:34,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:34,754 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:34,754 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:34,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:34,755 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:34,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:34,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:34,755 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:34,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:34,756 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:34,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:34,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:34,757 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,757 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:34,757 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:34,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,759 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:34,759 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:34,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:34,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:34,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:34,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:34,877 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:34,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:34,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:34,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1237 [2022-12-13 02:01:34,877 INFO L420 AbstractCegarLoop]: === Iteration 1239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash -123376545, now seen corresponding path program 1 times [2022-12-13 02:01:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:34,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028009019] [2022-12-13 02:01:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:34,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:34,929 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 02:01:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:34,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028009019] [2022-12-13 02:01:34,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028009019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:34,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:34,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938937946] [2022-12-13 02:01:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:34,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:34,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:34,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:34,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:34,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:34,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:34,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:34,984 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:34,984 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:34,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:34,984 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:34,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:34,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:34,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:34,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:34,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:34,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:34,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:34,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:34,986 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:34,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:34,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:34,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,989 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:34,989 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:34,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:34,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:34,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:35,105 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:35,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:35,106 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:35,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:35,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1238 [2022-12-13 02:01:35,106 INFO L420 AbstractCegarLoop]: === Iteration 1240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -66118243, now seen corresponding path program 1 times [2022-12-13 02:01:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:35,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756166348] [2022-12-13 02:01:35,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:35,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:35,161 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 02:01:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:35,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756166348] [2022-12-13 02:01:35,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756166348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:35,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:35,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052166389] [2022-12-13 02:01:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:35,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:35,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:35,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:35,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:35,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:35,209 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:35,209 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:35,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:35,210 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:35,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:35,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:35,210 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:35,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:35,211 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:35,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:35,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:35,212 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:35,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:35,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,214 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:35,214 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:35,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:35,215 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,215 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:35,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:35,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:01:35,340 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:35,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:35,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:35,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1239 [2022-12-13 02:01:35,341 INFO L420 AbstractCegarLoop]: === Iteration 1241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash -8859941, now seen corresponding path program 1 times [2022-12-13 02:01:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:35,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074258602] [2022-12-13 02:01:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:35,406 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 02:01:35,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074258602] [2022-12-13 02:01:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074258602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:35,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:35,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866765211] [2022-12-13 02:01:35,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:35,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:35,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:35,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:35,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:35,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:35,451 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:35,451 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:35,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:35,451 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:35,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:35,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:35,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:35,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:35,452 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:35,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:35,453 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:35,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:35,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:35,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:35,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:35,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:35,456 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:35,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:35,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:35,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:35,573 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:35,573 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:35,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,573 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:35,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:35,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1240 [2022-12-13 02:01:35,574 INFO L420 AbstractCegarLoop]: === Iteration 1242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 48398361, now seen corresponding path program 1 times [2022-12-13 02:01:35,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:35,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729082364] [2022-12-13 02:01:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:35,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729082364] [2022-12-13 02:01:35,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729082364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:35,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:35,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488825956] [2022-12-13 02:01:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:35,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:35,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:35,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:35,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:35,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:35,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:35,673 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:35,673 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:35,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:35,673 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:35,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:35,674 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:35,674 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:35,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:35,674 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,675 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:35,675 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:35,675 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:35,675 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:35,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:35,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,678 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:35,678 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:35,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:35,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:35,793 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:35,793 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:35,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:35,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:35,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:35,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1241 [2022-12-13 02:01:35,794 INFO L420 AbstractCegarLoop]: === Iteration 1243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash 105656663, now seen corresponding path program 1 times [2022-12-13 02:01:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:35,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329514273] [2022-12-13 02:01:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:35,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:35,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 02:01:35,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:35,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329514273] [2022-12-13 02:01:35,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329514273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:35,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:35,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65500200] [2022-12-13 02:01:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:35,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:35,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:35,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:35,847 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:35,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:35,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:35,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:35,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:35,896 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:35,896 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:35,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:35,897 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:35,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:35,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:35,897 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:35,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:35,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:35,898 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,898 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:35,898 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:35,898 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:35,898 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:35,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:35,899 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:35,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,901 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:35,901 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:35,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:35,901 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:35,901 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:36,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:36,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:36,033 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:36,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:36,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:36,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1242 [2022-12-13 02:01:36,033 INFO L420 AbstractCegarLoop]: === Iteration 1244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:36,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 162914965, now seen corresponding path program 1 times [2022-12-13 02:01:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:36,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172055078] [2022-12-13 02:01:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:36,093 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 02:01:36,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:36,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172055078] [2022-12-13 02:01:36,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172055078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:36,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:36,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:36,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811990404] [2022-12-13 02:01:36,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:36,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:36,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:36,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:36,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:36,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:36,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:36,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:36,146 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:36,146 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:36,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:36,147 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:36,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:36,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:36,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:36,148 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:36,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:36,149 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:36,149 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:36,149 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:36,149 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:36,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:36,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,152 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:36,152 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:36,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:36,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:36,286 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:36,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:36,287 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:36,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,287 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:36,287 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:36,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1243 [2022-12-13 02:01:36,287 INFO L420 AbstractCegarLoop]: === Iteration 1245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 220173267, now seen corresponding path program 1 times [2022-12-13 02:01:36,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:36,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897369368] [2022-12-13 02:01:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:36,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:36,356 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 02:01:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:36,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897369368] [2022-12-13 02:01:36,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897369368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:36,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:36,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:36,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103229441] [2022-12-13 02:01:36,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:36,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:36,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:36,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:36,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:36,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:36,420 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:36,420 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:36,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:36,421 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:36,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:36,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:36,421 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:36,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:36,422 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:36,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:36,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:36,422 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:36,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:36,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,425 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:36,425 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:36,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:36,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:36,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:36,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:36,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:36,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:36,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:36,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1244 [2022-12-13 02:01:36,558 INFO L420 AbstractCegarLoop]: === Iteration 1246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 277431569, now seen corresponding path program 1 times [2022-12-13 02:01:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:36,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49951575] [2022-12-13 02:01:36,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:36,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:36,613 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 02:01:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:36,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49951575] [2022-12-13 02:01:36,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49951575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:36,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:36,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:36,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808177985] [2022-12-13 02:01:36,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:36,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:36,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:36,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:36,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:36,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:36,668 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:36,668 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:36,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:36,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:36,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:36,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:36,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:36,669 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:36,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:36,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:36,671 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:36,671 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:36,671 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:36,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:36,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,675 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:36,675 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:36,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:36,675 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:36,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:36,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:36,806 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:36,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:36,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:36,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1245 [2022-12-13 02:01:36,806 INFO L420 AbstractCegarLoop]: === Iteration 1247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:36,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:36,806 INFO L85 PathProgramCache]: Analyzing trace with hash 334689871, now seen corresponding path program 1 times [2022-12-13 02:01:36,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:36,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116460722] [2022-12-13 02:01:36,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:36,865 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 02:01:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116460722] [2022-12-13 02:01:36,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116460722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:36,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:36,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639540296] [2022-12-13 02:01:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:36,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:36,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:36,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:36,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:36,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:36,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:36,919 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:36,919 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:36,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:36,920 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:36,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:36,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:36,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:36,920 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:36,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:36,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:36,921 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:36,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:36,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:36,921 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:36,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:36,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:36,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,924 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:36,924 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:36,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:36,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:36,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:37,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:37,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:37,047 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:37,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:37,047 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:37,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1246 [2022-12-13 02:01:37,048 INFO L420 AbstractCegarLoop]: === Iteration 1248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:37,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash 391948173, now seen corresponding path program 1 times [2022-12-13 02:01:37,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:37,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681142964] [2022-12-13 02:01:37,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:37,101 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 02:01:37,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:37,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681142964] [2022-12-13 02:01:37,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681142964] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:37,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:37,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854321791] [2022-12-13 02:01:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:37,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:37,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:37,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:37,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:37,102 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:37,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:37,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:37,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:37,152 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:37,152 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:37,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:37,153 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:37,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:37,153 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:37,153 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:37,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:37,154 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:37,154 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:37,154 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:37,154 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,154 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:37,154 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:37,154 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,157 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:37,157 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:37,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:37,157 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,157 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:37,274 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:37,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:37,275 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:37,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:37,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:37,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1247 [2022-12-13 02:01:37,275 INFO L420 AbstractCegarLoop]: === Iteration 1249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:37,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 449206475, now seen corresponding path program 1 times [2022-12-13 02:01:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:37,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119138711] [2022-12-13 02:01:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:37,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:37,327 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 02:01:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:37,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119138711] [2022-12-13 02:01:37,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119138711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:37,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:37,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918182715] [2022-12-13 02:01:37,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:37,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:37,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:37,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:37,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:37,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:37,371 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:37,371 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:37,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:37,371 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:37,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:37,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:37,372 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:37,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:37,373 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,373 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:37,373 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:37,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:37,373 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,373 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:37,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:37,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,376 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:37,376 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:37,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:37,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:37,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:37,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:37,492 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:37,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:37,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:37,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1248 [2022-12-13 02:01:37,493 INFO L420 AbstractCegarLoop]: === Iteration 1250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:37,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:37,493 INFO L85 PathProgramCache]: Analyzing trace with hash 506464777, now seen corresponding path program 1 times [2022-12-13 02:01:37,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:37,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683892268] [2022-12-13 02:01:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:37,546 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 02:01:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:37,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683892268] [2022-12-13 02:01:37,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683892268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:37,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:37,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557782489] [2022-12-13 02:01:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:37,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:37,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:37,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:37,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:37,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:37,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:37,598 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:37,598 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:37,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:37,599 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:37,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:37,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:37,599 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:37,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:37,600 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:37,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:37,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:37,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:37,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:37,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:37,603 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:37,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:37,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:37,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:37,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:37,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:37,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:37,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:37,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1249 [2022-12-13 02:01:37,720 INFO L420 AbstractCegarLoop]: === Iteration 1251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:37,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 563723079, now seen corresponding path program 1 times [2022-12-13 02:01:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:37,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363633441] [2022-12-13 02:01:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:37,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:37,779 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 02:01:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:37,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363633441] [2022-12-13 02:01:37,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363633441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:37,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:37,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:37,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207016702] [2022-12-13 02:01:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:37,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:37,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:37,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:37,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:37,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:37,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:37,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:37,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:37,829 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:37,830 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:37,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:37,830 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:37,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:37,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:37,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:37,831 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:37,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:37,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:37,831 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:37,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:37,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:37,832 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:37,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:37,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:37,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,835 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:37,835 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:37,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:37,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:37,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:37,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:37,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:37,951 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:37,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:37,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:37,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:37,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1250 [2022-12-13 02:01:37,952 INFO L420 AbstractCegarLoop]: === Iteration 1252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 620981381, now seen corresponding path program 1 times [2022-12-13 02:01:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:37,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859538068] [2022-12-13 02:01:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:38,002 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 02:01:38,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:38,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859538068] [2022-12-13 02:01:38,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859538068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:38,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:38,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:38,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061282107] [2022-12-13 02:01:38,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:38,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:38,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:38,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:38,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:38,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:38,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:38,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:38,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:38,054 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:38,054 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:38,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:38,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:38,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:38,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:38,055 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:38,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:38,056 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:38,056 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:38,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:38,056 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:38,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:38,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,059 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:38,059 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:38,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:38,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:38,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:38,176 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:38,176 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:38,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:38,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:38,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1251 [2022-12-13 02:01:38,177 INFO L420 AbstractCegarLoop]: === Iteration 1253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:38,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:38,177 INFO L85 PathProgramCache]: Analyzing trace with hash 678239683, now seen corresponding path program 1 times [2022-12-13 02:01:38,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:38,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432777039] [2022-12-13 02:01:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:38,231 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 02:01:38,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:38,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432777039] [2022-12-13 02:01:38,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432777039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:38,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:38,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:38,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137372259] [2022-12-13 02:01:38,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:38,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:38,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:38,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:38,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:38,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:38,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:38,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:38,282 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:38,282 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:38,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:38,282 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:38,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:38,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:38,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:38,283 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:38,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:38,284 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:38,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:38,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:38,284 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:38,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:38,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,287 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:38,287 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:38,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:38,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:38,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:38,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:38,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:38,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:38,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:38,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1252 [2022-12-13 02:01:38,404 INFO L420 AbstractCegarLoop]: === Iteration 1254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:38,404 INFO L85 PathProgramCache]: Analyzing trace with hash 735497985, now seen corresponding path program 1 times [2022-12-13 02:01:38,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:38,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571273184] [2022-12-13 02:01:38,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:38,466 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 02:01:38,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:38,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571273184] [2022-12-13 02:01:38,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571273184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:38,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:38,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114750980] [2022-12-13 02:01:38,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:38,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:38,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:38,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:38,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:38,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:38,512 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:38,512 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:38,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:38,513 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:38,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:38,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:38,514 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:38,514 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:38,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:38,514 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:38,515 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:38,515 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:38,515 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:38,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:38,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,518 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:38,518 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:38,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:38,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:38,634 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:38,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:38,635 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:38,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:38,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:38,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1253 [2022-12-13 02:01:38,635 INFO L420 AbstractCegarLoop]: === Iteration 1255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 792756287, now seen corresponding path program 1 times [2022-12-13 02:01:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587367498] [2022-12-13 02:01:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:38,689 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 02:01:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:38,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587367498] [2022-12-13 02:01:38,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587367498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:38,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:38,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308123491] [2022-12-13 02:01:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:38,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:38,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:38,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:38,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:38,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:38,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:38,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:38,742 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:38,742 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:38,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:38,743 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:38,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:38,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:38,743 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:38,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:38,744 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:38,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:38,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:38,744 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,745 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:38,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:38,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,747 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:38,747 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:38,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:38,748 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,748 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:38,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:38,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:38,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:38,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:38,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:38,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1254 [2022-12-13 02:01:38,864 INFO L420 AbstractCegarLoop]: === Iteration 1256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash 850014589, now seen corresponding path program 1 times [2022-12-13 02:01:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:38,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773093550] [2022-12-13 02:01:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:38,919 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 02:01:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773093550] [2022-12-13 02:01:38,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773093550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:38,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:38,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152298093] [2022-12-13 02:01:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:38,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:38,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:38,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:38,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:38,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:38,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:38,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:38,982 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:38,982 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:38,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:38,983 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:38,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:38,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:38,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:38,983 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:38,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:38,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:38,984 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:38,985 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:38,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:38,985 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:38,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:38,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:38,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,988 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:38,988 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:38,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:38,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:38,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:39,108 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:39,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:01:39,109 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:39,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:39,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:39,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1255 [2022-12-13 02:01:39,109 INFO L420 AbstractCegarLoop]: === Iteration 1257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 907272891, now seen corresponding path program 1 times [2022-12-13 02:01:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:39,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400437263] [2022-12-13 02:01:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:39,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 02:01:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:39,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400437263] [2022-12-13 02:01:39,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400437263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:39,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:39,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498932212] [2022-12-13 02:01:39,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:39,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:39,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:39,164 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:39,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:39,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:39,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:39,207 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:39,207 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:39,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:39,208 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:39,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:39,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:39,208 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:39,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:39,209 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:39,209 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:39,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:39,209 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:39,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:39,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,212 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:39,212 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:39,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:39,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:39,327 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:39,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:39,328 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:39,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:39,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:39,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1256 [2022-12-13 02:01:39,328 INFO L420 AbstractCegarLoop]: === Iteration 1258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:39,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:39,328 INFO L85 PathProgramCache]: Analyzing trace with hash 964531193, now seen corresponding path program 1 times [2022-12-13 02:01:39,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:39,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763599579] [2022-12-13 02:01:39,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:39,388 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 02:01:39,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763599579] [2022-12-13 02:01:39,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763599579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:39,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:39,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:39,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318059027] [2022-12-13 02:01:39,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:39,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:39,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:39,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:39,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:39,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:39,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:39,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:39,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:39,432 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:39,433 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:39,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:39,433 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:39,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:39,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:39,434 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:39,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:39,434 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:39,435 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:39,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:39,435 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:39,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:39,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,438 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:39,438 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:39,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:39,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:39,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:39,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:01:39,552 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:39,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:39,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:39,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1257 [2022-12-13 02:01:39,552 INFO L420 AbstractCegarLoop]: === Iteration 1259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:39,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1021789495, now seen corresponding path program 1 times [2022-12-13 02:01:39,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:39,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884089083] [2022-12-13 02:01:39,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:39,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:39,604 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 02:01:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:39,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884089083] [2022-12-13 02:01:39,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884089083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:39,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:39,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:39,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371535335] [2022-12-13 02:01:39,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:39,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:39,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:39,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:39,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:39,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:39,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:39,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:39,652 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:39,652 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:39,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:39,653 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:39,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:39,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:39,653 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:39,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:39,654 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:39,654 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:39,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:39,655 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:39,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:39,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,657 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:39,657 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:39,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:39,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:39,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:39,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:39,788 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:39,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:39,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:39,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1258 [2022-12-13 02:01:39,789 INFO L420 AbstractCegarLoop]: === Iteration 1260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:39,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1079047797, now seen corresponding path program 1 times [2022-12-13 02:01:39,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:39,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263210951] [2022-12-13 02:01:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:39,847 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 02:01:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:39,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263210951] [2022-12-13 02:01:39,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263210951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:39,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:39,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:39,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898519925] [2022-12-13 02:01:39,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:39,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:39,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:39,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:39,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:39,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:39,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:39,900 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:39,900 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:39,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:39,901 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:39,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:39,902 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:39,902 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:39,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:39,903 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,903 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:39,903 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:39,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:39,903 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,904 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:39,904 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:39,904 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:39,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,908 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:39,908 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:39,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:39,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:39,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:40,041 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:40,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:01:40,042 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:40,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:40,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:40,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1259 [2022-12-13 02:01:40,042 INFO L420 AbstractCegarLoop]: === Iteration 1261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:40,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1136306099, now seen corresponding path program 1 times [2022-12-13 02:01:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:40,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305005826] [2022-12-13 02:01:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:40,103 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 02:01:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305005826] [2022-12-13 02:01:40,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305005826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:40,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:40,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333387170] [2022-12-13 02:01:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:40,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:40,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:40,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:40,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:40,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:40,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:40,159 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:40,159 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:40,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:40,160 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:40,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:40,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:40,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:40,160 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:40,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:40,162 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:40,162 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:40,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:40,162 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:40,162 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:40,162 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,166 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:40,166 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:40,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:40,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:40,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:01:40,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:40,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:40,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:40,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1260 [2022-12-13 02:01:40,305 INFO L420 AbstractCegarLoop]: === Iteration 1262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:40,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1193564401, now seen corresponding path program 1 times [2022-12-13 02:01:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:40,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505538834] [2022-12-13 02:01:40,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:40,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505538834] [2022-12-13 02:01:40,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505538834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:40,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:40,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260659527] [2022-12-13 02:01:40,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:40,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:40,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:40,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:40,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:40,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:40,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:40,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:40,431 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:40,431 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:40,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:40,432 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:40,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:40,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:40,432 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:40,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:40,433 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:40,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:40,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:40,434 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:40,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:40,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:40,438 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:40,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:40,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:40,567 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:40,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:40,568 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:40,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:40,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:40,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1261 [2022-12-13 02:01:40,569 INFO L420 AbstractCegarLoop]: === Iteration 1263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1250822703, now seen corresponding path program 1 times [2022-12-13 02:01:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:40,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924543618] [2022-12-13 02:01:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:40,642 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 02:01:40,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:40,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924543618] [2022-12-13 02:01:40,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924543618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:40,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:40,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346620890] [2022-12-13 02:01:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:40,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:40,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:40,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:40,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:40,643 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:40,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:40,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:40,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:40,697 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:40,698 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:40,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:40,698 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:40,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:40,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:40,699 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:40,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:40,700 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:40,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:40,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:40,701 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:40,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:40,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,705 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:40,705 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:40,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:40,705 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,705 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:40,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:40,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:40,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:40,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:40,839 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:40,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1262 [2022-12-13 02:01:40,839 INFO L420 AbstractCegarLoop]: === Iteration 1264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1308081005, now seen corresponding path program 1 times [2022-12-13 02:01:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:40,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678882240] [2022-12-13 02:01:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:40,897 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 02:01:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678882240] [2022-12-13 02:01:40,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678882240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:40,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:40,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:40,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852551022] [2022-12-13 02:01:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:40,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:40,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:40,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:40,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:40,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:40,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:40,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:40,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:40,955 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:40,955 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:40,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:40,956 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:40,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:40,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:40,956 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:40,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:40,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:40,957 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:40,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:40,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:40,957 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,958 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:40,958 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:40,958 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:40,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,961 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:40,961 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:40,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:40,961 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:40,961 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:41,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:41,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:01:41,097 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:41,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:41,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:41,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1263 [2022-12-13 02:01:41,098 INFO L420 AbstractCegarLoop]: === Iteration 1265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:41,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1365339307, now seen corresponding path program 1 times [2022-12-13 02:01:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:41,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885088454] [2022-12-13 02:01:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:41,158 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 02:01:41,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:41,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885088454] [2022-12-13 02:01:41,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885088454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:41,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:41,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:41,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6883760] [2022-12-13 02:01:41,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:41,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:41,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:41,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:41,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:41,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:41,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:41,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:41,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:41,211 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:41,212 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:41,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:41,212 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:41,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:41,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:41,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:41,213 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:41,213 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:41,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:41,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:41,214 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:41,214 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:41,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:41,214 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,214 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:41,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:41,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:41,217 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:41,217 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:41,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:41,217 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:41,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:41,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:41,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:01:41,357 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:41,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:41,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:41,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1264 [2022-12-13 02:01:41,357 INFO L420 AbstractCegarLoop]: === Iteration 1266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:41,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1422597609, now seen corresponding path program 1 times [2022-12-13 02:01:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:41,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768623592] [2022-12-13 02:01:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:41,431 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 02:01:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:41,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768623592] [2022-12-13 02:01:41,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768623592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:41,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:41,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15977128] [2022-12-13 02:01:41,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:41,432 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:41,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:41,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:41,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:41,499 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:41,500 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:41,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:41,500 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:41,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:41,501 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:41,501 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:41,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:41,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:41,501 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,502 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:41,502 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:41,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:41,502 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:41,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:41,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:41,505 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:41,505 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:41,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:41,505 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:41,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:41,636 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:41,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:41,636 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:41,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:41,637 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:41,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1265 [2022-12-13 02:01:41,637 INFO L420 AbstractCegarLoop]: === Iteration 1267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1479855911, now seen corresponding path program 1 times [2022-12-13 02:01:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:41,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782059732] [2022-12-13 02:01:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:41,697 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 02:01:41,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:41,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782059732] [2022-12-13 02:01:41,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782059732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:41,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:41,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:41,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943568481] [2022-12-13 02:01:41,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:41,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:41,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:41,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:41,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:41,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:41,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:41,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:41,750 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:41,750 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:41,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:41,751 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:41,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:41,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:41,752 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:41,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:41,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:41,752 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:41,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:41,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:41,753 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:41,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:41,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:41,756 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:41,756 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:41,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:41,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:41,887 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:41,888 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:41,888 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:41,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:41,888 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:41,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1266 [2022-12-13 02:01:41,888 INFO L420 AbstractCegarLoop]: === Iteration 1268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:41,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1537114213, now seen corresponding path program 1 times [2022-12-13 02:01:41,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:41,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314842137] [2022-12-13 02:01:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:41,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:41,966 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 02:01:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:41,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314842137] [2022-12-13 02:01:41,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314842137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:41,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:41,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310692410] [2022-12-13 02:01:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:41,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:41,967 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:41,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:41,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:41,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:41,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:42,027 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:42,028 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:42,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:42,028 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:42,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:42,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:42,029 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:42,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:42,030 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:42,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:42,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:42,030 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:42,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:42,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,033 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:42,033 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:42,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:42,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:42,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:42,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:42,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:42,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:42,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:42,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1267 [2022-12-13 02:01:42,168 INFO L420 AbstractCegarLoop]: === Iteration 1269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:42,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1594372515, now seen corresponding path program 1 times [2022-12-13 02:01:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:42,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731933353] [2022-12-13 02:01:42,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:42,237 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 02:01:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:42,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731933353] [2022-12-13 02:01:42,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731933353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:42,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:42,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296340894] [2022-12-13 02:01:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:42,239 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:42,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:42,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:42,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:42,290 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:42,290 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:42,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:42,290 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:42,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:42,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:42,291 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:42,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:42,292 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:42,292 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:42,292 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:42,292 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:42,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:42,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,296 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:42,296 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:42,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:42,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:42,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:42,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:01:42,422 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:42,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:42,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:42,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1268 [2022-12-13 02:01:42,422 INFO L420 AbstractCegarLoop]: === Iteration 1270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:42,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:42,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1651630817, now seen corresponding path program 1 times [2022-12-13 02:01:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:42,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672245653] [2022-12-13 02:01:42,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:42,476 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 02:01:42,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:42,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672245653] [2022-12-13 02:01:42,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672245653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:42,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:42,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:42,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667256978] [2022-12-13 02:01:42,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:42,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:42,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:42,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:42,478 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:42,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:42,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:42,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:42,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:42,528 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:42,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:42,529 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:42,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:42,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:42,529 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:42,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:42,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:42,530 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:42,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:42,530 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:42,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:42,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,533 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:42,533 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:42,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:42,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:42,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:42,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:42,650 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:42,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:42,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:42,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1269 [2022-12-13 02:01:42,650 INFO L420 AbstractCegarLoop]: === Iteration 1271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:42,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:42,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1708889119, now seen corresponding path program 1 times [2022-12-13 02:01:42,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:42,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669788133] [2022-12-13 02:01:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:42,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:42,704 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 02:01:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:42,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669788133] [2022-12-13 02:01:42,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669788133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:42,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:42,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436688816] [2022-12-13 02:01:42,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:42,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:42,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:42,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:42,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:42,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:42,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:42,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:42,748 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:42,748 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:42,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:42,748 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:42,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:42,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:42,749 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:42,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:42,750 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:42,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:42,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:42,750 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:42,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:42,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,753 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:42,753 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:42,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:42,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:42,868 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:42,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:42,868 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:42,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:42,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:42,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1270 [2022-12-13 02:01:42,869 INFO L420 AbstractCegarLoop]: === Iteration 1272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1766147421, now seen corresponding path program 1 times [2022-12-13 02:01:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:42,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2804337] [2022-12-13 02:01:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:42,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:42,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2804337] [2022-12-13 02:01:42,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2804337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:42,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:42,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310065394] [2022-12-13 02:01:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:42,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:42,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:42,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:42,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:42,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:42,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:42,972 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:42,972 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:42,973 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:42,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:42,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:42,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:42,973 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:42,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:42,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:42,974 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:42,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:42,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:42,974 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:42,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:42,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:42,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,977 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:42,977 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:42,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:42,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:42,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:43,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:43,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:43,095 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:43,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:43,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:43,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1271 [2022-12-13 02:01:43,095 INFO L420 AbstractCegarLoop]: === Iteration 1273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:43,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:43,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1823405723, now seen corresponding path program 1 times [2022-12-13 02:01:43,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:43,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238640943] [2022-12-13 02:01:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:43,160 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 02:01:43,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:43,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238640943] [2022-12-13 02:01:43,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238640943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:43,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:43,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538977096] [2022-12-13 02:01:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:43,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:43,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:43,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:43,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:43,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:43,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:43,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:43,214 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:43,214 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:43,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:43,215 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:43,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:43,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:43,215 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:43,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:43,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:43,216 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:43,216 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:43,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:43,216 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,217 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:43,217 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:43,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:43,229 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:43,230 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:43,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:43,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:43,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:43,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:43,361 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:01:43,361 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:43,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:43,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1272 [2022-12-13 02:01:43,361 INFO L420 AbstractCegarLoop]: === Iteration 1274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1880664025, now seen corresponding path program 1 times [2022-12-13 02:01:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:43,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083614796] [2022-12-13 02:01:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:43,421 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 02:01:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:43,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083614796] [2022-12-13 02:01:43,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083614796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:43,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:43,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616093969] [2022-12-13 02:01:43,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:43,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:43,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:43,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:43,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:43,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:43,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:43,476 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:43,476 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:43,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:43,477 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:43,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:43,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:43,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:43,477 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:43,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:43,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:43,478 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:43,478 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:43,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:43,478 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:43,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:43,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:43,481 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:43,481 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:43,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:43,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:43,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:43,620 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:43,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:01:43,622 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:43,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:43,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:43,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1273 [2022-12-13 02:01:43,622 INFO L420 AbstractCegarLoop]: === Iteration 1275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:43,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1937922327, now seen corresponding path program 1 times [2022-12-13 02:01:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:43,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239542655] [2022-12-13 02:01:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:43,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:43,696 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 02:01:43,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239542655] [2022-12-13 02:01:43,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239542655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:43,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:43,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110151698] [2022-12-13 02:01:43,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:43,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:43,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:43,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:43,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:43,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:43,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:43,753 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:43,753 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:43,754 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:43,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:43,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:43,754 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:43,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:43,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:43,755 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:43,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:43,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:43,756 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:43,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:43,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:43,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:43,759 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:43,760 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:43,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:43,760 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:43,760 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:43,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:43,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:43,892 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:43,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:43,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:43,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1274 [2022-12-13 02:01:43,893 INFO L420 AbstractCegarLoop]: === Iteration 1276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1995180629, now seen corresponding path program 1 times [2022-12-13 02:01:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:43,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947290759] [2022-12-13 02:01:43,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:43,963 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 02:01:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:43,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947290759] [2022-12-13 02:01:43,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947290759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:43,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:43,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359353728] [2022-12-13 02:01:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:43,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:43,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:43,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:43,964 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:43,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:43,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:43,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:43,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:44,014 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:44,014 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:44,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:44,015 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:44,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:44,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:44,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:44,016 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:44,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:44,016 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:44,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:44,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:44,017 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:44,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:44,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,020 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:44,020 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:44,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:44,020 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,020 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:44,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:44,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:44,138 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:44,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:44,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:44,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1275 [2022-12-13 02:01:44,138 INFO L420 AbstractCegarLoop]: === Iteration 1277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:44,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:44,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2052438931, now seen corresponding path program 1 times [2022-12-13 02:01:44,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:44,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113448218] [2022-12-13 02:01:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:44,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 02:01:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:44,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113448218] [2022-12-13 02:01:44,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113448218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:44,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:44,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542325138] [2022-12-13 02:01:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:44,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:44,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:44,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:44,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:44,236 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:44,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:44,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:44,237 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:44,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:44,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:44,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:44,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:44,238 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:44,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:44,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:44,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:44,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:44,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,242 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:44,242 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:44,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:44,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:44,358 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:44,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:44,359 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:44,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:44,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:44,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1276 [2022-12-13 02:01:44,359 INFO L420 AbstractCegarLoop]: === Iteration 1278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2109697233, now seen corresponding path program 1 times [2022-12-13 02:01:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:44,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114423281] [2022-12-13 02:01:44,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:44,414 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 02:01:44,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:44,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114423281] [2022-12-13 02:01:44,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114423281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:44,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:44,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:44,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649405993] [2022-12-13 02:01:44,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:44,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:44,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:44,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:44,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:44,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:44,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:44,458 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:44,458 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:44,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:44,458 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:44,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:44,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:44,459 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:44,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:44,460 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:44,460 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:44,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:44,460 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:44,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:44,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,463 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:44,463 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:44,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:44,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:44,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:44,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:44,580 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:44,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:44,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:44,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1277 [2022-12-13 02:01:44,580 INFO L420 AbstractCegarLoop]: === Iteration 1279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2128011761, now seen corresponding path program 1 times [2022-12-13 02:01:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398156189] [2022-12-13 02:01:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:44,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:44,646 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 02:01:44,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:44,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398156189] [2022-12-13 02:01:44,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398156189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:44,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:44,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:44,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576928750] [2022-12-13 02:01:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:44,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:44,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:44,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:44,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:44,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:44,690 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:44,691 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:44,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:44,691 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:44,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:44,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:44,692 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:44,693 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:44,693 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:44,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:44,693 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,693 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:44,693 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:44,693 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,696 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:44,696 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:44,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:44,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:44,812 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:44,812 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:44,812 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:44,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:44,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:44,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1278 [2022-12-13 02:01:44,813 INFO L420 AbstractCegarLoop]: === Iteration 1280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:44,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:44,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2070753459, now seen corresponding path program 1 times [2022-12-13 02:01:44,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295676419] [2022-12-13 02:01:44,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:44,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:44,865 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 02:01:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295676419] [2022-12-13 02:01:44,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295676419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:44,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:44,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:44,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102006549] [2022-12-13 02:01:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:44,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:44,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:44,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:44,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:44,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:44,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:44,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:44,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:44,910 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:44,910 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:44,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:44,910 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:44,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:44,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:44,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:44,911 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:44,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:44,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:44,912 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:44,912 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:44,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:44,912 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:44,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:44,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:44,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,915 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:44,915 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:44,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:44,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:44,915 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:45,030 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:45,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:45,031 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:45,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:45,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:45,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1279 [2022-12-13 02:01:45,031 INFO L420 AbstractCegarLoop]: === Iteration 1281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2013495157, now seen corresponding path program 1 times [2022-12-13 02:01:45,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:45,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908743646] [2022-12-13 02:01:45,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:45,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:45,084 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 02:01:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:45,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908743646] [2022-12-13 02:01:45,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908743646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:45,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:45,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:45,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042309715] [2022-12-13 02:01:45,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:45,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:45,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:45,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:45,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:45,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:45,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:45,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:45,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:45,129 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:45,129 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:45,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:45,130 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:45,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:45,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:45,130 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:45,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:45,131 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:45,132 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:45,132 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:45,132 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,132 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:45,132 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:45,132 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,135 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:45,135 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:45,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:45,135 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,135 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:45,253 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:45,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:45,253 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:45,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:45,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:45,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1280 [2022-12-13 02:01:45,254 INFO L420 AbstractCegarLoop]: === Iteration 1282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1956236855, now seen corresponding path program 1 times [2022-12-13 02:01:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:45,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133559798] [2022-12-13 02:01:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:45,307 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 02:01:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:45,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133559798] [2022-12-13 02:01:45,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133559798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:45,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:45,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992907657] [2022-12-13 02:01:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:45,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:45,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:45,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:45,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:45,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:45,358 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:45,358 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:45,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:45,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:45,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:45,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:45,360 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:45,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:45,360 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:45,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:45,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:45,361 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:45,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:45,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,363 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:45,364 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:45,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:45,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:45,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:45,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:45,483 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:45,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:45,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:45,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1281 [2022-12-13 02:01:45,483 INFO L420 AbstractCegarLoop]: === Iteration 1283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1898978553, now seen corresponding path program 1 times [2022-12-13 02:01:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:45,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239776694] [2022-12-13 02:01:45,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:45,545 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 02:01:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:45,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239776694] [2022-12-13 02:01:45,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239776694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:45,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:45,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707262648] [2022-12-13 02:01:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:45,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:45,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:45,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:45,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:45,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:45,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:45,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:45,590 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:45,590 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:45,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:45,590 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:45,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:45,591 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:45,591 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:45,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:45,592 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:45,592 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:45,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:45,592 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:45,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:45,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,595 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:45,595 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:45,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:45,595 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,595 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:45,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:45,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:01:45,716 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:45,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:45,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:45,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1282 [2022-12-13 02:01:45,717 INFO L420 AbstractCegarLoop]: === Iteration 1284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:45,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1841720251, now seen corresponding path program 1 times [2022-12-13 02:01:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:45,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244567524] [2022-12-13 02:01:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:45,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 02:01:45,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:45,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244567524] [2022-12-13 02:01:45,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244567524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:45,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:45,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055617421] [2022-12-13 02:01:45,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:45,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:45,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:45,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:45,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:45,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:45,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:45,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:45,816 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:45,816 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:45,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:45,816 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:45,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:45,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:45,817 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:45,817 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:45,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:45,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:45,818 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:45,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:45,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:45,818 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:45,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:45,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:45,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,821 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:45,821 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:45,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:45,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:45,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:45,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:45,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:45,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:45,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:45,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:45,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1283 [2022-12-13 02:01:45,937 INFO L420 AbstractCegarLoop]: === Iteration 1285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1784461949, now seen corresponding path program 1 times [2022-12-13 02:01:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:45,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095477187] [2022-12-13 02:01:45,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:45,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:46,001 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 02:01:46,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:46,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095477187] [2022-12-13 02:01:46,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095477187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:46,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:46,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:46,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148202785] [2022-12-13 02:01:46,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:46,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:46,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:46,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:46,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:46,052 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:46,052 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:46,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:46,053 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:46,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:46,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:46,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:46,053 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:46,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:46,054 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:46,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:46,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:46,054 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:46,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:46,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,057 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:46,057 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:46,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:46,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:46,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:46,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:01:46,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:46,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:46,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:46,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1284 [2022-12-13 02:01:46,183 INFO L420 AbstractCegarLoop]: === Iteration 1286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1727203647, now seen corresponding path program 1 times [2022-12-13 02:01:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:46,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985363990] [2022-12-13 02:01:46,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:46,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:46,237 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 02:01:46,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:46,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985363990] [2022-12-13 02:01:46,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985363990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:46,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:46,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:46,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645594296] [2022-12-13 02:01:46,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:46,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:46,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:46,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:46,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:46,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:46,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:46,286 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:46,286 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:46,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:46,287 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:46,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:46,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:46,287 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:46,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:46,288 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:46,288 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:46,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:46,289 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:46,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:46,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,291 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:46,291 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:46,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:46,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:46,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:46,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:46,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:46,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:46,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:46,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1285 [2022-12-13 02:01:46,410 INFO L420 AbstractCegarLoop]: === Iteration 1287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:46,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:46,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1669945345, now seen corresponding path program 1 times [2022-12-13 02:01:46,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:46,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836787355] [2022-12-13 02:01:46,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:46,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:46,460 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 02:01:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836787355] [2022-12-13 02:01:46,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836787355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:46,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:46,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330257773] [2022-12-13 02:01:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:46,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:46,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:46,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:46,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:46,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:46,504 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:46,504 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:46,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:46,505 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:46,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:46,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:46,505 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:46,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:46,506 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:46,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:46,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:46,506 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:46,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:46,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,509 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:46,509 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:46,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:46,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:46,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:46,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:46,626 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:46,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:46,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1286 [2022-12-13 02:01:46,626 INFO L420 AbstractCegarLoop]: === Iteration 1288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1612687043, now seen corresponding path program 1 times [2022-12-13 02:01:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:46,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920401764] [2022-12-13 02:01:46,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:46,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:46,681 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 02:01:46,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:46,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920401764] [2022-12-13 02:01:46,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920401764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:46,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:46,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520164447] [2022-12-13 02:01:46,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:46,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:46,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:46,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:46,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:46,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:46,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:46,734 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:46,734 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:46,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:46,734 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:46,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:46,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:46,735 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:46,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:46,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:46,736 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:46,736 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:46,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:46,736 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:46,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:46,736 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:46,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,739 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:46,739 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:46,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:46,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:46,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:46,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:46,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:01:46,870 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:46,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:46,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:46,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1287 [2022-12-13 02:01:46,870 INFO L420 AbstractCegarLoop]: === Iteration 1289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:46,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:46,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1555428741, now seen corresponding path program 1 times [2022-12-13 02:01:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:46,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740491559] [2022-12-13 02:01:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:46,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:46,944 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 02:01:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:46,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740491559] [2022-12-13 02:01:46,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740491559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:46,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:46,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:46,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301474782] [2022-12-13 02:01:46,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:46,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:46,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:46,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:46,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:46,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:46,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:46,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:47,007 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:47,008 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:47,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:47,008 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:47,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:47,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:47,009 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:47,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:47,010 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:47,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:47,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:47,010 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:47,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:47,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,013 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:47,013 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:47,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:47,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:47,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:47,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:47,147 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:47,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:47,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:47,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1288 [2022-12-13 02:01:47,147 INFO L420 AbstractCegarLoop]: === Iteration 1290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:47,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:47,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1498170439, now seen corresponding path program 1 times [2022-12-13 02:01:47,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:47,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380487529] [2022-12-13 02:01:47,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:47,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:47,208 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 02:01:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:47,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380487529] [2022-12-13 02:01:47,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380487529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:47,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:47,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187718639] [2022-12-13 02:01:47,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:47,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:47,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:47,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:47,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:47,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:47,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:47,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:47,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:47,263 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:47,263 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:47,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:47,264 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:47,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:47,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:47,264 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:47,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:47,265 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:47,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:47,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:47,266 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:47,266 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:47,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,268 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:47,269 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:47,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:47,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:47,413 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:47,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 02:01:47,414 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:47,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:47,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:47,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1289 [2022-12-13 02:01:47,414 INFO L420 AbstractCegarLoop]: === Iteration 1291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1440912137, now seen corresponding path program 1 times [2022-12-13 02:01:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:47,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888419539] [2022-12-13 02:01:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:47,473 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 02:01:47,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:47,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888419539] [2022-12-13 02:01:47,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888419539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:47,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:47,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297755663] [2022-12-13 02:01:47,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:47,474 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:47,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:47,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:47,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:47,540 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:47,540 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:47,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:47,541 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:47,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:47,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:47,541 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:47,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:47,542 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:47,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:47,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:47,542 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:47,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:47,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,545 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:47,545 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:47,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:47,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:47,679 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:47,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:47,680 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:47,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:47,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:47,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1290 [2022-12-13 02:01:47,681 INFO L420 AbstractCegarLoop]: === Iteration 1292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1383653835, now seen corresponding path program 1 times [2022-12-13 02:01:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:47,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483075724] [2022-12-13 02:01:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:47,741 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 02:01:47,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:47,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483075724] [2022-12-13 02:01:47,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483075724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:47,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:47,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360589420] [2022-12-13 02:01:47,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:47,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:47,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:47,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:47,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:47,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:47,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:47,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:47,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:47,795 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:47,795 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:47,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:47,795 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:47,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:47,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:47,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:47,796 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:47,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:47,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:47,797 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:47,797 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:47,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:47,797 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:47,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:47,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:47,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,800 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:47,800 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:47,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:47,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:47,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:47,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:47,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:47,917 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:47,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:47,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:47,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1291 [2022-12-13 02:01:47,917 INFO L420 AbstractCegarLoop]: === Iteration 1293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:47,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1326395533, now seen corresponding path program 1 times [2022-12-13 02:01:47,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:47,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095256033] [2022-12-13 02:01:47,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:47,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:47,972 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 02:01:47,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:47,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095256033] [2022-12-13 02:01:47,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095256033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:47,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:47,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:47,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274883375] [2022-12-13 02:01:47,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:47,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:47,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:47,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:47,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:47,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:47,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:47,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:47,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:47,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:48,023 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:48,023 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:48,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:48,023 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:48,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:48,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:48,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:48,024 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:48,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:48,025 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:48,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:48,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:48,025 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,028 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:48,028 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:48,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:48,145 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:48,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:48,145 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:48,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:48,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:48,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1292 [2022-12-13 02:01:48,146 INFO L420 AbstractCegarLoop]: === Iteration 1294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:48,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:48,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1269137231, now seen corresponding path program 1 times [2022-12-13 02:01:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:48,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132814515] [2022-12-13 02:01:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:48,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 02:01:48,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:48,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132814515] [2022-12-13 02:01:48,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132814515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:48,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:48,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:48,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439712474] [2022-12-13 02:01:48,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:48,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:48,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:48,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:48,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:48,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:48,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:48,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:48,252 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:48,253 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:48,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:48,253 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:48,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:48,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:48,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:48,254 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:48,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:48,254 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,254 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:48,254 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:48,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:48,255 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,257 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:48,257 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:48,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:48,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:48,373 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:48,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:48,373 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:48,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:48,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:48,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1293 [2022-12-13 02:01:48,374 INFO L420 AbstractCegarLoop]: === Iteration 1295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:48,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:48,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1211878929, now seen corresponding path program 1 times [2022-12-13 02:01:48,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:48,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363985537] [2022-12-13 02:01:48,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:48,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:48,427 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 02:01:48,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:48,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363985537] [2022-12-13 02:01:48,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363985537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:48,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:48,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:48,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673045792] [2022-12-13 02:01:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:48,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:48,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:48,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:48,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:48,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:48,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:48,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:48,472 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:48,472 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:48,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:48,473 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:48,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:48,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:48,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:48,473 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:48,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:48,474 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:48,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:48,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:48,474 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,477 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:48,477 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:48,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:48,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:48,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:48,593 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:48,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:48,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:48,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1294 [2022-12-13 02:01:48,593 INFO L420 AbstractCegarLoop]: === Iteration 1296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:48,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1154620627, now seen corresponding path program 1 times [2022-12-13 02:01:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:48,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104718192] [2022-12-13 02:01:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:48,655 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 02:01:48,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:48,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104718192] [2022-12-13 02:01:48,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104718192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:48,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:48,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:48,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653605241] [2022-12-13 02:01:48,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:48,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:48,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:48,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:48,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:48,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:48,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:48,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:48,700 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:48,701 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:48,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:48,701 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:48,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:48,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:48,702 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:48,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:48,703 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:48,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:48,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:48,703 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:48,706 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:48,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:48,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:48,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:48,840 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:48,840 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:48,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,840 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:48,840 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:48,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1295 [2022-12-13 02:01:48,840 INFO L420 AbstractCegarLoop]: === Iteration 1297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:48,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1097362325, now seen corresponding path program 1 times [2022-12-13 02:01:48,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:48,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929164803] [2022-12-13 02:01:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:48,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:48,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 02:01:48,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929164803] [2022-12-13 02:01:48,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929164803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:48,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:48,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195995450] [2022-12-13 02:01:48,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:48,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:48,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:48,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:48,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:48,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:48,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:48,962 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:48,962 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:48,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:48,963 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:48,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:48,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:48,963 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:48,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:48,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:48,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:48,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:48,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:48,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:48,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:48,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:48,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:48,967 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:48,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:48,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:48,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:49,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:49,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:49,100 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:49,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:49,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:49,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1296 [2022-12-13 02:01:49,101 INFO L420 AbstractCegarLoop]: === Iteration 1298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:49,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1040104023, now seen corresponding path program 1 times [2022-12-13 02:01:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:49,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091925108] [2022-12-13 02:01:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:49,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091925108] [2022-12-13 02:01:49,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091925108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:49,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:49,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146376458] [2022-12-13 02:01:49,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:49,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:49,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:49,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:49,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:49,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:49,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:49,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:49,204 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:49,204 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:49,205 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:49,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:49,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:49,205 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:49,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:49,206 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:49,206 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:49,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:49,206 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:49,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:49,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,210 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:49,210 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:49,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:49,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:49,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:49,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:49,342 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:49,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:49,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:49,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1297 [2022-12-13 02:01:49,342 INFO L420 AbstractCegarLoop]: === Iteration 1299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:49,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:49,343 INFO L85 PathProgramCache]: Analyzing trace with hash -982845721, now seen corresponding path program 1 times [2022-12-13 02:01:49,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:49,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064167228] [2022-12-13 02:01:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:49,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:49,401 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 02:01:49,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:49,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064167228] [2022-12-13 02:01:49,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064167228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:49,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:49,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:49,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469430696] [2022-12-13 02:01:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:49,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:49,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:49,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:49,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:49,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:49,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:49,454 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:49,454 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:49,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:49,455 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:49,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:49,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:49,455 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:49,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:49,456 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,456 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:49,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:49,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:49,456 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,456 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:49,456 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:49,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,459 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:49,459 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:49,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:49,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:49,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:49,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:49,594 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:49,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:49,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:49,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1298 [2022-12-13 02:01:49,594 INFO L420 AbstractCegarLoop]: === Iteration 1300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -925587419, now seen corresponding path program 1 times [2022-12-13 02:01:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:49,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097978510] [2022-12-13 02:01:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:49,660 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 02:01:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:49,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097978510] [2022-12-13 02:01:49,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097978510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:49,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:49,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410306970] [2022-12-13 02:01:49,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:49,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:49,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:49,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:49,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:49,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:49,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:49,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:49,715 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:49,715 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:49,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:49,715 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:49,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:49,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:49,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:49,716 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:49,717 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:49,717 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:49,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:49,717 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:49,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:49,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,720 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:49,720 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:49,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:49,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:49,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:49,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:01:49,843 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:49,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:49,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:49,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1299 [2022-12-13 02:01:49,843 INFO L420 AbstractCegarLoop]: === Iteration 1301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:49,843 INFO L85 PathProgramCache]: Analyzing trace with hash -868329117, now seen corresponding path program 1 times [2022-12-13 02:01:49,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:49,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592704840] [2022-12-13 02:01:49,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:49,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:49,905 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 02:01:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:49,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592704840] [2022-12-13 02:01:49,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592704840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:49,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:49,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:49,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807354299] [2022-12-13 02:01:49,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:49,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:49,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:49,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:49,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:49,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:49,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:49,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:49,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:49,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:49,962 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:49,962 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:49,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:49,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:49,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:49,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:49,963 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:49,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:49,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:49,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:49,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:49,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:49,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:49,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:49,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:49,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:49,967 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:49,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:49,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:49,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:50,088 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:50,089 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:01:50,089 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:50,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,089 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:50,089 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:50,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1300 [2022-12-13 02:01:50,089 INFO L420 AbstractCegarLoop]: === Iteration 1302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:50,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -811070815, now seen corresponding path program 1 times [2022-12-13 02:01:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237279418] [2022-12-13 02:01:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:50,150 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 02:01:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:50,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237279418] [2022-12-13 02:01:50,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237279418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:50,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:50,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290534167] [2022-12-13 02:01:50,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:50,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:50,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:50,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:50,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:50,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:50,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:50,202 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:50,203 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:50,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:50,203 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:50,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:50,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:50,204 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:50,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:50,205 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:50,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:50,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:50,205 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:50,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:50,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,208 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:50,208 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:50,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:50,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:50,326 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:50,327 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:50,327 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:50,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:50,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:50,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1301 [2022-12-13 02:01:50,328 INFO L420 AbstractCegarLoop]: === Iteration 1303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:50,328 INFO L85 PathProgramCache]: Analyzing trace with hash -753812513, now seen corresponding path program 1 times [2022-12-13 02:01:50,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:50,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675673319] [2022-12-13 02:01:50,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:50,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:50,381 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 02:01:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675673319] [2022-12-13 02:01:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675673319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:50,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:50,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513015895] [2022-12-13 02:01:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:50,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:50,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:50,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:50,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:50,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:50,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:50,427 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:50,428 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:50,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:50,428 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:50,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:50,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:50,429 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:50,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:50,430 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:50,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:50,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:50,430 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:50,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:50,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,433 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:50,433 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:50,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:50,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:50,567 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:50,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:01:50,568 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:50,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:50,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:50,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1302 [2022-12-13 02:01:50,568 INFO L420 AbstractCegarLoop]: === Iteration 1304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash -696554211, now seen corresponding path program 1 times [2022-12-13 02:01:50,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:50,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809060863] [2022-12-13 02:01:50,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:50,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:01:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:50,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809060863] [2022-12-13 02:01:50,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809060863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:50,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:50,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:50,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812886130] [2022-12-13 02:01:50,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:50,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:50,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:50,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:50,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:50,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:50,693 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:50,693 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:50,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:50,694 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:50,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:50,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:50,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:50,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:50,694 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:50,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:50,695 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:50,696 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:50,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:50,696 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:50,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:50,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,700 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:50,700 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:50,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:50,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:50,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:50,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:01:50,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:50,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:50,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:50,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1303 [2022-12-13 02:01:50,838 INFO L420 AbstractCegarLoop]: === Iteration 1305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -639295909, now seen corresponding path program 1 times [2022-12-13 02:01:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:50,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456294268] [2022-12-13 02:01:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:50,899 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 02:01:50,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:50,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456294268] [2022-12-13 02:01:50,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456294268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:50,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:50,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899787605] [2022-12-13 02:01:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:50,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:50,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:50,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:50,900 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:50,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:50,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:50,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:50,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:50,961 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:50,962 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:50,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:50,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:50,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:50,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:50,963 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:50,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:50,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:50,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:50,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:50,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:50,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:50,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:50,965 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:50,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,968 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:50,968 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:50,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:50,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:50,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:51,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:51,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:51,099 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:51,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:51,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:51,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1304 [2022-12-13 02:01:51,099 INFO L420 AbstractCegarLoop]: === Iteration 1306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:51,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:51,099 INFO L85 PathProgramCache]: Analyzing trace with hash -582037607, now seen corresponding path program 1 times [2022-12-13 02:01:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:51,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513899388] [2022-12-13 02:01:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:51,172 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 02:01:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:51,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513899388] [2022-12-13 02:01:51,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513899388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:51,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:51,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:51,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886938767] [2022-12-13 02:01:51,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:51,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:51,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:51,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:51,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:51,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:51,230 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:51,231 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:51,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:51,231 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:51,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:51,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:51,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:51,232 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:51,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:51,233 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:51,233 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:51,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:51,234 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:51,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:51,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,237 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:51,238 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:51,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:51,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:51,380 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:51,381 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 02:01:51,381 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:51,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:51,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:51,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1305 [2022-12-13 02:01:51,381 INFO L420 AbstractCegarLoop]: === Iteration 1307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:51,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:51,381 INFO L85 PathProgramCache]: Analyzing trace with hash -524779305, now seen corresponding path program 1 times [2022-12-13 02:01:51,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:51,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472501917] [2022-12-13 02:01:51,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:51,434 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 02:01:51,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:51,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472501917] [2022-12-13 02:01:51,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472501917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:51,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:51,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981222790] [2022-12-13 02:01:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:51,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:51,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:51,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:51,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:51,486 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:51,487 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:51,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:51,487 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:51,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:51,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:51,488 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:51,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:51,489 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:51,489 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:51,489 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:51,489 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,489 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:51,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:51,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:51,500 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:51,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:51,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:51,614 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:51,615 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:01:51,615 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:51,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:51,615 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:51,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1306 [2022-12-13 02:01:51,615 INFO L420 AbstractCegarLoop]: === Iteration 1308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:51,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash -467521003, now seen corresponding path program 1 times [2022-12-13 02:01:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:51,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363753438] [2022-12-13 02:01:51,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:51,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:51,669 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 02:01:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:51,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363753438] [2022-12-13 02:01:51,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363753438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:51,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:51,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802286622] [2022-12-13 02:01:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:51,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:51,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:51,670 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:51,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:51,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:51,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:51,720 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:51,720 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:51,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:51,721 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:51,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:51,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:51,721 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:51,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:51,722 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,722 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:51,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:51,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:51,731 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:51,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:51,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,735 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:51,735 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:51,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:51,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:51,871 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:51,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:01:51,872 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:51,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:51,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:51,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1307 [2022-12-13 02:01:51,872 INFO L420 AbstractCegarLoop]: === Iteration 1309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash -410262701, now seen corresponding path program 1 times [2022-12-13 02:01:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:51,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108798648] [2022-12-13 02:01:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:51,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:51,928 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 02:01:51,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:51,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108798648] [2022-12-13 02:01:51,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108798648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:51,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:51,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245949712] [2022-12-13 02:01:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:51,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:51,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:51,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:51,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:51,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:51,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:51,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:51,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:51,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:51,972 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:51,973 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:51,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:51,973 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:51,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:51,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:51,974 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:51,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:51,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:51,974 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:51,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:51,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:51,975 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:51,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:51,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:51,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,978 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:51,978 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:51,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:51,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:52,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:52,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:52,093 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:52,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:52,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:52,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1308 [2022-12-13 02:01:52,094 INFO L420 AbstractCegarLoop]: === Iteration 1310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash -353004399, now seen corresponding path program 1 times [2022-12-13 02:01:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:52,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933854077] [2022-12-13 02:01:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:52,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:52,148 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 02:01:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:52,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933854077] [2022-12-13 02:01:52,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933854077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:52,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:52,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092906740] [2022-12-13 02:01:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:52,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:52,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:52,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:52,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:52,191 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:52,191 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:52,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:52,192 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:52,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:52,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:52,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:52,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:52,193 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:52,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:52,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:52,194 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:52,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:52,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,196 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:52,196 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:52,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:52,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:52,320 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:52,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:01:52,321 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:52,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:52,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:52,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1309 [2022-12-13 02:01:52,321 INFO L420 AbstractCegarLoop]: === Iteration 1311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -295746097, now seen corresponding path program 1 times [2022-12-13 02:01:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:52,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187725965] [2022-12-13 02:01:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:52,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:52,375 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 02:01:52,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:52,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187725965] [2022-12-13 02:01:52,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187725965] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:52,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:52,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:52,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142929136] [2022-12-13 02:01:52,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:52,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:52,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:52,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:52,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:52,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:52,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:52,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:52,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:52,419 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:52,419 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:52,419 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:52,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:52,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:52,420 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:52,420 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:52,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:52,421 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,421 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:52,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:52,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:52,421 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:52,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:52,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,424 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:52,424 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:52,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:52,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:52,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:52,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:52,542 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:52,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:52,542 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:52,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1310 [2022-12-13 02:01:52,542 INFO L420 AbstractCegarLoop]: === Iteration 1312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:52,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:52,542 INFO L85 PathProgramCache]: Analyzing trace with hash -238487795, now seen corresponding path program 1 times [2022-12-13 02:01:52,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:52,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952588097] [2022-12-13 02:01:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:52,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:52,597 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 02:01:52,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:52,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952588097] [2022-12-13 02:01:52,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952588097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:52,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:52,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965367711] [2022-12-13 02:01:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:52,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:52,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:52,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:52,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:52,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:52,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:52,649 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:52,649 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:52,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:52,650 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:52,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:52,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:52,650 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:52,651 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:52,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:52,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:52,652 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:52,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:52,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,654 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:52,655 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:52,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:52,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:52,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:52,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:52,771 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:52,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:52,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:52,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1311 [2022-12-13 02:01:52,771 INFO L420 AbstractCegarLoop]: === Iteration 1313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash -181229493, now seen corresponding path program 1 times [2022-12-13 02:01:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:52,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246209753] [2022-12-13 02:01:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:52,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:52,837 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 02:01:52,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:52,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246209753] [2022-12-13 02:01:52,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246209753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:52,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:52,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834160844] [2022-12-13 02:01:52,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:52,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:52,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:52,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:52,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:52,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:52,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:52,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:52,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:52,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:52,888 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:52,888 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:52,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:52,888 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:52,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:52,889 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:52,889 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:52,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:52,890 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,890 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:52,890 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:52,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:52,890 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,890 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:52,890 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:52,890 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:52,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,893 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:52,893 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:52,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:52,893 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:52,893 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:53,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:53,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:53,012 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:53,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:53,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:53,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1312 [2022-12-13 02:01:53,012 INFO L420 AbstractCegarLoop]: === Iteration 1314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash -123971191, now seen corresponding path program 1 times [2022-12-13 02:01:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:53,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222694091] [2022-12-13 02:01:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:53,074 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 02:01:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:53,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222694091] [2022-12-13 02:01:53,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222694091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:53,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:53,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958434239] [2022-12-13 02:01:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:53,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:53,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:53,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:53,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:53,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:53,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:53,120 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:53,120 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:53,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:53,121 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:53,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:53,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:53,121 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:53,122 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:53,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:53,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:53,122 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:53,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:53,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,125 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:53,125 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:53,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:53,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:53,241 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:53,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:53,242 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:53,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:53,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:53,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1313 [2022-12-13 02:01:53,242 INFO L420 AbstractCegarLoop]: === Iteration 1315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:53,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:53,242 INFO L85 PathProgramCache]: Analyzing trace with hash -66712889, now seen corresponding path program 1 times [2022-12-13 02:01:53,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:53,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865210935] [2022-12-13 02:01:53,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:53,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:53,297 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 02:01:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:53,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865210935] [2022-12-13 02:01:53,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865210935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:53,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:53,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351401145] [2022-12-13 02:01:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:53,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:53,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:53,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:53,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:53,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:53,345 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:53,345 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:53,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:53,346 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:53,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:53,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:53,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:53,346 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:53,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:53,347 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:53,347 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:53,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:53,347 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:53,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:53,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,350 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:53,350 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:53,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:53,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:53,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:53,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:01:53,472 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:53,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:53,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:53,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1314 [2022-12-13 02:01:53,472 INFO L420 AbstractCegarLoop]: === Iteration 1316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash -9454587, now seen corresponding path program 1 times [2022-12-13 02:01:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:53,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533018307] [2022-12-13 02:01:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:53,527 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 02:01:53,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:53,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533018307] [2022-12-13 02:01:53,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533018307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:53,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:53,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:53,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444516758] [2022-12-13 02:01:53,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:53,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:53,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:53,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:53,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:53,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:53,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:53,581 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:53,582 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:53,582 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:53,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:53,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:53,583 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:53,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:53,584 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:53,584 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:53,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:53,584 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:53,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:53,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,587 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:53,587 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:53,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:53,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:53,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:53,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:53,705 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:53,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:53,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:53,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1315 [2022-12-13 02:01:53,705 INFO L420 AbstractCegarLoop]: === Iteration 1317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:53,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 47803715, now seen corresponding path program 1 times [2022-12-13 02:01:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:53,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625812206] [2022-12-13 02:01:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:53,768 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 02:01:53,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:53,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625812206] [2022-12-13 02:01:53,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625812206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:53,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:53,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:53,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504708262] [2022-12-13 02:01:53,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:53,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:53,769 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:53,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:53,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:53,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:53,812 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:53,812 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:53,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:53,813 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:53,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:53,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:53,813 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:53,813 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:53,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:53,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:53,814 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:53,814 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:53,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:53,814 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:53,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:53,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:53,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,817 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:53,817 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:53,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:53,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:53,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:53,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:53,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:53,932 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:53,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:53,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:53,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1316 [2022-12-13 02:01:53,933 INFO L420 AbstractCegarLoop]: === Iteration 1318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:53,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:53,933 INFO L85 PathProgramCache]: Analyzing trace with hash 105062017, now seen corresponding path program 1 times [2022-12-13 02:01:53,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:53,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021580815] [2022-12-13 02:01:53,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:53,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:53,984 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 02:01:53,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021580815] [2022-12-13 02:01:53,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021580815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:53,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:53,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:53,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806215259] [2022-12-13 02:01:53,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:53,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:53,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:53,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:53,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:53,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:53,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:54,035 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:54,036 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:54,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:54,036 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:54,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:54,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:54,037 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:54,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:54,037 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:54,038 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:54,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:54,038 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,038 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:54,038 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:54,038 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,041 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:54,041 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:54,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:54,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,041 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:54,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:54,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:01:54,174 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:54,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:54,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:54,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1317 [2022-12-13 02:01:54,174 INFO L420 AbstractCegarLoop]: === Iteration 1319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:54,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 162320319, now seen corresponding path program 1 times [2022-12-13 02:01:54,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:54,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846180277] [2022-12-13 02:01:54,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:54,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:54,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 02:01:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:54,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846180277] [2022-12-13 02:01:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846180277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:54,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:54,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:54,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857018207] [2022-12-13 02:01:54,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:54,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:54,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:54,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:54,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:54,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:54,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:54,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:54,308 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:54,308 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:54,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:54,309 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:54,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:54,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:54,309 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:54,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:54,310 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:54,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:54,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:54,311 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:54,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:54,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,313 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:54,313 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:54,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:54,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:54,446 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:54,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:01:54,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,447 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:54,447 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:54,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1318 [2022-12-13 02:01:54,447 INFO L420 AbstractCegarLoop]: === Iteration 1320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:54,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 219578621, now seen corresponding path program 1 times [2022-12-13 02:01:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:54,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439724880] [2022-12-13 02:01:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:54,519 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 02:01:54,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:54,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439724880] [2022-12-13 02:01:54,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439724880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:54,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:54,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:54,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028410563] [2022-12-13 02:01:54,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:54,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:54,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:54,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:54,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:54,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:54,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:54,583 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:54,584 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:54,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:54,584 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:54,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:54,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:54,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:54,585 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:54,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:54,586 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,586 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:54,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:54,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:54,587 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,587 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:54,587 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:54,587 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,590 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:54,591 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:54,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:54,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:54,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:54,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:01:54,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:54,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:54,720 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:54,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1319 [2022-12-13 02:01:54,720 INFO L420 AbstractCegarLoop]: === Iteration 1321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash 276836923, now seen corresponding path program 1 times [2022-12-13 02:01:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:54,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246719195] [2022-12-13 02:01:54,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:54,786 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 02:01:54,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:54,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246719195] [2022-12-13 02:01:54,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246719195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:54,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:54,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386107830] [2022-12-13 02:01:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:54,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:54,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:54,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:54,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:54,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:54,840 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:54,840 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:54,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:54,840 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:54,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:54,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:54,841 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:54,841 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:54,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:54,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:54,842 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,842 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:54,842 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:54,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:54,843 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:54,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:54,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:54,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,846 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:54,846 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:54,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:54,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:54,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:54,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:54,975 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:01:54,975 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:54,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:54,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:54,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:54,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1320 [2022-12-13 02:01:54,976 INFO L420 AbstractCegarLoop]: === Iteration 1322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:54,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash 334095225, now seen corresponding path program 1 times [2022-12-13 02:01:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:54,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188744232] [2022-12-13 02:01:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:55,029 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 02:01:55,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188744232] [2022-12-13 02:01:55,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188744232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:55,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:55,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:55,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272108249] [2022-12-13 02:01:55,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:55,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:55,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:55,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:55,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:55,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:55,074 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:55,075 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:55,075 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:55,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:55,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:55,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:55,076 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:55,077 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:55,077 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:55,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:55,077 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:55,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:55,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,080 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:55,080 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:55,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:55,080 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,080 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:55,198 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:55,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:01:55,199 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:55,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:55,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:55,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1321 [2022-12-13 02:01:55,199 INFO L420 AbstractCegarLoop]: === Iteration 1323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash 391353527, now seen corresponding path program 1 times [2022-12-13 02:01:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:55,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573523490] [2022-12-13 02:01:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:55,256 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 02:01:55,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:55,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573523490] [2022-12-13 02:01:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573523490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:55,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:55,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738123078] [2022-12-13 02:01:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:55,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:55,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:55,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:55,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:55,300 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:55,300 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:55,301 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:55,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:55,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:55,301 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:55,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:55,302 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:55,303 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:55,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:55,303 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:55,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:55,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,306 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:55,306 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:55,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:55,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:55,423 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:55,424 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:01:55,424 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:55,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:55,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:55,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1322 [2022-12-13 02:01:55,424 INFO L420 AbstractCegarLoop]: === Iteration 1324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:55,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:55,424 INFO L85 PathProgramCache]: Analyzing trace with hash 448611829, now seen corresponding path program 1 times [2022-12-13 02:01:55,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:55,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893803059] [2022-12-13 02:01:55,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:55,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:55,475 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 02:01:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:55,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893803059] [2022-12-13 02:01:55,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893803059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:55,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:55,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:55,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336347034] [2022-12-13 02:01:55,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:55,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:55,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:55,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:55,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:55,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:55,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:55,519 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:55,519 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:55,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:55,520 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:55,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:55,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:55,520 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:55,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:55,521 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:55,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:55,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:55,521 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:55,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:55,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,533 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:55,533 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:55,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:55,533 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,533 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:55,650 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:55,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:01:55,651 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:55,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,651 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:55,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:55,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1323 [2022-12-13 02:01:55,651 INFO L420 AbstractCegarLoop]: === Iteration 1325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:55,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:55,651 INFO L85 PathProgramCache]: Analyzing trace with hash 505870131, now seen corresponding path program 1 times [2022-12-13 02:01:55,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:55,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866642828] [2022-12-13 02:01:55,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:55,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:55,712 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 02:01:55,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:55,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866642828] [2022-12-13 02:01:55,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866642828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:55,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:55,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031518419] [2022-12-13 02:01:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:55,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:55,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:55,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:55,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:55,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:55,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:55,764 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:55,764 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:55,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:55,765 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:55,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:55,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:55,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:55,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:55,766 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:55,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:55,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:55,767 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:55,767 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:55,767 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,769 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:55,770 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:55,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:55,770 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,770 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:55,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:55,884 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:01:55,884 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:55,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,884 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:55,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:55,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1324 [2022-12-13 02:01:55,885 INFO L420 AbstractCegarLoop]: === Iteration 1326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash 563128433, now seen corresponding path program 1 times [2022-12-13 02:01:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:55,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530685743] [2022-12-13 02:01:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:55,936 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 02:01:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:55,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530685743] [2022-12-13 02:01:55,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530685743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:55,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:55,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902025235] [2022-12-13 02:01:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:55,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:55,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:55,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:55,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:55,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:55,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:55,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:55,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:55,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:55,987 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:55,987 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:55,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:55,987 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:55,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:55,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:55,988 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:55,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:55,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:55,989 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:55,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:55,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:55,989 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:55,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:55,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:55,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,992 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:55,992 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:55,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:55,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:55,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:56,108 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:56,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:01:56,109 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:56,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,109 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:56,109 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:56,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1325 [2022-12-13 02:01:56,109 INFO L420 AbstractCegarLoop]: === Iteration 1327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash 620386735, now seen corresponding path program 1 times [2022-12-13 02:01:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:56,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860195934] [2022-12-13 02:01:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:56,162 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 02:01:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:56,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860195934] [2022-12-13 02:01:56,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860195934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:56,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:56,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:56,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825576946] [2022-12-13 02:01:56,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:56,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:56,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:56,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:56,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:56,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:56,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:56,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:56,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:56,205 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:56,205 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:56,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:56,205 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:56,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:56,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:56,206 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:56,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:56,207 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:56,207 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:56,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:56,207 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,207 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:56,207 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:56,207 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,210 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:56,210 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:56,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:56,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:56,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:56,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:01:56,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:56,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:56,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:56,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1326 [2022-12-13 02:01:56,325 INFO L420 AbstractCegarLoop]: === Iteration 1328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash 677645037, now seen corresponding path program 1 times [2022-12-13 02:01:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:56,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875223363] [2022-12-13 02:01:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:56,378 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 02:01:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:56,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875223363] [2022-12-13 02:01:56,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875223363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:56,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:56,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872831930] [2022-12-13 02:01:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:56,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:56,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:56,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:56,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:56,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:56,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:56,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:56,421 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:56,421 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:56,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:56,422 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:56,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:56,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:56,422 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:56,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:56,423 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:56,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:56,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:56,423 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:56,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:56,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,426 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:56,426 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:56,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:56,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:56,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:56,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:56,541 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:56,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:56,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:56,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1327 [2022-12-13 02:01:56,541 INFO L420 AbstractCegarLoop]: === Iteration 1329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:56,541 INFO L85 PathProgramCache]: Analyzing trace with hash 734903339, now seen corresponding path program 1 times [2022-12-13 02:01:56,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:56,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66040643] [2022-12-13 02:01:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:56,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:56,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 02:01:56,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:56,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66040643] [2022-12-13 02:01:56,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66040643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:56,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:56,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251112500] [2022-12-13 02:01:56,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:56,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:56,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:56,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:56,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:56,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:56,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:56,638 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:56,638 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:56,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:56,639 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:56,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:56,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:56,639 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:56,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:56,640 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:56,640 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:56,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:56,640 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:56,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:56,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,643 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:56,643 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:56,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:56,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:56,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:56,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:01:56,768 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:56,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:56,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:56,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1328 [2022-12-13 02:01:56,769 INFO L420 AbstractCegarLoop]: === Iteration 1330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:56,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 792161641, now seen corresponding path program 1 times [2022-12-13 02:01:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:56,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379681440] [2022-12-13 02:01:56,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:56,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:56,830 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 02:01:56,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:56,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379681440] [2022-12-13 02:01:56,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379681440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:56,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:56,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:56,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181682624] [2022-12-13 02:01:56,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:56,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:56,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:56,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:56,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:56,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:56,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:56,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:56,880 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:56,880 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:56,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:56,881 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:56,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:56,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:56,882 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:56,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:56,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:56,882 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:56,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:56,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:56,883 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:56,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:56,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:56,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,886 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:56,886 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:56,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:56,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:56,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:57,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:57,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:01:57,013 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:57,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:57,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:57,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1329 [2022-12-13 02:01:57,014 INFO L420 AbstractCegarLoop]: === Iteration 1331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:57,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 849419943, now seen corresponding path program 1 times [2022-12-13 02:01:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:57,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495485320] [2022-12-13 02:01:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:57,069 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 02:01:57,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:57,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495485320] [2022-12-13 02:01:57,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495485320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:57,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:57,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352000811] [2022-12-13 02:01:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:57,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:57,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:57,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:57,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:57,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:57,121 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:57,121 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:57,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:57,121 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:57,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:57,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:57,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:57,122 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:57,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:57,123 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:57,123 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:57,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:57,123 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:57,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:57,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,126 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:57,126 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:57,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:57,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:57,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:57,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:57,243 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:57,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:57,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:57,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1330 [2022-12-13 02:01:57,243 INFO L420 AbstractCegarLoop]: === Iteration 1332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash 906678245, now seen corresponding path program 1 times [2022-12-13 02:01:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:57,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269692991] [2022-12-13 02:01:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:57,297 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 02:01:57,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:57,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269692991] [2022-12-13 02:01:57,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269692991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:57,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:57,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24288732] [2022-12-13 02:01:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:57,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:57,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:57,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:57,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:57,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:57,342 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:57,342 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:57,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:57,343 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:57,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:57,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:57,343 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:57,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:57,344 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:57,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:57,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:57,344 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:57,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:57,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,347 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:57,347 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:57,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:57,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:57,461 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:57,462 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:01:57,462 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:57,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:57,462 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:57,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1331 [2022-12-13 02:01:57,462 INFO L420 AbstractCegarLoop]: === Iteration 1333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 963936547, now seen corresponding path program 1 times [2022-12-13 02:01:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:57,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672468625] [2022-12-13 02:01:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:57,515 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 02:01:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:57,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672468625] [2022-12-13 02:01:57,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672468625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:57,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:57,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299420796] [2022-12-13 02:01:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:57,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:57,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:57,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:57,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:57,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:57,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:57,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:57,566 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:57,566 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:57,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:57,567 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:57,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:57,567 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:57,567 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:57,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:57,568 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,568 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:57,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:57,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:57,568 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:57,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:57,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,571 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:57,571 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:57,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:57,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:57,687 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:57,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:57,688 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:57,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,688 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:57,688 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1332 [2022-12-13 02:01:57,689 INFO L420 AbstractCegarLoop]: === Iteration 1334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1021194849, now seen corresponding path program 1 times [2022-12-13 02:01:57,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:57,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459677351] [2022-12-13 02:01:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:57,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:57,746 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 02:01:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:57,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459677351] [2022-12-13 02:01:57,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459677351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:57,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:57,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761317479] [2022-12-13 02:01:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:57,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:57,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:57,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:57,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:57,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:57,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:57,807 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:57,807 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:57,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:57,808 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:57,808 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:57,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:57,808 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:57,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:57,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:57,809 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:57,809 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:57,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:57,809 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:57,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:57,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:57,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,812 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:57,812 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:57,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:57,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:57,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:57,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:57,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:01:57,946 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:57,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:57,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:57,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1333 [2022-12-13 02:01:57,946 INFO L420 AbstractCegarLoop]: === Iteration 1335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1078453151, now seen corresponding path program 1 times [2022-12-13 02:01:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:57,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640766208] [2022-12-13 02:01:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:58,019 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 02:01:58,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:58,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640766208] [2022-12-13 02:01:58,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640766208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:58,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:58,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:58,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008456942] [2022-12-13 02:01:58,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:58,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:58,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:58,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:58,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:58,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:58,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:58,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:58,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:58,082 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:58,082 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:58,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:58,083 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:58,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:58,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:58,084 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:58,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:58,085 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:58,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:58,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:58,085 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:58,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:58,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,088 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:58,088 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:58,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:58,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:58,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:58,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:01:58,235 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:58,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:58,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:58,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1334 [2022-12-13 02:01:58,235 INFO L420 AbstractCegarLoop]: === Iteration 1336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1135711453, now seen corresponding path program 1 times [2022-12-13 02:01:58,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:58,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630530668] [2022-12-13 02:01:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:58,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:58,305 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 02:01:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:58,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630530668] [2022-12-13 02:01:58,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630530668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:58,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:58,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:58,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647108585] [2022-12-13 02:01:58,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:58,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:58,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:58,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:58,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:58,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:58,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:58,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:58,360 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:58,360 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:58,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:58,361 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:58,361 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:58,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:58,362 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:58,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:58,363 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:58,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:58,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:58,363 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:58,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:58,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,367 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:58,367 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:58,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:58,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,368 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:58,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:58,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:01:58,496 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:58,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:58,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1335 [2022-12-13 02:01:58,497 INFO L420 AbstractCegarLoop]: === Iteration 1337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1192969755, now seen corresponding path program 1 times [2022-12-13 02:01:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:58,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125171804] [2022-12-13 02:01:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:58,556 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 02:01:58,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:58,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125171804] [2022-12-13 02:01:58,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125171804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:58,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:58,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874967780] [2022-12-13 02:01:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:58,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:58,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:58,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:58,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:58,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:58,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:58,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:58,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:58,617 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:58,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:58,617 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:58,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:58,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:58,618 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:58,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:58,619 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:58,619 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:58,619 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:58,619 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,619 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:58,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:58,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,622 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:58,622 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:58,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:58,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:58,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:01:58,758 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:58,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:58,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:58,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1336 [2022-12-13 02:01:58,759 INFO L420 AbstractCegarLoop]: === Iteration 1338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1250228057, now seen corresponding path program 1 times [2022-12-13 02:01:58,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:58,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394529785] [2022-12-13 02:01:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:58,827 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 02:01:58,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:58,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394529785] [2022-12-13 02:01:58,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394529785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:58,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:58,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145325617] [2022-12-13 02:01:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:58,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:58,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:58,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:58,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:58,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:58,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:58,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:58,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:58,882 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:58,882 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:58,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:58,882 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:58,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:58,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:58,883 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:58,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:58,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:58,884 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:58,884 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:58,884 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:58,884 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:58,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:58,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:58,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,887 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:58,888 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:58,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:58,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:58,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:59,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:59,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:01:59,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:59,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:59,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:59,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1337 [2022-12-13 02:01:59,004 INFO L420 AbstractCegarLoop]: === Iteration 1339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1307486359, now seen corresponding path program 1 times [2022-12-13 02:01:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:59,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115126972] [2022-12-13 02:01:59,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:59,058 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 02:01:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:59,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115126972] [2022-12-13 02:01:59,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115126972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:59,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:59,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:59,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996964605] [2022-12-13 02:01:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:59,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:59,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:59,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:59,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:59,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:59,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:59,110 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:59,110 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:59,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:59,110 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:59,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:59,111 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:59,111 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:59,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:59,112 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,112 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:59,112 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:59,112 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:59,112 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:59,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:59,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,115 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:59,115 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:59,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:59,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,115 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:59,245 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:59,245 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:01:59,245 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:59,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,246 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:59,246 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1338 [2022-12-13 02:01:59,246 INFO L420 AbstractCegarLoop]: === Iteration 1340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1364744661, now seen corresponding path program 1 times [2022-12-13 02:01:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:59,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113010076] [2022-12-13 02:01:59,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:59,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:59,310 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 02:01:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:59,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113010076] [2022-12-13 02:01:59,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113010076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:59,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:59,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465369264] [2022-12-13 02:01:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:59,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:59,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:59,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:59,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:59,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:59,363 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:59,363 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:59,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:59,364 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:59,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:59,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:59,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:59,365 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:59,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:59,366 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:59,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:59,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:59,366 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:59,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:59,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,370 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:59,370 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:59,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:59,371 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,371 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:59,508 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:59,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:01:59,509 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:59,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:59,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1339 [2022-12-13 02:01:59,509 INFO L420 AbstractCegarLoop]: === Iteration 1341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1422002963, now seen corresponding path program 1 times [2022-12-13 02:01:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:59,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065843249] [2022-12-13 02:01:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:59,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:59,588 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 02:01:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:59,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065843249] [2022-12-13 02:01:59,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065843249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:59,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:59,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014152623] [2022-12-13 02:01:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:59,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:59,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:59,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:59,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:59,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:59,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:59,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:59,667 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:59,667 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:01:59,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:59,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:59,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:59,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:59,668 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:59,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:59,669 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,669 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:59,669 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:59,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:59,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:59,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:59,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,672 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:59,673 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:01:59,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:59,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:01:59,806 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:01:59,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:01:59,811 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:01:59,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:01:59,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:01:59,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1340 [2022-12-13 02:01:59,811 INFO L420 AbstractCegarLoop]: === Iteration 1342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:01:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:01:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1479261265, now seen corresponding path program 1 times [2022-12-13 02:01:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:01:59,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137318899] [2022-12-13 02:01:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:01:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:01:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:01:59,866 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 02:01:59,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:01:59,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137318899] [2022-12-13 02:01:59,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137318899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:01:59,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:01:59,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:01:59,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341556240] [2022-12-13 02:01:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:01:59,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:01:59,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:01:59,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:01:59,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:01:59,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:01:59,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:01:59,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:01:59,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:01:59,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:01:59,920 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:01:59,921 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:01:59,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:01:59,921 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:01:59,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:01:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:01:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:01:59,922 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:01:59,922 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:01:59,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:01:59,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:01:59,923 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,923 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:01:59,923 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:01:59,923 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:01:59,923 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:01:59,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:01:59,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:01:59,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,926 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:01:59,926 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:01:59,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:01:59,926 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:01:59,926 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:00,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:00,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:00,061 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:00,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:00,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:00,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1341 [2022-12-13 02:02:00,061 INFO L420 AbstractCegarLoop]: === Iteration 1343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:00,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1536519567, now seen corresponding path program 1 times [2022-12-13 02:02:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:00,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265688653] [2022-12-13 02:02:00,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:00,126 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 02:02:00,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:00,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265688653] [2022-12-13 02:02:00,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265688653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:00,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:00,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:00,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851982736] [2022-12-13 02:02:00,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:00,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:00,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:00,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:00,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:00,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:00,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:00,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:00,186 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:00,186 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:00,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:00,187 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:00,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:00,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:00,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:00,188 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:00,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:00,188 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:00,189 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:00,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:00,189 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:00,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:00,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,192 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:00,192 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:00,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:00,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:00,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:00,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:02:00,316 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:00,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:00,316 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:00,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1342 [2022-12-13 02:02:00,316 INFO L420 AbstractCegarLoop]: === Iteration 1344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1593777869, now seen corresponding path program 1 times [2022-12-13 02:02:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:00,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163005333] [2022-12-13 02:02:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:00,373 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 02:02:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:00,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163005333] [2022-12-13 02:02:00,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163005333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:00,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:00,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383955214] [2022-12-13 02:02:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:00,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:00,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:00,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:00,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:00,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:00,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:00,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:00,422 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:00,422 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:00,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:00,422 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:00,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:00,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:00,423 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:00,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:00,424 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:00,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:00,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:00,424 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:00,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:00,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,427 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:00,427 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:00,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:00,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:00,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:00,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:02:00,552 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:00,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:00,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:00,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1343 [2022-12-13 02:02:00,552 INFO L420 AbstractCegarLoop]: === Iteration 1345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1651036171, now seen corresponding path program 1 times [2022-12-13 02:02:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868266072] [2022-12-13 02:02:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:00,607 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 02:02:00,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:00,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868266072] [2022-12-13 02:02:00,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868266072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:00,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:00,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071130554] [2022-12-13 02:02:00,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:00,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:00,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:00,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:00,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:00,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:00,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:00,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:00,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:00,659 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:00,659 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:00,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:00,660 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:00,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:00,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:00,660 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:00,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:00,661 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:00,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:00,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:00,661 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:00,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:00,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,664 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:00,664 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:00,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:00,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:00,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:00,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:00,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:00,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:00,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:00,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1344 [2022-12-13 02:02:00,781 INFO L420 AbstractCegarLoop]: === Iteration 1346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1708294473, now seen corresponding path program 1 times [2022-12-13 02:02:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:00,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014538955] [2022-12-13 02:02:00,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:00,833 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 02:02:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:00,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014538955] [2022-12-13 02:02:00,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014538955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:00,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:00,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491878711] [2022-12-13 02:02:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:00,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:00,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:00,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:00,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:00,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:00,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:00,877 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:00,877 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:00,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:00,878 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:00,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:00,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:00,878 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:00,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:00,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:00,879 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:00,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:00,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:00,879 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:00,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:00,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,882 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:00,882 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:00,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:00,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:00,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:01,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:01,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:01,002 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:01,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:01,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:01,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1345 [2022-12-13 02:02:01,002 INFO L420 AbstractCegarLoop]: === Iteration 1347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1765552775, now seen corresponding path program 1 times [2022-12-13 02:02:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:01,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447170591] [2022-12-13 02:02:01,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:01,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:01,068 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 02:02:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:01,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447170591] [2022-12-13 02:02:01,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447170591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:01,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:01,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699786534] [2022-12-13 02:02:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:01,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:01,069 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:01,069 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:01,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:01,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:01,112 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:01,112 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:01,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:01,113 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:01,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:01,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:01,113 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:01,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:01,114 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:01,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:01,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:01,114 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:01,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:01,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,117 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:01,117 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:01,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:01,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:01,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:01,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:01,251 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:01,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:01,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:01,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1346 [2022-12-13 02:02:01,251 INFO L420 AbstractCegarLoop]: === Iteration 1348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:01,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1822811077, now seen corresponding path program 1 times [2022-12-13 02:02:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:01,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796096620] [2022-12-13 02:02:01,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:01,304 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 02:02:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:01,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796096620] [2022-12-13 02:02:01,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796096620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:01,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:01,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444126462] [2022-12-13 02:02:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:01,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:01,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:01,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:01,305 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:01,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:01,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:01,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:01,348 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:01,348 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:01,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:01,348 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:01,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:01,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:01,349 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:01,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:01,350 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:01,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:01,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:01,350 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:01,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:01,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,353 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:01,353 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:01,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:01,353 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,353 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:01,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:01,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:01,470 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:01,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:01,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:01,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1347 [2022-12-13 02:02:01,470 INFO L420 AbstractCegarLoop]: === Iteration 1349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:01,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:01,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1880069379, now seen corresponding path program 1 times [2022-12-13 02:02:01,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:01,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541372282] [2022-12-13 02:02:01,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:01,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:01,524 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 02:02:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:01,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541372282] [2022-12-13 02:02:01,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541372282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:01,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:01,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812932628] [2022-12-13 02:02:01,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:01,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:01,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:01,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:01,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:01,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:01,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:01,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:01,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:01,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:01,577 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:01,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:01,577 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:01,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:01,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:01,578 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:01,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:01,579 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:01,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:01,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:01,579 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:01,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:01,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:01,582 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:01,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:01,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:01,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:01,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:02:01,703 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:01,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:01,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:01,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1348 [2022-12-13 02:02:01,703 INFO L420 AbstractCegarLoop]: === Iteration 1350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:01,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1937327681, now seen corresponding path program 1 times [2022-12-13 02:02:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676258184] [2022-12-13 02:02:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:01,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:01,762 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 02:02:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676258184] [2022-12-13 02:02:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676258184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:01,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:01,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:01,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232608803] [2022-12-13 02:02:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:01,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:01,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:01,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:01,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:01,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:01,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:01,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:01,818 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:01,819 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:01,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:01,819 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:01,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:01,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:01,820 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:01,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:01,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:01,821 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:01,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:01,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:01,821 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:01,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:01,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:01,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,824 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:01,824 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:01,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:01,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:01,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:01,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:01,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:02:01,945 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:01,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:01,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:01,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:01,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1349 [2022-12-13 02:02:01,946 INFO L420 AbstractCegarLoop]: === Iteration 1351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:01,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1994585983, now seen corresponding path program 1 times [2022-12-13 02:02:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:01,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556371588] [2022-12-13 02:02:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:02,001 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 02:02:02,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:02,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556371588] [2022-12-13 02:02:02,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556371588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:02,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:02,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:02,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074017615] [2022-12-13 02:02:02,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:02,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:02,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:02,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:02,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:02,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:02,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:02,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:02,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:02,053 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:02,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:02,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:02,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:02,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:02,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:02,054 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:02,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:02,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:02,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:02,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:02,055 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:02,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:02,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,058 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:02,058 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:02,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:02,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:02,192 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:02,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:02,193 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:02,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:02,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:02,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1350 [2022-12-13 02:02:02,194 INFO L420 AbstractCegarLoop]: === Iteration 1352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:02,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2051844285, now seen corresponding path program 1 times [2022-12-13 02:02:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:02,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975358590] [2022-12-13 02:02:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:02,251 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 02:02:02,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:02,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975358590] [2022-12-13 02:02:02,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975358590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:02,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:02,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348987334] [2022-12-13 02:02:02,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:02,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:02,253 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:02,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:02,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:02,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:02,300 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:02,300 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:02,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:02,300 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:02,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:02,301 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:02,301 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:02,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:02,302 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,302 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:02,302 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:02,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:02,302 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,302 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:02,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:02,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,305 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:02,305 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:02,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:02,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:02,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:02,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:02:02,434 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:02,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:02,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:02,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1351 [2022-12-13 02:02:02,434 INFO L420 AbstractCegarLoop]: === Iteration 1353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:02,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2109102587, now seen corresponding path program 1 times [2022-12-13 02:02:02,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:02,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955279697] [2022-12-13 02:02:02,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:02,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:02,491 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 02:02:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:02,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955279697] [2022-12-13 02:02:02,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955279697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:02,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:02,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35926737] [2022-12-13 02:02:02,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:02,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:02,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:02,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:02,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:02,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:02,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:02,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:02,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:02,539 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:02,539 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:02,540 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:02,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:02,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:02,540 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:02,541 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:02,541 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:02,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:02,541 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:02,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:02,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,544 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:02,544 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:02,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:02,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:02,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:02,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:02:02,668 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:02,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:02,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:02,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1352 [2022-12-13 02:02:02,668 INFO L420 AbstractCegarLoop]: === Iteration 1354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:02,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2128606407, now seen corresponding path program 1 times [2022-12-13 02:02:02,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:02,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361412411] [2022-12-13 02:02:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:02,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 02:02:02,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:02,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361412411] [2022-12-13 02:02:02,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361412411] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:02,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:02,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996901826] [2022-12-13 02:02:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:02,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:02,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:02,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:02,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:02,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:02,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:02,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:02,792 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:02,792 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:02,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:02,793 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:02,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:02,793 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:02,793 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:02,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:02,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:02,794 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,794 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:02,794 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:02,794 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:02,794 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,795 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:02,795 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:02,795 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:02,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,797 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:02,797 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:02,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:02,798 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:02,798 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:02,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:02,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:02:02,918 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:02,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:02,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:02,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1353 [2022-12-13 02:02:02,918 INFO L420 AbstractCegarLoop]: === Iteration 1355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2071348105, now seen corresponding path program 1 times [2022-12-13 02:02:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:02,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020722765] [2022-12-13 02:02:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:02,977 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 02:02:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:02,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020722765] [2022-12-13 02:02:02,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020722765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:02,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:02,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605118113] [2022-12-13 02:02:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:02,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:02,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:02,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:02,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:02,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:02,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:02,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:02,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:02,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:03,041 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:03,041 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:03,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:03,042 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:03,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:03,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:03,042 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:03,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:03,044 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:03,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:03,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:03,044 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:03,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:03,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,048 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:03,048 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:03,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:03,182 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:03,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:03,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:03,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:03,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:03,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1354 [2022-12-13 02:02:03,184 INFO L420 AbstractCegarLoop]: === Iteration 1356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2014089803, now seen corresponding path program 1 times [2022-12-13 02:02:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:03,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982265770] [2022-12-13 02:02:03,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:03,250 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 02:02:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:03,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982265770] [2022-12-13 02:02:03,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982265770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:03,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:03,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969501174] [2022-12-13 02:02:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:03,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:03,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:03,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:03,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:03,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:03,312 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:03,312 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:03,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:03,313 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:03,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:03,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:03,313 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:03,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:03,315 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:03,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:03,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:03,315 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,315 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:03,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:03,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,319 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:03,319 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:03,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:03,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:03,454 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:03,455 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:02:03,455 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:03,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,455 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:03,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:03,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1355 [2022-12-13 02:02:03,456 INFO L420 AbstractCegarLoop]: === Iteration 1357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1956831501, now seen corresponding path program 1 times [2022-12-13 02:02:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:03,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132119357] [2022-12-13 02:02:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:03,509 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 02:02:03,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:03,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132119357] [2022-12-13 02:02:03,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132119357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:03,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:03,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:03,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986857179] [2022-12-13 02:02:03,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:03,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:03,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:03,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:03,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:03,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:03,553 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:03,553 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:03,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:03,554 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:03,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:03,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:03,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:03,554 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:03,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:03,555 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:03,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:03,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:03,555 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,556 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:03,556 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:03,556 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,558 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:03,558 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:03,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:03,559 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,559 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:03,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:03,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:03,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:03,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:03,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:03,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1356 [2022-12-13 02:02:03,674 INFO L420 AbstractCegarLoop]: === Iteration 1358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:03,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1899573199, now seen corresponding path program 1 times [2022-12-13 02:02:03,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:03,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876546857] [2022-12-13 02:02:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:03,728 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 02:02:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:03,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876546857] [2022-12-13 02:02:03,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876546857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:03,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:03,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870532074] [2022-12-13 02:02:03,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:03,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:03,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:03,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:03,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:03,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:03,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:03,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:03,780 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:03,781 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:03,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:03,781 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:03,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:03,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:03,782 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:03,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:03,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:03,783 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:03,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:03,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:03,783 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:03,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:03,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:03,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,786 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:03,786 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:03,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:03,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:03,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:03,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:03,904 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:03,904 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:03,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:03,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:03,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1357 [2022-12-13 02:02:03,904 INFO L420 AbstractCegarLoop]: === Iteration 1359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1842314897, now seen corresponding path program 1 times [2022-12-13 02:02:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:03,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269982845] [2022-12-13 02:02:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:03,974 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 02:02:03,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:03,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269982845] [2022-12-13 02:02:03,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269982845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:03,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:03,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667897782] [2022-12-13 02:02:03,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:03,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:03,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:03,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:03,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:03,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:03,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:03,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:03,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:04,019 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:04,019 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:04,019 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:04,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:04,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:04,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:04,020 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:04,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:04,021 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:04,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:04,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:04,021 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:04,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:04,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,024 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:04,024 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:04,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:04,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:04,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:04,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:04,141 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:04,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:04,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:04,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1358 [2022-12-13 02:02:04,141 INFO L420 AbstractCegarLoop]: === Iteration 1360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1785056595, now seen corresponding path program 1 times [2022-12-13 02:02:04,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:04,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400202031] [2022-12-13 02:02:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:04,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:04,196 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 02:02:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400202031] [2022-12-13 02:02:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400202031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:04,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:04,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:04,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461589440] [2022-12-13 02:02:04,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:04,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:04,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:04,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:04,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:04,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:04,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:04,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:04,240 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:04,241 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:04,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:04,241 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:04,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:04,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:04,242 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:04,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:04,242 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,242 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:04,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:04,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:04,243 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:04,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:04,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,245 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:04,246 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:04,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:04,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:04,360 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:04,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:04,360 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:04,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,361 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:04,361 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:04,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1359 [2022-12-13 02:02:04,361 INFO L420 AbstractCegarLoop]: === Iteration 1361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:04,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1727798293, now seen corresponding path program 1 times [2022-12-13 02:02:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169889643] [2022-12-13 02:02:04,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:04,413 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 02:02:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:04,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169889643] [2022-12-13 02:02:04,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169889643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:04,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:04,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508913212] [2022-12-13 02:02:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:04,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:04,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:04,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:04,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:04,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:04,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:04,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:04,462 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:04,462 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:04,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:04,463 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:04,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:04,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:04,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:04,463 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:04,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:04,464 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:04,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:04,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:04,465 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:04,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:04,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:04,467 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:04,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:04,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:04,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:04,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:04,582 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:04,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:04,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:04,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1360 [2022-12-13 02:02:04,583 INFO L420 AbstractCegarLoop]: === Iteration 1362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:04,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1670539991, now seen corresponding path program 1 times [2022-12-13 02:02:04,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:04,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386180144] [2022-12-13 02:02:04,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:04,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:04,636 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 02:02:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386180144] [2022-12-13 02:02:04,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386180144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:04,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053171892] [2022-12-13 02:02:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:04,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:04,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:04,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:04,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:04,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:04,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:04,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:04,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:04,680 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:04,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:04,681 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:04,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:04,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:04,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:04,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:04,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:04,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:04,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:04,682 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:04,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:04,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,685 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:04,685 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:04,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:04,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:04,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:04,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:04,800 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:04,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:04,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:04,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1361 [2022-12-13 02:02:04,800 INFO L420 AbstractCegarLoop]: === Iteration 1363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:04,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:04,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1613281689, now seen corresponding path program 1 times [2022-12-13 02:02:04,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:04,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90321118] [2022-12-13 02:02:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:04,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:04,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:04,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90321118] [2022-12-13 02:02:04,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90321118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:04,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:04,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:04,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618036734] [2022-12-13 02:02:04,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:04,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:04,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:04,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:04,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:04,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:04,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:04,904 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:04,905 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:04,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:04,905 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:04,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:04,905 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:04,906 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:04,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:04,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:04,906 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,906 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:04,906 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:04,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:04,907 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:04,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:04,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:04,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,909 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:04,909 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:04,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:04,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:04,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:05,031 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:05,032 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:05,032 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:05,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,032 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:05,032 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:05,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1362 [2022-12-13 02:02:05,032 INFO L420 AbstractCegarLoop]: === Iteration 1364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1556023387, now seen corresponding path program 1 times [2022-12-13 02:02:05,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:05,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678320394] [2022-12-13 02:02:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:05,099 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 02:02:05,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:05,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678320394] [2022-12-13 02:02:05,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678320394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:05,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:05,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:05,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765295801] [2022-12-13 02:02:05,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:05,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:05,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:05,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:05,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:05,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:05,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:05,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:05,150 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:05,150 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:05,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:05,150 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:05,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:05,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:05,151 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:05,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:05,152 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:05,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:05,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:05,152 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:05,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:05,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,155 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:05,155 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:05,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:05,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:05,268 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:05,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:05,269 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:05,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:05,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:05,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1363 [2022-12-13 02:02:05,269 INFO L420 AbstractCegarLoop]: === Iteration 1365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:05,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1498765085, now seen corresponding path program 1 times [2022-12-13 02:02:05,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:05,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853368560] [2022-12-13 02:02:05,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:05,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:05,322 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 02:02:05,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:05,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853368560] [2022-12-13 02:02:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853368560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:05,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:05,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:05,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427282454] [2022-12-13 02:02:05,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:05,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:05,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:05,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:05,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:05,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:05,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:05,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:05,372 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:05,373 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:05,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:05,373 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:05,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:05,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:05,374 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:05,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:05,375 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:05,375 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:05,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:05,375 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:05,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:05,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,378 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:05,378 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:05,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:05,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:05,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:05,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:05,493 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:05,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:05,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:05,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1364 [2022-12-13 02:02:05,494 INFO L420 AbstractCegarLoop]: === Iteration 1366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:05,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:05,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1441506783, now seen corresponding path program 1 times [2022-12-13 02:02:05,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:05,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376854058] [2022-12-13 02:02:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:05,575 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 02:02:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376854058] [2022-12-13 02:02:05,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376854058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:05,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:05,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364705306] [2022-12-13 02:02:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:05,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:05,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:05,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:05,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:05,635 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:05,635 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:05,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:05,636 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:05,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:05,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:05,636 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:05,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:05,637 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:05,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:05,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:05,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:05,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:05,638 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,640 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:05,640 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:05,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:05,641 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:05,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:05,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:05,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:05,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1365 [2022-12-13 02:02:05,759 INFO L420 AbstractCegarLoop]: === Iteration 1367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1384248481, now seen corresponding path program 1 times [2022-12-13 02:02:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:05,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935437294] [2022-12-13 02:02:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:05,814 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 02:02:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:05,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935437294] [2022-12-13 02:02:05,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935437294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:05,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:05,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:05,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430725533] [2022-12-13 02:02:05,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:05,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:05,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:05,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:05,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:05,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:05,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:05,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:05,864 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:05,864 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:05,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:05,864 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:05,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:05,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:05,865 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:05,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:05,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:05,865 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:05,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:05,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:05,866 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:05,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:05,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:05,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,869 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:05,869 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:05,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:05,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:05,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:05,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:05,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:05,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:05,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:05,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1366 [2022-12-13 02:02:05,988 INFO L420 AbstractCegarLoop]: === Iteration 1368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1326990179, now seen corresponding path program 1 times [2022-12-13 02:02:05,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:05,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864560720] [2022-12-13 02:02:05,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:06,041 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 02:02:06,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:06,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864560720] [2022-12-13 02:02:06,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864560720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:06,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:06,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999316471] [2022-12-13 02:02:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:06,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:06,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:06,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:06,042 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:06,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:06,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:06,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:06,097 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:06,097 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:06,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:06,098 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:06,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:06,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:06,098 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:06,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:06,099 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:06,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:06,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:06,100 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:06,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:06,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,103 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:06,103 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:06,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:06,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:06,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:06,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:02:06,226 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:06,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:06,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1367 [2022-12-13 02:02:06,226 INFO L420 AbstractCegarLoop]: === Iteration 1369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:06,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1269731877, now seen corresponding path program 1 times [2022-12-13 02:02:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:06,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954087178] [2022-12-13 02:02:06,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:06,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:06,298 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 02:02:06,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:06,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954087178] [2022-12-13 02:02:06,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954087178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:06,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:06,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117402988] [2022-12-13 02:02:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:06,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:06,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:06,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:06,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:06,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:06,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:06,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:06,357 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:06,357 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:06,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:06,358 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:06,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:06,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:06,358 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:06,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:06,359 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:06,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:06,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:06,359 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:06,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:06,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,362 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:06,362 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:06,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:06,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:06,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:06,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:02:06,505 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:06,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:06,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:06,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1368 [2022-12-13 02:02:06,506 INFO L420 AbstractCegarLoop]: === Iteration 1370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:06,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1212473575, now seen corresponding path program 1 times [2022-12-13 02:02:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:06,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878204027] [2022-12-13 02:02:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:06,587 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 02:02:06,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:06,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878204027] [2022-12-13 02:02:06,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878204027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:06,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:06,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742421209] [2022-12-13 02:02:06,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:06,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:06,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:06,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:06,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:06,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:06,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:06,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:06,638 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:06,638 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:06,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:06,639 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:06,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:06,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:06,639 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:06,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:06,640 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:06,640 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:06,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:06,641 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:06,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:06,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,643 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:06,643 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:06,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:06,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:06,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:06,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:06,773 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:06,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:06,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:06,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1369 [2022-12-13 02:02:06,773 INFO L420 AbstractCegarLoop]: === Iteration 1371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1155215273, now seen corresponding path program 1 times [2022-12-13 02:02:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:06,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346421918] [2022-12-13 02:02:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:06,845 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 02:02:06,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346421918] [2022-12-13 02:02:06,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346421918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:06,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:06,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518849838] [2022-12-13 02:02:06,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:06,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:06,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:06,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:06,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:06,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:06,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:06,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:06,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:06,898 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:06,898 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:06,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:06,899 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:06,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:06,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:06,899 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:06,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:06,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:06,900 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,900 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:06,900 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:06,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:06,901 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:06,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:06,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:06,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,903 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:06,903 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:06,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:06,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:07,034 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:07,035 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:07,035 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:07,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1370 [2022-12-13 02:02:07,036 INFO L420 AbstractCegarLoop]: === Iteration 1372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1097956971, now seen corresponding path program 1 times [2022-12-13 02:02:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145818215] [2022-12-13 02:02:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:07,096 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 02:02:07,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:07,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145818215] [2022-12-13 02:02:07,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145818215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:07,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:07,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:07,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916868297] [2022-12-13 02:02:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:07,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:07,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:07,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:07,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:07,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:07,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:07,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:07,157 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:07,157 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:07,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:07,158 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:07,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:07,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:07,158 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:07,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:07,159 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:07,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:07,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:07,159 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:07,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:07,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,162 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:07,162 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:07,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:07,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:07,294 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:07,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:07,295 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:07,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:07,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:07,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1371 [2022-12-13 02:02:07,295 INFO L420 AbstractCegarLoop]: === Iteration 1373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1040698669, now seen corresponding path program 1 times [2022-12-13 02:02:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528722957] [2022-12-13 02:02:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:07,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:07,353 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 02:02:07,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:07,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528722957] [2022-12-13 02:02:07,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528722957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:07,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:07,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783858561] [2022-12-13 02:02:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:07,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:07,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:07,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:07,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:07,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:07,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:07,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:07,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:07,416 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:07,416 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:07,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:07,417 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:07,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:07,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:07,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:07,418 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:07,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:07,418 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,418 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:07,419 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:07,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:07,419 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:07,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:07,419 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,422 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:07,422 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:07,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:07,422 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,422 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:07,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:07,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:07,556 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:07,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:07,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:07,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1372 [2022-12-13 02:02:07,557 INFO L420 AbstractCegarLoop]: === Iteration 1374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:07,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:07,557 INFO L85 PathProgramCache]: Analyzing trace with hash -983440367, now seen corresponding path program 1 times [2022-12-13 02:02:07,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:07,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325861195] [2022-12-13 02:02:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:07,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:07,616 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 02:02:07,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:07,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325861195] [2022-12-13 02:02:07,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325861195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:07,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:07,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100221256] [2022-12-13 02:02:07,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:07,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:07,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:07,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:07,618 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:07,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:07,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:07,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:07,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:07,680 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:07,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:07,680 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:07,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:07,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:07,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:07,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:07,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:07,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:07,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:07,682 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:07,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:07,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,685 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:07,685 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:07,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:07,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:07,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:07,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:07,819 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:07,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:07,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:07,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1373 [2022-12-13 02:02:07,819 INFO L420 AbstractCegarLoop]: === Iteration 1375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -926182065, now seen corresponding path program 1 times [2022-12-13 02:02:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11520895] [2022-12-13 02:02:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:07,900 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 02:02:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11520895] [2022-12-13 02:02:07,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11520895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:07,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:07,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:07,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016660030] [2022-12-13 02:02:07,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:07,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:07,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:07,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:07,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:07,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:07,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:07,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:07,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:07,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:07,971 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:07,971 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:07,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:07,972 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:07,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:07,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:07,973 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:07,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:07,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:07,974 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:07,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:07,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:07,974 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:07,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:07,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:07,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,977 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:07,977 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:07,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:07,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:07,977 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:08,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:08,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 02:02:08,124 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:08,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:08,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:08,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1374 [2022-12-13 02:02:08,124 INFO L420 AbstractCegarLoop]: === Iteration 1376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash -868923763, now seen corresponding path program 1 times [2022-12-13 02:02:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:08,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107175027] [2022-12-13 02:02:08,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:08,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:08,209 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 02:02:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:08,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107175027] [2022-12-13 02:02:08,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107175027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:08,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:08,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326414605] [2022-12-13 02:02:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:08,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:08,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:08,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:08,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:08,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:08,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:08,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:08,273 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:08,273 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:08,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:08,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:08,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:08,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:08,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:08,274 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:08,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:08,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:08,275 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:08,276 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:08,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:08,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:08,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:08,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:08,280 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:08,280 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:08,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:08,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:08,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:08,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:08,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:08,411 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:08,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:08,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:08,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1375 [2022-12-13 02:02:08,412 INFO L420 AbstractCegarLoop]: === Iteration 1377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:08,412 INFO L85 PathProgramCache]: Analyzing trace with hash -811665461, now seen corresponding path program 1 times [2022-12-13 02:02:08,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:08,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916058477] [2022-12-13 02:02:08,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:08,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:08,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 02:02:08,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:08,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916058477] [2022-12-13 02:02:08,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916058477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:08,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:08,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631978705] [2022-12-13 02:02:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:08,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:08,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:08,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:08,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:08,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:08,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:08,532 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:08,532 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:08,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:08,533 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:08,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:08,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:08,533 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:08,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:08,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:08,534 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:08,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:08,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:08,534 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:08,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:08,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:08,537 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:08,537 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:08,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:08,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:08,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:08,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:08,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:08,673 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:08,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:08,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:08,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1376 [2022-12-13 02:02:08,673 INFO L420 AbstractCegarLoop]: === Iteration 1378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -754407159, now seen corresponding path program 1 times [2022-12-13 02:02:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:08,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673827322] [2022-12-13 02:02:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:08,737 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 02:02:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:08,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673827322] [2022-12-13 02:02:08,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673827322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:08,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:08,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:08,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239544844] [2022-12-13 02:02:08,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:08,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:08,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:08,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:08,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:08,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:08,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:08,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:08,798 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:08,798 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:08,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:08,799 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:08,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:08,799 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:08,799 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:08,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:08,800 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:08,800 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:08,800 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:08,800 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,800 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:08,801 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:08,801 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:08,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:08,803 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:08,803 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:08,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:08,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:08,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:08,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:08,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:08,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:08,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:08,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:08,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1377 [2022-12-13 02:02:08,936 INFO L420 AbstractCegarLoop]: === Iteration 1379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:08,936 INFO L85 PathProgramCache]: Analyzing trace with hash -697148857, now seen corresponding path program 1 times [2022-12-13 02:02:08,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131691985] [2022-12-13 02:02:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:08,992 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 02:02:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131691985] [2022-12-13 02:02:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131691985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:08,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:08,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:08,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707094637] [2022-12-13 02:02:08,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:08,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:08,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:08,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:08,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:08,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:08,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:08,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:08,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:08,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:09,054 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:09,054 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:09,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:09,055 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:09,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:09,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:09,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:09,055 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:09,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:09,057 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:09,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:09,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:09,057 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:09,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:09,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:09,061 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:09,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:09,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:09,192 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:09,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:09,193 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:09,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:09,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:09,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1378 [2022-12-13 02:02:09,193 INFO L420 AbstractCegarLoop]: === Iteration 1380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash -639890555, now seen corresponding path program 1 times [2022-12-13 02:02:09,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:09,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930056491] [2022-12-13 02:02:09,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:09,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:09,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:09,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930056491] [2022-12-13 02:02:09,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930056491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:09,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:09,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:09,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191923933] [2022-12-13 02:02:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:09,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:09,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:09,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:09,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:09,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:09,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:09,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:09,313 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:09,313 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:09,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:09,314 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:09,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:09,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:09,314 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:09,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:09,315 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:09,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:09,315 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:09,315 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:09,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:09,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,318 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:09,318 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:09,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:09,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:09,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:09,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:02:09,446 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:09,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:09,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:09,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1379 [2022-12-13 02:02:09,446 INFO L420 AbstractCegarLoop]: === Iteration 1381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -582632253, now seen corresponding path program 1 times [2022-12-13 02:02:09,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:09,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595574324] [2022-12-13 02:02:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:09,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:09,516 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 02:02:09,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595574324] [2022-12-13 02:02:09,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595574324] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:09,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:09,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:09,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044103762] [2022-12-13 02:02:09,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:09,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:09,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:09,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:09,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:09,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:09,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:09,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:09,560 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:09,560 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:09,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:09,560 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:09,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:09,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:09,561 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:09,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:09,562 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:09,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:09,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:09,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:09,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:09,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,565 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:09,565 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:09,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 184 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:09,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:09,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:09,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:09,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:09,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:09,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1380 [2022-12-13 02:02:09,682 INFO L420 AbstractCegarLoop]: === Iteration 1382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -525373951, now seen corresponding path program 1 times [2022-12-13 02:02:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:09,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721471145] [2022-12-13 02:02:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:09,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:09,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721471145] [2022-12-13 02:02:09,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721471145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:09,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:09,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742313896] [2022-12-13 02:02:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:09,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:09,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:09,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:09,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:09,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:09,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:09,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:09,794 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:09,794 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:09,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:09,795 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:09,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:09,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:09,795 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:09,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:09,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:09,796 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,796 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:09,796 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:09,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:09,797 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:09,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:09,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:09,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,799 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:09,800 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:09,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:09,800 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:09,800 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:09,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:09,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:09,916 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:09,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:09,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:09,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1381 [2022-12-13 02:02:09,916 INFO L420 AbstractCegarLoop]: === Iteration 1383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:09,916 INFO L85 PathProgramCache]: Analyzing trace with hash -468115649, now seen corresponding path program 1 times [2022-12-13 02:02:09,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:09,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14917057] [2022-12-13 02:02:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:09,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:09,971 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 02:02:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:09,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14917057] [2022-12-13 02:02:09,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14917057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:09,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:09,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493174317] [2022-12-13 02:02:09,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:09,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:09,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:09,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:09,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:09,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:09,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:09,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:09,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:10,023 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:10,023 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:10,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:10,023 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:10,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:10,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:10,024 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:10,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:10,025 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:10,025 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:10,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:10,025 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:10,025 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:10,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,028 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:10,028 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:10,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:10,028 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,028 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:10,143 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:10,143 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:10,143 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:10,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:10,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:10,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1382 [2022-12-13 02:02:10,144 INFO L420 AbstractCegarLoop]: === Iteration 1384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:10,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -410857347, now seen corresponding path program 1 times [2022-12-13 02:02:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:10,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430487371] [2022-12-13 02:02:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:10,198 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 02:02:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:10,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430487371] [2022-12-13 02:02:10,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430487371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:10,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:10,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546871084] [2022-12-13 02:02:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:10,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:10,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:10,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:10,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:10,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:10,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:10,250 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:10,250 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:10,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:10,251 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:10,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:10,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:10,251 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:10,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:10,252 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:10,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:10,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:10,252 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:10,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:10,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,255 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:10,255 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:10,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:10,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:10,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:10,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:02:10,376 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:10,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:10,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:10,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1383 [2022-12-13 02:02:10,377 INFO L420 AbstractCegarLoop]: === Iteration 1385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:10,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:10,377 INFO L85 PathProgramCache]: Analyzing trace with hash -353599045, now seen corresponding path program 1 times [2022-12-13 02:02:10,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:10,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961228747] [2022-12-13 02:02:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:10,438 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 02:02:10,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:10,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961228747] [2022-12-13 02:02:10,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961228747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:10,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:10,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:10,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037659628] [2022-12-13 02:02:10,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:10,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:10,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:10,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:10,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:10,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:10,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:10,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:10,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:10,497 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:10,497 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:10,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:10,497 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:10,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:10,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:10,498 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:10,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:10,499 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:10,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:10,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:10,499 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:10,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:10,500 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,503 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:10,503 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:10,503 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,503 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:10,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:10,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:10,622 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:10,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:10,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:10,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1384 [2022-12-13 02:02:10,622 INFO L420 AbstractCegarLoop]: === Iteration 1386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash -296340743, now seen corresponding path program 1 times [2022-12-13 02:02:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:10,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791704996] [2022-12-13 02:02:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:10,676 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 02:02:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791704996] [2022-12-13 02:02:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791704996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:10,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:10,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518696574] [2022-12-13 02:02:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:10,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:10,677 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:10,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:10,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:10,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:10,735 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:10,736 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:10,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:10,736 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:10,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:10,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:10,736 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:10,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:10,737 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:10,737 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:10,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:10,738 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:10,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:10,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,740 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:10,740 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:10,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:10,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:10,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:10,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:10,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:10,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:10,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:10,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1385 [2022-12-13 02:02:10,854 INFO L420 AbstractCegarLoop]: === Iteration 1387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:10,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -239082441, now seen corresponding path program 1 times [2022-12-13 02:02:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:10,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916786281] [2022-12-13 02:02:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:10,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 02:02:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916786281] [2022-12-13 02:02:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916786281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630873233] [2022-12-13 02:02:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:10,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:10,910 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:10,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:10,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:10,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:10,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:10,962 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:10,962 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:10,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:10,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:10,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:10,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:10,963 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:10,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:10,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:10,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:10,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:10,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:10,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:10,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:10,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:10,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:10,967 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:10,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:10,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:10,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:11,100 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:11,101 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:11,101 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:11,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,101 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:11,101 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:11,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1386 [2022-12-13 02:02:11,101 INFO L420 AbstractCegarLoop]: === Iteration 1388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash -181824139, now seen corresponding path program 1 times [2022-12-13 02:02:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:11,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493222333] [2022-12-13 02:02:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:11,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:11,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493222333] [2022-12-13 02:02:11,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493222333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:11,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:11,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662597255] [2022-12-13 02:02:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:11,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:11,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:11,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:11,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:11,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:11,209 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:11,209 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:11,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:11,210 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:11,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:11,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:11,211 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:11,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:11,212 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,212 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:11,212 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:11,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:11,212 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:11,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:11,212 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,216 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:11,216 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:11,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:11,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:11,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:02:11,346 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:11,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:11,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:11,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1387 [2022-12-13 02:02:11,346 INFO L420 AbstractCegarLoop]: === Iteration 1389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -124565837, now seen corresponding path program 1 times [2022-12-13 02:02:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:11,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861795949] [2022-12-13 02:02:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:11,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:11,403 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 02:02:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:11,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861795949] [2022-12-13 02:02:11,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861795949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:11,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:11,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:11,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482100546] [2022-12-13 02:02:11,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:11,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:11,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:11,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:11,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:11,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:11,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:11,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:11,462 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:11,463 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:11,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:11,463 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:11,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:11,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:11,464 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:11,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:11,465 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,465 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:11,465 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:11,465 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:11,465 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,465 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:11,465 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:11,465 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,468 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:11,468 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:11,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:11,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:11,599 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:11,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:02:11,600 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:11,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:11,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:11,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1388 [2022-12-13 02:02:11,600 INFO L420 AbstractCegarLoop]: === Iteration 1390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash -67307535, now seen corresponding path program 1 times [2022-12-13 02:02:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:11,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730297574] [2022-12-13 02:02:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:11,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:11,668 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 02:02:11,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:11,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730297574] [2022-12-13 02:02:11,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730297574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:11,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:11,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:11,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107134798] [2022-12-13 02:02:11,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:11,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:11,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:11,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:11,669 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:11,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:11,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:11,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:11,720 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:11,721 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:11,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:11,721 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:11,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:11,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:11,722 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:11,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:11,723 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:11,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:11,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:11,724 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:11,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:11,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,727 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:11,728 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:11,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:11,728 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,728 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:11,859 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:11,860 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:11,860 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:11,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1389 [2022-12-13 02:02:11,860 INFO L420 AbstractCegarLoop]: === Iteration 1391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:11,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash -10049233, now seen corresponding path program 1 times [2022-12-13 02:02:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329564240] [2022-12-13 02:02:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:11,915 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 02:02:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:11,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329564240] [2022-12-13 02:02:11,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329564240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:11,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:11,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515067279] [2022-12-13 02:02:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:11,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:11,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:11,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:11,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:11,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:11,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:11,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:11,967 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:11,967 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:11,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:11,968 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:11,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:11,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:11,968 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:11,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:11,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:11,969 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:11,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:11,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:11,970 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:11,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:11,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:11,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,972 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:11,973 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:11,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:11,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:11,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:12,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:12,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:12,090 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:12,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:12,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1390 [2022-12-13 02:02:12,090 INFO L420 AbstractCegarLoop]: === Iteration 1392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:12,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash 47209069, now seen corresponding path program 1 times [2022-12-13 02:02:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:12,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824241258] [2022-12-13 02:02:12,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:12,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:12,161 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 02:02:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:12,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824241258] [2022-12-13 02:02:12,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824241258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:12,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:12,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807177715] [2022-12-13 02:02:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:12,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:12,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:12,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:12,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:12,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:12,205 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:12,205 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:12,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:12,206 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:12,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:12,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:12,206 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:12,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:12,207 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,207 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:12,207 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:12,207 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:12,208 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:12,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:12,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:12,211 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:12,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:12,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:12,332 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:12,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:12,332 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:12,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:12,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:12,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1391 [2022-12-13 02:02:12,333 INFO L420 AbstractCegarLoop]: === Iteration 1393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash 104467371, now seen corresponding path program 1 times [2022-12-13 02:02:12,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618799254] [2022-12-13 02:02:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:12,385 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 02:02:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:12,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618799254] [2022-12-13 02:02:12,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618799254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:12,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:12,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298776745] [2022-12-13 02:02:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:12,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:12,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:12,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:12,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:12,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:12,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:12,437 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:12,437 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:12,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:12,438 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:12,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:12,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:12,438 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:12,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:12,439 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:12,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:12,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:12,439 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:12,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:12,440 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,442 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:12,442 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:12,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:12,443 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,443 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:12,558 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:12,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:12,559 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:12,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:12,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:12,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1392 [2022-12-13 02:02:12,560 INFO L420 AbstractCegarLoop]: === Iteration 1394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:12,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:12,560 INFO L85 PathProgramCache]: Analyzing trace with hash 161725673, now seen corresponding path program 1 times [2022-12-13 02:02:12,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:12,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364534325] [2022-12-13 02:02:12,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:12,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:12,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364534325] [2022-12-13 02:02:12,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364534325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:12,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:12,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049335229] [2022-12-13 02:02:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:12,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:12,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:12,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:12,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:12,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:12,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:12,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:12,682 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:12,682 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:12,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:12,683 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:12,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:12,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:12,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:12,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:12,684 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:12,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:12,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:12,685 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:12,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:12,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,689 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:12,689 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:12,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:12,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:12,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:12,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:12,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:12,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:12,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:12,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1393 [2022-12-13 02:02:12,822 INFO L420 AbstractCegarLoop]: === Iteration 1395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash 218983975, now seen corresponding path program 1 times [2022-12-13 02:02:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532220393] [2022-12-13 02:02:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:12,877 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 02:02:12,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532220393] [2022-12-13 02:02:12,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532220393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:12,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:12,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68830912] [2022-12-13 02:02:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:12,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:12,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:12,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:12,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:12,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:12,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:12,928 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:12,928 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:12,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:12,929 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:12,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:12,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:12,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:12,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:12,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:12,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:12,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:12,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:12,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:12,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:12,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:12,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,935 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:12,935 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:12,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:12,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:13,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:13,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:13,065 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:13,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:13,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:13,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1394 [2022-12-13 02:02:13,065 INFO L420 AbstractCegarLoop]: === Iteration 1396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:13,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:13,065 INFO L85 PathProgramCache]: Analyzing trace with hash 276242277, now seen corresponding path program 1 times [2022-12-13 02:02:13,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:13,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263814997] [2022-12-13 02:02:13,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:13,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:13,122 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 02:02:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263814997] [2022-12-13 02:02:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263814997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:13,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:13,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615598272] [2022-12-13 02:02:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:13,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:13,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:13,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:13,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:13,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:13,174 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:13,175 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:13,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:13,175 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:13,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:13,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:13,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:13,176 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:13,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:13,177 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:13,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:13,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:13,177 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:13,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:13,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,180 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:13,180 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:13,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:13,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,180 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:13,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:13,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:13,310 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:13,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:13,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:13,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1395 [2022-12-13 02:02:13,310 INFO L420 AbstractCegarLoop]: === Iteration 1397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash 333500579, now seen corresponding path program 1 times [2022-12-13 02:02:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:13,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905903599] [2022-12-13 02:02:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:13,368 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 02:02:13,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:13,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905903599] [2022-12-13 02:02:13,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905903599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:13,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:13,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:13,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23731642] [2022-12-13 02:02:13,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:13,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:13,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:13,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:13,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:13,369 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:13,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:13,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:13,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:13,422 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:13,422 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:13,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:13,423 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:13,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:13,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:13,423 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:13,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:13,424 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:13,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:13,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:13,425 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:13,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:13,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,427 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:13,428 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:13,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:13,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:13,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:02:13,574 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:13,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:13,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:13,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1396 [2022-12-13 02:02:13,574 INFO L420 AbstractCegarLoop]: === Iteration 1398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 390758881, now seen corresponding path program 1 times [2022-12-13 02:02:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:13,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952134447] [2022-12-13 02:02:13,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:13,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:13,633 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 02:02:13,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952134447] [2022-12-13 02:02:13,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952134447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:13,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:13,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:13,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77905893] [2022-12-13 02:02:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:13,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:13,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:13,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:13,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:13,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:13,694 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:13,695 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:13,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:13,695 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:13,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:13,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:13,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:13,696 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:13,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:13,697 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:13,697 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:13,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:13,698 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:13,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:13,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,702 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:13,702 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:13,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:13,702 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,702 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:13,834 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:13,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:13,835 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:13,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:13,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:13,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1397 [2022-12-13 02:02:13,835 INFO L420 AbstractCegarLoop]: === Iteration 1399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash 448017183, now seen corresponding path program 1 times [2022-12-13 02:02:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:13,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720137948] [2022-12-13 02:02:13,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:13,901 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 02:02:13,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:13,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720137948] [2022-12-13 02:02:13,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720137948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:13,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:13,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163749072] [2022-12-13 02:02:13,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:13,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:13,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:13,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:13,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:13,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:13,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:13,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:13,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:13,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:13,961 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:13,962 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:13,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:13,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:13,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:13,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:13,963 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:13,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:13,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:13,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:13,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:13,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:13,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:13,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:13,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:13,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:13,967 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:13,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:13,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:13,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:14,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:14,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:14,099 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:14,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:14,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:14,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1398 [2022-12-13 02:02:14,100 INFO L420 AbstractCegarLoop]: === Iteration 1400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 505275485, now seen corresponding path program 1 times [2022-12-13 02:02:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:14,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182649126] [2022-12-13 02:02:14,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:14,161 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 02:02:14,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:14,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182649126] [2022-12-13 02:02:14,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182649126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:14,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:14,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:14,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769447977] [2022-12-13 02:02:14,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:14,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:14,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:14,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:14,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:14,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:14,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:14,223 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:14,223 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:14,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:14,224 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:14,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:14,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:14,224 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:14,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:14,225 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:14,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:14,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:14,226 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:14,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:14,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,228 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:14,228 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:14,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:14,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:14,361 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:14,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:14,362 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:14,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:14,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1399 [2022-12-13 02:02:14,362 INFO L420 AbstractCegarLoop]: === Iteration 1401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:14,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash 562533787, now seen corresponding path program 1 times [2022-12-13 02:02:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:14,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920609263] [2022-12-13 02:02:14,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:14,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:14,428 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 02:02:14,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:14,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920609263] [2022-12-13 02:02:14,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920609263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:14,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:14,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:14,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422860105] [2022-12-13 02:02:14,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:14,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:14,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:14,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:14,429 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:14,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:14,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:14,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:14,482 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:14,482 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:14,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:14,483 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:14,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:14,483 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:14,483 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:14,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:14,484 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,484 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:14,484 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:14,484 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:14,484 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:14,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:14,485 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,487 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:14,487 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:14,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:14,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,488 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:14,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:14,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:14,609 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:14,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:14,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:14,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1400 [2022-12-13 02:02:14,609 INFO L420 AbstractCegarLoop]: === Iteration 1402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:14,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash 619792089, now seen corresponding path program 1 times [2022-12-13 02:02:14,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:14,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669004527] [2022-12-13 02:02:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:14,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:14,673 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 02:02:14,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:14,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669004527] [2022-12-13 02:02:14,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669004527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:14,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:14,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:14,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240180716] [2022-12-13 02:02:14,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:14,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:14,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:14,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:14,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:14,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:14,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:14,729 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:14,730 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:14,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:14,730 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:14,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:14,731 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:14,731 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:14,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:14,732 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:14,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:14,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:14,732 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:14,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:14,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,735 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:14,735 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:14,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:14,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,735 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:14,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:14,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:02:14,863 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:14,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:14,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:14,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1401 [2022-12-13 02:02:14,864 INFO L420 AbstractCegarLoop]: === Iteration 1403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:14,864 INFO L85 PathProgramCache]: Analyzing trace with hash 677050391, now seen corresponding path program 1 times [2022-12-13 02:02:14,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:14,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005514595] [2022-12-13 02:02:14,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:14,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:14,928 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 02:02:14,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005514595] [2022-12-13 02:02:14,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005514595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:14,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:14,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:14,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396214178] [2022-12-13 02:02:14,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:14,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:14,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:14,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:14,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:14,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:14,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:14,981 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:14,982 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:14,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:14,982 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:14,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:14,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:14,983 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:14,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:14,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:14,984 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:14,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:14,984 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:14,984 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,984 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:14,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:14,984 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:14,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,987 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:14,987 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:14,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:14,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:14,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:15,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:15,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:15,107 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:15,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:15,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:15,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1402 [2022-12-13 02:02:15,107 INFO L420 AbstractCegarLoop]: === Iteration 1404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:15,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:15,107 INFO L85 PathProgramCache]: Analyzing trace with hash 734308693, now seen corresponding path program 1 times [2022-12-13 02:02:15,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:15,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28132065] [2022-12-13 02:02:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:15,171 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 02:02:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:15,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28132065] [2022-12-13 02:02:15,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28132065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:15,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:15,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:15,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611460254] [2022-12-13 02:02:15,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:15,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:15,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:15,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:15,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:15,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:15,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:15,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:15,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:15,226 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:15,226 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:15,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:15,227 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:15,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:15,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:15,227 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:15,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:15,228 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:15,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:15,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:15,228 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:15,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:15,228 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,231 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:15,231 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:15,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:15,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:15,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:02:15,360 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:15,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:15,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:15,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1403 [2022-12-13 02:02:15,360 INFO L420 AbstractCegarLoop]: === Iteration 1405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash 791566995, now seen corresponding path program 1 times [2022-12-13 02:02:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:15,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698862714] [2022-12-13 02:02:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:15,414 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 02:02:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:15,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698862714] [2022-12-13 02:02:15,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698862714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:15,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:15,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535528491] [2022-12-13 02:02:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:15,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:15,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:15,415 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:15,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:15,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:15,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:15,464 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:15,464 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:15,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:15,465 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:15,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:15,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:15,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:15,465 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:15,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:15,466 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:15,466 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:15,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:15,467 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:15,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:15,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,469 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:15,469 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:15,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:15,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:15,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:15,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:15,585 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,585 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:15,585 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:15,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1404 [2022-12-13 02:02:15,586 INFO L420 AbstractCegarLoop]: === Iteration 1406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:15,586 INFO L85 PathProgramCache]: Analyzing trace with hash 848825297, now seen corresponding path program 1 times [2022-12-13 02:02:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:15,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655484529] [2022-12-13 02:02:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:15,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:15,640 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 02:02:15,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655484529] [2022-12-13 02:02:15,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655484529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:15,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:15,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689876457] [2022-12-13 02:02:15,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:15,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:15,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:15,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:15,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:15,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:15,694 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:15,694 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:15,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:15,695 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:15,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:15,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:15,695 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:15,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:15,696 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:15,696 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:15,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:15,696 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:15,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:15,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,699 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:15,699 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:15,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:15,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:15,828 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:15,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:15,829 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:15,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:15,829 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:15,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1405 [2022-12-13 02:02:15,829 INFO L420 AbstractCegarLoop]: === Iteration 1407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:15,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:15,830 INFO L85 PathProgramCache]: Analyzing trace with hash 906083599, now seen corresponding path program 1 times [2022-12-13 02:02:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:15,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791486084] [2022-12-13 02:02:15,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:15,901 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 02:02:15,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:15,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791486084] [2022-12-13 02:02:15,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791486084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:15,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:15,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:15,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351543133] [2022-12-13 02:02:15,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:15,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:15,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:15,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:15,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:15,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:15,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:15,953 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:15,953 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:15,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:15,954 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:15,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:15,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:15,955 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:15,955 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:15,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:15,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:15,955 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:15,956 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:15,956 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:15,956 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,956 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:15,956 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:15,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:15,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,959 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:15,959 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:15,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:15,959 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:15,959 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:16,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:16,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:02:16,087 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:16,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:16,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:16,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1406 [2022-12-13 02:02:16,087 INFO L420 AbstractCegarLoop]: === Iteration 1408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:16,088 INFO L85 PathProgramCache]: Analyzing trace with hash 963341901, now seen corresponding path program 1 times [2022-12-13 02:02:16,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:16,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197480494] [2022-12-13 02:02:16,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:16,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:16,148 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 02:02:16,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:16,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197480494] [2022-12-13 02:02:16,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197480494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:16,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:16,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111408484] [2022-12-13 02:02:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:16,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:16,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:16,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:16,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:16,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:16,200 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:16,200 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:16,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:16,201 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:16,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:16,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:16,202 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:16,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:16,203 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,203 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:16,203 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:16,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:16,204 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:16,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:16,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,208 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:16,208 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:16,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:16,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:16,340 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:16,341 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:16,341 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:16,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,341 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:16,341 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:16,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1407 [2022-12-13 02:02:16,341 INFO L420 AbstractCegarLoop]: === Iteration 1409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:16,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1020600203, now seen corresponding path program 1 times [2022-12-13 02:02:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:16,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593524184] [2022-12-13 02:02:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:16,408 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 02:02:16,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:16,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593524184] [2022-12-13 02:02:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593524184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:16,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:16,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485991881] [2022-12-13 02:02:16,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:16,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:16,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:16,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:16,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:16,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:16,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:16,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:16,461 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:16,461 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:16,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:16,462 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:16,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:16,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:16,463 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:16,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:16,463 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:16,463 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:16,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:16,464 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:16,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:16,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,466 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:16,466 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:16,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:16,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:16,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:16,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:16,598 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:16,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:16,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:16,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1408 [2022-12-13 02:02:16,598 INFO L420 AbstractCegarLoop]: === Iteration 1410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:16,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:16,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1077858505, now seen corresponding path program 1 times [2022-12-13 02:02:16,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:16,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598740704] [2022-12-13 02:02:16,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:16,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:16,655 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 02:02:16,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:16,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598740704] [2022-12-13 02:02:16,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598740704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:16,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:16,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:16,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465744449] [2022-12-13 02:02:16,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:16,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:16,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:16,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:16,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:16,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:16,709 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:16,709 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:16,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:16,710 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:16,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:16,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:16,710 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:16,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:16,711 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,711 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:16,711 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:16,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:16,711 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:16,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:16,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,714 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:16,714 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:16,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:16,715 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,715 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:16,846 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:16,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:16,847 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:16,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1409 [2022-12-13 02:02:16,847 INFO L420 AbstractCegarLoop]: === Iteration 1411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1135116807, now seen corresponding path program 1 times [2022-12-13 02:02:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707132118] [2022-12-13 02:02:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:16,903 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 02:02:16,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:16,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707132118] [2022-12-13 02:02:16,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707132118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:16,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:16,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:16,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816980035] [2022-12-13 02:02:16,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:16,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:16,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:16,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:16,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:16,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:16,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:16,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:16,959 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:16,959 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:16,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:16,960 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:16,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:16,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:16,960 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:16,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:16,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:16,961 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:16,961 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:16,961 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:16,961 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:16,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:16,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:16,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,964 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:16,964 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:16,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:16,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:16,965 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:17,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:17,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:17,081 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:17,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:17,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:17,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1410 [2022-12-13 02:02:17,081 INFO L420 AbstractCegarLoop]: === Iteration 1412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:17,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1192375109, now seen corresponding path program 1 times [2022-12-13 02:02:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:17,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487110607] [2022-12-13 02:02:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:17,143 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 02:02:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487110607] [2022-12-13 02:02:17,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487110607] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:17,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:17,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:17,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223696190] [2022-12-13 02:02:17,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:17,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:17,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:17,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:17,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:17,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:17,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:17,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:17,206 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:17,206 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:17,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:17,207 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:17,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:17,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:17,207 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:17,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:17,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:17,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:17,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:17,209 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:17,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:17,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:17,211 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:17,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:17,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:17,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:17,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:17,346 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:17,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:17,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:17,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1411 [2022-12-13 02:02:17,346 INFO L420 AbstractCegarLoop]: === Iteration 1413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:17,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1249633411, now seen corresponding path program 1 times [2022-12-13 02:02:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491094259] [2022-12-13 02:02:17,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:17,405 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 02:02:17,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:17,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491094259] [2022-12-13 02:02:17,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491094259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:17,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:17,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044345101] [2022-12-13 02:02:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:17,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:17,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:17,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:17,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:17,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:17,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:17,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:17,466 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:17,466 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:17,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:17,467 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:17,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:17,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:17,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:17,467 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:17,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:17,468 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,468 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:17,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:17,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:17,469 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:17,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:17,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,472 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:17,473 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:17,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:17,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:17,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:17,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:02:17,609 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:17,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,609 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:17,609 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:17,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1412 [2022-12-13 02:02:17,609 INFO L420 AbstractCegarLoop]: === Iteration 1414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1306891713, now seen corresponding path program 1 times [2022-12-13 02:02:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:17,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591406733] [2022-12-13 02:02:17,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:17,693 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 02:02:17,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:17,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591406733] [2022-12-13 02:02:17,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591406733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:17,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:17,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:17,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114744156] [2022-12-13 02:02:17,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:17,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:17,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:17,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:17,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:17,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:17,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:17,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:17,757 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:17,758 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:17,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:17,758 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:17,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:17,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:17,759 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:17,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:17,759 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:17,759 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:17,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:17,760 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:17,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:17,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,762 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:17,762 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:17,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:17,763 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,763 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:17,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:17,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:17,895 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:17,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:17,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:17,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1413 [2022-12-13 02:02:17,895 INFO L420 AbstractCegarLoop]: === Iteration 1415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:17,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1364150015, now seen corresponding path program 1 times [2022-12-13 02:02:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:17,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574368901] [2022-12-13 02:02:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:17,950 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 02:02:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:17,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574368901] [2022-12-13 02:02:17,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574368901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:17,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:17,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750363918] [2022-12-13 02:02:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:17,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:17,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:17,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:17,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:17,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:17,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:17,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:17,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:17,994 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:17,994 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:17,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:17,995 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:17,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:17,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:17,996 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:17,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:17,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:17,996 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:17,997 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:17,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:17,997 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:17,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:17,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:17,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:17,999 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:18,000 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:18,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:18,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:18,117 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:18,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:18,118 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:18,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:18,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:18,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1414 [2022-12-13 02:02:18,118 INFO L420 AbstractCegarLoop]: === Iteration 1416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:18,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1421408317, now seen corresponding path program 1 times [2022-12-13 02:02:18,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094719435] [2022-12-13 02:02:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:18,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:18,170 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 02:02:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094719435] [2022-12-13 02:02:18,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094719435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:18,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:18,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:18,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455611385] [2022-12-13 02:02:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:18,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:18,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:18,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:18,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:18,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:18,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:18,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:18,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:18,226 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:18,226 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:18,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:18,227 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:18,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:18,227 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:18,227 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:18,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:18,228 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,228 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:18,228 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:18,228 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:18,228 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,228 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:18,228 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:18,229 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,231 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:18,231 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:18,231 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,231 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:18,348 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:18,349 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:18,349 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:18,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:18,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:18,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1415 [2022-12-13 02:02:18,349 INFO L420 AbstractCegarLoop]: === Iteration 1417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1478666619, now seen corresponding path program 1 times [2022-12-13 02:02:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:18,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987925098] [2022-12-13 02:02:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:18,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:18,403 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 02:02:18,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:18,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987925098] [2022-12-13 02:02:18,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987925098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104607718] [2022-12-13 02:02:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:18,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:18,404 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:18,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:18,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:18,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:18,456 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:18,456 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:18,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:18,457 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:18,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:18,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:18,457 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:18,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:18,458 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:18,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:18,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:18,458 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,459 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:18,459 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:18,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,461 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:18,462 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:18,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:18,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:18,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:18,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:18,579 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:18,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:18,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:18,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1416 [2022-12-13 02:02:18,579 INFO L420 AbstractCegarLoop]: === Iteration 1418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:18,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:18,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1535924921, now seen corresponding path program 1 times [2022-12-13 02:02:18,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:18,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69470594] [2022-12-13 02:02:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:18,633 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 02:02:18,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:18,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69470594] [2022-12-13 02:02:18,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69470594] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:18,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:18,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:18,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674481580] [2022-12-13 02:02:18,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:18,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:18,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:18,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:18,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:18,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:18,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:18,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:18,683 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:18,683 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:18,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:18,684 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:18,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:18,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:18,684 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:18,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:18,685 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:18,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:18,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:18,685 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:18,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:18,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,688 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:18,688 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:18,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:18,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:18,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:18,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:18,804 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:18,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:18,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:18,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1417 [2022-12-13 02:02:18,804 INFO L420 AbstractCegarLoop]: === Iteration 1419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1593183223, now seen corresponding path program 1 times [2022-12-13 02:02:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:18,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703767207] [2022-12-13 02:02:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:18,857 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 02:02:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:18,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703767207] [2022-12-13 02:02:18,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703767207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:18,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:18,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515747307] [2022-12-13 02:02:18,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:18,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:18,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:18,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:18,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:18,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:18,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:18,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:18,907 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:18,908 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:18,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:18,908 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:18,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:18,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:18,909 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:18,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:18,909 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,909 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:18,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:18,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:18,910 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:18,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:18,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:18,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,912 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:18,913 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:18,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:18,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:18,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:19,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:19,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:19,028 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:19,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:19,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:19,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1418 [2022-12-13 02:02:19,028 INFO L420 AbstractCegarLoop]: === Iteration 1420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1650441525, now seen corresponding path program 1 times [2022-12-13 02:02:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220126942] [2022-12-13 02:02:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:19,092 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 02:02:19,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:19,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220126942] [2022-12-13 02:02:19,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220126942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:19,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:19,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:19,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296681966] [2022-12-13 02:02:19,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:19,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:19,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:19,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:19,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:19,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:19,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:19,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:19,135 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:19,135 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:19,136 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:19,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:19,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:19,136 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:19,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:19,137 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:19,137 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:19,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:19,137 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:19,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:19,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,140 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:19,140 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:19,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:19,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:19,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:19,255 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:19,255 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:19,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:19,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:19,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1419 [2022-12-13 02:02:19,256 INFO L420 AbstractCegarLoop]: === Iteration 1421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:19,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1707699827, now seen corresponding path program 1 times [2022-12-13 02:02:19,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:19,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440970149] [2022-12-13 02:02:19,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:19,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:19,317 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 02:02:19,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:19,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440970149] [2022-12-13 02:02:19,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440970149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:19,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:19,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512811103] [2022-12-13 02:02:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:19,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:19,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:19,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:19,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:19,318 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:19,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:19,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:19,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:19,370 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:19,370 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:19,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:19,370 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:19,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:19,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:19,371 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:19,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:19,371 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,372 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:19,372 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:19,372 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:19,372 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:19,372 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:19,372 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,375 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:19,375 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:19,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:19,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:19,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:19,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:02:19,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:19,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:19,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:19,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1420 [2022-12-13 02:02:19,501 INFO L420 AbstractCegarLoop]: === Iteration 1422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:19,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:19,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1764958129, now seen corresponding path program 1 times [2022-12-13 02:02:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:19,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798637189] [2022-12-13 02:02:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:19,552 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 02:02:19,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:19,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798637189] [2022-12-13 02:02:19,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798637189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:19,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:19,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075320738] [2022-12-13 02:02:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:19,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:19,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:19,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:19,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:19,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:19,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:19,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:19,596 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:19,596 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:19,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:19,597 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:19,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:19,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:19,597 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:19,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:19,598 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:19,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:19,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:19,598 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:19,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:19,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,601 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:19,601 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:19,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:19,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:19,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:19,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:19,721 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:19,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:19,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:19,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1421 [2022-12-13 02:02:19,721 INFO L420 AbstractCegarLoop]: === Iteration 1423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1822216431, now seen corresponding path program 1 times [2022-12-13 02:02:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:19,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250795095] [2022-12-13 02:02:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:19,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250795095] [2022-12-13 02:02:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250795095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:19,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:19,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757309870] [2022-12-13 02:02:19,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:19,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:19,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:19,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:19,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:19,789 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:19,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:19,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:19,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:19,848 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:19,848 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:19,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:19,849 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:19,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:19,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:19,849 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:19,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:19,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:19,851 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:19,851 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:19,851 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:19,851 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,851 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:19,851 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:19,851 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:19,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,855 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:19,855 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:19,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:19,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:19,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:19,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:19,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:02:19,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:19,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:19,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:19,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:19,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1422 [2022-12-13 02:02:19,978 INFO L420 AbstractCegarLoop]: === Iteration 1424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:19,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1879474733, now seen corresponding path program 1 times [2022-12-13 02:02:19,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:19,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340973326] [2022-12-13 02:02:19,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:20,033 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 02:02:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:20,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340973326] [2022-12-13 02:02:20,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340973326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:20,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:20,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303106408] [2022-12-13 02:02:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:20,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:20,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:20,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:20,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:20,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:20,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:20,082 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:20,082 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:20,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:20,083 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:20,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:20,083 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:20,083 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:20,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:20,084 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,084 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:20,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:20,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:20,085 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:20,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:20,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,088 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:20,088 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:20,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:20,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:20,206 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:20,207 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:20,207 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:20,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:20,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:20,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1423 [2022-12-13 02:02:20,207 INFO L420 AbstractCegarLoop]: === Iteration 1425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1936733035, now seen corresponding path program 1 times [2022-12-13 02:02:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:20,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173694337] [2022-12-13 02:02:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:20,260 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 02:02:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:20,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173694337] [2022-12-13 02:02:20,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173694337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:20,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:20,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731262153] [2022-12-13 02:02:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:20,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:20,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:20,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:20,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:20,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:20,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:20,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:20,305 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:20,305 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:20,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:20,306 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:20,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:20,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:20,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:20,306 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:20,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:20,307 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:20,307 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:20,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:20,308 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,308 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:20,308 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:20,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,310 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:20,310 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:20,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:20,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:20,438 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:20,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:02:20,439 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:20,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,439 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:20,439 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:20,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1424 [2022-12-13 02:02:20,439 INFO L420 AbstractCegarLoop]: === Iteration 1426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:20,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1993991337, now seen corresponding path program 1 times [2022-12-13 02:02:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:20,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328081825] [2022-12-13 02:02:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:20,490 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 02:02:20,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:20,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328081825] [2022-12-13 02:02:20,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328081825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:20,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:20,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256384768] [2022-12-13 02:02:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:20,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:20,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:20,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:20,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:20,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:20,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:20,540 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:20,540 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:20,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:20,541 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:20,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:20,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:20,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:20,541 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:20,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:20,542 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:20,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:20,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:20,542 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:20,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:20,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,545 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:20,545 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:20,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:20,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:20,663 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:20,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:20,663 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:20,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:20,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:20,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1425 [2022-12-13 02:02:20,664 INFO L420 AbstractCegarLoop]: === Iteration 1427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2051249639, now seen corresponding path program 1 times [2022-12-13 02:02:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:20,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133493440] [2022-12-13 02:02:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:20,717 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 02:02:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:20,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133493440] [2022-12-13 02:02:20,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133493440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:20,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:20,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:20,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581098051] [2022-12-13 02:02:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:20,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:20,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:20,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:20,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:20,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:20,763 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:20,763 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:20,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:20,763 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:20,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:20,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:20,764 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:20,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:20,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:20,765 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:20,765 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:20,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:20,765 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:20,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:20,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:20,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,768 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:20,768 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:20,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:20,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:20,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:20,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:20,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:02:20,896 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:20,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:20,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:20,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1426 [2022-12-13 02:02:20,897 INFO L420 AbstractCegarLoop]: === Iteration 1428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2108507941, now seen corresponding path program 1 times [2022-12-13 02:02:20,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:20,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936945135] [2022-12-13 02:02:20,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:20,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:20,947 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 02:02:20,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936945135] [2022-12-13 02:02:20,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936945135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:20,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:20,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472117600] [2022-12-13 02:02:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:20,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:20,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:20,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:20,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:20,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:20,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:20,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:21,001 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:21,002 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:21,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:21,002 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:21,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:21,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:21,003 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:21,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:21,003 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:21,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:21,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:21,004 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:21,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:21,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,007 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:21,007 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:21,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:21,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:21,134 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:21,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:02:21,134 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:21,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:21,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:21,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1427 [2022-12-13 02:02:21,135 INFO L420 AbstractCegarLoop]: === Iteration 1429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:21,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:21,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2129201053, now seen corresponding path program 1 times [2022-12-13 02:02:21,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:21,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20991078] [2022-12-13 02:02:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:21,189 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 02:02:21,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:21,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20991078] [2022-12-13 02:02:21,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20991078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:21,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:21,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:21,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781192515] [2022-12-13 02:02:21,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:21,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:21,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:21,190 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:21,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:21,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:21,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:21,241 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:21,241 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:21,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:21,241 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:21,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:21,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:21,242 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:21,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:21,243 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:21,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:21,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:21,243 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:21,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:21,243 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,246 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:21,246 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:21,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:21,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:21,398 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:21,399 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 02:02:21,399 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:21,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,399 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:21,399 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:21,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1428 [2022-12-13 02:02:21,399 INFO L420 AbstractCegarLoop]: === Iteration 1430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:21,400 INFO L85 PathProgramCache]: Analyzing trace with hash -2071942751, now seen corresponding path program 1 times [2022-12-13 02:02:21,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:21,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595718764] [2022-12-13 02:02:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:21,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:21,460 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 02:02:21,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:21,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595718764] [2022-12-13 02:02:21,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595718764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:21,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996104717] [2022-12-13 02:02:21,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:21,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:21,461 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:21,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:21,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:21,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:21,522 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:21,523 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:21,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:21,523 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:21,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:21,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:21,524 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:21,525 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:21,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:21,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:21,525 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:21,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:21,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,528 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:21,528 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:21,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:21,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:21,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:21,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:21,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:21,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:21,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1429 [2022-12-13 02:02:21,661 INFO L420 AbstractCegarLoop]: === Iteration 1431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:21,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2014684449, now seen corresponding path program 1 times [2022-12-13 02:02:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:21,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507521807] [2022-12-13 02:02:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:21,742 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 02:02:21,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:21,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507521807] [2022-12-13 02:02:21,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507521807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:21,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:21,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508297068] [2022-12-13 02:02:21,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:21,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:21,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:21,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:21,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:21,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:21,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:21,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:21,806 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:21,807 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:21,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:21,807 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:21,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:21,808 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:21,808 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:21,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:21,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:21,809 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,809 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:21,809 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:21,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:21,809 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:21,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:21,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:21,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,812 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:21,812 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:21,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:21,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:21,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:21,946 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:21,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:21,947 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:21,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:21,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:21,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:21,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1430 [2022-12-13 02:02:21,947 INFO L420 AbstractCegarLoop]: === Iteration 1432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:21,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1957426147, now seen corresponding path program 1 times [2022-12-13 02:02:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:21,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179260255] [2022-12-13 02:02:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:22,019 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 02:02:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:22,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179260255] [2022-12-13 02:02:22,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179260255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:22,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:22,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:22,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578461534] [2022-12-13 02:02:22,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:22,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:22,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:22,020 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:22,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:22,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:22,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:22,095 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:22,095 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:22,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:22,096 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:22,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:22,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:22,097 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:22,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:22,098 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,098 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:22,098 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:22,098 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:22,098 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:22,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:22,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,101 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:22,101 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:22,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:22,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:22,233 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:22,234 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:22,234 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:22,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:22,234 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:22,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1431 [2022-12-13 02:02:22,234 INFO L420 AbstractCegarLoop]: === Iteration 1433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:22,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1900167845, now seen corresponding path program 1 times [2022-12-13 02:02:22,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:22,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113998734] [2022-12-13 02:02:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:22,321 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 02:02:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113998734] [2022-12-13 02:02:22,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113998734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:22,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:22,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970821283] [2022-12-13 02:02:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:22,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:22,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:22,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:22,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:22,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:22,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:22,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:22,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:22,378 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:22,378 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:22,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:22,378 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:22,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:22,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:22,380 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:22,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:22,382 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:22,382 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:22,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:22,382 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,382 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:22,382 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:22,382 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,386 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:22,386 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:22,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:22,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:22,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:22,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:02:22,529 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:22,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:22,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:22,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1432 [2022-12-13 02:02:22,529 INFO L420 AbstractCegarLoop]: === Iteration 1434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:22,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:22,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1842909543, now seen corresponding path program 1 times [2022-12-13 02:02:22,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:22,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626946010] [2022-12-13 02:02:22,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:22,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:22,592 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 02:02:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:22,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626946010] [2022-12-13 02:02:22,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626946010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:22,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:22,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890523603] [2022-12-13 02:02:22,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:22,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:22,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:22,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:22,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:22,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:22,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:22,641 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:22,641 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:22,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:22,642 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:22,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:22,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:22,642 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:22,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:22,643 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:22,644 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:22,644 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:22,644 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:22,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:22,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,647 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:22,648 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:22,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:22,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:22,774 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:22,775 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:02:22,775 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:22,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,775 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:22,775 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:22,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1433 [2022-12-13 02:02:22,775 INFO L420 AbstractCegarLoop]: === Iteration 1435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1785651241, now seen corresponding path program 1 times [2022-12-13 02:02:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:22,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987497932] [2022-12-13 02:02:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:22,827 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 02:02:22,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:22,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987497932] [2022-12-13 02:02:22,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987497932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:22,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:22,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694231372] [2022-12-13 02:02:22,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:22,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:22,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:22,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:22,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:22,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:22,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:22,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:22,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:22,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:22,878 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:22,878 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:22,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:22,878 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:22,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:22,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:22,879 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:22,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:22,879 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:22,880 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:22,880 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:22,880 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,880 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:22,880 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:22,880 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:22,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,882 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:22,882 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:22,883 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:22,883 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:22,999 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:23,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:23,000 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:23,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:23,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:23,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1434 [2022-12-13 02:02:23,000 INFO L420 AbstractCegarLoop]: === Iteration 1436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1728392939, now seen corresponding path program 1 times [2022-12-13 02:02:23,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:23,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898265248] [2022-12-13 02:02:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,055 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 02:02:23,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898265248] [2022-12-13 02:02:23,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898265248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:23,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:23,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:23,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775982516] [2022-12-13 02:02:23,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:23,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:23,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:23,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:23,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:23,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:23,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:23,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:23,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:23,106 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:23,106 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:23,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:23,106 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:23,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:23,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:23,107 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:23,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:23,108 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:23,108 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:23,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:23,108 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:23,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:23,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,111 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:23,111 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:23,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:23,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:23,228 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:23,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:23,229 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:23,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:23,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:23,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1435 [2022-12-13 02:02:23,229 INFO L420 AbstractCegarLoop]: === Iteration 1437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1671134637, now seen corresponding path program 1 times [2022-12-13 02:02:23,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:23,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708050367] [2022-12-13 02:02:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,290 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 02:02:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:23,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708050367] [2022-12-13 02:02:23,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708050367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:23,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:23,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640073700] [2022-12-13 02:02:23,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:23,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:23,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:23,291 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:23,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:23,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:23,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:23,341 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:23,342 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:23,342 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:23,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:23,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:23,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:23,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:23,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:23,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:23,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:23,343 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:23,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:23,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:23,346 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:23,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:23,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:23,458 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:23,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 02:02:23,458 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:23,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:23,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:23,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1436 [2022-12-13 02:02:23,459 INFO L420 AbstractCegarLoop]: === Iteration 1438 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:23,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1613876335, now seen corresponding path program 1 times [2022-12-13 02:02:23,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:23,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077441667] [2022-12-13 02:02:23,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,522 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 02:02:23,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:23,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077441667] [2022-12-13 02:02:23,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077441667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:23,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:23,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:23,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210537314] [2022-12-13 02:02:23,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:23,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:23,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:23,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:23,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:23,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:23,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:23,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:23,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:23,565 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:23,565 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:23,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:23,566 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:23,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:23,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:23,566 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:23,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:23,567 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:23,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:23,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:23,567 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:23,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:23,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,570 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:23,570 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:23,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:23,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,570 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:23,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:23,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:02:23,683 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:23,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:23,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:23,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1437 [2022-12-13 02:02:23,684 INFO L420 AbstractCegarLoop]: === Iteration 1439 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:23,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:23,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1556618033, now seen corresponding path program 1 times [2022-12-13 02:02:23,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:23,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813854300] [2022-12-13 02:02:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,745 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 02:02:23,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:23,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813854300] [2022-12-13 02:02:23,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813854300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:23,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:23,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420536819] [2022-12-13 02:02:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:23,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:23,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:23,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:23,746 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:23,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:23,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:23,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:23,790 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:23,790 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:23,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:23,790 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:23,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:23,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:23,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:23,791 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:23,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:23,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:23,792 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:23,792 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:23,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:23,792 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:23,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:23,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:23,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,795 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:23,795 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:23,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:23,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:23,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:23,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:23,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:23,912 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:23,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:23,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1438 [2022-12-13 02:02:23,913 INFO L420 AbstractCegarLoop]: === Iteration 1440 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:23,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:23,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1499359731, now seen corresponding path program 1 times [2022-12-13 02:02:23,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:23,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863042279] [2022-12-13 02:02:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:23,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 02:02:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863042279] [2022-12-13 02:02:23,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863042279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:23,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:23,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697011305] [2022-12-13 02:02:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:23,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:23,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:23,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:23,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:23,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:23,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:23,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:24,008 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:24,008 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:24,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:24,008 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:24,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:24,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:24,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:24,009 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:24,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:24,010 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,010 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:24,010 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:24,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:24,010 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:24,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:24,010 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,013 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:24,013 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:24,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:24,013 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,013 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:24,128 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:24,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:24,129 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:24,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:24,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1439 [2022-12-13 02:02:24,129 INFO L420 AbstractCegarLoop]: === Iteration 1441 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1442101429, now seen corresponding path program 1 times [2022-12-13 02:02:24,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:24,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384337986] [2022-12-13 02:02:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:24,183 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 02:02:24,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:24,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384337986] [2022-12-13 02:02:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384337986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:24,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995965084] [2022-12-13 02:02:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:24,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:24,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:24,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:24,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:24,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:24,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:24,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:24,227 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:24,227 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:24,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:24,228 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:24,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:24,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:24,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:24,228 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:24,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:24,229 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:24,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:24,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:24,229 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:24,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:24,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,232 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:24,232 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:24,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:24,232 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,232 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:24,351 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:24,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:24,352 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:24,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:24,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:24,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1440 [2022-12-13 02:02:24,352 INFO L420 AbstractCegarLoop]: === Iteration 1442 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1384843127, now seen corresponding path program 1 times [2022-12-13 02:02:24,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:24,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906470246] [2022-12-13 02:02:24,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:24,408 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 02:02:24,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:24,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906470246] [2022-12-13 02:02:24,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906470246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:24,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:24,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:24,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342724443] [2022-12-13 02:02:24,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:24,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:24,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:24,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:24,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:24,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:24,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:24,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:24,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:24,461 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:24,462 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:24,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:24,462 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:24,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:24,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:24,463 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:24,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:24,463 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:24,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:24,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:24,464 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:24,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:24,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:24,467 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:24,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:24,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:24,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:24,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:24,586 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:24,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:24,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:24,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1441 [2022-12-13 02:02:24,587 INFO L420 AbstractCegarLoop]: === Iteration 1443 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1327584825, now seen corresponding path program 1 times [2022-12-13 02:02:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:24,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208072196] [2022-12-13 02:02:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:24,640 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 02:02:24,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:24,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208072196] [2022-12-13 02:02:24,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208072196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:24,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:24,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:24,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938367001] [2022-12-13 02:02:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:24,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:24,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:24,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:24,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:24,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:24,683 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:24,683 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:24,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:24,684 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:24,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:24,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:24,684 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:24,684 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:24,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:24,685 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,685 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:24,685 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:24,685 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:24,685 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:24,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:24,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,688 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:24,688 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:24,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:24,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:24,806 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:24,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:24,806 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:24,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:24,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:24,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1442 [2022-12-13 02:02:24,807 INFO L420 AbstractCegarLoop]: === Iteration 1444 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1270326523, now seen corresponding path program 1 times [2022-12-13 02:02:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:24,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381603601] [2022-12-13 02:02:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:24,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:24,863 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 02:02:24,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:24,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381603601] [2022-12-13 02:02:24,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381603601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:24,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:24,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:24,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690750101] [2022-12-13 02:02:24,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:24,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:24,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:24,864 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:24,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:24,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:24,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:24,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:24,917 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:24,917 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:24,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:24,917 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:24,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:24,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:24,918 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:24,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:24,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:24,919 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:24,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:24,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:24,919 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:24,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:24,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:24,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:24,922 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:24,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:24,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:24,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:25,041 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:25,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:25,041 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:25,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,042 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:25,042 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:25,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1443 [2022-12-13 02:02:25,042 INFO L420 AbstractCegarLoop]: === Iteration 1445 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:25,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:25,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1213068221, now seen corresponding path program 1 times [2022-12-13 02:02:25,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:25,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847343784] [2022-12-13 02:02:25,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:25,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:25,096 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 02:02:25,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:25,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847343784] [2022-12-13 02:02:25,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847343784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:25,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:25,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:25,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770754766] [2022-12-13 02:02:25,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:25,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:25,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:25,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:25,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:25,097 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:25,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:25,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:25,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:25,141 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:25,141 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:25,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:25,141 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:25,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:25,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:25,142 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:25,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:25,143 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,143 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:25,143 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:25,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:25,143 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,143 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:25,143 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:25,143 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,146 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:25,146 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:25,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:25,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:25,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:25,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:25,268 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:25,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:25,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:25,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1444 [2022-12-13 02:02:25,268 INFO L420 AbstractCegarLoop]: === Iteration 1446 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1155809919, now seen corresponding path program 1 times [2022-12-13 02:02:25,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:25,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542063323] [2022-12-13 02:02:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:25,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:25,321 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 02:02:25,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:25,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542063323] [2022-12-13 02:02:25,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542063323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:25,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:25,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653932237] [2022-12-13 02:02:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:25,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:25,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:25,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:25,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:25,365 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:25,365 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:25,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:25,365 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:25,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:25,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:25,366 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:25,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:25,367 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:25,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:25,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:25,367 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:25,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:25,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,370 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:25,370 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:25,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:25,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:25,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:25,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:25,487 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:25,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:25,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:25,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1445 [2022-12-13 02:02:25,487 INFO L420 AbstractCegarLoop]: === Iteration 1447 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1098551617, now seen corresponding path program 1 times [2022-12-13 02:02:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:25,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489324631] [2022-12-13 02:02:25,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:25,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:25,540 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 02:02:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:25,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489324631] [2022-12-13 02:02:25,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489324631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:25,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885665171] [2022-12-13 02:02:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:25,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:25,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:25,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:25,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:25,585 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:25,585 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:25,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:25,586 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:25,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:25,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:25,586 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:25,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:25,587 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:25,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:25,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:25,587 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:25,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:25,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,590 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:25,590 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:25,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:25,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:25,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:25,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:02:25,717 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:25,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,718 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:25,718 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:25,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1446 [2022-12-13 02:02:25,718 INFO L420 AbstractCegarLoop]: === Iteration 1448 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:25,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:25,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1041293315, now seen corresponding path program 1 times [2022-12-13 02:02:25,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:25,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139768450] [2022-12-13 02:02:25,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:25,789 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 02:02:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:25,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139768450] [2022-12-13 02:02:25,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139768450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:25,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:25,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014131579] [2022-12-13 02:02:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:25,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:25,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:25,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:25,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:25,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:25,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:25,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:25,843 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:25,843 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:25,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:25,844 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:25,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:25,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:25,845 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:25,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:25,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:25,845 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:25,846 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:25,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:25,846 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,846 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:25,846 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:25,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:25,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,849 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:25,849 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:25,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:25,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:25,979 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:25,980 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:02:25,980 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:25,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:25,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:25,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:25,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1447 [2022-12-13 02:02:25,980 INFO L420 AbstractCegarLoop]: === Iteration 1449 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash -984035013, now seen corresponding path program 1 times [2022-12-13 02:02:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:25,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839509548] [2022-12-13 02:02:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:25,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:26,043 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 02:02:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:26,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839509548] [2022-12-13 02:02:26,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839509548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:26,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:26,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337880961] [2022-12-13 02:02:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:26,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:26,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:26,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:26,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:26,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:26,095 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:26,095 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:26,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:26,096 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:26,096 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:26,096 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:26,096 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:26,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:26,097 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:26,097 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:26,097 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:26,098 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,098 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:26,098 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:26,098 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,100 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:26,100 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:26,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:26,101 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,101 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:26,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:26,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:26,230 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:26,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:26,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:26,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1448 [2022-12-13 02:02:26,230 INFO L420 AbstractCegarLoop]: === Iteration 1450 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:26,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:26,231 INFO L85 PathProgramCache]: Analyzing trace with hash -926776711, now seen corresponding path program 1 times [2022-12-13 02:02:26,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:26,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194559244] [2022-12-13 02:02:26,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:26,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:26,296 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 02:02:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194559244] [2022-12-13 02:02:26,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194559244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:26,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:26,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448755586] [2022-12-13 02:02:26,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:26,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:26,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:26,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:26,297 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:26,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:26,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:26,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:26,349 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:26,349 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:26,349 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:26,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:26,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:26,350 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:26,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:26,350 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:26,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:26,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:26,351 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,351 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:26,351 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:26,351 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,354 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:26,354 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:26,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:26,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:26,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:26,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:26,472 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:26,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:26,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:26,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1449 [2022-12-13 02:02:26,473 INFO L420 AbstractCegarLoop]: === Iteration 1451 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:26,473 INFO L85 PathProgramCache]: Analyzing trace with hash -869518409, now seen corresponding path program 1 times [2022-12-13 02:02:26,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:26,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061372507] [2022-12-13 02:02:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:26,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:26,526 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 02:02:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061372507] [2022-12-13 02:02:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061372507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:26,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:26,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:26,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79459633] [2022-12-13 02:02:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:26,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:26,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:26,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:26,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:26,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:26,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:26,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:26,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:26,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:26,578 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:26,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:26,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:26,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:26,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:26,579 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:26,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:26,579 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:26,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:26,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:26,580 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:26,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:26,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:26,583 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:26,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:26,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:26,699 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:26,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:26,700 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:26,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:26,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:26,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1450 [2022-12-13 02:02:26,700 INFO L420 AbstractCegarLoop]: === Iteration 1452 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash -812260107, now seen corresponding path program 1 times [2022-12-13 02:02:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:26,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804240052] [2022-12-13 02:02:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:26,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:26,752 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 02:02:26,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:26,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804240052] [2022-12-13 02:02:26,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804240052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:26,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:26,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363997477] [2022-12-13 02:02:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:26,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:26,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:26,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:26,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:26,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:26,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:26,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:26,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:26,795 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:26,796 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:26,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:26,796 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:26,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:26,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:26,797 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:26,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:26,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:26,797 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:26,797 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:26,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:26,798 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:26,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:26,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:26,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,800 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:26,800 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:26,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:26,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:26,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:26,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:26,915 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:26,915 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:26,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:26,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1451 [2022-12-13 02:02:26,916 INFO L420 AbstractCegarLoop]: === Iteration 1453 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -755001805, now seen corresponding path program 1 times [2022-12-13 02:02:26,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:26,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319732071] [2022-12-13 02:02:26,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:26,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:26,969 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 02:02:26,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:26,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319732071] [2022-12-13 02:02:26,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319732071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:26,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:26,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:26,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527709246] [2022-12-13 02:02:26,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:26,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:26,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:26,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:26,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:26,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:27,013 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:27,013 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:27,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:27,014 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:27,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:27,014 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:27,014 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:27,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:27,015 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,015 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:27,015 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:27,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:27,015 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:27,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:27,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,018 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:27,018 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:27,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:27,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:27,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:27,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:02:27,147 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:27,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:27,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:27,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1452 [2022-12-13 02:02:27,147 INFO L420 AbstractCegarLoop]: === Iteration 1454 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:27,148 INFO L85 PathProgramCache]: Analyzing trace with hash -697743503, now seen corresponding path program 1 times [2022-12-13 02:02:27,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:27,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525264903] [2022-12-13 02:02:27,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:27,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:27,201 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 02:02:27,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:27,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525264903] [2022-12-13 02:02:27,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525264903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:27,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:27,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:27,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998557809] [2022-12-13 02:02:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:27,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:27,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:27,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:27,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:27,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:27,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:27,257 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:27,257 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:27,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:27,258 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:27,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:27,258 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:27,258 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:27,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:27,259 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:27,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:27,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:27,260 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:27,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:27,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,264 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:27,264 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:27,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:27,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:27,401 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:27,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:02:27,401 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:27,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:27,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:27,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1453 [2022-12-13 02:02:27,402 INFO L420 AbstractCegarLoop]: === Iteration 1455 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:27,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash -640485201, now seen corresponding path program 1 times [2022-12-13 02:02:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:27,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124905779] [2022-12-13 02:02:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:27,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:27,466 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 02:02:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:27,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124905779] [2022-12-13 02:02:27,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124905779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:27,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:27,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367981251] [2022-12-13 02:02:27,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:27,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:27,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:27,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:27,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:27,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:27,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:27,520 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:27,520 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:27,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:27,521 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:27,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:27,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:27,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:27,522 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:27,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:27,523 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:27,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:27,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:27,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:27,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:27,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,527 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:27,527 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:27,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:27,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:27,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:27,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:27,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:27,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:27,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:27,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1454 [2022-12-13 02:02:27,662 INFO L420 AbstractCegarLoop]: === Iteration 1456 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:27,662 INFO L85 PathProgramCache]: Analyzing trace with hash -583226899, now seen corresponding path program 1 times [2022-12-13 02:02:27,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:27,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542522739] [2022-12-13 02:02:27,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:27,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:27,728 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 02:02:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:27,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542522739] [2022-12-13 02:02:27,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542522739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:27,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:27,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779470356] [2022-12-13 02:02:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:27,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:27,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:27,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:27,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:27,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:27,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:27,790 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:27,790 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:27,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:27,790 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:27,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:27,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:27,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:27,791 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:27,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:27,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:27,792 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:27,792 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:27,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:27,792 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,792 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:27,792 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:27,792 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:27,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,795 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:27,795 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:27,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:27,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:27,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:27,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:27,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:27,914 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:27,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:27,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:27,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1455 [2022-12-13 02:02:27,914 INFO L420 AbstractCegarLoop]: === Iteration 1457 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -525968597, now seen corresponding path program 1 times [2022-12-13 02:02:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:27,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377329501] [2022-12-13 02:02:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:27,967 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 02:02:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:27,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377329501] [2022-12-13 02:02:27,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377329501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:27,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:27,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370752300] [2022-12-13 02:02:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:27,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:27,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:27,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:27,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:27,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:27,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:27,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:27,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:28,018 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:28,018 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:28,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:28,019 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:28,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:28,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:28,019 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:28,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:28,020 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,020 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:28,020 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:28,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:28,020 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:28,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:28,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,023 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:28,023 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:28,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:28,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:28,139 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:28,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:28,139 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:28,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:28,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:28,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1456 [2022-12-13 02:02:28,140 INFO L420 AbstractCegarLoop]: === Iteration 1458 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -468710295, now seen corresponding path program 1 times [2022-12-13 02:02:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:28,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609782350] [2022-12-13 02:02:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:28,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:28,193 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 02:02:28,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:28,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609782350] [2022-12-13 02:02:28,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609782350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:28,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:28,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106098142] [2022-12-13 02:02:28,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:28,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:28,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:28,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:28,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:28,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:28,243 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:28,244 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:28,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:28,244 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:28,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:28,245 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:28,245 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:28,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:28,245 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:28,246 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:28,246 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:28,246 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:28,246 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:28,246 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,248 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:28,248 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:28,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:28,249 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,249 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:28,364 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:28,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:28,365 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:28,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:28,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:28,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1457 [2022-12-13 02:02:28,365 INFO L420 AbstractCegarLoop]: === Iteration 1459 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:28,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:28,365 INFO L85 PathProgramCache]: Analyzing trace with hash -411451993, now seen corresponding path program 1 times [2022-12-13 02:02:28,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:28,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808253455] [2022-12-13 02:02:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:28,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:28,430 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 02:02:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:28,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808253455] [2022-12-13 02:02:28,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808253455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:28,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:28,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478774451] [2022-12-13 02:02:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:28,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:28,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:28,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:28,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:28,431 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:28,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:28,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:28,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:28,475 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:28,475 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:28,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:28,476 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:28,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:28,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:28,476 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:28,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:28,477 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:28,477 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:28,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:28,477 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,477 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:28,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:28,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,480 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:28,480 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:28,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:28,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:28,595 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:28,596 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:28,596 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:28,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:28,596 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:28,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1458 [2022-12-13 02:02:28,596 INFO L420 AbstractCegarLoop]: === Iteration 1460 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:28,597 INFO L85 PathProgramCache]: Analyzing trace with hash -354193691, now seen corresponding path program 1 times [2022-12-13 02:02:28,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:28,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476612125] [2022-12-13 02:02:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:28,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:28,649 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 02:02:28,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:28,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476612125] [2022-12-13 02:02:28,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476612125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:28,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:28,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:28,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591690751] [2022-12-13 02:02:28,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:28,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:28,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:28,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:28,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:28,650 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:28,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:28,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:28,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:28,700 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:28,701 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:28,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:28,701 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:28,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:28,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:28,702 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:28,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:28,702 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:28,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:28,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:28,703 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:28,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:28,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:28,706 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:28,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:28,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:28,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:28,819 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:02:28,819 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:28,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:28,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:28,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1459 [2022-12-13 02:02:28,819 INFO L420 AbstractCegarLoop]: === Iteration 1461 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:28,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:28,819 INFO L85 PathProgramCache]: Analyzing trace with hash -296935389, now seen corresponding path program 1 times [2022-12-13 02:02:28,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:28,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515721790] [2022-12-13 02:02:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:28,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:28,872 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 02:02:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:28,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515721790] [2022-12-13 02:02:28,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515721790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:28,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:28,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628780144] [2022-12-13 02:02:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:28,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:28,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:28,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:28,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:28,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:28,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:28,924 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:28,924 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:28,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:28,924 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:28,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:28,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:28,925 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:28,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:28,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:28,926 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:28,926 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:28,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:28,926 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,926 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:28,926 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:28,926 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:28,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,929 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:28,929 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:28,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:28,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:28,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:29,043 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:29,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:29,043 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:29,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,044 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:29,044 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:29,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1460 [2022-12-13 02:02:29,044 INFO L420 AbstractCegarLoop]: === Iteration 1462 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:29,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash -239677087, now seen corresponding path program 1 times [2022-12-13 02:02:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:29,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344348530] [2022-12-13 02:02:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:29,105 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 02:02:29,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:29,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344348530] [2022-12-13 02:02:29,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344348530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:29,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:29,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782129511] [2022-12-13 02:02:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:29,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:29,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:29,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:29,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:29,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:29,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:29,150 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:29,150 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:29,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:29,150 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:29,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:29,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:29,151 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:29,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:29,152 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:29,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:29,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:29,152 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:29,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:29,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,155 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:29,155 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:29,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:29,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:29,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:29,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:29,271 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:29,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:29,271 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:29,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1461 [2022-12-13 02:02:29,271 INFO L420 AbstractCegarLoop]: === Iteration 1463 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:29,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -182418785, now seen corresponding path program 1 times [2022-12-13 02:02:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:29,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558589467] [2022-12-13 02:02:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:29,322 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 02:02:29,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:29,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558589467] [2022-12-13 02:02:29,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558589467] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:29,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:29,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264679062] [2022-12-13 02:02:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:29,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:29,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:29,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:29,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:29,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:29,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:29,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:29,373 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:29,373 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:29,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:29,373 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:29,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:29,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:29,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:29,374 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:29,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:29,375 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:29,375 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:29,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:29,375 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:29,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:29,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,378 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:29,378 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:29,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:29,378 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,378 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:29,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:29,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:29,494 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:29,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:29,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:29,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1462 [2022-12-13 02:02:29,494 INFO L420 AbstractCegarLoop]: === Iteration 1464 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:29,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -125160483, now seen corresponding path program 1 times [2022-12-13 02:02:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:29,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080968361] [2022-12-13 02:02:29,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:29,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:29,556 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 02:02:29,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:29,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080968361] [2022-12-13 02:02:29,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080968361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:29,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:29,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897683794] [2022-12-13 02:02:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:29,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:29,557 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:29,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:29,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:29,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:29,610 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:29,610 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:29,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:29,610 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:29,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:29,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:29,611 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:29,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:29,612 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:29,612 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:29,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:29,612 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:29,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:29,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,615 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:29,615 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:29,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:29,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:29,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:29,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:29,737 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:29,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:29,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1463 [2022-12-13 02:02:29,737 INFO L420 AbstractCegarLoop]: === Iteration 1465 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:29,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:29,737 INFO L85 PathProgramCache]: Analyzing trace with hash -67902181, now seen corresponding path program 1 times [2022-12-13 02:02:29,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:29,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634795466] [2022-12-13 02:02:29,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:29,817 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 02:02:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:29,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634795466] [2022-12-13 02:02:29,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634795466] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:29,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:29,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904716396] [2022-12-13 02:02:29,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:29,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:29,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:29,818 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:29,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:29,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:29,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:29,871 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:29,871 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:29,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:29,871 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:29,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:29,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:29,872 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:29,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:29,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:29,873 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:29,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:29,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:29,873 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:29,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:29,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:29,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,876 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:29,876 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:29,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:29,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:29,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:29,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:29,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:29,994 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:29,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:29,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:29,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:29,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1464 [2022-12-13 02:02:29,994 INFO L420 AbstractCegarLoop]: === Iteration 1466 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash -10643879, now seen corresponding path program 1 times [2022-12-13 02:02:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:29,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831208930] [2022-12-13 02:02:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:30,066 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 02:02:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831208930] [2022-12-13 02:02:30,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831208930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:30,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:30,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556598488] [2022-12-13 02:02:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:30,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:30,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:30,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:30,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:30,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:30,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:30,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:30,120 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:30,121 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:30,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:30,121 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:30,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:30,122 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:30,122 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:30,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:30,122 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,123 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:30,123 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:30,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:30,123 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:30,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:30,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,126 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:30,126 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:30,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:30,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:30,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:30,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:30,242 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:30,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:30,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:30,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1465 [2022-12-13 02:02:30,243 INFO L420 AbstractCegarLoop]: === Iteration 1467 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:30,243 INFO L85 PathProgramCache]: Analyzing trace with hash 46614423, now seen corresponding path program 1 times [2022-12-13 02:02:30,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:30,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414894190] [2022-12-13 02:02:30,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:30,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:30,305 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 02:02:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:30,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414894190] [2022-12-13 02:02:30,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414894190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:30,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:30,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:30,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810259744] [2022-12-13 02:02:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:30,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:30,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:30,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:30,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:30,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:30,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:30,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:30,351 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:30,352 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:30,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:30,352 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:30,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:30,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:30,353 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:30,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:30,353 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:30,354 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:30,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:30,354 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:30,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:30,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,357 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:30,357 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:30,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:30,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:30,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:30,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:30,475 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:30,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:30,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:30,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1466 [2022-12-13 02:02:30,475 INFO L420 AbstractCegarLoop]: === Iteration 1468 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash 103872725, now seen corresponding path program 1 times [2022-12-13 02:02:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:30,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887909318] [2022-12-13 02:02:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:30,529 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 02:02:30,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:30,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887909318] [2022-12-13 02:02:30,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887909318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:30,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:30,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609866386] [2022-12-13 02:02:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:30,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:30,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:30,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:30,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:30,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:30,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:30,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:30,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:30,574 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:30,574 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:30,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:30,575 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:30,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:30,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:30,575 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:30,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:30,576 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:30,576 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:30,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:30,576 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:30,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:30,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,579 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:30,579 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:30,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:30,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:30,707 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:30,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:02:30,708 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:30,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:30,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:30,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1467 [2022-12-13 02:02:30,709 INFO L420 AbstractCegarLoop]: === Iteration 1469 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash 161131027, now seen corresponding path program 1 times [2022-12-13 02:02:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:30,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351382754] [2022-12-13 02:02:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:30,779 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 02:02:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:30,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351382754] [2022-12-13 02:02:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351382754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:30,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:30,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572020784] [2022-12-13 02:02:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:30,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:30,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:30,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:30,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:30,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:30,837 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:30,838 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:30,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:30,838 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:30,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:30,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:30,839 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:30,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:30,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:30,840 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:30,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:30,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:30,840 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:30,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:30,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:30,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,843 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:30,843 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:30,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:30,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:30,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:30,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:30,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:30,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:30,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:30,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:30,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:30,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1468 [2022-12-13 02:02:30,978 INFO L420 AbstractCegarLoop]: === Iteration 1470 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:30,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:30,978 INFO L85 PathProgramCache]: Analyzing trace with hash 218389329, now seen corresponding path program 1 times [2022-12-13 02:02:30,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:30,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744617234] [2022-12-13 02:02:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:31,062 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 02:02:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:31,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744617234] [2022-12-13 02:02:31,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744617234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:31,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:31,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:31,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431226484] [2022-12-13 02:02:31,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:31,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:31,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:31,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:31,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:31,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:31,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:31,116 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:31,116 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:31,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:31,117 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:31,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:31,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:31,117 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:31,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:31,119 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:31,119 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:31,119 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:31,119 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:31,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:31,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:31,123 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:31,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:31,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:31,257 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:31,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:31,258 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:31,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:31,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:31,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1469 [2022-12-13 02:02:31,258 INFO L420 AbstractCegarLoop]: === Iteration 1471 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:31,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 275647631, now seen corresponding path program 1 times [2022-12-13 02:02:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:31,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17822925] [2022-12-13 02:02:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:31,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:31,328 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 02:02:31,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:31,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17822925] [2022-12-13 02:02:31,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17822925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:31,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:31,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826991408] [2022-12-13 02:02:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:31,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:31,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:31,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:31,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:31,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:31,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:31,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:31,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:31,392 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:31,393 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:31,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:31,393 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:31,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:31,394 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:31,394 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:31,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:31,395 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,395 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:31,395 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:31,395 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:31,395 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,395 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:31,395 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:31,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,398 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:31,398 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:31,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:31,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:31,531 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:31,532 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:31,532 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:31,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,532 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:31,532 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:31,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1470 [2022-12-13 02:02:31,532 INFO L420 AbstractCegarLoop]: === Iteration 1472 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:31,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash 332905933, now seen corresponding path program 1 times [2022-12-13 02:02:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:31,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200170039] [2022-12-13 02:02:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:31,592 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 02:02:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:31,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200170039] [2022-12-13 02:02:31,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200170039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:31,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:31,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655485351] [2022-12-13 02:02:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:31,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:31,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:31,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:31,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:31,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:31,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:31,655 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:31,655 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:31,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:31,655 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:31,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:31,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:31,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:31,656 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:31,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:31,657 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,657 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:31,657 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:31,657 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:31,657 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,657 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:31,657 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:31,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,660 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:31,660 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:31,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:31,660 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:31,796 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:31,797 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:02:31,797 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:31,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,797 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:31,797 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:31,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1471 [2022-12-13 02:02:31,797 INFO L420 AbstractCegarLoop]: === Iteration 1473 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 390164235, now seen corresponding path program 1 times [2022-12-13 02:02:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:31,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384826426] [2022-12-13 02:02:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:31,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:31,865 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 02:02:31,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:31,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384826426] [2022-12-13 02:02:31,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384826426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:31,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:31,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365669206] [2022-12-13 02:02:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:31,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:31,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:31,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:31,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:31,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:31,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:31,927 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:31,928 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:31,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:31,928 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:31,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:31,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:31,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:31,929 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:31,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:31,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:31,930 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:31,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:31,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:31,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:31,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:31,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:31,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,935 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:31,935 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:31,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:31,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:31,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:32,066 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:32,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:32,067 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:32,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:32,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1472 [2022-12-13 02:02:32,067 INFO L420 AbstractCegarLoop]: === Iteration 1474 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash 447422537, now seen corresponding path program 1 times [2022-12-13 02:02:32,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:32,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196191251] [2022-12-13 02:02:32,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:32,135 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 02:02:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:32,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196191251] [2022-12-13 02:02:32,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196191251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:32,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:32,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761100927] [2022-12-13 02:02:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:32,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:32,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:32,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:32,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:32,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:32,189 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:32,189 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:32,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:32,190 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:32,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:32,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:32,190 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:32,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:32,191 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:32,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:32,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:32,192 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:32,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:32,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,194 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:32,195 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:32,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:32,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:32,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:32,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:32,312 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:32,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:32,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:32,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1473 [2022-12-13 02:02:32,313 INFO L420 AbstractCegarLoop]: === Iteration 1475 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:32,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 504680839, now seen corresponding path program 1 times [2022-12-13 02:02:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:32,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127672966] [2022-12-13 02:02:32,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:32,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 02:02:32,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:32,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127672966] [2022-12-13 02:02:32,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127672966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:32,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:32,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677864697] [2022-12-13 02:02:32,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:32,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:32,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:32,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:32,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:32,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:32,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:32,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:32,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:32,415 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:32,415 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:32,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:32,416 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:32,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:32,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:32,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:32,416 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:32,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:32,417 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,417 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:32,417 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:32,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:32,417 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:32,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:32,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,420 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:32,420 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:32,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:32,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:32,538 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:32,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:32,539 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:32,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:32,539 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:32,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1474 [2022-12-13 02:02:32,539 INFO L420 AbstractCegarLoop]: === Iteration 1476 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash 561939141, now seen corresponding path program 1 times [2022-12-13 02:02:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:32,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905919189] [2022-12-13 02:02:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:32,600 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 02:02:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905919189] [2022-12-13 02:02:32,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905919189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:32,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:32,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480828588] [2022-12-13 02:02:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:32,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:32,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:32,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:32,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:32,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:32,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:32,643 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:32,643 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:32,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:32,644 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:32,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:32,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:32,645 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:32,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:32,645 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:32,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:32,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:32,646 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:32,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:32,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,649 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:32,649 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:32,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:32,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:32,766 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:32,767 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:32,767 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:32,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:32,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:32,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1475 [2022-12-13 02:02:32,768 INFO L420 AbstractCegarLoop]: === Iteration 1477 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 619197443, now seen corresponding path program 1 times [2022-12-13 02:02:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:32,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826273593] [2022-12-13 02:02:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:32,830 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 02:02:32,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:32,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826273593] [2022-12-13 02:02:32,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826273593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:32,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:32,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499331399] [2022-12-13 02:02:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:32,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:32,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:32,831 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:32,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:32,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:32,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:32,876 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:32,877 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:32,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:32,877 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:32,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:32,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:32,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:32,878 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:32,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:32,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:32,879 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:32,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:32,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:32,879 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:32,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:32,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:32,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,882 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:32,882 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:32,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:32,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:32,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:32,997 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:32,998 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:32,998 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:32,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:32,998 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:32,998 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:32,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1476 [2022-12-13 02:02:32,998 INFO L420 AbstractCegarLoop]: === Iteration 1478 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:32,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 676455745, now seen corresponding path program 1 times [2022-12-13 02:02:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:32,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38749377] [2022-12-13 02:02:32,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:33,059 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 02:02:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:33,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38749377] [2022-12-13 02:02:33,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38749377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:33,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:33,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888429943] [2022-12-13 02:02:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:33,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:33,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:33,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:33,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:33,111 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:33,111 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:33,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:33,112 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:33,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:33,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:33,112 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:33,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:33,113 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:33,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:33,113 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:33,113 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,113 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:33,113 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:33,113 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,116 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:33,116 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:33,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:33,116 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:33,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:33,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:33,231 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:33,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:33,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:33,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1477 [2022-12-13 02:02:33,231 INFO L420 AbstractCegarLoop]: === Iteration 1479 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash 733714047, now seen corresponding path program 1 times [2022-12-13 02:02:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:33,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659303170] [2022-12-13 02:02:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:33,286 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 02:02:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:33,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659303170] [2022-12-13 02:02:33,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659303170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:33,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:33,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653079569] [2022-12-13 02:02:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:33,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:33,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:33,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:33,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:33,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:33,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:33,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:33,330 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:33,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:33,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:33,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:33,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:33,331 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:33,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:33,332 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:33,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:33,332 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:33,332 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:33,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:33,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,335 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:33,335 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:33,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:33,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:33,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:33,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:33,451 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:33,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:33,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:33,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1478 [2022-12-13 02:02:33,451 INFO L420 AbstractCegarLoop]: === Iteration 1480 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 790972349, now seen corresponding path program 1 times [2022-12-13 02:02:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:33,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608371751] [2022-12-13 02:02:33,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:33,504 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 02:02:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:33,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608371751] [2022-12-13 02:02:33,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608371751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:33,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:33,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856656477] [2022-12-13 02:02:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:33,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:33,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:33,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:33,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:33,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:33,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:33,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:33,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:33,555 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:33,556 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:33,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:33,556 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:33,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:33,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:33,557 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:33,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:33,557 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:33,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:33,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:33,558 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:33,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:33,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,560 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:33,560 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:33,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:33,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:33,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:33,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:33,677 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:33,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:33,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:33,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1479 [2022-12-13 02:02:33,677 INFO L420 AbstractCegarLoop]: === Iteration 1481 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 848230651, now seen corresponding path program 1 times [2022-12-13 02:02:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:33,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006279249] [2022-12-13 02:02:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:33,731 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 02:02:33,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:33,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006279249] [2022-12-13 02:02:33,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006279249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:33,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:33,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114255363] [2022-12-13 02:02:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:33,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:33,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:33,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:33,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:33,732 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:33,732 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:33,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:33,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:33,805 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:33,805 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:33,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:33,806 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:33,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:33,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:33,806 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:33,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:33,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:33,807 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:33,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:33,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:33,807 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:33,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:33,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:33,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,810 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:33,810 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:33,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:33,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:33,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:33,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:33,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:33,928 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:33,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:33,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:33,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1480 [2022-12-13 02:02:33,928 INFO L420 AbstractCegarLoop]: === Iteration 1482 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:33,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash 905488953, now seen corresponding path program 1 times [2022-12-13 02:02:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:33,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917857344] [2022-12-13 02:02:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:33,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917857344] [2022-12-13 02:02:33,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917857344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:33,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:33,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338586575] [2022-12-13 02:02:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:33,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:33,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:33,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:33,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:33,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:33,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:34,040 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:34,040 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:34,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:34,041 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:34,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:34,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:34,041 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:34,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:34,043 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,043 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:34,043 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:34,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:34,043 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:34,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:34,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,047 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:34,047 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:34,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:34,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:34,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:34,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:02:34,167 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:34,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:34,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:34,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1481 [2022-12-13 02:02:34,167 INFO L420 AbstractCegarLoop]: === Iteration 1483 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:34,167 INFO L85 PathProgramCache]: Analyzing trace with hash 962747255, now seen corresponding path program 1 times [2022-12-13 02:02:34,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:34,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52094286] [2022-12-13 02:02:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:34,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:34,222 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 02:02:34,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:34,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52094286] [2022-12-13 02:02:34,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52094286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:34,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:34,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:34,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941861047] [2022-12-13 02:02:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:34,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:34,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:34,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:34,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:34,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:34,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:34,265 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:34,265 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:34,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:34,266 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:34,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:34,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:34,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:34,266 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:34,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:34,267 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,267 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:34,267 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:34,267 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:34,268 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:34,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:34,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,270 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:34,270 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:34,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:34,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:34,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:34,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:34,386 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:34,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:34,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:34,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1482 [2022-12-13 02:02:34,386 INFO L420 AbstractCegarLoop]: === Iteration 1484 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:34,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:34,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1020005557, now seen corresponding path program 1 times [2022-12-13 02:02:34,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:34,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586644748] [2022-12-13 02:02:34,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:34,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:34,440 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 02:02:34,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:34,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586644748] [2022-12-13 02:02:34,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586644748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:34,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:34,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22470755] [2022-12-13 02:02:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:34,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:34,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:34,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:34,441 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:34,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:34,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:34,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:34,484 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:34,484 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:34,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:34,485 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:34,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:34,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:34,485 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:34,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:34,486 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,486 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:34,486 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:34,486 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:34,486 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,486 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:34,486 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:34,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,489 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:34,489 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:34,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:34,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:34,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:34,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:34,606 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:34,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:34,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:34,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1483 [2022-12-13 02:02:34,606 INFO L420 AbstractCegarLoop]: === Iteration 1485 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:34,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1077263859, now seen corresponding path program 1 times [2022-12-13 02:02:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:34,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429971122] [2022-12-13 02:02:34,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:34,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:34,667 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 02:02:34,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:34,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429971122] [2022-12-13 02:02:34,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429971122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:34,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:34,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104279181] [2022-12-13 02:02:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:34,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:34,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:34,668 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:34,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:34,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:34,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:34,712 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:34,712 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:34,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:34,712 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:34,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:34,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:34,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:34,713 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:34,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:34,713 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:34,714 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:34,714 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:34,714 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,714 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:34,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:34,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,716 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:34,717 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:34,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:34,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:34,834 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:34,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:34,834 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:34,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:34,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:34,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1484 [2022-12-13 02:02:34,835 INFO L420 AbstractCegarLoop]: === Iteration 1486 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1134522161, now seen corresponding path program 1 times [2022-12-13 02:02:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:34,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527048727] [2022-12-13 02:02:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:34,888 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 02:02:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:34,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527048727] [2022-12-13 02:02:34,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527048727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:34,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:34,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031754529] [2022-12-13 02:02:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:34,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:34,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:34,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:34,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:34,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:34,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:34,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:34,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:34,931 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:34,932 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:34,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:34,932 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:34,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:34,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:34,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:34,933 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:34,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:34,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:34,934 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,934 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:34,934 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:34,934 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:34,934 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:34,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:34,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:34,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,937 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:34,937 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:34,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:34,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:34,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:35,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:35,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:35,054 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:35,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:35,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:35,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1485 [2022-12-13 02:02:35,055 INFO L420 AbstractCegarLoop]: === Iteration 1487 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1191780463, now seen corresponding path program 1 times [2022-12-13 02:02:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590579304] [2022-12-13 02:02:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:35,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:35,117 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 02:02:35,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:35,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590579304] [2022-12-13 02:02:35,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590579304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:35,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:35,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658936822] [2022-12-13 02:02:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:35,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:35,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:35,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:35,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:35,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:35,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:35,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:35,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:35,161 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:35,161 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:35,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:35,162 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:35,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:35,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:35,162 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:35,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:35,163 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:35,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:35,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:35,163 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:35,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:35,164 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,166 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:35,166 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:35,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:35,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:35,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:35,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:35,284 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:35,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,284 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:35,284 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:35,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1486 [2022-12-13 02:02:35,284 INFO L420 AbstractCegarLoop]: === Iteration 1488 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1249038765, now seen corresponding path program 1 times [2022-12-13 02:02:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:35,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501262502] [2022-12-13 02:02:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:35,338 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 02:02:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:35,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501262502] [2022-12-13 02:02:35,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501262502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:35,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:35,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743071522] [2022-12-13 02:02:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:35,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:35,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:35,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:35,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:35,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:35,384 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:35,384 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:35,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:35,385 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:35,385 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:35,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:35,385 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:35,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:35,386 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:35,386 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:35,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:35,386 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:35,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:35,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,389 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:35,389 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:35,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:35,390 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,390 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:35,514 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:35,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:02:35,515 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:35,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,515 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:35,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:35,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1487 [2022-12-13 02:02:35,515 INFO L420 AbstractCegarLoop]: === Iteration 1489 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:35,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1306297067, now seen corresponding path program 1 times [2022-12-13 02:02:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:35,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564433698] [2022-12-13 02:02:35,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:35,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:35,583 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 02:02:35,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564433698] [2022-12-13 02:02:35,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564433698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:35,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:35,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:35,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292644893] [2022-12-13 02:02:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:35,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:35,584 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:35,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:35,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:35,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:35,647 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:35,648 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:35,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:35,648 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:35,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:35,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:35,649 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:35,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:35,650 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,650 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:35,650 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:35,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:35,650 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:35,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:35,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,653 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:35,653 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:35,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:35,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:35,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:35,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:35,789 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:35,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:35,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:35,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1488 [2022-12-13 02:02:35,789 INFO L420 AbstractCegarLoop]: === Iteration 1490 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:35,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:35,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1363555369, now seen corresponding path program 1 times [2022-12-13 02:02:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:35,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884373208] [2022-12-13 02:02:35,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:35,861 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 02:02:35,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:35,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884373208] [2022-12-13 02:02:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884373208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:35,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:35,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:35,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223313055] [2022-12-13 02:02:35,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:35,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:35,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:35,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:35,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:35,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:35,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:35,924 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:35,925 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:35,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:35,925 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:35,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:35,926 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:35,926 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:35,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:35,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:35,927 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,927 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:35,927 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:35,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:35,928 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,928 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:35,928 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:35,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:35,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,932 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:35,932 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:35,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:35,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:35,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:36,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:36,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:02:36,068 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:36,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:36,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1489 [2022-12-13 02:02:36,069 INFO L420 AbstractCegarLoop]: === Iteration 1491 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:36,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1420813671, now seen corresponding path program 1 times [2022-12-13 02:02:36,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:36,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736334789] [2022-12-13 02:02:36,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:36,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:36,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736334789] [2022-12-13 02:02:36,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736334789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:36,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:36,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:36,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668971721] [2022-12-13 02:02:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:36,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:36,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:36,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:36,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:36,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:36,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:36,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:36,201 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:36,201 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:36,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:36,202 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:36,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:36,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:36,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:36,202 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:36,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:36,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:36,203 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,203 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:36,203 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:36,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:36,203 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:36,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:36,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:36,207 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:36,207 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:36,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:36,207 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:36,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:36,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:36,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:36,342 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:36,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:36,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:36,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1490 [2022-12-13 02:02:36,343 INFO L420 AbstractCegarLoop]: === Iteration 1492 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1478071973, now seen corresponding path program 1 times [2022-12-13 02:02:36,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:36,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863175736] [2022-12-13 02:02:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:36,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:36,404 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 02:02:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:36,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863175736] [2022-12-13 02:02:36,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863175736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:36,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:36,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719464114] [2022-12-13 02:02:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:36,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:36,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:36,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:36,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:36,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:36,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:36,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:36,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:36,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:36,469 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:36,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:36,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:36,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:36,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:36,470 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:36,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:36,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:36,481 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:36,482 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:36,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:36,482 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:36,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:36,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:36,487 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:36,487 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:36,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:36,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:36,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:36,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:36,624 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:02:36,624 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:36,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,624 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:36,624 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:36,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1491 [2022-12-13 02:02:36,624 INFO L420 AbstractCegarLoop]: === Iteration 1493 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:36,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1535330275, now seen corresponding path program 1 times [2022-12-13 02:02:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:36,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746518480] [2022-12-13 02:02:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:36,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:36,683 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 02:02:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746518480] [2022-12-13 02:02:36,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746518480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:36,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:36,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100053022] [2022-12-13 02:02:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:36,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:36,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:36,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:36,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:36,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:36,748 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:36,749 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:36,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:36,749 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:36,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:36,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:36,750 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:36,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:36,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:36,751 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:36,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:36,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:36,751 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:36,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:36,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:36,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:36,755 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:36,755 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:36,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:36,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:36,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:36,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:36,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:02:36,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:36,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:36,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:36,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1492 [2022-12-13 02:02:36,894 INFO L420 AbstractCegarLoop]: === Iteration 1494 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:36,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1592588577, now seen corresponding path program 1 times [2022-12-13 02:02:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:36,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154584778] [2022-12-13 02:02:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:36,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154584778] [2022-12-13 02:02:36,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154584778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:36,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:36,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471662161] [2022-12-13 02:02:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:36,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:36,965 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:36,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:36,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:36,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:36,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:37,018 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:37,019 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:37,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:37,019 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:37,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:37,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:37,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:37,020 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:37,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:37,021 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:37,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:37,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:37,021 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:37,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:37,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,024 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:37,024 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:37,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:37,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:37,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:37,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:02:37,166 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:37,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:37,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:37,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1493 [2022-12-13 02:02:37,166 INFO L420 AbstractCegarLoop]: === Iteration 1495 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1649846879, now seen corresponding path program 1 times [2022-12-13 02:02:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:37,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507640696] [2022-12-13 02:02:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:37,224 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 02:02:37,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:37,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507640696] [2022-12-13 02:02:37,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507640696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:37,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:37,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:37,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895790332] [2022-12-13 02:02:37,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:37,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:37,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:37,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:37,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:37,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:37,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:37,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:37,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:37,269 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:37,269 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:37,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:37,270 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:37,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:37,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:37,271 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:37,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:37,271 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:37,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:37,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:37,272 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:37,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:37,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,274 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:37,275 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:37,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:37,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:37,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:37,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:37,392 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:37,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:37,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:37,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1494 [2022-12-13 02:02:37,393 INFO L420 AbstractCegarLoop]: === Iteration 1496 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1707105181, now seen corresponding path program 1 times [2022-12-13 02:02:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:37,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540783979] [2022-12-13 02:02:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:37,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:37,446 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 02:02:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:37,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540783979] [2022-12-13 02:02:37,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540783979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:37,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:37,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:37,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259418165] [2022-12-13 02:02:37,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:37,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:37,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:37,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:37,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:37,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:37,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:37,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:37,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:37,492 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:37,492 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:37,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:37,492 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:37,492 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:37,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:37,493 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:37,493 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:37,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:37,494 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:37,494 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:37,494 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:37,494 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,494 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:37,494 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:37,494 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,497 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:37,497 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:37,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 201 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:37,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:37,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:37,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:37,617 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:37,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:37,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:37,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1495 [2022-12-13 02:02:37,617 INFO L420 AbstractCegarLoop]: === Iteration 1497 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1764363483, now seen corresponding path program 1 times [2022-12-13 02:02:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:37,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268572574] [2022-12-13 02:02:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:37,671 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 02:02:37,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:37,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268572574] [2022-12-13 02:02:37,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268572574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:37,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:37,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:37,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111739341] [2022-12-13 02:02:37,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:37,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:37,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:37,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:37,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:37,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:37,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:37,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:37,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:37,715 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:37,715 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:37,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:37,716 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:37,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:37,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:37,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:37,716 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:37,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:37,717 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:37,717 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:37,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:37,717 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:37,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:37,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,720 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:37,720 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:37,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:37,720 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,720 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:37,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:37,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:37,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:37,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:37,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:37,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1496 [2022-12-13 02:02:37,838 INFO L420 AbstractCegarLoop]: === Iteration 1498 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1821621785, now seen corresponding path program 1 times [2022-12-13 02:02:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:37,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502411341] [2022-12-13 02:02:37,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:37,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 02:02:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:37,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502411341] [2022-12-13 02:02:37,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502411341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:37,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:37,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89661530] [2022-12-13 02:02:37,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:37,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:37,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:37,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:37,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:37,903 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:37,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:37,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:37,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:37,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:37,946 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:37,946 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:37,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:37,947 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:37,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:37,947 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:37,947 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:37,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:37,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:37,948 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,948 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:37,948 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:37,948 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:37,948 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,948 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:37,948 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:37,948 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:37,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,951 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:37,951 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:37,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:37,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:37,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:38,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:38,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:38,067 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:38,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:38,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:38,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1497 [2022-12-13 02:02:38,068 INFO L420 AbstractCegarLoop]: === Iteration 1499 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:38,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1878880087, now seen corresponding path program 1 times [2022-12-13 02:02:38,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:38,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333038504] [2022-12-13 02:02:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:38,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:38,135 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 02:02:38,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:38,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333038504] [2022-12-13 02:02:38,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333038504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:38,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:38,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:38,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536323834] [2022-12-13 02:02:38,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:38,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:38,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:38,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:38,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:38,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:38,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:38,187 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:38,187 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:38,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:38,188 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:38,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:38,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:38,188 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:38,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:38,189 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:38,189 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:38,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:38,189 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:38,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:38,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,192 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:38,192 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:38,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:38,192 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:38,309 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:38,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:38,310 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:38,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:38,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:38,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1498 [2022-12-13 02:02:38,310 INFO L420 AbstractCegarLoop]: === Iteration 1500 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:38,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1936138389, now seen corresponding path program 1 times [2022-12-13 02:02:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:38,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701167962] [2022-12-13 02:02:38,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:38,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:38,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 02:02:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:38,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701167962] [2022-12-13 02:02:38,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701167962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:38,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:38,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088498519] [2022-12-13 02:02:38,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:38,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:38,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:38,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:38,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:38,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:38,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:38,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:38,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:38,409 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:38,410 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:38,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:38,410 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:38,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:38,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:38,411 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:38,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:38,411 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:38,412 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:38,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:38,412 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:38,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:38,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,414 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:38,414 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:38,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:38,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:38,533 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:38,534 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:38,534 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:38,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:38,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1499 [2022-12-13 02:02:38,534 INFO L420 AbstractCegarLoop]: === Iteration 1501 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1993396691, now seen corresponding path program 1 times [2022-12-13 02:02:38,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034325060] [2022-12-13 02:02:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:38,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:38,595 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 02:02:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:38,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034325060] [2022-12-13 02:02:38,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034325060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:38,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:38,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452572944] [2022-12-13 02:02:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:38,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:38,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:38,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:38,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:38,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:38,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:38,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:38,641 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:38,641 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:38,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:38,641 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:38,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:38,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:38,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:38,642 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:38,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:38,643 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,643 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:38,643 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:38,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:38,643 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:38,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:38,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,646 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:38,646 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:38,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:38,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:38,770 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:38,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:02:38,771 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:38,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:38,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:38,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1500 [2022-12-13 02:02:38,772 INFO L420 AbstractCegarLoop]: === Iteration 1502 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2050654993, now seen corresponding path program 1 times [2022-12-13 02:02:38,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:38,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9233197] [2022-12-13 02:02:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:38,843 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 02:02:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9233197] [2022-12-13 02:02:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9233197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:38,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:38,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343428134] [2022-12-13 02:02:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:38,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:38,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:38,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:38,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:38,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:38,844 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:38,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:38,899 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:38,899 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:38,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:38,900 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:38,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:38,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:38,900 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:38,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:38,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:38,901 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,901 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:38,901 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:38,901 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:38,901 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,901 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:38,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:38,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:38,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,904 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:38,904 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:38,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:38,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:39,039 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:39,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:39,040 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:39,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:39,040 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:39,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1501 [2022-12-13 02:02:39,040 INFO L420 AbstractCegarLoop]: === Iteration 1503 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:39,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2107913295, now seen corresponding path program 1 times [2022-12-13 02:02:39,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:39,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188483363] [2022-12-13 02:02:39,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:39,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:39,108 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 02:02:39,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:39,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188483363] [2022-12-13 02:02:39,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188483363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:39,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:39,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719934624] [2022-12-13 02:02:39,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:39,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:39,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:39,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:39,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:39,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:39,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:39,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:39,164 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:39,165 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:39,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:39,165 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:39,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:39,166 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:39,166 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:39,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:39,166 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,167 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:39,167 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:39,167 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:39,167 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,167 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:39,167 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:39,167 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,178 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:39,178 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:39,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:39,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:39,299 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:39,300 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:39,300 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:39,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:39,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:39,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1502 [2022-12-13 02:02:39,300 INFO L420 AbstractCegarLoop]: === Iteration 1504 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2129795699, now seen corresponding path program 1 times [2022-12-13 02:02:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:39,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158840407] [2022-12-13 02:02:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:39,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:39,355 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 02:02:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:39,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158840407] [2022-12-13 02:02:39,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158840407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:39,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:39,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:39,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662369808] [2022-12-13 02:02:39,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:39,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:39,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:39,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:39,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:39,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:39,413 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:39,413 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:39,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:39,413 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:39,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:39,414 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:39,414 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:39,415 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,415 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:39,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:39,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:39,415 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:39,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:39,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,418 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:39,418 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:39,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:39,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:39,541 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:39,542 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:02:39,542 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:39,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,543 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:39,543 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:39,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1503 [2022-12-13 02:02:39,543 INFO L420 AbstractCegarLoop]: === Iteration 1505 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:39,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2072537397, now seen corresponding path program 1 times [2022-12-13 02:02:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:39,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440420240] [2022-12-13 02:02:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:39,595 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 02:02:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:39,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440420240] [2022-12-13 02:02:39,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440420240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:39,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:39,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678590147] [2022-12-13 02:02:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:39,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:39,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:39,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:39,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:39,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:39,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:39,639 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:39,639 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:39,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:39,640 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:39,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:39,640 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:39,640 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:39,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:39,641 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:39,641 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:39,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:39,641 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:39,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:39,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,644 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:39,644 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:39,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:39,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:39,760 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:39,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:39,761 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:39,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:39,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:39,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1504 [2022-12-13 02:02:39,761 INFO L420 AbstractCegarLoop]: === Iteration 1506 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2015279095, now seen corresponding path program 1 times [2022-12-13 02:02:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:39,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114619396] [2022-12-13 02:02:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:39,833 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 02:02:39,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114619396] [2022-12-13 02:02:39,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114619396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:39,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:39,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77381689] [2022-12-13 02:02:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:39,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:39,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:39,834 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:39,834 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:39,834 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:39,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:39,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:39,883 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:39,883 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:39,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:39,883 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:39,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:39,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:39,884 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:39,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:39,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:39,885 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:39,885 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:39,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:39,885 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:39,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:39,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:39,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,888 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:39,888 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:39,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:39,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:39,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:40,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:40,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:02:40,012 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:40,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:40,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:40,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1505 [2022-12-13 02:02:40,012 INFO L420 AbstractCegarLoop]: === Iteration 1507 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:40,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1958020793, now seen corresponding path program 1 times [2022-12-13 02:02:40,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:40,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173178264] [2022-12-13 02:02:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:40,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:40,069 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 02:02:40,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:40,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173178264] [2022-12-13 02:02:40,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173178264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:40,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:40,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:40,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56476075] [2022-12-13 02:02:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:40,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:40,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:40,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:40,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:40,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:40,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:40,120 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:40,120 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:40,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:40,121 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:40,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:40,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:40,121 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:40,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:40,122 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:40,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:40,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:40,122 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:40,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:40,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,125 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:40,125 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:40,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:40,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:40,241 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:40,242 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:40,242 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:40,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:40,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:40,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1506 [2022-12-13 02:02:40,242 INFO L420 AbstractCegarLoop]: === Iteration 1508 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:40,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:40,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1900762491, now seen corresponding path program 1 times [2022-12-13 02:02:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:40,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004856880] [2022-12-13 02:02:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:40,295 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 02:02:40,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:40,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004856880] [2022-12-13 02:02:40,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004856880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:40,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:40,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869140417] [2022-12-13 02:02:40,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:40,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:40,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:40,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:40,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:40,340 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:40,340 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:40,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:40,340 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:40,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:40,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:40,341 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:40,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:40,341 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:40,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:40,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:40,342 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:40,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:40,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,345 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:40,345 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:40,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:40,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:40,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:40,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:40,460 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:40,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:40,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:40,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1507 [2022-12-13 02:02:40,460 INFO L420 AbstractCegarLoop]: === Iteration 1509 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:40,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:40,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1843504189, now seen corresponding path program 1 times [2022-12-13 02:02:40,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:40,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618273086] [2022-12-13 02:02:40,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:40,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:40,536 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 02:02:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618273086] [2022-12-13 02:02:40,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618273086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:40,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:40,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311322692] [2022-12-13 02:02:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:40,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:40,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:40,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:40,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:40,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:40,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:40,598 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:40,598 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:40,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:40,599 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:40,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:40,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:40,599 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:40,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:40,600 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:40,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:40,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:40,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:40,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:40,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:40,603 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:40,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:40,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:40,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:40,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:40,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:40,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:40,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1508 [2022-12-13 02:02:40,735 INFO L420 AbstractCegarLoop]: === Iteration 1510 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1786245887, now seen corresponding path program 1 times [2022-12-13 02:02:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:40,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002169423] [2022-12-13 02:02:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:40,796 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 02:02:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:40,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002169423] [2022-12-13 02:02:40,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002169423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:40,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:40,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685438797] [2022-12-13 02:02:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:40,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:40,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:40,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:40,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:40,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:40,851 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:40,851 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:40,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:40,852 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:40,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:40,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:40,852 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:40,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:40,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:40,853 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:40,853 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:40,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:40,854 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:40,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:40,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:40,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,856 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:40,857 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:40,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:40,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:40,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:40,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:40,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:02:40,995 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:40,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:40,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:40,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:40,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1509 [2022-12-13 02:02:40,995 INFO L420 AbstractCegarLoop]: === Iteration 1511 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1728987585, now seen corresponding path program 1 times [2022-12-13 02:02:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744146231] [2022-12-13 02:02:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:40,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:41,054 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 02:02:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:41,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744146231] [2022-12-13 02:02:41,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744146231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:41,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:41,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390178717] [2022-12-13 02:02:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:41,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:41,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:41,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:41,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:41,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:41,122 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:41,123 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:41,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:41,123 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:41,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:41,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:41,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:41,124 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:41,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:41,125 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,125 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:41,125 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:41,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:41,125 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:41,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:41,125 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,128 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:41,128 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:41,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:41,128 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,128 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:41,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:41,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:41,260 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:41,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:41,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:41,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1510 [2022-12-13 02:02:41,260 INFO L420 AbstractCegarLoop]: === Iteration 1512 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:41,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1671729283, now seen corresponding path program 1 times [2022-12-13 02:02:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:41,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365067107] [2022-12-13 02:02:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:41,320 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 02:02:41,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:41,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365067107] [2022-12-13 02:02:41,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365067107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:41,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:41,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55727919] [2022-12-13 02:02:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:41,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:41,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:41,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:41,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:41,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:41,374 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:41,374 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:41,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:41,375 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:41,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:41,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:41,376 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:41,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:41,376 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:41,376 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:41,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:41,377 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:41,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:41,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,379 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:41,379 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:41,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:41,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:41,512 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:41,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:41,513 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:41,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:41,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:41,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1511 [2022-12-13 02:02:41,514 INFO L420 AbstractCegarLoop]: === Iteration 1513 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:41,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:41,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1614470981, now seen corresponding path program 1 times [2022-12-13 02:02:41,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:41,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822855564] [2022-12-13 02:02:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:41,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:41,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822855564] [2022-12-13 02:02:41,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822855564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:41,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:41,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:41,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332016111] [2022-12-13 02:02:41,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:41,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:41,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:41,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:41,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:41,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:41,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:41,626 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:41,626 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:41,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:41,627 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:41,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:41,627 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:41,627 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:41,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:41,628 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,628 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:41,628 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:41,628 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:41,628 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,629 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:41,629 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:41,629 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,631 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:41,631 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:41,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:41,632 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,632 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:41,764 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:41,765 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:41,765 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:41,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:41,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:41,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1512 [2022-12-13 02:02:41,766 INFO L420 AbstractCegarLoop]: === Iteration 1514 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1557212679, now seen corresponding path program 1 times [2022-12-13 02:02:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:41,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999635926] [2022-12-13 02:02:41,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:41,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:41,850 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 02:02:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:41,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999635926] [2022-12-13 02:02:41,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999635926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:41,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:41,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:41,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982203920] [2022-12-13 02:02:41,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:41,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:41,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:41,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:41,851 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:41,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:41,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:41,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:41,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:41,909 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:41,909 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:41,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:41,910 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:41,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:41,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:41,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:41,911 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:41,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:41,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:41,912 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:41,912 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:41,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:41,912 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,913 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:41,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:41,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:41,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,916 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:41,917 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:41,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:41,917 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:41,917 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:42,078 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:42,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 167 [2022-12-13 02:02:42,079 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:42,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,079 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:42,079 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:42,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1513 [2022-12-13 02:02:42,079 INFO L420 AbstractCegarLoop]: === Iteration 1515 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1499954377, now seen corresponding path program 1 times [2022-12-13 02:02:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:42,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35725556] [2022-12-13 02:02:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:42,150 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 02:02:42,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:42,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35725556] [2022-12-13 02:02:42,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35725556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:42,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:42,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:42,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367804748] [2022-12-13 02:02:42,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:42,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:42,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:42,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:42,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:42,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:42,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:42,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:42,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:42,210 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:42,211 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:42,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:42,211 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:42,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:42,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:42,212 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:42,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:42,213 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:42,213 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:42,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:42,213 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:42,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:42,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,216 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:42,216 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:42,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:42,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:42,353 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:42,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:02:42,354 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:42,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:42,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:42,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1514 [2022-12-13 02:02:42,355 INFO L420 AbstractCegarLoop]: === Iteration 1516 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:42,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1442696075, now seen corresponding path program 1 times [2022-12-13 02:02:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:42,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617903468] [2022-12-13 02:02:42,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:42,412 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 02:02:42,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:42,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617903468] [2022-12-13 02:02:42,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617903468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:42,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:42,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173524369] [2022-12-13 02:02:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:42,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:42,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:42,413 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:42,413 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,413 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:42,413 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:42,467 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:42,467 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:42,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:42,468 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:42,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:42,468 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:42,468 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:42,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:42,469 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,469 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:42,469 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:42,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:42,469 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,469 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:42,469 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:42,469 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,472 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:42,472 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:42,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:42,472 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,472 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:42,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:42,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:02:42,586 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:42,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:42,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:42,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1515 [2022-12-13 02:02:42,587 INFO L420 AbstractCegarLoop]: === Iteration 1517 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1385437773, now seen corresponding path program 1 times [2022-12-13 02:02:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:42,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744044854] [2022-12-13 02:02:42,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:42,638 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 02:02:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:42,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744044854] [2022-12-13 02:02:42,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744044854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:42,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:42,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185429993] [2022-12-13 02:02:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:42,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:42,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:42,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:42,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:42,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:42,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:42,681 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:42,681 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:42,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:42,682 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:42,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:42,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:42,682 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:42,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:42,683 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:42,683 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:42,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:42,683 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:42,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:42,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,686 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:42,686 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:42,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:42,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:42,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:42,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:42,804 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:42,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:42,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:42,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1516 [2022-12-13 02:02:42,804 INFO L420 AbstractCegarLoop]: === Iteration 1518 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:42,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1328179471, now seen corresponding path program 1 times [2022-12-13 02:02:42,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:42,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643752368] [2022-12-13 02:02:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:42,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:42,856 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 02:02:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643752368] [2022-12-13 02:02:42,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643752368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:42,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:42,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547455598] [2022-12-13 02:02:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:42,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:42,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:42,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:42,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:42,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:42,916 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:42,916 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:42,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:42,917 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:42,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:42,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:42,917 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:42,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:42,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:42,918 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,918 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:42,918 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:42,918 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:42,918 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:42,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:42,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:42,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,921 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:42,921 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:42,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:42,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:42,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:43,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:43,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:43,039 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:43,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:43,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:43,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1517 [2022-12-13 02:02:43,039 INFO L420 AbstractCegarLoop]: === Iteration 1519 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1270921169, now seen corresponding path program 1 times [2022-12-13 02:02:43,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:43,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073667866] [2022-12-13 02:02:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:43,091 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 02:02:43,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:43,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073667866] [2022-12-13 02:02:43,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073667866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:43,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:43,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:43,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928014791] [2022-12-13 02:02:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:43,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:43,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:43,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:43,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:43,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:43,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:43,141 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:43,142 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:43,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:43,142 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:43,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:43,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:43,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:43,143 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:43,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:43,143 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,143 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:43,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:43,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:43,144 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:43,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:43,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,146 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:43,146 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:43,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:43,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:43,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:43,263 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:43,263 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:43,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:43,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:43,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1518 [2022-12-13 02:02:43,263 INFO L420 AbstractCegarLoop]: === Iteration 1520 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:43,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:43,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1213662867, now seen corresponding path program 1 times [2022-12-13 02:02:43,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:43,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930500879] [2022-12-13 02:02:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:43,325 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 02:02:43,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:43,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930500879] [2022-12-13 02:02:43,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930500879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:43,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:43,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638929870] [2022-12-13 02:02:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:43,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:43,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:43,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:43,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:43,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:43,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:43,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:43,375 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:43,376 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:43,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:43,376 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:43,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:43,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:43,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:43,377 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:43,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:43,377 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:43,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:43,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:43,378 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,378 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:43,378 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:43,378 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,380 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:43,380 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:43,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:43,381 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,381 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:43,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:43,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:43,497 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:43,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:43,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:43,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1519 [2022-12-13 02:02:43,497 INFO L420 AbstractCegarLoop]: === Iteration 1521 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:43,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1156404565, now seen corresponding path program 1 times [2022-12-13 02:02:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:43,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829544290] [2022-12-13 02:02:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:43,560 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 02:02:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:43,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829544290] [2022-12-13 02:02:43,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829544290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:43,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:43,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:43,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744093397] [2022-12-13 02:02:43,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:43,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:43,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:43,561 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:43,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:43,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:43,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:43,605 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:43,605 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:43,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:43,605 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:43,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:43,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:43,606 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:43,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:43,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:43,607 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:43,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:43,607 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,607 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:43,607 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:43,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,609 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:43,610 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:43,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:43,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:43,727 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:43,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:43,728 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:43,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:43,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:43,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1520 [2022-12-13 02:02:43,729 INFO L420 AbstractCegarLoop]: === Iteration 1522 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:43,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1099146263, now seen corresponding path program 1 times [2022-12-13 02:02:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:43,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433288884] [2022-12-13 02:02:43,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:43,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:43,782 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 02:02:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:43,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433288884] [2022-12-13 02:02:43,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433288884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:43,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:43,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613790035] [2022-12-13 02:02:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:43,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:43,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:43,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:43,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:43,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:43,826 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:43,826 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:43,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:43,827 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:43,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:43,827 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:43,827 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:43,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:43,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:43,828 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,828 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:43,828 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:43,828 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:43,828 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:43,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:43,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:43,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,831 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:43,831 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:43,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:43,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:43,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:43,945 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:43,946 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:02:43,946 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:43,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:43,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:43,946 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:43,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1521 [2022-12-13 02:02:43,946 INFO L420 AbstractCegarLoop]: === Iteration 1523 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1041887961, now seen corresponding path program 1 times [2022-12-13 02:02:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:43,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231702539] [2022-12-13 02:02:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:43,999 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 02:02:43,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:43,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231702539] [2022-12-13 02:02:43,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231702539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:43,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:43,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363641728] [2022-12-13 02:02:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:43,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:43,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:43,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:44,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:44,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:44,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:44,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:44,043 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:44,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:44,043 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:44,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:44,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:44,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:44,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:44,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:44,045 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:44,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:44,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:44,045 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:44,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:44,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,048 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:44,048 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:44,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:44,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:44,164 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:44,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:44,164 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:44,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:44,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:44,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1522 [2022-12-13 02:02:44,165 INFO L420 AbstractCegarLoop]: === Iteration 1524 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:44,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash -984629659, now seen corresponding path program 1 times [2022-12-13 02:02:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:44,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754689889] [2022-12-13 02:02:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:44,226 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 02:02:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754689889] [2022-12-13 02:02:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754689889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:44,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:44,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361919581] [2022-12-13 02:02:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:44,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:44,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:44,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:44,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:44,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:44,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:44,278 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:44,278 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:44,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:44,279 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:44,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:44,279 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:44,279 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:44,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:44,280 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,280 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:44,280 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:44,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:44,280 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:44,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:44,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,283 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:44,283 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:44,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:44,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:44,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:44,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:02:44,413 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:44,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:44,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1523 [2022-12-13 02:02:44,414 INFO L420 AbstractCegarLoop]: === Iteration 1525 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -927371357, now seen corresponding path program 1 times [2022-12-13 02:02:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:44,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22130815] [2022-12-13 02:02:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:44,478 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 02:02:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22130815] [2022-12-13 02:02:44,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22130815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:44,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:44,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069585295] [2022-12-13 02:02:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:44,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:44,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:44,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:44,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:44,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:44,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:44,524 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:44,524 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:44,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:44,525 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:44,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:44,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:44,525 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:44,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:44,526 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,526 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:44,526 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:44,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:44,526 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,526 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:44,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:44,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,529 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:44,529 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:44,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:44,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:44,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:44,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:44,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:44,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:44,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:44,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1524 [2022-12-13 02:02:44,661 INFO L420 AbstractCegarLoop]: === Iteration 1526 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:44,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:44,661 INFO L85 PathProgramCache]: Analyzing trace with hash -870113055, now seen corresponding path program 1 times [2022-12-13 02:02:44,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:44,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100451123] [2022-12-13 02:02:44,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:44,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:44,716 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 02:02:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:44,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100451123] [2022-12-13 02:02:44,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100451123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:44,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:44,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014069443] [2022-12-13 02:02:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:44,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:44,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:44,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:44,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:44,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:44,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:44,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:44,762 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:44,762 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:44,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:44,763 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:44,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:44,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:44,763 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:44,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:44,764 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:44,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:44,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:44,764 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:44,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:44,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,768 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:44,768 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:44,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:44,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:44,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:44,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:44,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:44,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:44,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:44,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1525 [2022-12-13 02:02:44,889 INFO L420 AbstractCegarLoop]: === Iteration 1527 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash -812854753, now seen corresponding path program 1 times [2022-12-13 02:02:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:44,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305873063] [2022-12-13 02:02:44,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:44,942 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 02:02:44,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:44,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305873063] [2022-12-13 02:02:44,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305873063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:44,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:44,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295435530] [2022-12-13 02:02:44,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:44,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:44,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:44,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:44,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:44,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:44,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:44,986 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:44,986 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:44,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:44,987 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:44,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:44,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:44,987 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:44,987 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:44,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:44,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:44,988 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,988 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:44,988 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:44,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:44,988 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:44,988 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:44,988 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:44,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,991 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:44,991 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:44,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:44,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:44,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:45,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:45,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:45,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:45,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:45,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:45,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1526 [2022-12-13 02:02:45,108 INFO L420 AbstractCegarLoop]: === Iteration 1528 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash -755596451, now seen corresponding path program 1 times [2022-12-13 02:02:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:45,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374688544] [2022-12-13 02:02:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:45,165 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 02:02:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:45,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374688544] [2022-12-13 02:02:45,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374688544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:45,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:45,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682362293] [2022-12-13 02:02:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:45,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:45,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:45,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:45,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:45,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:45,219 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:45,220 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:45,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:45,220 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:45,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:45,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:45,221 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:45,221 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:45,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:45,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:45,222 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,222 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:45,222 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:45,222 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:45,222 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:45,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:45,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:45,225 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:45,225 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:45,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:45,225 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:45,225 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:45,357 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:45,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:45,358 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:45,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:45,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:45,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1527 [2022-12-13 02:02:45,358 INFO L420 AbstractCegarLoop]: === Iteration 1529 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:45,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash -698338149, now seen corresponding path program 1 times [2022-12-13 02:02:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:45,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419564311] [2022-12-13 02:02:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:45,423 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 02:02:45,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:45,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419564311] [2022-12-13 02:02:45,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419564311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:45,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:45,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937032935] [2022-12-13 02:02:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:45,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:45,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:45,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:45,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:45,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:45,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:45,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:45,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:45,476 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:45,476 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:45,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:45,476 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:45,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:45,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:45,477 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:45,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:45,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:45,478 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:45,478 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:45,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:45,478 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:45,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:45,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:45,481 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:45,481 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:45,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:45,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:45,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:45,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:45,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:02:45,612 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:45,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:45,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:45,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1528 [2022-12-13 02:02:45,612 INFO L420 AbstractCegarLoop]: === Iteration 1530 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:45,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:45,612 INFO L85 PathProgramCache]: Analyzing trace with hash -641079847, now seen corresponding path program 1 times [2022-12-13 02:02:45,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:45,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411896243] [2022-12-13 02:02:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:45,678 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 02:02:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:45,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411896243] [2022-12-13 02:02:45,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411896243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:45,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:45,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:45,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962656559] [2022-12-13 02:02:45,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:45,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:45,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:45,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:45,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:45,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:45,731 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:45,731 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:45,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:45,732 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:45,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:45,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:45,732 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:45,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:45,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:45,733 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:45,733 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:45,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:45,733 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:45,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:45,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:45,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:45,736 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:45,736 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:45,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:45,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:45,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:45,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:45,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:45,870 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:45,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:45,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:45,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1529 [2022-12-13 02:02:45,871 INFO L420 AbstractCegarLoop]: === Iteration 1531 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash -583821545, now seen corresponding path program 1 times [2022-12-13 02:02:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:45,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209670276] [2022-12-13 02:02:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:45,939 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 02:02:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:45,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209670276] [2022-12-13 02:02:45,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209670276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:45,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:45,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634950026] [2022-12-13 02:02:45,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:45,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:45,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:45,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:45,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:45,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:45,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:46,002 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:46,003 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:46,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:46,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:46,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:46,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:46,004 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:46,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:46,005 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:46,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:46,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:46,005 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:46,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:46,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,008 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:46,008 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:46,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:46,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:46,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:46,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:46,142 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:46,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:46,142 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:46,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1530 [2022-12-13 02:02:46,142 INFO L420 AbstractCegarLoop]: === Iteration 1532 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:46,142 INFO L85 PathProgramCache]: Analyzing trace with hash -526563243, now seen corresponding path program 1 times [2022-12-13 02:02:46,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129485573] [2022-12-13 02:02:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:46,201 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 02:02:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:46,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129485573] [2022-12-13 02:02:46,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129485573] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:46,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:46,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:46,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486890067] [2022-12-13 02:02:46,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:46,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:46,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:46,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:46,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:46,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:46,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:46,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:46,262 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:46,263 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:46,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:46,263 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:46,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:46,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:46,264 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:46,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:46,265 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:46,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:46,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:46,265 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:46,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:46,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,268 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:46,268 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:46,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:46,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:46,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:46,402 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:46,402 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:46,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:46,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:46,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1531 [2022-12-13 02:02:46,403 INFO L420 AbstractCegarLoop]: === Iteration 1533 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -469304941, now seen corresponding path program 1 times [2022-12-13 02:02:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:46,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768961486] [2022-12-13 02:02:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:46,472 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 02:02:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:46,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768961486] [2022-12-13 02:02:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768961486] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:46,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:46,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824456952] [2022-12-13 02:02:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:46,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:46,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:46,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:46,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:46,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:46,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:46,534 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:46,534 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:46,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:46,535 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:46,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:46,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:46,535 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:46,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:46,536 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,536 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:46,536 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:46,536 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:46,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:46,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:46,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,539 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:46,539 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:46,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:46,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:46,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:46,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:46,673 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:46,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:46,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:46,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1532 [2022-12-13 02:02:46,674 INFO L420 AbstractCegarLoop]: === Iteration 1534 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:46,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash -412046639, now seen corresponding path program 1 times [2022-12-13 02:02:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:46,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696592655] [2022-12-13 02:02:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:46,727 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 02:02:46,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:46,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696592655] [2022-12-13 02:02:46,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696592655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:46,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:46,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572382113] [2022-12-13 02:02:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:46,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:46,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:46,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:46,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:46,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:46,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:46,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:46,770 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:46,771 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:46,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:46,771 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:46,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:46,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:46,772 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:46,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:46,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:46,772 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,772 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:46,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:46,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:46,773 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:46,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:46,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:46,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,775 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:46,776 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:46,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:46,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:46,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:46,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:46,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:46,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:46,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:46,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:46,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1533 [2022-12-13 02:02:46,895 INFO L420 AbstractCegarLoop]: === Iteration 1535 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash -354788337, now seen corresponding path program 1 times [2022-12-13 02:02:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:46,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892373143] [2022-12-13 02:02:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:46,951 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 02:02:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:46,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892373143] [2022-12-13 02:02:46,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892373143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:46,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:46,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185280812] [2022-12-13 02:02:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:46,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:46,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:46,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:46,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:46,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:46,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:46,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:46,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:46,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:47,014 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:47,014 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:47,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:47,015 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:47,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:47,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:47,015 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:47,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:47,016 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:47,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:47,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:47,017 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:47,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:47,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,020 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:47,021 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:47,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:47,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:47,159 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:47,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:02:47,160 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:47,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:47,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:47,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1534 [2022-12-13 02:02:47,160 INFO L420 AbstractCegarLoop]: === Iteration 1536 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:47,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash -297530035, now seen corresponding path program 1 times [2022-12-13 02:02:47,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:47,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670511073] [2022-12-13 02:02:47,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:47,232 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 02:02:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670511073] [2022-12-13 02:02:47,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670511073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:47,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:47,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850738486] [2022-12-13 02:02:47,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:47,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:47,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:47,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:47,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:47,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:47,284 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:47,284 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:47,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:47,285 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:47,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:47,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:47,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:47,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:47,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:47,286 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:47,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:47,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:47,287 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:47,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:47,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,290 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:47,290 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:47,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:47,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:47,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:47,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:02:47,433 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:47,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:47,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:47,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1535 [2022-12-13 02:02:47,434 INFO L420 AbstractCegarLoop]: === Iteration 1537 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:47,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash -240271733, now seen corresponding path program 1 times [2022-12-13 02:02:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:47,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344710949] [2022-12-13 02:02:47,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:47,490 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 02:02:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:47,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344710949] [2022-12-13 02:02:47,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344710949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:47,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:47,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616626929] [2022-12-13 02:02:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:47,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:47,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:47,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:47,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:47,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:47,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:47,545 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:47,546 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:47,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:47,546 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:47,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:47,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:47,547 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:47,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:47,547 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:47,548 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:47,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:47,548 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:47,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:47,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,551 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:47,551 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:47,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:47,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:47,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:47,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:47,667 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:47,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:47,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:47,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1536 [2022-12-13 02:02:47,667 INFO L420 AbstractCegarLoop]: === Iteration 1538 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -183013431, now seen corresponding path program 1 times [2022-12-13 02:02:47,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:47,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382359818] [2022-12-13 02:02:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:47,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:47,719 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 02:02:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382359818] [2022-12-13 02:02:47,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382359818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:47,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:47,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719414641] [2022-12-13 02:02:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:47,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:47,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:47,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:47,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:47,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:47,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:47,771 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:47,771 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:47,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:47,772 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:47,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:47,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:47,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:47,772 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:47,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:47,773 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:47,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:47,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:47,774 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:47,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:47,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,776 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:47,776 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:47,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:47,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:47,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:47,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:47,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:47,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:47,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:47,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1537 [2022-12-13 02:02:47,894 INFO L420 AbstractCegarLoop]: === Iteration 1539 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:47,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:47,894 INFO L85 PathProgramCache]: Analyzing trace with hash -125755129, now seen corresponding path program 1 times [2022-12-13 02:02:47,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:47,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815268059] [2022-12-13 02:02:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:47,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:47,950 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 02:02:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:47,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815268059] [2022-12-13 02:02:47,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815268059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:47,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:47,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766110224] [2022-12-13 02:02:47,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:47,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:47,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:47,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:47,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:47,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:47,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:47,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:47,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:47,994 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:47,994 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:47,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:47,994 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:47,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:47,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:47,995 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:47,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:47,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:47,996 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:47,996 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:47,996 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:47,996 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,996 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:47,996 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:47,996 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:47,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,999 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:47,999 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:47,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:47,999 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:47,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:48,117 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:48,118 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:48,118 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:48,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:48,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:48,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1538 [2022-12-13 02:02:48,119 INFO L420 AbstractCegarLoop]: === Iteration 1540 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:48,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash -68496827, now seen corresponding path program 1 times [2022-12-13 02:02:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:48,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127340737] [2022-12-13 02:02:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:48,172 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 02:02:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:48,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127340737] [2022-12-13 02:02:48,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127340737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:48,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:48,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:48,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223521572] [2022-12-13 02:02:48,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:48,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:48,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:48,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:48,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:48,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:48,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:48,217 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:48,217 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:48,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:48,217 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:48,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:48,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:48,218 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:48,218 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:48,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:48,219 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,219 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:48,219 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:48,219 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:48,219 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,219 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:48,219 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:48,219 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,222 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:48,222 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:48,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:48,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:48,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:48,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:48,339 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:48,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:48,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1539 [2022-12-13 02:02:48,339 INFO L420 AbstractCegarLoop]: === Iteration 1541 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash -11238525, now seen corresponding path program 1 times [2022-12-13 02:02:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:48,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666752402] [2022-12-13 02:02:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:48,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666752402] [2022-12-13 02:02:48,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666752402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:48,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:48,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785386951] [2022-12-13 02:02:48,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:48,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:48,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:48,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:48,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:48,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:48,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:48,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:48,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:48,447 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:48,447 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:48,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:48,447 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:48,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:48,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:48,448 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:48,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:48,449 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:48,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:48,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:48,449 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:48,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:48,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:48,452 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:48,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:48,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:48,570 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:48,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:48,571 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:48,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:48,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:48,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1540 [2022-12-13 02:02:48,571 INFO L420 AbstractCegarLoop]: === Iteration 1542 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 46019777, now seen corresponding path program 1 times [2022-12-13 02:02:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:48,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926605635] [2022-12-13 02:02:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:48,636 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 02:02:48,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:48,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926605635] [2022-12-13 02:02:48,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926605635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:48,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:48,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219001475] [2022-12-13 02:02:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:48,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:48,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:48,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:48,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:48,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:48,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:48,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:48,680 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:48,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:48,680 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:48,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:48,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:48,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:48,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:48,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:48,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:48,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:48,682 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,682 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:48,682 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:48,682 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,685 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:48,685 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:48,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:48,685 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,685 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:48,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:48,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:02:48,808 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:48,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:48,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:48,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1541 [2022-12-13 02:02:48,809 INFO L420 AbstractCegarLoop]: === Iteration 1543 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 103278079, now seen corresponding path program 1 times [2022-12-13 02:02:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:48,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927076918] [2022-12-13 02:02:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:48,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:48,861 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 02:02:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:48,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927076918] [2022-12-13 02:02:48,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927076918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:48,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:48,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:48,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381698854] [2022-12-13 02:02:48,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:48,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:48,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:48,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:48,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:48,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:48,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:48,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:48,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:48,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:48,905 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:48,905 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:48,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:48,906 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:48,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:48,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:48,906 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:48,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:48,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:48,907 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:48,907 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:48,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:48,907 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:48,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:48,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:48,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,910 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:48,910 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:48,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:48,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:48,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:49,029 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:49,030 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:49,030 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:49,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:49,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:49,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1542 [2022-12-13 02:02:49,031 INFO L420 AbstractCegarLoop]: === Iteration 1544 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:49,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash 160536381, now seen corresponding path program 1 times [2022-12-13 02:02:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:49,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662936327] [2022-12-13 02:02:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:49,084 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 02:02:49,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662936327] [2022-12-13 02:02:49,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662936327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:49,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:49,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834710789] [2022-12-13 02:02:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:49,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:49,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:49,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:49,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:49,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:49,128 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:49,128 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:49,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:49,129 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:49,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:49,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:49,129 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:49,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:49,130 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:49,130 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:49,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:49,130 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:49,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:49,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,133 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:49,133 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:49,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:49,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:49,249 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:49,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:49,250 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:49,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:49,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1543 [2022-12-13 02:02:49,250 INFO L420 AbstractCegarLoop]: === Iteration 1545 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash 217794683, now seen corresponding path program 1 times [2022-12-13 02:02:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:49,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672487065] [2022-12-13 02:02:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:49,306 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 02:02:49,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672487065] [2022-12-13 02:02:49,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672487065] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:49,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:49,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151703748] [2022-12-13 02:02:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:49,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:49,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:49,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:49,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:49,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:49,358 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:49,358 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:49,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:49,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:49,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:49,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:49,359 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:49,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:49,360 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:49,360 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:49,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:49,360 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:49,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:49,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,363 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:49,363 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:49,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:49,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:49,494 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:49,495 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:49,495 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:49,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,495 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:49,495 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:49,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1544 [2022-12-13 02:02:49,496 INFO L420 AbstractCegarLoop]: === Iteration 1546 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:49,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash 275052985, now seen corresponding path program 1 times [2022-12-13 02:02:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:49,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489157158] [2022-12-13 02:02:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:49,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:49,551 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 02:02:49,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:49,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489157158] [2022-12-13 02:02:49,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489157158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:49,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:49,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609410693] [2022-12-13 02:02:49,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:49,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:49,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:49,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:49,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:49,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:49,598 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:49,598 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:49,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:49,598 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:49,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:49,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:49,599 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:49,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:49,600 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:49,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:49,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:49,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:49,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:49,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:49,603 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:49,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:49,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:49,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:49,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:02:49,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:49,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:49,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:49,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1545 [2022-12-13 02:02:49,727 INFO L420 AbstractCegarLoop]: === Iteration 1547 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:49,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:49,727 INFO L85 PathProgramCache]: Analyzing trace with hash 332311287, now seen corresponding path program 1 times [2022-12-13 02:02:49,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:49,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735323950] [2022-12-13 02:02:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:49,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:49,797 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 02:02:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:49,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735323950] [2022-12-13 02:02:49,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735323950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:49,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:49,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:49,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987272355] [2022-12-13 02:02:49,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:49,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:49,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:49,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:49,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:49,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:49,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:49,851 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:49,851 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:49,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:49,852 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:49,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:49,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:49,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:49,852 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:49,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:49,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:49,853 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:49,853 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:49,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:49,853 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,853 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:49,853 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:49,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:49,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,856 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:49,856 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:49,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:49,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:49,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:49,973 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:49,974 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:49,974 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:49,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:49,974 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:49,974 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:49,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1546 [2022-12-13 02:02:49,974 INFO L420 AbstractCegarLoop]: === Iteration 1548 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash 389569589, now seen corresponding path program 1 times [2022-12-13 02:02:49,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:49,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637888943] [2022-12-13 02:02:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:49,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:50,036 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 02:02:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:50,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637888943] [2022-12-13 02:02:50,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637888943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:50,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:50,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89790063] [2022-12-13 02:02:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:50,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:50,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:50,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:50,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:50,037 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:50,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:50,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:50,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:50,080 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:50,081 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:50,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:50,081 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:50,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:50,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:50,082 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:50,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:50,082 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:50,083 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:50,083 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:50,083 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:50,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:50,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,085 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:50,086 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:50,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:50,202 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:50,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:02:50,202 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:50,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:50,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1547 [2022-12-13 02:02:50,203 INFO L420 AbstractCegarLoop]: === Iteration 1549 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:50,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:50,203 INFO L85 PathProgramCache]: Analyzing trace with hash 446827891, now seen corresponding path program 1 times [2022-12-13 02:02:50,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:50,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667759413] [2022-12-13 02:02:50,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:50,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:50,259 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 02:02:50,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667759413] [2022-12-13 02:02:50,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667759413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:50,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602675134] [2022-12-13 02:02:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:50,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:50,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:50,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:50,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:50,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:50,323 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:50,323 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:50,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:50,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:50,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:50,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:50,324 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:50,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:50,325 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:50,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:50,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:50,325 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:50,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:50,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,328 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:50,328 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:50,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:50,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:50,461 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:50,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:02:50,462 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:50,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:50,462 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:50,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1548 [2022-12-13 02:02:50,462 INFO L420 AbstractCegarLoop]: === Iteration 1550 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash 504086193, now seen corresponding path program 1 times [2022-12-13 02:02:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:50,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497102851] [2022-12-13 02:02:50,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:50,525 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 02:02:50,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:50,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497102851] [2022-12-13 02:02:50,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497102851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:50,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:50,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:50,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679116196] [2022-12-13 02:02:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:50,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:50,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:50,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:50,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:50,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:50,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:50,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:50,585 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:50,585 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:50,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:50,586 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:50,586 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:50,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:50,586 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:50,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:50,587 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:50,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:50,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:50,587 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,587 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:50,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:50,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,590 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:50,590 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:50,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:50,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:50,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:50,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:50,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:50,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:50,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:50,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1549 [2022-12-13 02:02:50,724 INFO L420 AbstractCegarLoop]: === Iteration 1551 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:50,725 INFO L85 PathProgramCache]: Analyzing trace with hash 561344495, now seen corresponding path program 1 times [2022-12-13 02:02:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:50,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214404266] [2022-12-13 02:02:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:50,780 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 02:02:50,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:50,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214404266] [2022-12-13 02:02:50,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214404266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:50,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:50,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:50,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922876231] [2022-12-13 02:02:50,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:50,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:50,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:50,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:50,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:50,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:50,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:50,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:50,841 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:50,841 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:50,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:50,842 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:50,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:50,842 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:50,842 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:50,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:50,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:50,843 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:50,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:50,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:50,843 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:50,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:50,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:50,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,846 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:50,846 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:50,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:50,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:50,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:50,980 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:50,981 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:50,981 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:50,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:50,981 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:50,981 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:50,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1550 [2022-12-13 02:02:50,981 INFO L420 AbstractCegarLoop]: === Iteration 1552 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 618602797, now seen corresponding path program 1 times [2022-12-13 02:02:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185866033] [2022-12-13 02:02:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:50,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:02:51,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:51,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185866033] [2022-12-13 02:02:51,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185866033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:51,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:51,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407075572] [2022-12-13 02:02:51,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:51,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:51,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:51,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:51,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:51,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:51,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:51,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:51,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:51,101 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:51,101 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:51,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:51,102 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:51,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:51,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:51,103 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:51,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:51,103 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:51,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:51,104 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:51,104 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,104 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:51,104 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:51,104 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,106 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:51,107 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:51,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:51,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:51,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:51,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 02:02:51,252 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:51,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:51,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:51,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1551 [2022-12-13 02:02:51,253 INFO L420 AbstractCegarLoop]: === Iteration 1553 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 675861099, now seen corresponding path program 1 times [2022-12-13 02:02:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577433664] [2022-12-13 02:02:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:51,313 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 02:02:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:51,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577433664] [2022-12-13 02:02:51,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577433664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:51,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:51,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799141269] [2022-12-13 02:02:51,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:51,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:51,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:51,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:51,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:51,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:51,387 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:51,388 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:51,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:51,388 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:51,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:51,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:51,389 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:51,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:51,390 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:51,390 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:51,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:51,390 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:51,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:51,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,393 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:51,393 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:51,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:51,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:51,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:51,529 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:51,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:51,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:51,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1552 [2022-12-13 02:02:51,530 INFO L420 AbstractCegarLoop]: === Iteration 1554 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:51,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash 733119401, now seen corresponding path program 1 times [2022-12-13 02:02:51,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:51,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108665619] [2022-12-13 02:02:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:51,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:51,591 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 02:02:51,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:51,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108665619] [2022-12-13 02:02:51,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108665619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:51,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:51,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487491375] [2022-12-13 02:02:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:51,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:51,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:51,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:51,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:51,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:51,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:51,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:51,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:51,647 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:51,647 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:51,648 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:51,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:51,648 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:51,648 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:51,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:51,649 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,649 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:51,650 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:51,650 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:51,650 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,650 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:51,650 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:51,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,652 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:51,653 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:51,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:51,653 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,653 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:51,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:51,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:51,789 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:51,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:51,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:51,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1553 [2022-12-13 02:02:51,789 INFO L420 AbstractCegarLoop]: === Iteration 1555 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash 790377703, now seen corresponding path program 1 times [2022-12-13 02:02:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:51,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857316423] [2022-12-13 02:02:51,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:51,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:51,853 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 02:02:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:51,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857316423] [2022-12-13 02:02:51,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857316423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:51,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:51,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636831586] [2022-12-13 02:02:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:51,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:51,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:51,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:51,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:51,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:51,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:51,916 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:51,917 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:51,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:51,917 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:51,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:51,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:51,918 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:51,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:51,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:51,919 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:51,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:51,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:51,919 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:51,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:51,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:51,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:51,922 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:51,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:51,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:51,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:52,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:52,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:02:52,061 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:52,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:52,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:52,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1554 [2022-12-13 02:02:52,061 INFO L420 AbstractCegarLoop]: === Iteration 1556 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:52,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 847636005, now seen corresponding path program 1 times [2022-12-13 02:02:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:52,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636249109] [2022-12-13 02:02:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:52,122 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 02:02:52,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:52,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636249109] [2022-12-13 02:02:52,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636249109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:52,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:52,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:52,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962654735] [2022-12-13 02:02:52,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:52,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:52,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:52,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:52,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:52,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:52,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:52,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:52,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:52,185 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:52,186 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:52,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:52,186 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:52,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:52,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:52,187 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:52,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:52,188 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:52,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:52,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:52,189 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:52,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:52,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,193 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:52,193 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:52,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:52,193 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,193 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:52,327 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:52,328 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:52,328 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:52,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,328 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:52,328 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1555 [2022-12-13 02:02:52,328 INFO L420 AbstractCegarLoop]: === Iteration 1557 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:52,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:52,328 INFO L85 PathProgramCache]: Analyzing trace with hash 904894307, now seen corresponding path program 1 times [2022-12-13 02:02:52,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:52,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664871102] [2022-12-13 02:02:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:52,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:52,399 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 02:02:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:52,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664871102] [2022-12-13 02:02:52,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664871102] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:52,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:52,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:52,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034286030] [2022-12-13 02:02:52,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:52,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:52,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:52,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:52,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:52,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:52,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:52,450 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:52,450 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:52,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:52,451 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:52,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:52,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:52,452 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:52,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:52,452 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:52,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:52,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:52,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:52,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:52,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:52,456 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:52,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:52,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:52,591 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:52,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:52,592 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:52,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,592 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:52,592 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:52,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1556 [2022-12-13 02:02:52,592 INFO L420 AbstractCegarLoop]: === Iteration 1558 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:52,593 INFO L85 PathProgramCache]: Analyzing trace with hash 962152609, now seen corresponding path program 1 times [2022-12-13 02:02:52,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:52,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832383387] [2022-12-13 02:02:52,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:52,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:52,648 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 02:02:52,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:52,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832383387] [2022-12-13 02:02:52,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832383387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:52,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:52,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022168747] [2022-12-13 02:02:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:52,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:52,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:52,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:52,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:52,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:52,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:52,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:52,693 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:52,693 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:52,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:52,693 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:52,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:52,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:52,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:52,694 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:52,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:52,695 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:52,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:52,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:52,695 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:52,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:52,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,698 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:52,698 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:52,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:52,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:52,816 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:52,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:02:52,817 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:52,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:52,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:52,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1557 [2022-12-13 02:02:52,817 INFO L420 AbstractCegarLoop]: === Iteration 1559 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:52,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:52,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1019410911, now seen corresponding path program 1 times [2022-12-13 02:02:52,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:52,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731499709] [2022-12-13 02:02:52,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:52,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:52,881 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 02:02:52,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:52,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731499709] [2022-12-13 02:02:52,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731499709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:52,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:52,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:52,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455195120] [2022-12-13 02:02:52,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:52,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:52,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:52,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:52,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:52,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:52,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:52,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:52,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:52,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:52,932 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:52,932 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:52,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:52,932 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:52,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:52,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:52,933 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:52,933 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:52,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:52,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:52,934 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,934 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:52,934 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:52,934 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:52,934 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,934 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:52,934 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:52,934 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:52,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,937 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:52,937 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:52,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:52,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:52,937 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:53,054 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:53,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:53,055 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:53,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:53,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1558 [2022-12-13 02:02:53,055 INFO L420 AbstractCegarLoop]: === Iteration 1560 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:53,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1076669213, now seen corresponding path program 1 times [2022-12-13 02:02:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:53,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128788940] [2022-12-13 02:02:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:53,108 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 02:02:53,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:53,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128788940] [2022-12-13 02:02:53,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128788940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:53,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:53,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:53,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109088594] [2022-12-13 02:02:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:53,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:53,109 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:53,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:53,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:53,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:53,160 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:53,160 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:53,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:53,160 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:53,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:53,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:53,161 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:53,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:53,162 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:53,162 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:53,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:53,162 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:53,162 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:53,162 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,165 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:53,165 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:53,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:53,165 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,165 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:53,282 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:53,283 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:53,283 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:53,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,283 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:53,283 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:53,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1559 [2022-12-13 02:02:53,283 INFO L420 AbstractCegarLoop]: === Iteration 1561 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:53,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1133927515, now seen corresponding path program 1 times [2022-12-13 02:02:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:53,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71020738] [2022-12-13 02:02:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:53,338 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 02:02:53,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:53,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71020738] [2022-12-13 02:02:53,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71020738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:53,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:53,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:53,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605162425] [2022-12-13 02:02:53,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:53,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:53,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:53,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:53,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:53,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:53,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:53,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:53,389 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:53,389 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:53,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:53,389 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:53,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:53,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:53,390 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:53,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:53,391 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:53,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:53,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:53,391 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:53,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:53,391 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,394 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:53,394 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:53,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:53,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:53,512 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:53,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:53,512 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:53,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:53,513 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:53,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1560 [2022-12-13 02:02:53,513 INFO L420 AbstractCegarLoop]: === Iteration 1562 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1191185817, now seen corresponding path program 1 times [2022-12-13 02:02:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:53,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226667889] [2022-12-13 02:02:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:53,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:53,567 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 02:02:53,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:53,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226667889] [2022-12-13 02:02:53,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226667889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:53,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:53,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:53,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646085945] [2022-12-13 02:02:53,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:53,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:53,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:53,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:53,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:53,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:53,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:53,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:53,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:53,613 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:53,613 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:53,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:53,614 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:53,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:53,614 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:53,614 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:53,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:53,615 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,615 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:53,615 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:53,615 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:53,615 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:53,616 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:53,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,618 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:53,618 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:53,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:53,619 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,619 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:53,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:53,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:53,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:53,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:53,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:53,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1561 [2022-12-13 02:02:53,735 INFO L420 AbstractCegarLoop]: === Iteration 1563 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1248444119, now seen corresponding path program 1 times [2022-12-13 02:02:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:53,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043043429] [2022-12-13 02:02:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:53,789 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 02:02:53,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:53,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043043429] [2022-12-13 02:02:53,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043043429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:53,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:53,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:53,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436902425] [2022-12-13 02:02:53,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:53,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:53,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:53,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:53,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:53,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:53,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:53,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:53,835 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:53,835 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:53,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:53,836 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:53,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:53,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:53,837 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:53,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:53,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:53,837 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:53,838 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:53,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:53,838 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:53,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:53,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:53,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,841 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:53,841 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:53,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:53,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:53,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:53,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:53,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:53,958 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:53,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:53,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:53,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:53,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1562 [2022-12-13 02:02:53,958 INFO L420 AbstractCegarLoop]: === Iteration 1564 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1305702421, now seen corresponding path program 1 times [2022-12-13 02:02:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:53,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181606906] [2022-12-13 02:02:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:54,013 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 02:02:54,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:54,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181606906] [2022-12-13 02:02:54,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181606906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:54,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:54,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220982783] [2022-12-13 02:02:54,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:54,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:54,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:54,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:54,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:54,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:54,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:54,072 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:54,072 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:54,073 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:54,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:54,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:54,073 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:54,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:54,074 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:54,074 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:54,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:54,075 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,075 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:54,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:54,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,077 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:54,077 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:54,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:54,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:54,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:54,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:54,194 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:54,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,194 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:54,194 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1563 [2022-12-13 02:02:54,194 INFO L420 AbstractCegarLoop]: === Iteration 1565 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:54,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1362960723, now seen corresponding path program 1 times [2022-12-13 02:02:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:54,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568863213] [2022-12-13 02:02:54,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:54,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:54,248 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 02:02:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:54,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568863213] [2022-12-13 02:02:54,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568863213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:54,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:54,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976310224] [2022-12-13 02:02:54,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:54,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:54,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:54,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:54,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:54,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:54,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:54,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:54,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:54,293 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:54,293 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:54,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:54,294 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:54,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:54,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:54,294 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:54,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:54,295 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:54,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:54,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:54,295 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:54,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:54,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,298 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:54,299 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:54,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:54,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:54,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:54,418 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:54,418 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:54,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:54,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:54,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1564 [2022-12-13 02:02:54,419 INFO L420 AbstractCegarLoop]: === Iteration 1566 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:54,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1420219025, now seen corresponding path program 1 times [2022-12-13 02:02:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:54,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566314701] [2022-12-13 02:02:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:54,476 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 02:02:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566314701] [2022-12-13 02:02:54,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566314701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:54,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:54,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440235148] [2022-12-13 02:02:54,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:54,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:54,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:54,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:54,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:54,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:54,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:54,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:54,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:54,522 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:54,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:54,522 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:54,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:54,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:54,523 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:54,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:54,524 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:54,524 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:54,524 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:54,524 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:54,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:54,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,528 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:54,528 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:54,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:54,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:54,649 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:54,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:02:54,650 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:54,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:54,650 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:54,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1565 [2022-12-13 02:02:54,650 INFO L420 AbstractCegarLoop]: === Iteration 1567 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:54,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1477477327, now seen corresponding path program 1 times [2022-12-13 02:02:54,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:54,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738339683] [2022-12-13 02:02:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:54,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:54,706 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 02:02:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:54,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738339683] [2022-12-13 02:02:54,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738339683] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:54,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:54,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46689370] [2022-12-13 02:02:54,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:54,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:54,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:54,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:54,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:54,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:54,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:54,755 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:54,755 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:54,756 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:54,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:54,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:54,756 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:54,757 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,757 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:54,757 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:54,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:54,757 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:54,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:54,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,760 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:54,760 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:54,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:54,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:54,881 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:54,882 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:54,882 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:54,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:54,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:54,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1566 [2022-12-13 02:02:54,882 INFO L420 AbstractCegarLoop]: === Iteration 1568 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1534735629, now seen corresponding path program 1 times [2022-12-13 02:02:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:54,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345429768] [2022-12-13 02:02:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:54,936 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 02:02:54,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:54,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345429768] [2022-12-13 02:02:54,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345429768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:54,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:54,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766206268] [2022-12-13 02:02:54,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:54,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:54,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:54,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:54,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:54,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:54,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:54,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:54,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:54,980 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:54,981 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:54,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:54,981 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:54,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:54,982 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:54,982 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:54,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:54,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:54,982 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:54,983 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:54,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:54,983 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:54,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:54,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,985 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:54,985 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:54,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:54,986 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:54,986 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:55,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:55,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:02:55,111 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:55,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:55,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:55,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1567 [2022-12-13 02:02:55,111 INFO L420 AbstractCegarLoop]: === Iteration 1569 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1591993931, now seen corresponding path program 1 times [2022-12-13 02:02:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:55,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481688067] [2022-12-13 02:02:55,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:55,173 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 02:02:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:55,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481688067] [2022-12-13 02:02:55,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481688067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:55,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:55,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:55,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811311391] [2022-12-13 02:02:55,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:55,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:55,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:55,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:55,234 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:55,234 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:55,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:55,235 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:55,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:55,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:55,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:55,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:55,235 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:55,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:55,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:55,236 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:55,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:55,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:55,237 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:55,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:55,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:55,239 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:55,240 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:55,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:55,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:55,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:55,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:55,375 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:55,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:55,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:55,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1568 [2022-12-13 02:02:55,375 INFO L420 AbstractCegarLoop]: === Iteration 1570 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:55,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:55,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1649252233, now seen corresponding path program 1 times [2022-12-13 02:02:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:55,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702329986] [2022-12-13 02:02:55,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:55,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:55,447 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 02:02:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:55,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702329986] [2022-12-13 02:02:55,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702329986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:55,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:55,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:55,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471295455] [2022-12-13 02:02:55,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:55,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:55,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:55,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:55,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:55,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:55,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:55,499 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:55,499 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:55,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:55,500 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:55,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:55,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:55,500 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:55,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:55,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:55,501 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:55,501 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:55,501 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:55,501 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,501 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:55,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:55,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:55,504 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:55,504 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:55,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:55,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:55,505 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:55,634 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:55,635 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:02:55,635 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:55,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,635 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:55,635 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:55,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1569 [2022-12-13 02:02:55,636 INFO L420 AbstractCegarLoop]: === Iteration 1571 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1706510535, now seen corresponding path program 1 times [2022-12-13 02:02:55,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:55,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751902599] [2022-12-13 02:02:55,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:55,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:55,703 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 02:02:55,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:55,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751902599] [2022-12-13 02:02:55,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751902599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:55,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:55,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:55,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473594388] [2022-12-13 02:02:55,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:55,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:55,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:55,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:55,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:55,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:55,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:55,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:55,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:55,755 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:55,756 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:55,756 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:55,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:55,757 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:55,757 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:55,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:55,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:55,758 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:55,758 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:55,758 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:55,758 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,758 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:55,758 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:55,758 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:55,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:55,761 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:55,761 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:55,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:55,761 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:55,761 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:55,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:55,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:02:55,895 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:55,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:55,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:55,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1570 [2022-12-13 02:02:55,896 INFO L420 AbstractCegarLoop]: === Iteration 1572 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:55,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1763768837, now seen corresponding path program 1 times [2022-12-13 02:02:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:55,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732253010] [2022-12-13 02:02:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:55,969 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 02:02:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732253010] [2022-12-13 02:02:55,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732253010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:55,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:55,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15411817] [2022-12-13 02:02:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:55,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:55,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:55,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:55,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:55,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:55,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:55,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:56,023 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:56,023 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:56,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:56,024 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:56,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:56,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:56,025 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:56,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:56,026 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,026 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:56,026 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:56,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:56,026 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:56,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:56,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,029 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:56,029 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:56,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:56,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:56,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:56,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:02:56,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:56,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:56,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1571 [2022-12-13 02:02:56,169 INFO L420 AbstractCegarLoop]: === Iteration 1573 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:56,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:56,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1821027139, now seen corresponding path program 1 times [2022-12-13 02:02:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:56,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447236571] [2022-12-13 02:02:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:56,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:56,228 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 02:02:56,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:56,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447236571] [2022-12-13 02:02:56,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447236571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:56,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:56,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273944263] [2022-12-13 02:02:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:56,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:56,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:56,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:56,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:56,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:56,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:56,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:56,292 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:56,292 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:56,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:56,293 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:56,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:56,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:56,293 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:56,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:56,294 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:56,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:56,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:56,294 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:56,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:56,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:56,297 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:56,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:56,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:56,445 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:56,446 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 02:02:56,446 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:56,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,446 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:56,446 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:56,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1572 [2022-12-13 02:02:56,446 INFO L420 AbstractCegarLoop]: === Iteration 1574 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:56,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:56,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1878285441, now seen corresponding path program 1 times [2022-12-13 02:02:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:56,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734870146] [2022-12-13 02:02:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:56,506 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 02:02:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:56,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734870146] [2022-12-13 02:02:56,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734870146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:56,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:56,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:56,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261990810] [2022-12-13 02:02:56,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:56,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:56,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:56,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:56,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:56,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:56,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:56,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:56,569 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:56,570 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:56,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:56,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:56,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:56,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:56,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:56,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:56,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:56,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:56,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:56,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:56,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:56,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,575 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:56,575 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:56,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:56,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:56,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:56,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:02:56,710 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:56,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,710 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:56,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:56,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1573 [2022-12-13 02:02:56,711 INFO L420 AbstractCegarLoop]: === Iteration 1575 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1935543743, now seen corresponding path program 1 times [2022-12-13 02:02:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:56,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774988838] [2022-12-13 02:02:56,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:56,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 02:02:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:56,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774988838] [2022-12-13 02:02:56,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774988838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:56,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:56,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009743357] [2022-12-13 02:02:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:56,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:56,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:56,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:56,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:56,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:56,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:56,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:56,829 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:56,830 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:56,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:56,830 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:56,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:56,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:56,831 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:56,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:56,832 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:56,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:56,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:56,844 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:56,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:56,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:56,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,848 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:56,848 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:56,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:56,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:56,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:56,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:56,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:02:56,983 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:56,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:56,984 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:56,984 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:56,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1574 [2022-12-13 02:02:56,984 INFO L420 AbstractCegarLoop]: === Iteration 1576 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1992802045, now seen corresponding path program 1 times [2022-12-13 02:02:56,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:56,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515938130] [2022-12-13 02:02:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:57,058 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 02:02:57,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:57,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515938130] [2022-12-13 02:02:57,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515938130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:57,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:57,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:57,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41065338] [2022-12-13 02:02:57,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:57,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:57,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:57,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:57,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:57,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:57,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:57,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:57,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:57,114 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:57,115 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:57,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:57,115 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:57,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:57,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:57,116 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:57,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:57,117 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:57,117 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:57,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:57,117 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:57,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:57,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,120 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:57,120 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:57,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:57,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:57,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:57,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:02:57,260 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:57,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:57,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:57,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1575 [2022-12-13 02:02:57,260 INFO L420 AbstractCegarLoop]: === Iteration 1577 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2050060347, now seen corresponding path program 1 times [2022-12-13 02:02:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:57,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781404821] [2022-12-13 02:02:57,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:57,323 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 02:02:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781404821] [2022-12-13 02:02:57,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781404821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:57,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:57,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:57,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423780803] [2022-12-13 02:02:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:57,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:57,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:57,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:57,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:57,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:57,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:57,385 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:57,385 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:57,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:57,386 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:57,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:57,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:57,386 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:57,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:57,387 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:57,388 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:57,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:57,388 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,388 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:57,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:57,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,391 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:57,392 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:02:57,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:57,392 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,392 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:57,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:57,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:02:57,528 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:57,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,528 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:57,528 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:57,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1576 [2022-12-13 02:02:57,529 INFO L420 AbstractCegarLoop]: === Iteration 1578 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2107318649, now seen corresponding path program 1 times [2022-12-13 02:02:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:57,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005549255] [2022-12-13 02:02:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:57,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 02:02:57,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:57,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005549255] [2022-12-13 02:02:57,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005549255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:57,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:57,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:57,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057824578] [2022-12-13 02:02:57,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:57,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:57,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:57,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:57,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:57,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:57,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:57,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:57,650 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:57,650 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:57,651 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:57,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:57,651 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:57,651 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:57,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:57,652 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,652 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:57,652 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:57,652 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:57,653 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,653 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:57,653 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:57,653 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,655 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:57,655 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:57,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:57,656 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,656 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:57,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:57,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:57,773 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:57,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:57,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:57,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1577 [2022-12-13 02:02:57,773 INFO L420 AbstractCegarLoop]: === Iteration 1579 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:57,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2130390345, now seen corresponding path program 1 times [2022-12-13 02:02:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:57,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229659676] [2022-12-13 02:02:57,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:57,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:57,836 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 02:02:57,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:57,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229659676] [2022-12-13 02:02:57,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229659676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:57,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:57,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717563917] [2022-12-13 02:02:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:57,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:57,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:57,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:57,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:57,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:57,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:57,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:57,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:57,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:57,882 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:57,882 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:57,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:57,883 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:57,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:57,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:57,883 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:57,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:57,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:57,884 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,884 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:57,884 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:57,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:57,885 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:57,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:57,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:57,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,887 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:57,888 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:57,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:57,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:57,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:58,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:58,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:02:58,005 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:58,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:58,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:58,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1578 [2022-12-13 02:02:58,006 INFO L420 AbstractCegarLoop]: === Iteration 1580 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:58,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:58,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2073132043, now seen corresponding path program 1 times [2022-12-13 02:02:58,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:58,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137265827] [2022-12-13 02:02:58,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:58,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:58,061 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 02:02:58,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:58,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137265827] [2022-12-13 02:02:58,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137265827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:58,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:58,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:58,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851384078] [2022-12-13 02:02:58,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:58,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:58,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:58,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:58,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:58,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:58,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:58,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:58,113 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:58,113 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:58,113 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:58,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:58,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:58,114 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:58,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:58,115 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:58,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:58,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:58,115 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:58,115 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:58,115 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,118 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:58,118 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:58,118 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:58,235 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:58,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:58,236 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:58,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:58,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:58,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1579 [2022-12-13 02:02:58,236 INFO L420 AbstractCegarLoop]: === Iteration 1581 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:58,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2015873741, now seen corresponding path program 1 times [2022-12-13 02:02:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:58,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601640657] [2022-12-13 02:02:58,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:58,300 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 02:02:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:58,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601640657] [2022-12-13 02:02:58,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601640657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:58,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:58,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:58,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140430003] [2022-12-13 02:02:58,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:58,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:58,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:58,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:58,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:58,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:58,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:58,345 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:58,345 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:58,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:58,346 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:58,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:58,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:58,346 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:58,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:58,347 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:58,347 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:58,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:58,347 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,348 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:58,348 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:58,348 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,350 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:58,350 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:58,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:58,351 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,351 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:58,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:58,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:02:58,472 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:58,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,472 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:58,472 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:58,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1580 [2022-12-13 02:02:58,472 INFO L420 AbstractCegarLoop]: === Iteration 1582 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:58,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:58,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1958615439, now seen corresponding path program 1 times [2022-12-13 02:02:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:58,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005674145] [2022-12-13 02:02:58,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:58,528 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 02:02:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:58,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005674145] [2022-12-13 02:02:58,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005674145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:58,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:58,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539649844] [2022-12-13 02:02:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:58,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:58,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:58,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:58,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:58,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:58,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:58,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:58,574 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:58,574 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:58,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:58,575 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:58,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:58,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:58,576 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:58,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:58,576 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:58,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:58,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:58,577 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:58,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:58,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,580 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:58,580 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:58,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:58,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:58,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:58,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:58,698 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:58,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:58,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:58,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1581 [2022-12-13 02:02:58,699 INFO L420 AbstractCegarLoop]: === Iteration 1583 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:58,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:58,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1901357137, now seen corresponding path program 1 times [2022-12-13 02:02:58,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:58,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499349895] [2022-12-13 02:02:58,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:58,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:58,752 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 02:02:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:58,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499349895] [2022-12-13 02:02:58,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499349895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:58,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:58,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230515195] [2022-12-13 02:02:58,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:58,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:58,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:58,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:58,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:58,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:58,803 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:58,804 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:58,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:58,804 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:58,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:58,805 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:58,805 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:58,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:58,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:58,806 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:58,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:58,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:58,806 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,806 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:58,806 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:58,806 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:58,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,809 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:58,809 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:58,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:58,809 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:58,809 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:58,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:58,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:02:58,932 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:58,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:58,932 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:58,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1582 [2022-12-13 02:02:58,932 INFO L420 AbstractCegarLoop]: === Iteration 1584 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:58,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:58,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1844098835, now seen corresponding path program 1 times [2022-12-13 02:02:58,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:58,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387873399] [2022-12-13 02:02:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:58,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:58,989 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 02:02:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:58,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387873399] [2022-12-13 02:02:58,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387873399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:58,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:58,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:58,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156409111] [2022-12-13 02:02:58,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:58,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:58,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:58,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:58,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:58,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:58,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:58,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:59,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:59,043 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:59,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:59,043 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:59,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:59,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:59,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:59,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:59,045 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:59,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:59,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:59,045 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:59,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:59,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,048 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:59,048 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:59,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:59,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:59,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:59,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:02:59,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:59,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:59,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:59,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1583 [2022-12-13 02:02:59,168 INFO L420 AbstractCegarLoop]: === Iteration 1585 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:59,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1786840533, now seen corresponding path program 1 times [2022-12-13 02:02:59,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:59,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544915332] [2022-12-13 02:02:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:59,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:59,222 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 02:02:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:59,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544915332] [2022-12-13 02:02:59,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544915332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:59,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:59,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841297088] [2022-12-13 02:02:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:59,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:59,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:59,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:59,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:59,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:59,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:59,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:59,266 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:59,266 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:59,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:59,266 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:59,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:59,267 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:59,267 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:59,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:59,268 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:59,268 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:59,268 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:59,268 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,268 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:59,268 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:59,268 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,271 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:59,271 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:59,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:59,271 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,271 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:59,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:59,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:02:59,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:59,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:59,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:59,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1584 [2022-12-13 02:02:59,403 INFO L420 AbstractCegarLoop]: === Iteration 1586 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1729582231, now seen corresponding path program 1 times [2022-12-13 02:02:59,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:59,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853272493] [2022-12-13 02:02:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:59,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:59,456 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 02:02:59,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:59,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853272493] [2022-12-13 02:02:59,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853272493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:59,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:59,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:59,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355624387] [2022-12-13 02:02:59,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:59,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:59,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:59,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:59,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:59,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:59,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:59,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:59,511 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:59,511 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:59,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:59,512 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:59,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:59,512 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:59,512 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:59,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:59,513 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,513 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:59,513 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:59,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:59,513 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:59,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:59,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,517 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:59,517 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:59,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:59,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:59,634 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:59,634 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:02:59,634 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:59,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:59,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:59,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1585 [2022-12-13 02:02:59,635 INFO L420 AbstractCegarLoop]: === Iteration 1587 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1672323929, now seen corresponding path program 1 times [2022-12-13 02:02:59,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:59,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997461581] [2022-12-13 02:02:59,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:59,690 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 02:02:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:59,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997461581] [2022-12-13 02:02:59,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997461581] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:59,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:59,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256706209] [2022-12-13 02:02:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:59,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:59,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:59,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:59,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:59,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:59,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:59,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:59,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:59,736 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:59,736 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:02:59,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:59,736 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:59,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:59,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:59,737 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:59,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:59,738 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:59,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:59,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:59,738 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:59,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:59,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,741 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:59,741 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:59,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:59,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:02:59,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:02:59,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:02:59,862 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:02:59,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:02:59,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:02:59,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1586 [2022-12-13 02:02:59,863 INFO L420 AbstractCegarLoop]: === Iteration 1588 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:02:59,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:02:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1615065627, now seen corresponding path program 1 times [2022-12-13 02:02:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:02:59,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626072397] [2022-12-13 02:02:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:02:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:02:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:02:59,926 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 02:02:59,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:02:59,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626072397] [2022-12-13 02:02:59,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626072397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:02:59,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:02:59,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:02:59,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530027676] [2022-12-13 02:02:59,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:02:59,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:02:59,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:02:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:02:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:02:59,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:02:59,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:02:59,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:02:59,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:02:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:02:59,970 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:02:59,970 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:02:59,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:02:59,971 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:02:59,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:02:59,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:02:59,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:02:59,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:02:59,971 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:02:59,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:02:59,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:02:59,972 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:02:59,972 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:02:59,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:02:59,972 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,973 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:02:59,973 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:02:59,973 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:02:59,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,975 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:02:59,975 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:02:59,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:02:59,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:02:59,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:00,093 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:00,094 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:00,094 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:00,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,094 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:00,094 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:00,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1587 [2022-12-13 02:03:00,094 INFO L420 AbstractCegarLoop]: === Iteration 1589 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:00,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1557807325, now seen corresponding path program 1 times [2022-12-13 02:03:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:00,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692811765] [2022-12-13 02:03:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:00,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:00,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692811765] [2022-12-13 02:03:00,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692811765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:00,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:00,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:00,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939688437] [2022-12-13 02:03:00,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:00,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:00,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:00,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:00,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:00,201 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:00,201 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:00,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:00,201 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:00,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:00,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:00,202 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:00,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:00,203 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,203 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:00,203 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:00,203 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:00,203 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,203 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:00,203 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:00,203 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,206 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:00,206 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:00,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:00,206 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,206 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:00,321 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:00,321 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:00,321 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:00,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,322 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:00,322 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:00,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1588 [2022-12-13 02:03:00,322 INFO L420 AbstractCegarLoop]: === Iteration 1590 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1500549023, now seen corresponding path program 1 times [2022-12-13 02:03:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:00,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194936647] [2022-12-13 02:03:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:00,379 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 02:03:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:00,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194936647] [2022-12-13 02:03:00,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194936647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:00,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:00,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:00,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421763112] [2022-12-13 02:03:00,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:00,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:00,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:00,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:00,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:00,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:00,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:00,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:00,423 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:00,424 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:00,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:00,424 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:00,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:00,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:00,425 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:00,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:00,425 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:00,425 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:00,426 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:00,426 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,426 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:00,426 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:00,426 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,428 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:00,428 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:00,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:00,429 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,429 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:00,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:00,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:00,546 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:00,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:00,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:00,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1589 [2022-12-13 02:03:00,546 INFO L420 AbstractCegarLoop]: === Iteration 1591 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:00,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:00,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1443290721, now seen corresponding path program 1 times [2022-12-13 02:03:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:00,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031088209] [2022-12-13 02:03:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:00,600 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 02:03:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031088209] [2022-12-13 02:03:00,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031088209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:00,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:00,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606683035] [2022-12-13 02:03:00,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:00,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:00,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:00,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:00,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:00,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:00,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:00,644 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:00,644 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:00,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:00,644 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:00,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:00,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:00,645 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:00,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:00,646 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:00,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:00,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:00,646 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,646 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:00,646 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:00,646 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,649 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:00,649 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:00,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:00,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:00,765 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:00,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:00,766 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:00,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,766 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:00,766 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:00,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1590 [2022-12-13 02:03:00,766 INFO L420 AbstractCegarLoop]: === Iteration 1592 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1386032419, now seen corresponding path program 1 times [2022-12-13 02:03:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:00,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452154986] [2022-12-13 02:03:00,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:00,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:00,840 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 02:03:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:00,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452154986] [2022-12-13 02:03:00,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452154986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:00,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:00,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:00,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030828178] [2022-12-13 02:03:00,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:00,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:00,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:00,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:00,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:00,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:00,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:00,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:00,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:00,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:00,894 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:00,895 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:00,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:00,895 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:00,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:00,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:00,896 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:00,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:00,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:00,897 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,897 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:00,897 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:00,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:00,897 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:00,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:00,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:00,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,900 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:00,900 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:00,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:00,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:00,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:01,036 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:01,038 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:03:01,038 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:01,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:01,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:01,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1591 [2022-12-13 02:03:01,038 INFO L420 AbstractCegarLoop]: === Iteration 1593 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1328774117, now seen corresponding path program 1 times [2022-12-13 02:03:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:01,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063929398] [2022-12-13 02:03:01,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:01,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:01,099 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 02:03:01,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:01,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063929398] [2022-12-13 02:03:01,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063929398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:01,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:01,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:01,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840450089] [2022-12-13 02:03:01,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:01,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:01,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:01,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:01,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:01,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:01,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:01,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:01,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:01,160 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:01,161 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:01,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:01,161 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:01,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:01,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:01,162 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:01,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:01,163 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:01,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:01,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:01,163 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:01,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:01,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,166 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:01,166 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:01,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:01,166 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,166 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:01,302 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:01,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:01,303 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:01,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,303 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:01,303 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:01,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1592 [2022-12-13 02:03:01,304 INFO L420 AbstractCegarLoop]: === Iteration 1594 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:01,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:01,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1271515815, now seen corresponding path program 1 times [2022-12-13 02:03:01,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:01,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941619214] [2022-12-13 02:03:01,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:01,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:01,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 02:03:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:01,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941619214] [2022-12-13 02:03:01,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941619214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:01,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:01,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691312971] [2022-12-13 02:03:01,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:01,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:01,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:01,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:01,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:01,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:01,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:01,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:01,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:01,414 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:01,415 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:01,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:01,415 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:01,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:01,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:01,416 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:01,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:01,417 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,417 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:01,417 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:01,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:01,417 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:01,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:01,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,421 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:01,421 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:01,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:01,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:01,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:01,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:01,553 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:01,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:01,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:01,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1593 [2022-12-13 02:03:01,553 INFO L420 AbstractCegarLoop]: === Iteration 1595 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1214257513, now seen corresponding path program 1 times [2022-12-13 02:03:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:01,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539534116] [2022-12-13 02:03:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:01,616 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 02:03:01,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:01,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539534116] [2022-12-13 02:03:01,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539534116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:01,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:01,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:01,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048369748] [2022-12-13 02:03:01,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:01,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:01,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:01,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:01,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:01,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:01,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:01,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:01,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:01,672 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:01,672 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:01,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:01,673 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:01,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:01,673 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:01,673 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:01,674 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,674 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:01,674 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:01,674 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:01,674 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:01,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:01,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,677 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:01,677 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:01,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:01,678 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,678 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:01,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:01,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:01,808 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:01,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,808 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:01,808 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:01,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1594 [2022-12-13 02:03:01,808 INFO L420 AbstractCegarLoop]: === Iteration 1596 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:01,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1156999211, now seen corresponding path program 1 times [2022-12-13 02:03:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:01,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663705673] [2022-12-13 02:03:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:01,860 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 02:03:01,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:01,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663705673] [2022-12-13 02:03:01,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663705673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:01,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:01,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:01,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891434375] [2022-12-13 02:03:01,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:01,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:01,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:01,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:01,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:01,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:01,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:01,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:01,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:01,906 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:01,906 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:01,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:01,906 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:01,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:01,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:01,907 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:01,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:01,908 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:01,908 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:01,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:01,908 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:01,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:01,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:01,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,911 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:01,911 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:01,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:01,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:01,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:02,027 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:02,028 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:02,028 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:02,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,028 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:02,028 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:02,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1595 [2022-12-13 02:03:02,028 INFO L420 AbstractCegarLoop]: === Iteration 1597 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1099740909, now seen corresponding path program 1 times [2022-12-13 02:03:02,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:02,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183512732] [2022-12-13 02:03:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:02,082 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 02:03:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:02,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183512732] [2022-12-13 02:03:02,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183512732] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:02,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:02,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302767371] [2022-12-13 02:03:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:02,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:02,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:02,082 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:02,082 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:02,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:02,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:02,133 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:02,133 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:02,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:02,133 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:02,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:02,142 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:02,142 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:02,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:02,143 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,143 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:02,143 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:02,143 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:02,144 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:02,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:02,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,147 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:02,147 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:02,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:02,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:02,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:02,261 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:02,262 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:02,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:02,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:02,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1596 [2022-12-13 02:03:02,262 INFO L420 AbstractCegarLoop]: === Iteration 1598 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:02,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1042482607, now seen corresponding path program 1 times [2022-12-13 02:03:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:02,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700398893] [2022-12-13 02:03:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:02,315 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 02:03:02,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:02,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700398893] [2022-12-13 02:03:02,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700398893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:02,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:02,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:02,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250576312] [2022-12-13 02:03:02,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:02,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:02,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:02,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:02,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:02,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:02,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:02,358 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:02,358 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:02,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:02,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:02,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:02,359 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:02,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:02,360 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,360 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:02,360 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:02,360 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:02,360 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,360 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:02,360 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:02,360 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,363 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:02,363 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:02,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:02,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:02,478 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:02,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:02,478 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:02,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:02,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:02,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1597 [2022-12-13 02:03:02,479 INFO L420 AbstractCegarLoop]: === Iteration 1599 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:02,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -985224305, now seen corresponding path program 1 times [2022-12-13 02:03:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:02,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923893250] [2022-12-13 02:03:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:02,533 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 02:03:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:02,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923893250] [2022-12-13 02:03:02,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923893250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:02,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:02,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170989705] [2022-12-13 02:03:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:02,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:02,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:02,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:02,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:02,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:02,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:02,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:02,583 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:02,583 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:02,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:02,584 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:02,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:02,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:02,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:02,584 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:02,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:02,585 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:02,585 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:02,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:02,585 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:02,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:02,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,588 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:02,588 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:02,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:02,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:02,703 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:02,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:02,704 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:02,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:02,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:02,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1598 [2022-12-13 02:03:02,704 INFO L420 AbstractCegarLoop]: === Iteration 1600 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash -927966003, now seen corresponding path program 1 times [2022-12-13 02:03:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:02,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005823145] [2022-12-13 02:03:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:02,756 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 02:03:02,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:02,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005823145] [2022-12-13 02:03:02,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005823145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:02,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:02,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974802928] [2022-12-13 02:03:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:02,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:02,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:02,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:02,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:02,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:02,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:02,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:02,800 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:02,801 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:02,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:02,801 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:02,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:02,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:02,802 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:02,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:02,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:02,802 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:02,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:02,803 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:02,803 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:02,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:02,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:02,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,805 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:02,805 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:02,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:02,806 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:02,806 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:02,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:02,920 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:03:02,920 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:02,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,920 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:02,920 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:02,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1599 [2022-12-13 02:03:02,921 INFO L420 AbstractCegarLoop]: === Iteration 1601 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:02,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -870707701, now seen corresponding path program 1 times [2022-12-13 02:03:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:02,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392762657] [2022-12-13 02:03:02,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:02,977 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 02:03:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:02,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392762657] [2022-12-13 02:03:02,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392762657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:02,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:02,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310467418] [2022-12-13 02:03:02,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:02,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:02,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:02,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:02,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:02,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:02,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:02,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:02,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:03,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:03,030 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:03,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:03,030 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:03,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:03,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:03,031 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:03,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:03,032 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:03,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:03,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:03,032 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:03,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:03,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,035 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:03,035 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:03,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:03,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:03,156 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:03,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:03,156 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:03,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:03,157 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1600 [2022-12-13 02:03:03,157 INFO L420 AbstractCegarLoop]: === Iteration 1602 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -813449399, now seen corresponding path program 1 times [2022-12-13 02:03:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241251196] [2022-12-13 02:03:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:03,212 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 02:03:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241251196] [2022-12-13 02:03:03,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241251196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:03,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:03,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:03,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521568605] [2022-12-13 02:03:03,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:03,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:03,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:03,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:03,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:03,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:03,264 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:03,264 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:03,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:03,265 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:03,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:03,265 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:03,265 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:03,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:03,266 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,266 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:03,266 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:03,266 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:03,266 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,267 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:03,267 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:03,267 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,269 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:03,269 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:03,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:03,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,270 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:03,394 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:03,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:03:03,395 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:03,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:03,395 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:03,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1601 [2022-12-13 02:03:03,395 INFO L420 AbstractCegarLoop]: === Iteration 1603 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash -756191097, now seen corresponding path program 1 times [2022-12-13 02:03:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:03,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171596431] [2022-12-13 02:03:03,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:03,470 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 02:03:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:03,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171596431] [2022-12-13 02:03:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171596431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:03,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:03,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403138210] [2022-12-13 02:03:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:03,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:03,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:03,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:03,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:03,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:03,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:03,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:03,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:03,521 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:03,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:03,521 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:03,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:03,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:03,522 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:03,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:03,523 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:03,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:03,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:03,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:03,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:03,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,526 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:03,526 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:03,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:03,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:03,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:03:03,641 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:03,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:03,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:03,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1602 [2022-12-13 02:03:03,641 INFO L420 AbstractCegarLoop]: === Iteration 1604 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:03,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -698932795, now seen corresponding path program 1 times [2022-12-13 02:03:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:03,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653581902] [2022-12-13 02:03:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:03,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:03,701 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 02:03:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:03,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653581902] [2022-12-13 02:03:03,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653581902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:03,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:03,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:03,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073082873] [2022-12-13 02:03:03,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:03,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:03,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:03,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:03,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:03,702 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:03,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:03,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:03,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:03,753 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:03,753 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:03,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:03,753 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:03,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:03,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:03,754 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:03,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:03,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:03,755 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:03,755 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:03,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:03,755 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:03,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:03,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:03,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,758 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:03,758 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:03,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:03,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:03,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:03,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:03,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:03:03,885 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:03,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:03,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:03,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1603 [2022-12-13 02:03:03,885 INFO L420 AbstractCegarLoop]: === Iteration 1605 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash -641674493, now seen corresponding path program 1 times [2022-12-13 02:03:03,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:03,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810934539] [2022-12-13 02:03:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:03,942 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 02:03:03,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:03,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810934539] [2022-12-13 02:03:03,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810934539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:03,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:03,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299009050] [2022-12-13 02:03:03,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:03,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:03,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:03,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:03,943 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:03,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:03,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:03,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:03,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:04,001 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:04,002 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:04,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:04,002 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:04,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:04,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:04,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:04,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:04,003 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:04,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:04,004 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:04,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:04,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:04,004 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,004 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:04,004 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:04,004 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,007 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:04,007 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:04,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:04,007 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,007 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:04,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:04,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:04,138 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:04,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:04,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:04,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1604 [2022-12-13 02:03:04,138 INFO L420 AbstractCegarLoop]: === Iteration 1606 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:04,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:04,139 INFO L85 PathProgramCache]: Analyzing trace with hash -584416191, now seen corresponding path program 1 times [2022-12-13 02:03:04,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:04,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534948256] [2022-12-13 02:03:04,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:04,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:04,196 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 02:03:04,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:04,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534948256] [2022-12-13 02:03:04,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534948256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:04,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:04,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:04,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67786725] [2022-12-13 02:03:04,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:04,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:04,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:04,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:04,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:04,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:04,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:04,255 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:04,255 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:04,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:04,256 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:04,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:04,257 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:04,257 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:04,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:04,257 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:04,258 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:04,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:04,258 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,258 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:04,258 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:04,258 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,261 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:04,261 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:04,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:04,261 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,261 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:04,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:04,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:04,392 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:04,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:04,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:04,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1605 [2022-12-13 02:03:04,392 INFO L420 AbstractCegarLoop]: === Iteration 1607 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash -527157889, now seen corresponding path program 1 times [2022-12-13 02:03:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:04,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947360420] [2022-12-13 02:03:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:04,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947360420] [2022-12-13 02:03:04,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947360420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:04,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:04,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685763804] [2022-12-13 02:03:04,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:04,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:04,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:04,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:04,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:04,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:04,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:04,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:04,504 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:04,504 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:04,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:04,505 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:04,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:04,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:04,505 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:04,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:04,506 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:04,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:04,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:04,506 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:04,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:04,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,509 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:04,509 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:04,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:04,509 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,509 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:04,640 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:04,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:04,641 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:04,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:04,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1606 [2022-12-13 02:03:04,641 INFO L420 AbstractCegarLoop]: === Iteration 1608 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -469899587, now seen corresponding path program 1 times [2022-12-13 02:03:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:04,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195467306] [2022-12-13 02:03:04,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:04,708 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 02:03:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:04,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195467306] [2022-12-13 02:03:04,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195467306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:04,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:04,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350606619] [2022-12-13 02:03:04,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:04,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:04,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:04,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:04,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:04,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:04,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:04,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:04,781 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:04,781 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:04,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:04,782 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:04,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:04,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:04,783 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:04,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:04,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:04,783 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:04,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:04,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:04,784 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:04,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:04,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:04,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,787 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:04,787 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:04,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:04,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:04,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:04,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:04,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:04,919 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:04,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:04,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:04,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1607 [2022-12-13 02:03:04,919 INFO L420 AbstractCegarLoop]: === Iteration 1609 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:04,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:04,920 INFO L85 PathProgramCache]: Analyzing trace with hash -412641285, now seen corresponding path program 1 times [2022-12-13 02:03:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:04,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726733426] [2022-12-13 02:03:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:04,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:04,978 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 02:03:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:04,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726733426] [2022-12-13 02:03:04,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726733426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:04,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:04,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:04,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557527799] [2022-12-13 02:03:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:04,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:04,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:04,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:04,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:04,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:04,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:05,040 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:05,041 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:05,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:05,041 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:05,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:05,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:05,042 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:05,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:05,043 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,043 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:05,043 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:05,043 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:05,043 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,043 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:05,043 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:05,043 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,046 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:05,046 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:05,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:05,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:05,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:05,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:05,180 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:05,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:05,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:05,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1608 [2022-12-13 02:03:05,180 INFO L420 AbstractCegarLoop]: === Iteration 1610 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:05,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:05,180 INFO L85 PathProgramCache]: Analyzing trace with hash -355382983, now seen corresponding path program 1 times [2022-12-13 02:03:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:05,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570494224] [2022-12-13 02:03:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:05,237 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 02:03:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:05,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570494224] [2022-12-13 02:03:05,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570494224] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:05,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:05,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038800803] [2022-12-13 02:03:05,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:05,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:05,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:05,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:05,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:05,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:05,291 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:05,291 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:05,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:05,291 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:05,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:05,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:05,292 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:05,293 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:05,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:05,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:05,293 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:05,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:05,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,296 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:05,296 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:05,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:05,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:05,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:05,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:05,428 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:05,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:05,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:05,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1609 [2022-12-13 02:03:05,429 INFO L420 AbstractCegarLoop]: === Iteration 1611 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:05,429 INFO L85 PathProgramCache]: Analyzing trace with hash -298124681, now seen corresponding path program 1 times [2022-12-13 02:03:05,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:05,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560610226] [2022-12-13 02:03:05,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:05,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:05,489 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 02:03:05,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:05,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560610226] [2022-12-13 02:03:05,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560610226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:05,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:05,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:05,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109450567] [2022-12-13 02:03:05,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:05,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:05,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:05,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:05,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:05,490 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:05,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:05,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:05,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:05,550 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:05,550 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:05,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:05,550 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:05,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:05,551 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:05,551 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:05,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:05,552 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,552 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:05,552 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:05,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:05,552 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,552 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:05,552 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:05,552 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,555 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:05,555 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:05,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:05,555 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,555 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:05,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:05,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:05,689 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:05,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:05,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:05,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1610 [2022-12-13 02:03:05,689 INFO L420 AbstractCegarLoop]: === Iteration 1612 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -240866379, now seen corresponding path program 1 times [2022-12-13 02:03:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:05,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764102543] [2022-12-13 02:03:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:05,754 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 02:03:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:05,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764102543] [2022-12-13 02:03:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764102543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:05,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:05,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884798603] [2022-12-13 02:03:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:05,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:05,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:05,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:05,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:05,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:05,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:05,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:05,821 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:05,822 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:05,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:05,822 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:05,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:05,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:05,823 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:05,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:05,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:05,824 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:05,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:05,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:05,824 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:05,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:05,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:05,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,827 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:05,827 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:05,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:05,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:05,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:05,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:05,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 02:03:05,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:05,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:05,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1611 [2022-12-13 02:03:05,988 INFO L420 AbstractCegarLoop]: === Iteration 1613 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash -183608077, now seen corresponding path program 1 times [2022-12-13 02:03:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:05,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352017364] [2022-12-13 02:03:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:06,051 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 02:03:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:06,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352017364] [2022-12-13 02:03:06,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352017364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:06,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:06,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:06,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306500063] [2022-12-13 02:03:06,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:06,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:06,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:06,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:06,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:06,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:06,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:06,125 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:06,125 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:06,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:06,125 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:06,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:06,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:06,126 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:06,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:06,127 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,127 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:06,127 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:06,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:06,127 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:06,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:06,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,130 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:06,130 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:06,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:06,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:06,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:06,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:06,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:06,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:06,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:06,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1612 [2022-12-13 02:03:06,266 INFO L420 AbstractCegarLoop]: === Iteration 1614 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:06,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:06,266 INFO L85 PathProgramCache]: Analyzing trace with hash -126349775, now seen corresponding path program 1 times [2022-12-13 02:03:06,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:06,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108387743] [2022-12-13 02:03:06,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:06,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:06,339 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 02:03:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:06,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108387743] [2022-12-13 02:03:06,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108387743] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:06,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:06,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710518785] [2022-12-13 02:03:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:06,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:06,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:06,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:06,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:06,340 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:06,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:06,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:06,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:06,384 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:06,384 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:06,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:06,384 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:06,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:06,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:06,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:06,385 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:06,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:06,386 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:06,386 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:06,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:06,386 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,386 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:06,386 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:06,386 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,389 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:06,389 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:06,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:06,389 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,389 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:06,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:06,510 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:06,510 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:06,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,510 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:06,510 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:06,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1613 [2022-12-13 02:03:06,511 INFO L420 AbstractCegarLoop]: === Iteration 1615 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash -69091473, now seen corresponding path program 1 times [2022-12-13 02:03:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:06,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203836885] [2022-12-13 02:03:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:06,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:06,573 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 02:03:06,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:06,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203836885] [2022-12-13 02:03:06,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203836885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:06,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:06,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76097201] [2022-12-13 02:03:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:06,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:06,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:06,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:06,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:06,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:06,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:06,618 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:06,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:06,618 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:06,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:06,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:06,619 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:06,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:06,619 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:06,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:06,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:06,620 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:06,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:06,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,622 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:06,622 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:06,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:06,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:06,737 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:06,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:06,738 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:06,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:06,738 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1614 [2022-12-13 02:03:06,738 INFO L420 AbstractCegarLoop]: === Iteration 1616 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash -11833171, now seen corresponding path program 1 times [2022-12-13 02:03:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:06,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860062960] [2022-12-13 02:03:06,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:06,790 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 02:03:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:06,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860062960] [2022-12-13 02:03:06,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860062960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:06,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:06,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:06,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783876200] [2022-12-13 02:03:06,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:06,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:06,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:06,791 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:06,791 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:06,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:06,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:06,836 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:06,836 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:06,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:06,836 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:06,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:06,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:06,837 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:06,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:06,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:06,838 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:06,838 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:06,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:06,838 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:06,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:06,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:06,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,841 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:06,841 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:06,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:06,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:06,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:06,958 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:06,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:06,959 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:06,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:06,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:06,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:06,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1615 [2022-12-13 02:03:06,959 INFO L420 AbstractCegarLoop]: === Iteration 1617 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 45425131, now seen corresponding path program 1 times [2022-12-13 02:03:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:06,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883787011] [2022-12-13 02:03:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:06,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:07,013 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 02:03:07,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:07,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883787011] [2022-12-13 02:03:07,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883787011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:07,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:07,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:07,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091392916] [2022-12-13 02:03:07,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:07,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:07,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:07,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:07,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:07,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:07,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:07,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:07,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:07,063 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:07,063 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:07,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:07,064 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:07,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:07,064 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:07,064 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:07,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:07,065 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,065 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:07,065 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:07,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:07,065 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:07,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:07,066 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,068 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:07,068 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:07,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:07,069 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,069 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:07,183 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:07,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:07,184 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:07,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:07,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:07,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1616 [2022-12-13 02:03:07,184 INFO L420 AbstractCegarLoop]: === Iteration 1618 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 102683433, now seen corresponding path program 1 times [2022-12-13 02:03:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509078329] [2022-12-13 02:03:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:07,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:07,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509078329] [2022-12-13 02:03:07,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509078329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:07,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:07,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:07,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515833238] [2022-12-13 02:03:07,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:07,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:07,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:07,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:07,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:07,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:07,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:07,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:07,283 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:07,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:07,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:07,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:07,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:07,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:07,284 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:07,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:07,285 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:07,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:07,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:07,285 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:07,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:07,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,288 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:07,288 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:07,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:07,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:07,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:07,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:07,405 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:07,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:07,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:07,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1617 [2022-12-13 02:03:07,405 INFO L420 AbstractCegarLoop]: === Iteration 1619 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:07,405 INFO L85 PathProgramCache]: Analyzing trace with hash 159941735, now seen corresponding path program 1 times [2022-12-13 02:03:07,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:07,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852818994] [2022-12-13 02:03:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:07,468 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 02:03:07,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:07,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852818994] [2022-12-13 02:03:07,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852818994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:07,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:07,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:07,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889522895] [2022-12-13 02:03:07,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:07,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:07,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:07,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:07,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:07,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:07,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:07,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:07,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:07,541 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:07,541 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:07,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:07,541 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:07,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:07,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:07,542 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:07,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:07,543 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:07,543 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:07,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:07,543 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:07,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:07,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,546 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:07,546 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:07,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:07,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:07,665 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:07,666 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:03:07,666 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:07,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:07,666 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:07,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1618 [2022-12-13 02:03:07,666 INFO L420 AbstractCegarLoop]: === Iteration 1620 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 217200037, now seen corresponding path program 1 times [2022-12-13 02:03:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705300281] [2022-12-13 02:03:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:07,720 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 02:03:07,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:07,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705300281] [2022-12-13 02:03:07,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705300281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:07,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:07,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:07,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12645240] [2022-12-13 02:03:07,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:07,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:07,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:07,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:07,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:07,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:07,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:07,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:07,777 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:07,777 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:07,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:07,777 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:07,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:07,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:07,778 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:07,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:07,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:07,779 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:07,779 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:07,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:07,779 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:07,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:07,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,782 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:07,782 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:07,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:07,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:07,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:07,904 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:07,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:03:07,905 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:07,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:07,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:07,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1619 [2022-12-13 02:03:07,905 INFO L420 AbstractCegarLoop]: === Iteration 1621 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 274458339, now seen corresponding path program 1 times [2022-12-13 02:03:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:07,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404850785] [2022-12-13 02:03:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:07,960 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 02:03:07,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:07,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404850785] [2022-12-13 02:03:07,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404850785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:07,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:07,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742294784] [2022-12-13 02:03:07,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:07,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:07,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:07,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:07,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:07,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:07,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:08,004 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:08,004 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:08,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:08,005 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:08,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:08,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:08,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:08,005 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:08,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:08,007 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:08,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:08,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:08,007 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,008 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:08,008 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:08,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,010 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:08,010 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:08,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:08,011 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,011 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:08,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:08,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:08,128 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:08,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:08,128 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:08,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1620 [2022-12-13 02:03:08,128 INFO L420 AbstractCegarLoop]: === Iteration 1622 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:08,128 INFO L85 PathProgramCache]: Analyzing trace with hash 331716641, now seen corresponding path program 1 times [2022-12-13 02:03:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:08,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056531035] [2022-12-13 02:03:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:08,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:08,190 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 02:03:08,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:08,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056531035] [2022-12-13 02:03:08,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056531035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:08,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:08,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:08,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977781707] [2022-12-13 02:03:08,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:08,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:08,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:08,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:08,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:08,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:08,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:08,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:08,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:08,247 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:08,248 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:08,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:08,248 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:08,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:08,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:08,249 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:08,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:08,249 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,250 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:08,250 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:08,250 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:08,250 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,250 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:08,250 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:08,250 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,253 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:08,253 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:08,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:08,253 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,253 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:08,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:08,384 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:08,384 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:08,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:08,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:08,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1621 [2022-12-13 02:03:08,384 INFO L420 AbstractCegarLoop]: === Iteration 1623 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash 388974943, now seen corresponding path program 1 times [2022-12-13 02:03:08,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:08,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721813712] [2022-12-13 02:03:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:08,445 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 02:03:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721813712] [2022-12-13 02:03:08,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721813712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:08,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:08,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:08,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018212006] [2022-12-13 02:03:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:08,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:08,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:08,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:08,446 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:08,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:08,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:08,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:08,496 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:08,497 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:08,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:08,497 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:08,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:08,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:08,498 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:08,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:08,499 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:08,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:08,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:08,499 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:08,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:08,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,502 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:08,502 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:08,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:08,629 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:08,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:03:08,630 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:08,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:08,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:08,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1622 [2022-12-13 02:03:08,630 INFO L420 AbstractCegarLoop]: === Iteration 1624 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:08,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash 446233245, now seen corresponding path program 1 times [2022-12-13 02:03:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:08,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638114220] [2022-12-13 02:03:08,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:08,699 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 02:03:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:08,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638114220] [2022-12-13 02:03:08,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638114220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:08,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:08,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935991362] [2022-12-13 02:03:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:08,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:08,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:08,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:08,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:08,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:08,757 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:08,757 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:08,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:08,758 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:08,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:08,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:08,758 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:08,758 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:08,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:08,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:08,760 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,760 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:08,760 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:08,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:08,760 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,760 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:08,760 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:08,760 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:08,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,763 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:08,763 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:08,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:08,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:08,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:08,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:08,896 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:08,896 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:08,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:08,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:08,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1623 [2022-12-13 02:03:08,896 INFO L420 AbstractCegarLoop]: === Iteration 1625 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash 503491547, now seen corresponding path program 1 times [2022-12-13 02:03:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:08,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314055772] [2022-12-13 02:03:08,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:08,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:08,975 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 02:03:08,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:08,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314055772] [2022-12-13 02:03:08,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314055772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:08,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:08,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873431047] [2022-12-13 02:03:08,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:08,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:08,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:08,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:08,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:08,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:08,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:09,027 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:09,027 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:09,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:09,028 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:09,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:09,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:09,029 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:09,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:09,030 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:09,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:09,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:09,030 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:09,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:09,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,033 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:09,033 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:09,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:09,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,033 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:09,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:09,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:09,166 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:09,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:09,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:09,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1624 [2022-12-13 02:03:09,166 INFO L420 AbstractCegarLoop]: === Iteration 1626 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash 560749849, now seen corresponding path program 1 times [2022-12-13 02:03:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:09,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972051884] [2022-12-13 02:03:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:09,224 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 02:03:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972051884] [2022-12-13 02:03:09,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972051884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:09,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:09,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:09,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172903148] [2022-12-13 02:03:09,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:09,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:09,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:09,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:09,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:09,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:09,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:09,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:09,287 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:09,287 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:09,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:09,288 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:09,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:09,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:09,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:09,289 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:09,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:09,289 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:09,290 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:09,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:09,290 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:09,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:09,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,292 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:09,292 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:09,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:09,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:09,427 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:09,428 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:09,428 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:09,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:09,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1625 [2022-12-13 02:03:09,428 INFO L420 AbstractCegarLoop]: === Iteration 1627 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:09,429 INFO L85 PathProgramCache]: Analyzing trace with hash 618008151, now seen corresponding path program 1 times [2022-12-13 02:03:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:09,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697963420] [2022-12-13 02:03:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:09,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:09,501 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 02:03:09,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:09,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697963420] [2022-12-13 02:03:09,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697963420] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:09,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:09,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:09,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555529409] [2022-12-13 02:03:09,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:09,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:09,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:09,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:09,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:09,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:09,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:09,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:09,555 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:09,555 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:09,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:09,556 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:09,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:09,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:09,556 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:09,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:09,557 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:09,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:09,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:09,557 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:09,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:09,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,560 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:09,561 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:09,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:09,561 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,561 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:09,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:09,694 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:09,695 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:09,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:09,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:09,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1626 [2022-12-13 02:03:09,695 INFO L420 AbstractCegarLoop]: === Iteration 1628 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:09,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:09,695 INFO L85 PathProgramCache]: Analyzing trace with hash 675266453, now seen corresponding path program 1 times [2022-12-13 02:03:09,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:09,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792434235] [2022-12-13 02:03:09,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:09,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:09,760 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 02:03:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:09,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792434235] [2022-12-13 02:03:09,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792434235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:09,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:09,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:09,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968592044] [2022-12-13 02:03:09,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:09,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:09,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:09,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:09,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:09,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:09,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:09,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:09,805 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:09,805 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:09,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:09,805 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:09,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:09,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:09,806 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:09,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:09,807 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,807 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:09,807 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:09,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:09,807 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:09,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:09,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:09,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,810 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:09,810 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:09,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:09,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:09,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:09,925 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:09,926 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:09,926 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:09,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:09,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:09,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1627 [2022-12-13 02:03:09,926 INFO L420 AbstractCegarLoop]: === Iteration 1629 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:09,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:09,927 INFO L85 PathProgramCache]: Analyzing trace with hash 732524755, now seen corresponding path program 1 times [2022-12-13 02:03:09,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:09,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531817527] [2022-12-13 02:03:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:09,981 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 02:03:09,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:09,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531817527] [2022-12-13 02:03:09,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531817527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:09,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:09,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:09,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17345564] [2022-12-13 02:03:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:09,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:09,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:09,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:09,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:09,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:09,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:09,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:09,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:09,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:10,026 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:10,026 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:10,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:10,027 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:10,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:10,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:10,027 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:10,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:10,028 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:10,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:10,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:10,028 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,029 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:10,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:10,029 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,031 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:10,031 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:10,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:10,032 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,032 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:10,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:10,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:10,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:10,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:10,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:10,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1628 [2022-12-13 02:03:10,168 INFO L420 AbstractCegarLoop]: === Iteration 1630 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:10,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:10,168 INFO L85 PathProgramCache]: Analyzing trace with hash 789783057, now seen corresponding path program 1 times [2022-12-13 02:03:10,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:10,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048329363] [2022-12-13 02:03:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:10,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:10,231 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 02:03:10,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:10,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048329363] [2022-12-13 02:03:10,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048329363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:10,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:10,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351167064] [2022-12-13 02:03:10,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:10,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:10,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:10,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:10,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:10,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:10,294 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:10,294 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:10,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:10,295 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:10,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:10,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:10,296 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:10,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:10,297 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:10,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:10,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:10,297 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:10,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:10,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,300 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:10,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:10,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:10,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:10,433 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:10,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:10,434 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:10,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:10,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:10,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1629 [2022-12-13 02:03:10,434 INFO L420 AbstractCegarLoop]: === Iteration 1631 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash 847041359, now seen corresponding path program 1 times [2022-12-13 02:03:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:10,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569546059] [2022-12-13 02:03:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:10,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:10,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569546059] [2022-12-13 02:03:10,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569546059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:10,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:10,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713790109] [2022-12-13 02:03:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:10,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:10,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:10,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:10,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:10,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:10,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:10,577 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:10,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:10,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:10,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:10,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:10,578 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:10,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:10,579 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:10,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:10,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:10,580 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:10,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:10,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:10,583 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:10,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:10,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:10,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:10,716 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:10,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:10,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:10,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1630 [2022-12-13 02:03:10,717 INFO L420 AbstractCegarLoop]: === Iteration 1632 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:10,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:10,717 INFO L85 PathProgramCache]: Analyzing trace with hash 904299661, now seen corresponding path program 1 times [2022-12-13 02:03:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:10,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802883643] [2022-12-13 02:03:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:10,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:10,779 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 02:03:10,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:10,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802883643] [2022-12-13 02:03:10,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802883643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:10,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:10,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:10,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282644903] [2022-12-13 02:03:10,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:10,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:10,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:10,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:10,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:10,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:10,841 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:10,842 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:10,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:10,842 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:10,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:10,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:10,843 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:10,843 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:10,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:10,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:10,844 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,844 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:10,844 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:10,844 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:10,844 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,844 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:10,844 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:10,844 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:10,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,847 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:10,847 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:10,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:10,847 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:10,847 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:10,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:10,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:03:10,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:10,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:10,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:10,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1631 [2022-12-13 02:03:10,989 INFO L420 AbstractCegarLoop]: === Iteration 1633 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash 961557963, now seen corresponding path program 1 times [2022-12-13 02:03:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:10,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977363401] [2022-12-13 02:03:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:11,052 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 02:03:11,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:11,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977363401] [2022-12-13 02:03:11,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977363401] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:11,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:11,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61141207] [2022-12-13 02:03:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:11,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:11,053 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:11,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:11,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:11,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:11,106 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:11,106 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:11,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:11,107 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:11,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:11,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:11,108 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:11,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:11,108 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:11,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:11,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:11,109 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,109 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:11,109 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:11,109 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,112 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:11,112 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:11,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:11,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:11,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:11,247 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:11,247 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:11,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,247 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:11,247 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:11,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1632 [2022-12-13 02:03:11,247 INFO L420 AbstractCegarLoop]: === Iteration 1634 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:11,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:11,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1018816265, now seen corresponding path program 1 times [2022-12-13 02:03:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:11,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259570024] [2022-12-13 02:03:11,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:11,306 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 02:03:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259570024] [2022-12-13 02:03:11,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259570024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:11,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:11,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:11,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360325909] [2022-12-13 02:03:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:11,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:11,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:11,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:11,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:11,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:11,370 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:11,370 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:11,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:11,371 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:11,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:11,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:11,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:11,372 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:11,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:11,372 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,373 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:11,373 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:11,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:11,373 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,373 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:11,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:11,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,376 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:11,376 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:11,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:11,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:11,508 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:11,509 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:11,509 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:11,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,509 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:11,509 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:11,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1633 [2022-12-13 02:03:11,510 INFO L420 AbstractCegarLoop]: === Iteration 1635 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:11,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1076074567, now seen corresponding path program 1 times [2022-12-13 02:03:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:11,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831742623] [2022-12-13 02:03:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:11,587 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 02:03:11,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:11,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831742623] [2022-12-13 02:03:11,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831742623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:11,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:11,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42164100] [2022-12-13 02:03:11,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:11,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:11,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:11,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:11,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:11,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:11,652 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:11,652 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:11,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:11,653 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:11,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:11,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:11,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:11,654 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:11,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:11,655 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,655 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:11,655 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:11,655 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:11,655 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,655 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:11,655 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:11,655 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,658 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:11,658 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:11,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:11,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:11,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:11,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:11,791 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:11,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:11,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:11,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1634 [2022-12-13 02:03:11,792 INFO L420 AbstractCegarLoop]: === Iteration 1636 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:11,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1133332869, now seen corresponding path program 1 times [2022-12-13 02:03:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:11,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096610195] [2022-12-13 02:03:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:11,861 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 02:03:11,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:11,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096610195] [2022-12-13 02:03:11,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096610195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:11,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:11,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:11,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047759772] [2022-12-13 02:03:11,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:11,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:11,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:11,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:11,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:11,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:11,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:11,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:11,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:11,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:11,924 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:11,924 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:11,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:11,925 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:11,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:11,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:11,925 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:11,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:11,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:11,926 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:11,926 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:11,926 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:11,926 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:11,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:11,927 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:11,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,929 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:11,930 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:11,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:11,930 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:11,930 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:12,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:12,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:12,065 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:12,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:12,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:12,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1635 [2022-12-13 02:03:12,065 INFO L420 AbstractCegarLoop]: === Iteration 1637 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1190591171, now seen corresponding path program 1 times [2022-12-13 02:03:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:12,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167454032] [2022-12-13 02:03:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:12,129 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 02:03:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:12,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167454032] [2022-12-13 02:03:12,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167454032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:12,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:12,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545692987] [2022-12-13 02:03:12,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:12,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:12,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:12,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:12,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:12,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:12,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:12,193 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:12,193 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:12,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:12,194 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:12,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:12,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:12,194 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:12,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:12,195 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:12,195 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:12,195 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:12,196 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:12,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:12,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,198 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:12,199 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:12,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:12,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:12,334 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:12,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:12,335 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:12,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:12,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:12,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1636 [2022-12-13 02:03:12,335 INFO L420 AbstractCegarLoop]: === Iteration 1638 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:12,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1247849473, now seen corresponding path program 1 times [2022-12-13 02:03:12,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:12,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20009261] [2022-12-13 02:03:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:12,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:12,410 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 02:03:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:12,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20009261] [2022-12-13 02:03:12,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20009261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:12,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:12,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64202744] [2022-12-13 02:03:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:12,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:12,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:12,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:12,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:12,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:12,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:12,459 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:12,459 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:12,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:12,460 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:12,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:12,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:12,460 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:12,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:12,461 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,461 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:12,461 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:12,461 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:12,461 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:12,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:12,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,464 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:12,464 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:12,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:12,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:12,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:12,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:03:12,586 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:12,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:12,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:12,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1637 [2022-12-13 02:03:12,586 INFO L420 AbstractCegarLoop]: === Iteration 1639 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:12,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:12,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1305107775, now seen corresponding path program 1 times [2022-12-13 02:03:12,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:12,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693408663] [2022-12-13 02:03:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:12,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:12,644 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 02:03:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:12,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693408663] [2022-12-13 02:03:12,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693408663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:12,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:12,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584295030] [2022-12-13 02:03:12,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:12,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:12,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:12,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:12,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:12,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:12,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:12,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:12,689 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:12,689 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:12,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:12,689 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:12,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:12,690 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:12,690 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:12,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:12,691 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,691 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:12,691 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:12,691 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:12,691 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,691 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:12,691 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:12,691 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,694 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:12,694 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:12,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:12,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:12,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:12,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:03:12,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:12,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:12,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:12,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1638 [2022-12-13 02:03:12,822 INFO L420 AbstractCegarLoop]: === Iteration 1640 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1362366077, now seen corresponding path program 1 times [2022-12-13 02:03:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034904559] [2022-12-13 02:03:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:12,876 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 02:03:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:12,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034904559] [2022-12-13 02:03:12,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034904559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:12,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:12,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:12,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110320968] [2022-12-13 02:03:12,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:12,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:12,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:12,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:12,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:12,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:12,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:12,919 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:12,919 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:12,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:12,920 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:12,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:12,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:12,920 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:12,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:12,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:12,921 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:12,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:12,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:12,921 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:12,922 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:12,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:12,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,924 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:12,924 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:12,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:12,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:12,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:13,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:13,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:13,041 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:13,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:13,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:13,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1639 [2022-12-13 02:03:13,041 INFO L420 AbstractCegarLoop]: === Iteration 1641 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:13,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1419624379, now seen corresponding path program 1 times [2022-12-13 02:03:13,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:13,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120990525] [2022-12-13 02:03:13,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:13,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:13,107 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 02:03:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120990525] [2022-12-13 02:03:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120990525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:13,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:13,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:13,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954494209] [2022-12-13 02:03:13,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:13,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:13,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:13,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:13,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:13,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:13,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:13,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:13,157 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:13,158 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:13,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:13,158 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:13,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:13,159 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:13,159 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:13,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:13,159 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:13,160 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:13,160 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:13,160 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:13,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:13,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,162 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:13,162 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:13,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:13,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:13,288 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:13,289 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:03:13,289 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:13,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:13,289 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:13,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1640 [2022-12-13 02:03:13,289 INFO L420 AbstractCegarLoop]: === Iteration 1642 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1476882681, now seen corresponding path program 1 times [2022-12-13 02:03:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:13,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210875706] [2022-12-13 02:03:13,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:13,355 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 02:03:13,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:13,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210875706] [2022-12-13 02:03:13,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210875706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:13,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:13,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:13,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003257698] [2022-12-13 02:03:13,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:13,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:13,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:13,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:13,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:13,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:13,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:13,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:13,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:13,417 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:13,417 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:13,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:13,418 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:13,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:13,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:13,418 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:13,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:13,419 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:13,419 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:13,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:13,420 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,420 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:13,420 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:13,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,422 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:13,422 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:13,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:13,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:13,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:13,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:13,554 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:13,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:13,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:13,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1641 [2022-12-13 02:03:13,554 INFO L420 AbstractCegarLoop]: === Iteration 1643 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1534140983, now seen corresponding path program 1 times [2022-12-13 02:03:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:13,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948557277] [2022-12-13 02:03:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:13,613 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 02:03:13,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:13,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948557277] [2022-12-13 02:03:13,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948557277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:13,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:13,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:13,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937462790] [2022-12-13 02:03:13,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:13,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:13,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:13,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:13,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:13,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:13,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:13,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:13,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:13,665 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:13,665 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:13,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:13,665 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:13,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:13,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:13,666 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:13,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:13,667 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:13,667 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:13,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:13,667 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:13,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:13,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,670 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:13,670 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:13,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:13,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:13,802 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:13,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:13,803 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:13,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,803 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:13,803 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:13,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1642 [2022-12-13 02:03:13,803 INFO L420 AbstractCegarLoop]: === Iteration 1644 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1591399285, now seen corresponding path program 1 times [2022-12-13 02:03:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:13,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011519604] [2022-12-13 02:03:13,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:13,864 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 02:03:13,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011519604] [2022-12-13 02:03:13,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011519604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:13,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:13,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009862989] [2022-12-13 02:03:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:13,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:13,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:13,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:13,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:13,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:13,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:13,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:13,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:13,926 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:13,927 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:13,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:13,927 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:13,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:13,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:13,928 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:13,928 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:13,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:13,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:13,929 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,929 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:13,929 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:13,929 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:13,929 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:13,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:13,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:13,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,932 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:13,932 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:13,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:13,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:13,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:14,062 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:14,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:14,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:14,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:14,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:14,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1643 [2022-12-13 02:03:14,064 INFO L420 AbstractCegarLoop]: === Iteration 1645 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1648657587, now seen corresponding path program 1 times [2022-12-13 02:03:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:14,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357995544] [2022-12-13 02:03:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:14,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:14,123 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 02:03:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:14,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357995544] [2022-12-13 02:03:14,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357995544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:14,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:14,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:14,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549955780] [2022-12-13 02:03:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:14,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:14,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:14,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:14,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:14,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:14,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:14,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:14,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:14,177 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:14,177 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:14,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:14,178 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:14,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:14,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:14,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:14,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:14,179 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:14,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:14,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:14,180 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:14,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:14,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:14,182 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:14,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:14,183 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,183 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:14,315 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:14,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:14,317 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:14,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:14,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:14,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1644 [2022-12-13 02:03:14,317 INFO L420 AbstractCegarLoop]: === Iteration 1646 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:14,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:14,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1705915889, now seen corresponding path program 1 times [2022-12-13 02:03:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:14,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514452294] [2022-12-13 02:03:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:14,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514452294] [2022-12-13 02:03:14,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514452294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:14,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:14,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114004923] [2022-12-13 02:03:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:14,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:14,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:14,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:14,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:14,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:14,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:14,431 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:14,431 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:14,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:14,432 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:14,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:14,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:14,432 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:14,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:14,433 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:14,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:14,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:14,433 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:14,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:14,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,436 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:14,436 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:14,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:14,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:14,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:14,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:03:14,576 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:14,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,577 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:14,577 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:14,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1645 [2022-12-13 02:03:14,577 INFO L420 AbstractCegarLoop]: === Iteration 1647 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1763174191, now seen corresponding path program 1 times [2022-12-13 02:03:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:14,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163310722] [2022-12-13 02:03:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:14,648 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 02:03:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:14,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163310722] [2022-12-13 02:03:14,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163310722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:14,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:14,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902437752] [2022-12-13 02:03:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:14,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:14,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:14,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:14,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:14,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:14,702 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:14,702 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:14,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:14,703 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:14,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:14,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:14,704 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:14,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:14,704 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:14,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:14,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:14,705 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:14,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:14,705 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,708 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:14,708 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:14,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:14,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:14,841 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:14,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:14,843 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:14,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:14,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:14,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1646 [2022-12-13 02:03:14,843 INFO L420 AbstractCegarLoop]: === Iteration 1648 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:14,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1820432493, now seen corresponding path program 1 times [2022-12-13 02:03:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:14,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143164407] [2022-12-13 02:03:14,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:14,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:14,911 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 02:03:14,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:14,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143164407] [2022-12-13 02:03:14,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143164407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:14,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:14,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:14,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384594441] [2022-12-13 02:03:14,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:14,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:14,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:14,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:14,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:14,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:14,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:14,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:14,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:14,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:14,976 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:14,976 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:14,977 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:14,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:14,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:14,978 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:14,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:14,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:14,979 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:14,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:14,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:14,979 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:14,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:14,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:14,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,982 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:14,982 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:14,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:14,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:14,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:15,115 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:15,116 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:15,116 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:15,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:15,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:15,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1647 [2022-12-13 02:03:15,117 INFO L420 AbstractCegarLoop]: === Iteration 1649 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1877690795, now seen corresponding path program 1 times [2022-12-13 02:03:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:15,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434815707] [2022-12-13 02:03:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:15,190 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 02:03:15,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:15,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434815707] [2022-12-13 02:03:15,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434815707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:15,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:15,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:15,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166380679] [2022-12-13 02:03:15,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:15,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:15,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:15,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:15,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:15,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:15,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:15,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:15,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:15,253 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:15,253 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:15,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:15,254 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:15,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:15,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:15,254 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:15,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:15,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:15,255 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:15,255 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:15,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:15,256 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,256 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:15,256 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:15,256 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:15,258 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:15,258 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:15,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:15,259 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:15,259 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:15,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:15,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:03:15,385 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:15,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:15,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:15,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1648 [2022-12-13 02:03:15,385 INFO L420 AbstractCegarLoop]: === Iteration 1650 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:15,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:15,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1934949097, now seen corresponding path program 1 times [2022-12-13 02:03:15,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:15,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577547597] [2022-12-13 02:03:15,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:15,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:15,451 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 02:03:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577547597] [2022-12-13 02:03:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577547597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:15,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:15,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110968708] [2022-12-13 02:03:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:15,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:15,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:15,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:15,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:15,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:15,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:15,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:15,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:15,498 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:15,498 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:15,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:15,499 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:15,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:15,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:15,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:15,500 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:15,500 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:15,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:15,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:15,501 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,501 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:15,501 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:15,502 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:15,502 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:15,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:15,502 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:15,506 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:15,506 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:15,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:15,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:15,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:15,662 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:15,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 02:03:15,663 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:15,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,663 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:15,663 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:15,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1649 [2022-12-13 02:03:15,663 INFO L420 AbstractCegarLoop]: === Iteration 1651 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:15,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1992207399, now seen corresponding path program 1 times [2022-12-13 02:03:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:15,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596254281] [2022-12-13 02:03:15,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:15,720 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 02:03:15,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:15,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596254281] [2022-12-13 02:03:15,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596254281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:15,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:15,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481889466] [2022-12-13 02:03:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:15,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:15,720 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:15,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:15,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:15,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:15,782 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:15,782 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:15,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:15,783 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:15,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:15,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:15,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:15,783 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:15,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:15,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:15,784 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:15,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:15,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:15,784 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:15,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:15,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:15,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:15,787 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:15,787 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:15,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:15,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:15,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:15,904 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:15,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:15,905 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:15,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:15,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:15,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1650 [2022-12-13 02:03:15,905 INFO L420 AbstractCegarLoop]: === Iteration 1652 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:15,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash 2049465701, now seen corresponding path program 1 times [2022-12-13 02:03:15,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:15,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597457976] [2022-12-13 02:03:15,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:15,969 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 02:03:15,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:15,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597457976] [2022-12-13 02:03:15,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597457976] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:15,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:15,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:15,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45689713] [2022-12-13 02:03:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:15,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:15,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:15,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:15,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:15,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:15,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:15,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:15,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:15,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:16,021 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:16,022 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:16,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:16,022 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:16,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:16,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:16,023 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:16,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:16,023 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:16,024 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:16,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:16,024 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,024 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:16,024 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:16,024 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,027 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:16,027 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:16,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:16,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:16,145 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:16,146 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:16,146 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:16,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,146 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:16,146 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:16,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1651 [2022-12-13 02:03:16,146 INFO L420 AbstractCegarLoop]: === Iteration 1653 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:16,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:16,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2106724003, now seen corresponding path program 1 times [2022-12-13 02:03:16,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:16,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675731156] [2022-12-13 02:03:16,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:16,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:16,201 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 02:03:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:16,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675731156] [2022-12-13 02:03:16,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675731156] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:16,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:16,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012640975] [2022-12-13 02:03:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:16,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:16,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:16,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:16,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:16,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:16,252 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:16,253 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:16,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:16,253 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:16,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:16,254 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:16,254 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:16,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:16,254 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,255 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:16,255 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:16,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:16,255 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,255 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:16,255 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:16,255 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,258 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:16,258 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:16,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:16,258 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,258 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:16,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:16,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:16,375 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:16,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:16,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:16,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1652 [2022-12-13 02:03:16,376 INFO L420 AbstractCegarLoop]: === Iteration 1654 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2130984991, now seen corresponding path program 1 times [2022-12-13 02:03:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:16,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492144729] [2022-12-13 02:03:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:16,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:16,432 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 02:03:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:16,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492144729] [2022-12-13 02:03:16,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492144729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:16,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:16,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118384852] [2022-12-13 02:03:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:16,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:16,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:16,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:16,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:16,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:16,476 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:16,477 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:16,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:16,477 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:16,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:16,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:16,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:16,478 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:16,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:16,478 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:16,479 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:16,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:16,479 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:16,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:16,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,482 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:16,482 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:16,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:16,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:16,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:16,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:16,597 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:16,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:16,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:16,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1653 [2022-12-13 02:03:16,597 INFO L420 AbstractCegarLoop]: === Iteration 1655 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2073726689, now seen corresponding path program 1 times [2022-12-13 02:03:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:16,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973091013] [2022-12-13 02:03:16,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:16,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:16,651 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 02:03:16,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:16,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973091013] [2022-12-13 02:03:16,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973091013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:16,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:16,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:16,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175446665] [2022-12-13 02:03:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:16,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:16,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:16,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:16,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:16,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:16,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:16,705 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:16,705 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:16,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:16,706 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:16,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:16,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:16,706 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:16,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:16,707 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:16,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:16,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:16,707 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:16,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:16,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,710 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:16,710 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:16,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:16,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,710 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:16,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:16,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:16,827 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:16,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:16,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:16,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1654 [2022-12-13 02:03:16,828 INFO L420 AbstractCegarLoop]: === Iteration 1656 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:16,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2016468387, now seen corresponding path program 1 times [2022-12-13 02:03:16,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:16,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397106094] [2022-12-13 02:03:16,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:16,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:16,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 02:03:16,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:16,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397106094] [2022-12-13 02:03:16,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397106094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:16,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:16,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:16,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947083519] [2022-12-13 02:03:16,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:16,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:16,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:16,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:16,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:16,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:16,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:16,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:16,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:16,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:16,937 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:16,937 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:16,937 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:16,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:16,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:16,938 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:16,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:16,939 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:16,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:16,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:16,939 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:16,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:16,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:16,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,942 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:16,942 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:16,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:16,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:16,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:17,058 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:17,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:17,059 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:17,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:17,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:17,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1655 [2022-12-13 02:03:17,059 INFO L420 AbstractCegarLoop]: === Iteration 1657 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:17,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1959210085, now seen corresponding path program 1 times [2022-12-13 02:03:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:17,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158901551] [2022-12-13 02:03:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:17,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:17,113 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 02:03:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:17,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158901551] [2022-12-13 02:03:17,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158901551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:17,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:17,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917422712] [2022-12-13 02:03:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:17,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:17,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:17,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:17,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:17,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:17,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:17,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:17,157 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:17,157 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:17,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:17,158 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:17,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:17,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:17,158 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:17,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:17,159 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:17,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:17,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:17,159 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,160 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:17,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:17,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,162 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:17,162 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:17,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:17,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:17,296 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:17,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:17,297 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:17,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,297 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:17,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:17,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1656 [2022-12-13 02:03:17,297 INFO L420 AbstractCegarLoop]: === Iteration 1658 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1901951783, now seen corresponding path program 1 times [2022-12-13 02:03:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:17,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531313139] [2022-12-13 02:03:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:17,350 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 02:03:17,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:17,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531313139] [2022-12-13 02:03:17,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531313139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:17,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:17,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515557059] [2022-12-13 02:03:17,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:17,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:17,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:17,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:17,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:17,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:17,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:17,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:17,401 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:17,402 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:17,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:17,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:17,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:17,402 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:17,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:17,403 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:17,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:17,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:17,403 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,404 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:17,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:17,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,406 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:17,406 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:17,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:17,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:17,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:17,523 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:17,523 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:17,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:17,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:17,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1657 [2022-12-13 02:03:17,524 INFO L420 AbstractCegarLoop]: === Iteration 1659 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1844693481, now seen corresponding path program 1 times [2022-12-13 02:03:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:17,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454351387] [2022-12-13 02:03:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:17,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:17,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 02:03:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:17,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454351387] [2022-12-13 02:03:17,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454351387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:17,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:17,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:17,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239750034] [2022-12-13 02:03:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:17,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:17,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:17,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:17,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:17,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:17,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:17,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:17,623 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:17,623 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:17,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:17,624 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:17,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:17,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:17,625 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:17,625 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:17,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:17,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:17,626 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:17,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:17,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,629 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:17,629 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:17,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:17,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:17,748 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:17,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:03:17,749 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:17,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:17,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:17,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1658 [2022-12-13 02:03:17,749 INFO L420 AbstractCegarLoop]: === Iteration 1660 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1787435179, now seen corresponding path program 1 times [2022-12-13 02:03:17,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:17,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163325422] [2022-12-13 02:03:17,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:17,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:17,816 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 02:03:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:17,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163325422] [2022-12-13 02:03:17,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163325422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:17,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:17,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989313630] [2022-12-13 02:03:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:17,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:17,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:17,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:17,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:17,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:17,872 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:17,872 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:17,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:17,873 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:17,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:17,874 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:17,874 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:17,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:17,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:17,874 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,875 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:17,875 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:17,875 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:17,875 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:17,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:17,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:17,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,878 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:17,878 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:17,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:17,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:17,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:17,996 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:17,997 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:17,997 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:17,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:17,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:17,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:17,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1659 [2022-12-13 02:03:17,997 INFO L420 AbstractCegarLoop]: === Iteration 1661 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:17,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1730176877, now seen corresponding path program 1 times [2022-12-13 02:03:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:17,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262245834] [2022-12-13 02:03:17,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:17,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:18,051 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 02:03:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:18,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262245834] [2022-12-13 02:03:18,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262245834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:18,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:18,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:18,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774740641] [2022-12-13 02:03:18,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:18,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:18,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:18,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:18,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:18,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:18,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:18,103 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:18,103 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:18,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:18,103 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:18,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:18,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:18,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:18,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:18,104 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:18,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:18,105 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:18,105 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:18,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:18,105 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:18,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:18,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,108 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:18,108 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:18,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:18,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:18,222 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:18,223 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:18,223 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:18,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:18,223 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:18,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1660 [2022-12-13 02:03:18,223 INFO L420 AbstractCegarLoop]: === Iteration 1662 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1672918575, now seen corresponding path program 1 times [2022-12-13 02:03:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:18,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305030991] [2022-12-13 02:03:18,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:18,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:18,276 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 02:03:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:18,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305030991] [2022-12-13 02:03:18,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305030991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:18,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:18,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616267061] [2022-12-13 02:03:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:18,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:18,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:18,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:18,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:18,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:18,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:18,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:18,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:18,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:18,320 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:18,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:18,320 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:18,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:18,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:18,321 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:18,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:18,322 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:18,322 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:18,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:18,322 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:18,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:18,322 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,325 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:18,325 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:18,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,325 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:18,440 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:18,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:18,441 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:18,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:18,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:18,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1661 [2022-12-13 02:03:18,441 INFO L420 AbstractCegarLoop]: === Iteration 1663 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:18,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1615660273, now seen corresponding path program 1 times [2022-12-13 02:03:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:18,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299697951] [2022-12-13 02:03:18,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:18,505 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 02:03:18,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:18,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299697951] [2022-12-13 02:03:18,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299697951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:18,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:18,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778301016] [2022-12-13 02:03:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:18,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:18,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:18,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:18,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:18,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:18,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:18,558 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:18,558 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:18,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:18,558 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:18,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:18,559 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:18,559 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:18,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:18,560 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:18,560 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:18,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:18,560 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:18,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:18,560 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,563 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:18,563 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:18,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:18,563 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,563 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:18,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:18,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:18,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:18,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,681 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:18,681 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:18,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1662 [2022-12-13 02:03:18,681 INFO L420 AbstractCegarLoop]: === Iteration 1664 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:18,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:18,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1558401971, now seen corresponding path program 1 times [2022-12-13 02:03:18,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:18,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278302432] [2022-12-13 02:03:18,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:18,736 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 02:03:18,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278302432] [2022-12-13 02:03:18,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278302432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:18,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:18,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776341910] [2022-12-13 02:03:18,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:18,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:18,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:18,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:18,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:18,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:18,780 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:18,780 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:18,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:18,781 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:18,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:18,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:18,781 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:18,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:18,782 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:18,782 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:18,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:18,782 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:18,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:18,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:18,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,786 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:18,786 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:18,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:18,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:18,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:18,902 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:18,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:18,903 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:18,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:18,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:18,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1663 [2022-12-13 02:03:18,903 INFO L420 AbstractCegarLoop]: === Iteration 1665 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:18,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:18,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1501143669, now seen corresponding path program 1 times [2022-12-13 02:03:18,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:18,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680754928] [2022-12-13 02:03:18,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:18,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:18,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 02:03:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:18,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680754928] [2022-12-13 02:03:18,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680754928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:18,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:18,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172704708] [2022-12-13 02:03:18,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:18,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:18,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:18,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:18,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:18,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:18,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:19,009 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:19,009 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:19,010 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:19,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:19,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:19,010 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:19,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:19,011 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:19,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:19,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:19,011 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:19,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:19,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,014 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:19,014 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:19,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:19,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:19,129 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:19,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:19,129 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:19,130 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:19,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1664 [2022-12-13 02:03:19,130 INFO L420 AbstractCegarLoop]: === Iteration 1666 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:19,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1443885367, now seen corresponding path program 1 times [2022-12-13 02:03:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:19,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897051670] [2022-12-13 02:03:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:19,187 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 02:03:19,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:19,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897051670] [2022-12-13 02:03:19,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897051670] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:19,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:19,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:19,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315387703] [2022-12-13 02:03:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:19,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:19,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:19,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:19,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:19,188 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:19,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:19,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:19,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:19,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:19,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:19,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:19,237 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:19,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:19,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:19,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:19,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:19,239 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:19,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:19,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:19,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:19,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:19,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,242 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:19,242 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:19,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:19,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:19,359 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:19,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:19,360 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:19,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:19,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:19,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1665 [2022-12-13 02:03:19,361 INFO L420 AbstractCegarLoop]: === Iteration 1667 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1386627065, now seen corresponding path program 1 times [2022-12-13 02:03:19,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:19,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474465967] [2022-12-13 02:03:19,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:19,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:19,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 02:03:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:19,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474465967] [2022-12-13 02:03:19,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474465967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:19,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:19,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207630847] [2022-12-13 02:03:19,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:19,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:19,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:19,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:19,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:19,418 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:19,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:19,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:19,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:19,460 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:19,460 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:19,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:19,460 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:19,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:19,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:19,461 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:19,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:19,462 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:19,462 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:19,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:19,462 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,462 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:19,462 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:19,462 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,465 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:19,465 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:19,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:19,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:19,582 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:19,583 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:19,583 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:19,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:19,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:19,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1666 [2022-12-13 02:03:19,583 INFO L420 AbstractCegarLoop]: === Iteration 1668 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:19,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1329368763, now seen corresponding path program 1 times [2022-12-13 02:03:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:19,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810371706] [2022-12-13 02:03:19,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:19,638 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 02:03:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:19,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810371706] [2022-12-13 02:03:19,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810371706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:19,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:19,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:19,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190063017] [2022-12-13 02:03:19,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:19,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:19,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:19,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:19,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:19,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:19,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:19,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:19,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:19,682 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:19,682 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:19,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:19,682 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:19,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:19,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:19,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:19,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:19,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:19,683 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:19,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:19,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:19,684 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:19,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:19,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,687 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:19,687 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:19,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:19,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:19,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:19,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:19,823 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:19,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,823 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:19,823 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:19,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1667 [2022-12-13 02:03:19,823 INFO L420 AbstractCegarLoop]: === Iteration 1669 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:19,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1272110461, now seen corresponding path program 1 times [2022-12-13 02:03:19,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:19,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819207159] [2022-12-13 02:03:19,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:19,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:19,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819207159] [2022-12-13 02:03:19,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819207159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:19,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:19,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:19,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731369545] [2022-12-13 02:03:19,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:19,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:19,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:19,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:19,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:19,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:19,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:19,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:19,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:19,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:19,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:19,929 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:19,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:19,929 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:19,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:19,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:19,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:19,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:19,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:19,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:19,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:19,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:19,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:19,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:19,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:19,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:19,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,934 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:19,934 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:19,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:19,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:19,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:20,051 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:20,052 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:20,052 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:20,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:20,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:20,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1668 [2022-12-13 02:03:20,052 INFO L420 AbstractCegarLoop]: === Iteration 1670 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1214852159, now seen corresponding path program 1 times [2022-12-13 02:03:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:20,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878066066] [2022-12-13 02:03:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:20,105 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 02:03:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:20,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878066066] [2022-12-13 02:03:20,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878066066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:20,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:20,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819399614] [2022-12-13 02:03:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:20,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:20,106 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:20,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:20,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:20,148 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:20,149 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:20,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:20,149 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:20,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:20,150 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:20,150 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:20,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:20,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:20,151 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:20,151 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:20,151 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:20,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:20,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,153 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:20,154 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:20,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:20,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:20,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:20,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:20,273 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:20,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:20,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:20,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1669 [2022-12-13 02:03:20,273 INFO L420 AbstractCegarLoop]: === Iteration 1671 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:20,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1157593857, now seen corresponding path program 1 times [2022-12-13 02:03:20,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:20,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650377718] [2022-12-13 02:03:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:20,327 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 02:03:20,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:20,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650377718] [2022-12-13 02:03:20,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650377718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:20,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:20,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:20,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650685205] [2022-12-13 02:03:20,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:20,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:20,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:20,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:20,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:20,328 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:20,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:20,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:20,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:20,383 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:20,384 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:20,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:20,384 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:20,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:20,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:20,385 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:20,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:20,386 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,386 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:20,386 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:20,386 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:20,386 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:20,387 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:20,387 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,390 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:20,390 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:20,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:20,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:20,526 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:20,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:20,526 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:20,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:20,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:20,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1670 [2022-12-13 02:03:20,527 INFO L420 AbstractCegarLoop]: === Iteration 1672 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1100335555, now seen corresponding path program 1 times [2022-12-13 02:03:20,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:20,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50914813] [2022-12-13 02:03:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:20,583 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 02:03:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:20,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50914813] [2022-12-13 02:03:20,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50914813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:20,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:20,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:20,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522134497] [2022-12-13 02:03:20,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:20,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:20,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:20,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:20,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:20,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:20,648 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:20,648 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:20,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:20,649 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:20,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:20,650 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:20,650 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:20,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:20,651 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,651 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:20,651 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:20,651 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:20,651 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,651 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:20,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:20,651 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,654 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:20,654 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:20,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:20,654 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,654 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:20,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:20,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:03:20,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:20,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:20,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:20,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1671 [2022-12-13 02:03:20,782 INFO L420 AbstractCegarLoop]: === Iteration 1673 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:20,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1043077253, now seen corresponding path program 1 times [2022-12-13 02:03:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:20,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997271163] [2022-12-13 02:03:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:20,860 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 02:03:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:20,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997271163] [2022-12-13 02:03:20,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997271163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:20,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:20,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:20,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711084690] [2022-12-13 02:03:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:20,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:20,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:20,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:20,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:20,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:20,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:20,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:20,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:20,922 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:20,923 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:20,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:20,923 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:20,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:20,924 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:20,924 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:20,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:20,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:20,925 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:20,925 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:20,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:20,925 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:20,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:20,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:20,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,928 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:20,928 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:20,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:20,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:20,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:21,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:21,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 02:03:21,087 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:21,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:21,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1672 [2022-12-13 02:03:21,087 INFO L420 AbstractCegarLoop]: === Iteration 1674 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -985818951, now seen corresponding path program 1 times [2022-12-13 02:03:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:21,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70721752] [2022-12-13 02:03:21,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:21,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 02:03:21,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:21,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70721752] [2022-12-13 02:03:21,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70721752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:21,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:21,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:21,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156440156] [2022-12-13 02:03:21,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:21,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:21,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:21,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:21,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:21,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:21,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:21,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:21,241 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:21,241 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:21,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:21,242 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:21,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:21,242 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:21,242 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:21,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:21,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:21,243 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,243 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:21,243 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:21,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:21,243 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,243 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:21,243 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:21,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:21,246 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:21,246 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:21,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:21,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:21,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:21,386 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:21,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:03:21,387 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:21,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:21,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:21,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1673 [2022-12-13 02:03:21,387 INFO L420 AbstractCegarLoop]: === Iteration 1675 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash -928560649, now seen corresponding path program 1 times [2022-12-13 02:03:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:21,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858317497] [2022-12-13 02:03:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:21,441 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 02:03:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:21,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858317497] [2022-12-13 02:03:21,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858317497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:21,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:21,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105246503] [2022-12-13 02:03:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:21,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:21,442 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:21,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:21,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:21,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:21,493 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:21,493 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:21,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:21,494 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:21,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:21,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:21,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:21,494 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:21,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:21,495 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:21,495 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:21,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:21,495 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:21,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:21,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:21,498 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:21,498 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:21,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:21,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:21,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:21,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:21,617 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:21,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:21,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:21,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1674 [2022-12-13 02:03:21,618 INFO L420 AbstractCegarLoop]: === Iteration 1676 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:21,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -871302347, now seen corresponding path program 1 times [2022-12-13 02:03:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:21,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360942323] [2022-12-13 02:03:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:21,672 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 02:03:21,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:21,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360942323] [2022-12-13 02:03:21,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360942323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:21,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:21,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:21,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823393706] [2022-12-13 02:03:21,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:21,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:21,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:21,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:21,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:21,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:21,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:21,739 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:21,739 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:21,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:21,740 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:21,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:21,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:21,740 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:21,740 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:21,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:21,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:21,741 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,741 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:21,741 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:21,741 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:21,741 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,741 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:21,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:21,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:21,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:21,744 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:21,744 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:21,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:21,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:21,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:21,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:21,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:21,879 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:21,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:21,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:21,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1675 [2022-12-13 02:03:21,879 INFO L420 AbstractCegarLoop]: === Iteration 1677 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:21,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:21,879 INFO L85 PathProgramCache]: Analyzing trace with hash -814044045, now seen corresponding path program 1 times [2022-12-13 02:03:21,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:21,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768914001] [2022-12-13 02:03:21,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:21,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:21,947 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 02:03:21,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:21,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768914001] [2022-12-13 02:03:21,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768914001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:21,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:21,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099251894] [2022-12-13 02:03:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:21,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:21,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:21,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:21,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:21,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:21,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:21,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:22,014 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:22,014 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:22,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:22,015 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:22,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:22,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:22,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:22,015 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:22,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:22,017 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:22,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:22,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:22,017 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:22,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:22,017 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,021 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:22,021 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:22,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:22,022 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,022 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:22,162 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:22,163 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:03:22,163 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:22,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:22,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:22,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1676 [2022-12-13 02:03:22,163 INFO L420 AbstractCegarLoop]: === Iteration 1678 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:22,163 INFO L85 PathProgramCache]: Analyzing trace with hash -756785743, now seen corresponding path program 1 times [2022-12-13 02:03:22,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:22,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436846522] [2022-12-13 02:03:22,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:22,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:22,226 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 02:03:22,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436846522] [2022-12-13 02:03:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436846522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:22,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:22,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441663742] [2022-12-13 02:03:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:22,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:22,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:22,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:22,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:22,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:22,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:22,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:22,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:22,288 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:22,288 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:22,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:22,289 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:22,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:22,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:22,290 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:22,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:22,291 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,291 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:22,291 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:22,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:22,291 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:22,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:22,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,294 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:22,294 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:22,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:22,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:22,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:22,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:22,429 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,430 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:22,430 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:22,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1677 [2022-12-13 02:03:22,430 INFO L420 AbstractCegarLoop]: === Iteration 1679 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:22,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:22,430 INFO L85 PathProgramCache]: Analyzing trace with hash -699527441, now seen corresponding path program 1 times [2022-12-13 02:03:22,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:22,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387978064] [2022-12-13 02:03:22,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:22,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:22,492 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 02:03:22,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:22,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387978064] [2022-12-13 02:03:22,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387978064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:22,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:22,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:22,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811505386] [2022-12-13 02:03:22,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:22,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:22,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:22,493 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:22,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:22,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:22,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:22,545 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:22,546 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:22,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:22,546 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:22,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:22,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:22,557 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:22,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:22,559 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:22,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:22,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:22,559 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:22,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:22,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:22,564 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:22,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:22,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:22,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:22,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:22,699 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:22,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:22,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:22,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1678 [2022-12-13 02:03:22,700 INFO L420 AbstractCegarLoop]: === Iteration 1680 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:22,700 INFO L85 PathProgramCache]: Analyzing trace with hash -642269139, now seen corresponding path program 1 times [2022-12-13 02:03:22,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:22,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028378161] [2022-12-13 02:03:22,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:22,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:22,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 02:03:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028378161] [2022-12-13 02:03:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028378161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:22,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:22,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902143958] [2022-12-13 02:03:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:22,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:22,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:22,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:22,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:22,773 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:22,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:22,825 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:22,825 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:22,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:22,826 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:22,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:22,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:22,826 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:22,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:22,827 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:22,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:22,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:22,827 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,828 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:22,828 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:22,828 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:22,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,830 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:22,830 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:22,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:22,831 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:22,831 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:22,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:22,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:03:22,953 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:22,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:22,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:22,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:22,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1679 [2022-12-13 02:03:22,953 INFO L420 AbstractCegarLoop]: === Iteration 1681 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash -585010837, now seen corresponding path program 1 times [2022-12-13 02:03:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:22,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422413361] [2022-12-13 02:03:22,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:22,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:23,018 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 02:03:23,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:23,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422413361] [2022-12-13 02:03:23,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422413361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:23,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:23,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350189344] [2022-12-13 02:03:23,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:23,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:23,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:23,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:23,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:23,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:23,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:23,087 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:23,087 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:23,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:23,088 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:23,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:23,088 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:23,088 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:23,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:23,089 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,089 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:23,089 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:23,089 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:23,089 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,089 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:23,089 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:23,089 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,092 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:23,092 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:23,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:23,092 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,093 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:23,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:23,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:23,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:23,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:23,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:23,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1680 [2022-12-13 02:03:23,213 INFO L420 AbstractCegarLoop]: === Iteration 1682 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:23,213 INFO L85 PathProgramCache]: Analyzing trace with hash -527752535, now seen corresponding path program 1 times [2022-12-13 02:03:23,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:23,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337646575] [2022-12-13 02:03:23,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:23,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:23,266 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 02:03:23,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:23,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337646575] [2022-12-13 02:03:23,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337646575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:23,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:23,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:23,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555809230] [2022-12-13 02:03:23,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:23,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:23,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:23,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:23,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:23,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:23,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:23,318 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:23,318 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:23,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:23,318 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:23,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:23,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:23,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:23,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:23,319 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:23,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:23,320 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,320 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:23,320 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:23,320 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:23,320 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,320 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:23,320 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:23,320 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,323 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:23,323 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:23,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:23,323 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,323 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:23,439 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:23,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:23,440 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:23,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:23,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:23,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1681 [2022-12-13 02:03:23,440 INFO L420 AbstractCegarLoop]: === Iteration 1683 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash -470494233, now seen corresponding path program 1 times [2022-12-13 02:03:23,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:23,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792837136] [2022-12-13 02:03:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:23,494 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 02:03:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792837136] [2022-12-13 02:03:23,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792837136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:23,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:23,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130365857] [2022-12-13 02:03:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:23,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:23,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:23,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:23,495 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:23,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:23,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:23,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:23,538 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:23,538 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:23,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:23,539 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:23,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:23,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:23,539 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:23,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:23,540 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:23,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:23,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:23,540 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:23,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:23,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,543 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:23,543 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:23,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:23,544 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,544 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:23,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:23,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:23,677 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:23,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:23,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:23,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1682 [2022-12-13 02:03:23,677 INFO L420 AbstractCegarLoop]: === Iteration 1684 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:23,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:23,677 INFO L85 PathProgramCache]: Analyzing trace with hash -413235931, now seen corresponding path program 1 times [2022-12-13 02:03:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:23,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642212095] [2022-12-13 02:03:23,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:23,739 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 02:03:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:23,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642212095] [2022-12-13 02:03:23,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642212095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:23,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:23,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:23,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345603473] [2022-12-13 02:03:23,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:23,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:23,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:23,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:23,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:23,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:23,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:23,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:23,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:23,793 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:23,793 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:23,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:23,793 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:23,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:23,794 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:23,794 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:23,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:23,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:23,795 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,795 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:23,795 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:23,795 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:23,795 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,796 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:23,796 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:23,796 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:23,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,798 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:23,798 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:23,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:23,799 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:23,799 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:23,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:23,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:23,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:23,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:23,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:23,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:23,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1683 [2022-12-13 02:03:23,935 INFO L420 AbstractCegarLoop]: === Iteration 1685 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:23,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:23,936 INFO L85 PathProgramCache]: Analyzing trace with hash -355977629, now seen corresponding path program 1 times [2022-12-13 02:03:23,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:23,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607237866] [2022-12-13 02:03:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:24,005 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 02:03:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:24,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607237866] [2022-12-13 02:03:24,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607237866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:24,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:24,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870065125] [2022-12-13 02:03:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:24,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:24,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:24,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:24,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:24,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:24,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:24,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:24,067 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:24,067 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:24,068 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:24,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:24,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:24,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:24,069 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:24,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:24,069 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:24,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:24,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:24,070 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:24,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:24,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,073 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:24,073 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:24,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:24,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:24,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:24,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:24,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:24,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:24,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:24,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1684 [2022-12-13 02:03:24,206 INFO L420 AbstractCegarLoop]: === Iteration 1686 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash -298719327, now seen corresponding path program 1 times [2022-12-13 02:03:24,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:24,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589988418] [2022-12-13 02:03:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:24,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:24,276 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 02:03:24,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:24,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589988418] [2022-12-13 02:03:24,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589988418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:24,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:24,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937624460] [2022-12-13 02:03:24,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:24,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:24,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:24,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:24,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:24,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:24,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:24,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:24,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:24,338 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:24,338 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:24,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:24,338 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:24,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:24,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:24,339 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:24,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:24,340 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:24,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:24,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:24,341 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:24,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:24,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,345 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:24,345 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:24,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:24,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:24,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:24,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:24,465 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:24,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:24,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:24,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1685 [2022-12-13 02:03:24,465 INFO L420 AbstractCegarLoop]: === Iteration 1687 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash -241461025, now seen corresponding path program 1 times [2022-12-13 02:03:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:24,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814648254] [2022-12-13 02:03:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:24,522 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 02:03:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814648254] [2022-12-13 02:03:24,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814648254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:24,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:24,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300123753] [2022-12-13 02:03:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:24,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:24,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:24,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:24,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:24,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:24,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:24,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:24,567 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:24,567 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:24,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:24,567 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:24,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:24,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:24,568 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:24,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:24,569 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:24,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:24,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:24,569 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:24,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:24,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,572 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:24,572 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:24,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:24,572 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,572 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:24,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:24,688 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:24,689 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:24,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:24,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:24,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1686 [2022-12-13 02:03:24,689 INFO L420 AbstractCegarLoop]: === Iteration 1688 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash -184202723, now seen corresponding path program 1 times [2022-12-13 02:03:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:24,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922603826] [2022-12-13 02:03:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:24,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:24,744 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 02:03:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:24,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922603826] [2022-12-13 02:03:24,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922603826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:24,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:24,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:24,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475572760] [2022-12-13 02:03:24,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:24,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:24,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:24,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:24,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:24,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:24,790 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:24,790 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:24,791 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:24,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:24,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:24,791 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:24,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:24,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:24,792 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:24,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:24,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:24,793 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:24,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:24,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:24,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,795 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:24,796 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:24,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:24,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:24,912 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:24,913 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:24,913 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:24,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:24,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:24,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1687 [2022-12-13 02:03:24,913 INFO L420 AbstractCegarLoop]: === Iteration 1689 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:24,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash -126944421, now seen corresponding path program 1 times [2022-12-13 02:03:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:24,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760315086] [2022-12-13 02:03:24,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:24,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:24,967 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 02:03:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:24,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760315086] [2022-12-13 02:03:24,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760315086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:24,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:24,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837737653] [2022-12-13 02:03:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:24,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:24,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:24,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:24,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:24,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:24,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:24,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:25,019 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:25,019 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:25,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:25,019 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:25,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:25,020 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:25,020 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:25,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:25,021 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,021 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:25,021 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:25,021 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:25,021 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,021 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:25,021 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:25,021 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,024 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:25,024 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:25,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:25,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:25,140 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:25,141 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:25,141 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:25,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,141 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:25,141 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:25,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1688 [2022-12-13 02:03:25,142 INFO L420 AbstractCegarLoop]: === Iteration 1690 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:25,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -69686119, now seen corresponding path program 1 times [2022-12-13 02:03:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:25,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607487388] [2022-12-13 02:03:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:25,197 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 02:03:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:25,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607487388] [2022-12-13 02:03:25,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607487388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:25,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:25,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:25,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000329835] [2022-12-13 02:03:25,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:25,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:25,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:25,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:25,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:25,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:25,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:25,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:25,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:25,266 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:25,267 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:25,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:25,267 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:25,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:25,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:25,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:25,268 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:25,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:25,269 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:25,269 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:25,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:25,269 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:25,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:25,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,273 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:25,273 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:25,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:25,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:25,408 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:25,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:25,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:25,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:25,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:25,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1689 [2022-12-13 02:03:25,409 INFO L420 AbstractCegarLoop]: === Iteration 1691 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:25,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -12427817, now seen corresponding path program 1 times [2022-12-13 02:03:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:25,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066847233] [2022-12-13 02:03:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:25,463 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 02:03:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066847233] [2022-12-13 02:03:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066847233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:25,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:25,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646012682] [2022-12-13 02:03:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:25,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:25,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:25,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:25,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:25,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:25,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:25,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:25,514 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:25,514 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:25,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:25,515 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:25,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:25,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:25,516 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:25,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:25,517 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:25,517 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:25,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:25,517 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:25,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:25,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:25,521 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:25,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:25,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:25,657 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:25,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:03:25,658 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:25,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:25,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:25,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1690 [2022-12-13 02:03:25,659 INFO L420 AbstractCegarLoop]: === Iteration 1692 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:25,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash 44830485, now seen corresponding path program 1 times [2022-12-13 02:03:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:25,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117236125] [2022-12-13 02:03:25,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:25,727 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 02:03:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:25,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117236125] [2022-12-13 02:03:25,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117236125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:25,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:25,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:25,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144565521] [2022-12-13 02:03:25,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:25,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:25,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:25,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:25,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:25,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:25,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:25,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:25,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:25,780 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:25,780 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:25,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:25,781 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:25,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:25,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:25,781 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:25,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:25,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:25,782 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:25,782 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:25,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:25,783 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,783 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:25,783 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:25,783 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:25,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,785 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:25,786 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:25,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:25,786 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:25,786 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:25,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:25,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:25,922 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:25,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:25,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:25,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1691 [2022-12-13 02:03:25,922 INFO L420 AbstractCegarLoop]: === Iteration 1693 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:25,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:25,923 INFO L85 PathProgramCache]: Analyzing trace with hash 102088787, now seen corresponding path program 1 times [2022-12-13 02:03:25,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:25,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117705044] [2022-12-13 02:03:25,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:25,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:25,983 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 02:03:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117705044] [2022-12-13 02:03:25,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117705044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:25,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:25,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233279200] [2022-12-13 02:03:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:25,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:25,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:25,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:25,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:25,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:25,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:26,051 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:26,052 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:26,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:26,052 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:26,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:26,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:26,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:26,053 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:26,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:26,054 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:26,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:26,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:26,054 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:26,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:26,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,057 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:26,057 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:26,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:26,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:26,190 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:26,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:26,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:26,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:26,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:26,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1692 [2022-12-13 02:03:26,192 INFO L420 AbstractCegarLoop]: === Iteration 1694 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 159347089, now seen corresponding path program 1 times [2022-12-13 02:03:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:26,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295494143] [2022-12-13 02:03:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:26,258 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 02:03:26,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:26,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295494143] [2022-12-13 02:03:26,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295494143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:26,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:26,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967263815] [2022-12-13 02:03:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:26,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:26,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:26,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:26,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:26,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:26,321 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:26,322 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:26,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:26,322 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:26,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:26,323 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:26,323 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:26,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:26,324 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:26,324 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:26,324 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:26,324 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:26,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:26,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,327 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:26,327 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:26,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:26,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:26,459 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:26,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:26,460 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:26,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:26,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:26,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1693 [2022-12-13 02:03:26,461 INFO L420 AbstractCegarLoop]: === Iteration 1695 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:26,461 INFO L85 PathProgramCache]: Analyzing trace with hash 216605391, now seen corresponding path program 1 times [2022-12-13 02:03:26,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:26,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716360072] [2022-12-13 02:03:26,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:26,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:26,521 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 02:03:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716360072] [2022-12-13 02:03:26,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716360072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:26,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181605983] [2022-12-13 02:03:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:26,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:26,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:26,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:26,522 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:26,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:26,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:26,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:26,581 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:26,582 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:26,582 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:26,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:26,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:26,583 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:26,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:26,583 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:26,584 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:26,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:26,584 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:26,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:26,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,587 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:26,587 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:26,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:26,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:26,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:26,721 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:26,721 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:26,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:26,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:26,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1694 [2022-12-13 02:03:26,721 INFO L420 AbstractCegarLoop]: === Iteration 1696 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 273863693, now seen corresponding path program 1 times [2022-12-13 02:03:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:26,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770421632] [2022-12-13 02:03:26,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:26,797 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 02:03:26,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:26,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770421632] [2022-12-13 02:03:26,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770421632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:26,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:26,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:26,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072082571] [2022-12-13 02:03:26,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:26,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:26,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:26,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:26,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:26,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:26,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:26,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:26,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:26,852 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:26,852 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:26,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:26,853 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:26,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:26,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:26,853 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:26,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:26,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:26,854 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:26,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:26,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:26,854 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:26,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:26,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:26,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,857 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:26,857 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:26,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:26,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:26,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:26,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:26,991 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:26,991 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:26,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:26,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:26,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:26,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1695 [2022-12-13 02:03:26,992 INFO L420 AbstractCegarLoop]: === Iteration 1697 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:26,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:26,992 INFO L85 PathProgramCache]: Analyzing trace with hash 331121995, now seen corresponding path program 1 times [2022-12-13 02:03:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:26,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692987702] [2022-12-13 02:03:26,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:26,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:27,061 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 02:03:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:27,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692987702] [2022-12-13 02:03:27,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692987702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:27,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:27,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78763405] [2022-12-13 02:03:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:27,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:27,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:27,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:27,062 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:27,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:27,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:27,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:27,107 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:27,107 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:27,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:27,108 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:27,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:27,108 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:27,108 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:27,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:27,109 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,109 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:27,109 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:27,109 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:27,110 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:27,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:27,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,112 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:27,113 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:27,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:27,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,113 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:27,229 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:27,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:27,230 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:27,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:27,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:27,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1696 [2022-12-13 02:03:27,230 INFO L420 AbstractCegarLoop]: === Iteration 1698 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash 388380297, now seen corresponding path program 1 times [2022-12-13 02:03:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:27,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647383014] [2022-12-13 02:03:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:27,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:27,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647383014] [2022-12-13 02:03:27,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647383014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:27,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:27,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92710638] [2022-12-13 02:03:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:27,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:27,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:27,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:27,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:27,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:27,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:27,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:27,329 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:27,329 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:27,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:27,329 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:27,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:27,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:27,330 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:27,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:27,331 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:27,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:27,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:27,331 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:27,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:27,332 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,334 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:27,334 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:27,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:27,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:27,458 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:27,459 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:03:27,459 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:27,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,459 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:27,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:27,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1697 [2022-12-13 02:03:27,459 INFO L420 AbstractCegarLoop]: === Iteration 1699 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 445638599, now seen corresponding path program 1 times [2022-12-13 02:03:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491546882] [2022-12-13 02:03:27,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:27,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491546882] [2022-12-13 02:03:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491546882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:27,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:27,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:27,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579606692] [2022-12-13 02:03:27,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:27,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:27,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:27,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:27,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:27,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:27,570 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:27,570 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:27,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:27,571 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:27,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:27,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:27,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:27,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:27,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:27,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:27,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:27,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:27,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,573 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:27,573 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:27,573 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,575 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:27,575 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:27,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:27,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:27,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:27,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:27,696 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:27,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:27,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:27,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1698 [2022-12-13 02:03:27,696 INFO L420 AbstractCegarLoop]: === Iteration 1700 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:27,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash 502896901, now seen corresponding path program 1 times [2022-12-13 02:03:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:27,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943447725] [2022-12-13 02:03:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:27,754 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 02:03:27,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:27,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943447725] [2022-12-13 02:03:27,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943447725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:27,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:27,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051849101] [2022-12-13 02:03:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:27,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:27,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:27,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:27,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:27,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:27,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:27,804 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:27,805 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:27,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:27,805 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:27,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:27,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:27,806 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:27,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:27,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:27,806 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:27,806 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:27,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:27,807 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:27,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:27,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:27,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,809 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:27,809 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:27,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:27,810 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:27,810 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:27,928 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:27,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:27,929 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:27,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:27,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:27,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1699 [2022-12-13 02:03:27,929 INFO L420 AbstractCegarLoop]: === Iteration 1701 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:27,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash 560155203, now seen corresponding path program 1 times [2022-12-13 02:03:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:27,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13670553] [2022-12-13 02:03:27,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:27,998 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 02:03:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:27,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13670553] [2022-12-13 02:03:27,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13670553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:27,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:27,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:27,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574408234] [2022-12-13 02:03:27,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:27,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:27,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:27,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:27,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:27,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:27,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:27,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:28,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:28,050 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:28,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:28,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:28,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:28,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:28,051 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:28,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:28,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:28,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:28,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:28,052 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:28,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:28,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,054 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:28,054 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:28,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:28,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:28,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:28,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:03:28,177 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:28,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:28,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:28,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1700 [2022-12-13 02:03:28,177 INFO L420 AbstractCegarLoop]: === Iteration 1702 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:28,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash 617413505, now seen corresponding path program 1 times [2022-12-13 02:03:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:28,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315296811] [2022-12-13 02:03:28,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:28,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:28,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:28,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315296811] [2022-12-13 02:03:28,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315296811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:28,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:28,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558017387] [2022-12-13 02:03:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:28,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:28,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:28,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:28,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:28,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:28,277 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:28,277 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:28,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:28,277 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:28,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:28,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:28,278 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:28,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:28,279 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:28,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:28,279 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:28,279 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,279 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:28,279 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:28,279 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,282 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:28,282 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:28,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:28,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:28,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:28,397 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:28,397 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:28,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,397 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:28,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:28,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1701 [2022-12-13 02:03:28,398 INFO L420 AbstractCegarLoop]: === Iteration 1703 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 674671807, now seen corresponding path program 1 times [2022-12-13 02:03:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:28,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898152468] [2022-12-13 02:03:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:28,451 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 02:03:28,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:28,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898152468] [2022-12-13 02:03:28,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898152468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:28,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:28,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372065459] [2022-12-13 02:03:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:28,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:28,452 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:28,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:28,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:28,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:28,504 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:28,504 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:28,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:28,505 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:28,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:28,505 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:28,505 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:28,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:28,506 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,506 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:28,506 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:28,506 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:28,506 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:28,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:28,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,509 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:28,509 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:28,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:28,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:28,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:28,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:28,627 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:28,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:28,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:28,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1702 [2022-12-13 02:03:28,627 INFO L420 AbstractCegarLoop]: === Iteration 1704 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:28,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash 731930109, now seen corresponding path program 1 times [2022-12-13 02:03:28,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:28,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839038930] [2022-12-13 02:03:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:28,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:28,684 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 02:03:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839038930] [2022-12-13 02:03:28,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839038930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:28,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:28,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657679873] [2022-12-13 02:03:28,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:28,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:28,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:28,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:28,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:28,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:28,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:28,729 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:28,729 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:28,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:28,730 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:28,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:28,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:28,730 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:28,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:28,731 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,731 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:28,731 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:28,731 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:28,731 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,731 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:28,731 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:28,731 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,734 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:28,734 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:28,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:28,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:28,852 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:28,853 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:28,853 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:28,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:28,853 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:28,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1703 [2022-12-13 02:03:28,853 INFO L420 AbstractCegarLoop]: === Iteration 1705 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 789188411, now seen corresponding path program 1 times [2022-12-13 02:03:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:28,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364163840] [2022-12-13 02:03:28,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:28,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:28,908 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 02:03:28,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:28,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364163840] [2022-12-13 02:03:28,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364163840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:28,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:28,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173610529] [2022-12-13 02:03:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:28,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:28,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:28,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:28,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:28,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:28,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:28,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:28,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:28,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:28,963 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:28,963 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:28,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:28,964 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:28,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:28,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:28,964 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:28,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:28,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:28,965 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:28,965 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:28,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:28,965 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:28,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:28,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:28,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,968 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:28,968 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:28,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:28,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:28,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:29,105 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:29,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:03:29,106 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:29,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:29,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:29,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1704 [2022-12-13 02:03:29,106 INFO L420 AbstractCegarLoop]: === Iteration 1706 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:29,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:29,106 INFO L85 PathProgramCache]: Analyzing trace with hash 846446713, now seen corresponding path program 1 times [2022-12-13 02:03:29,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:29,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463920639] [2022-12-13 02:03:29,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:29,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:29,179 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 02:03:29,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463920639] [2022-12-13 02:03:29,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463920639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:29,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:29,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859775171] [2022-12-13 02:03:29,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:29,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:29,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:29,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:29,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:29,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:29,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:29,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:29,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:29,234 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:29,234 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:29,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:29,235 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:29,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:29,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:29,235 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:29,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:29,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:29,236 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:29,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:29,237 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:29,237 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:29,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:29,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:29,239 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:29,240 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:29,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:29,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:29,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:29,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:29,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:03:29,386 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:29,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:29,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1705 [2022-12-13 02:03:29,386 INFO L420 AbstractCegarLoop]: === Iteration 1707 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash 903705015, now seen corresponding path program 1 times [2022-12-13 02:03:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866377316] [2022-12-13 02:03:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:29,456 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 02:03:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:29,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866377316] [2022-12-13 02:03:29,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866377316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:29,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:29,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455347798] [2022-12-13 02:03:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:29,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:29,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:29,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:29,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:29,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:29,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:29,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:29,518 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:29,518 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:29,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:29,519 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:29,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:29,520 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:29,520 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:29,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:29,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:29,521 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,521 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:29,521 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:29,521 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:29,521 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,522 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:29,522 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:29,522 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:29,525 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:29,526 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:29,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:29,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:29,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:29,656 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:29,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:29,658 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:29,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:29,658 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:29,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1706 [2022-12-13 02:03:29,658 INFO L420 AbstractCegarLoop]: === Iteration 1708 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:29,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash 960963317, now seen corresponding path program 1 times [2022-12-13 02:03:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:29,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104821448] [2022-12-13 02:03:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:29,718 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 02:03:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104821448] [2022-12-13 02:03:29,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104821448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:29,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:29,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:29,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206553976] [2022-12-13 02:03:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:29,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:29,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:29,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:29,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:29,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:29,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:29,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:29,773 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:29,773 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:29,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:29,774 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:29,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:29,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:29,774 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:29,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:29,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:29,775 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:29,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:29,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:29,776 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:29,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:29,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:29,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:29,779 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:29,779 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:29,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:29,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:29,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:29,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:29,916 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:29,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:29,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:29,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1707 [2022-12-13 02:03:29,916 INFO L420 AbstractCegarLoop]: === Iteration 1709 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1018221619, now seen corresponding path program 1 times [2022-12-13 02:03:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:29,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42870697] [2022-12-13 02:03:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:29,985 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 02:03:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:29,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42870697] [2022-12-13 02:03:29,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42870697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:29,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:29,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954665963] [2022-12-13 02:03:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:29,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:29,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:29,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:29,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:29,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:29,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:29,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:29,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:29,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:30,042 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:30,042 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:30,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:30,043 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:30,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:30,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:30,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:30,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:30,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:30,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:30,044 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:30,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:30,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:30,045 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:30,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:30,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,048 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:30,048 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:30,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:30,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:30,180 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:30,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:30,181 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:30,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,181 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:30,181 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:30,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1708 [2022-12-13 02:03:30,181 INFO L420 AbstractCegarLoop]: === Iteration 1710 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1075479921, now seen corresponding path program 1 times [2022-12-13 02:03:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:30,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120208924] [2022-12-13 02:03:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:30,248 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 02:03:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:30,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120208924] [2022-12-13 02:03:30,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120208924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:30,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:30,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220488594] [2022-12-13 02:03:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:30,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:30,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:30,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:30,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:30,250 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:30,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:30,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:30,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:30,304 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:30,304 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:30,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:30,305 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:30,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:30,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:30,306 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:30,306 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:30,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:30,307 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,307 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:30,307 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:30,307 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:30,307 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:30,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:30,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,311 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:30,311 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:30,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:30,312 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,312 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:30,444 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:30,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:30,445 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:30,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:30,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:30,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1709 [2022-12-13 02:03:30,445 INFO L420 AbstractCegarLoop]: === Iteration 1711 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1132738223, now seen corresponding path program 1 times [2022-12-13 02:03:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288691984] [2022-12-13 02:03:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:30,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288691984] [2022-12-13 02:03:30,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288691984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:30,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:30,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690112154] [2022-12-13 02:03:30,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:30,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:30,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:30,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:30,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:30,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:30,574 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:30,574 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:30,575 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:30,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:30,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:30,576 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:30,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:30,577 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:30,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:30,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:30,577 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:30,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:30,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,580 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:30,580 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:30,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:30,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:30,712 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:30,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:30,713 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:30,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:30,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:30,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1710 [2022-12-13 02:03:30,713 INFO L420 AbstractCegarLoop]: === Iteration 1712 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1189996525, now seen corresponding path program 1 times [2022-12-13 02:03:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:30,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896299028] [2022-12-13 02:03:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:30,798 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 02:03:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896299028] [2022-12-13 02:03:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896299028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:30,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:30,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:30,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019445477] [2022-12-13 02:03:30,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:30,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:30,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:30,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:30,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:30,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:30,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:30,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:30,853 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:30,853 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:30,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:30,854 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:30,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:30,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:30,855 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:30,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:30,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:30,855 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:30,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:30,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:30,856 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:30,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:30,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:30,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,858 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:30,859 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:30,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:30,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:30,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:30,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:30,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:30,994 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:30,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:30,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:30,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:30,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1711 [2022-12-13 02:03:30,994 INFO L420 AbstractCegarLoop]: === Iteration 1713 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1247254827, now seen corresponding path program 1 times [2022-12-13 02:03:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:30,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974944543] [2022-12-13 02:03:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:31,057 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 02:03:31,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:31,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974944543] [2022-12-13 02:03:31,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974944543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:31,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:31,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404122984] [2022-12-13 02:03:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:31,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:31,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:31,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:31,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:31,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:31,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:31,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:31,111 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:31,111 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:31,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:31,111 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:31,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:31,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:31,112 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:31,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:31,113 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:31,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:31,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:31,114 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:31,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:31,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,118 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:31,118 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:31,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:31,118 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,118 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:31,253 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:31,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:31,254 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:31,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:31,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1712 [2022-12-13 02:03:31,254 INFO L420 AbstractCegarLoop]: === Iteration 1714 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:31,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:31,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1304513129, now seen corresponding path program 1 times [2022-12-13 02:03:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:31,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313740323] [2022-12-13 02:03:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:31,325 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 02:03:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:31,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313740323] [2022-12-13 02:03:31,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313740323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:31,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:31,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:31,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074877500] [2022-12-13 02:03:31,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:31,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:31,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:31,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:31,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:31,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:31,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:31,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:31,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:31,390 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:31,390 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:31,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:31,391 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:31,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:31,391 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:31,391 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:31,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:31,392 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,392 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:31,392 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:31,392 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:31,393 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,393 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:31,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:31,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,395 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:31,396 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:31,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:31,396 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,396 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:31,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:31,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:31,530 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:31,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:31,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:31,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1713 [2022-12-13 02:03:31,530 INFO L420 AbstractCegarLoop]: === Iteration 1715 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:31,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:31,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1361771431, now seen corresponding path program 1 times [2022-12-13 02:03:31,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:31,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102503535] [2022-12-13 02:03:31,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:31,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:31,592 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 02:03:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:31,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102503535] [2022-12-13 02:03:31,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102503535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:31,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:31,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:31,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352313755] [2022-12-13 02:03:31,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:31,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:31,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:31,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:31,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:31,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:31,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:31,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:31,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:31,646 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:31,646 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:31,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:31,647 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:31,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:31,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:31,647 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:31,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:31,648 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:31,648 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:31,649 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:31,649 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:31,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:31,649 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,651 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:31,652 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:31,652 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,652 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:31,784 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:31,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:31,785 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:31,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:31,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:31,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1714 [2022-12-13 02:03:31,785 INFO L420 AbstractCegarLoop]: === Iteration 1716 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1419029733, now seen corresponding path program 1 times [2022-12-13 02:03:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:31,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668700125] [2022-12-13 02:03:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:31,855 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 02:03:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:31,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668700125] [2022-12-13 02:03:31,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668700125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:31,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:31,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454877796] [2022-12-13 02:03:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:31,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:31,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:31,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:31,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:31,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:31,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:31,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:31,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:31,908 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:31,908 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:31,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:31,909 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:31,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:31,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:31,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:31,910 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:31,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:31,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:31,911 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:31,911 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:31,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:31,911 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:31,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:31,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:31,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,914 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:31,914 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:31,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:31,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:31,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:32,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:32,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:32,048 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:32,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:32,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:32,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1715 [2022-12-13 02:03:32,048 INFO L420 AbstractCegarLoop]: === Iteration 1717 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1476288035, now seen corresponding path program 1 times [2022-12-13 02:03:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:32,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403858869] [2022-12-13 02:03:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:32,118 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 02:03:32,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:32,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403858869] [2022-12-13 02:03:32,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403858869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:32,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:32,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400932326] [2022-12-13 02:03:32,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:32,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:32,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:32,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:32,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:32,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:32,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:32,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:32,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:32,175 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:32,176 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:32,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:32,176 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:32,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:32,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:32,177 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:32,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:32,177 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:32,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:32,178 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:32,178 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,178 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:32,178 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:32,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,180 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:32,180 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:32,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:32,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:32,298 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:32,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:32,299 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:32,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:32,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:32,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1716 [2022-12-13 02:03:32,299 INFO L420 AbstractCegarLoop]: === Iteration 1718 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:32,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1533546337, now seen corresponding path program 1 times [2022-12-13 02:03:32,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:32,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937470570] [2022-12-13 02:03:32,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:32,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:32,353 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 02:03:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:32,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937470570] [2022-12-13 02:03:32,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937470570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:32,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:32,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880589087] [2022-12-13 02:03:32,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:32,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:32,354 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:32,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:32,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:32,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:32,407 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:32,407 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:32,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:32,408 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:32,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:32,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:32,409 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:32,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:32,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:32,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:32,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:32,410 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:32,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:32,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,412 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:32,413 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:32,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:32,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:32,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:32,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:03:32,536 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:32,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:32,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:32,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1717 [2022-12-13 02:03:32,536 INFO L420 AbstractCegarLoop]: === Iteration 1719 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1590804639, now seen corresponding path program 1 times [2022-12-13 02:03:32,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:32,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415424907] [2022-12-13 02:03:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:32,591 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 02:03:32,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:32,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415424907] [2022-12-13 02:03:32,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415424907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:32,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:32,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:32,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651943120] [2022-12-13 02:03:32,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:32,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:32,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:32,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:32,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:32,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:32,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:32,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:32,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:32,634 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:32,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:32,635 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:32,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:32,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:32,636 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:32,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:32,636 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:32,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:32,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:32,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:32,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:32,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,639 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:32,640 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:32,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:32,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:32,755 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:32,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:32,756 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:32,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:32,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:32,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1718 [2022-12-13 02:03:32,756 INFO L420 AbstractCegarLoop]: === Iteration 1720 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:32,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1648062941, now seen corresponding path program 1 times [2022-12-13 02:03:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:32,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806183327] [2022-12-13 02:03:32,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:32,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:32,818 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 02:03:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:32,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806183327] [2022-12-13 02:03:32,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806183327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:32,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:32,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558733692] [2022-12-13 02:03:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:32,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:32,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:32,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:32,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:32,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:32,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:32,872 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:32,872 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:32,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:32,872 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:32,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:32,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:32,873 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:32,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:32,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:32,874 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:32,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:32,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:32,874 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,874 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:32,874 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:32,874 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:32,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,877 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:32,877 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:32,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:32,877 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:32,877 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:32,995 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:32,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:32,996 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:32,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:32,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:32,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:32,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1719 [2022-12-13 02:03:32,996 INFO L420 AbstractCegarLoop]: === Iteration 1721 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1705321243, now seen corresponding path program 1 times [2022-12-13 02:03:32,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:32,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459822556] [2022-12-13 02:03:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:33,059 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 02:03:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:33,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459822556] [2022-12-13 02:03:33,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459822556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:33,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:33,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207329983] [2022-12-13 02:03:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:33,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:33,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:33,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:33,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:33,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:33,113 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:33,113 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:33,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:33,114 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:33,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:33,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:33,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:33,114 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:33,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:33,115 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:33,115 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:33,115 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:33,115 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,115 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:33,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:33,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,118 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:33,118 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:33,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:33,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:33,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:33,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:33,252 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:33,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:33,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:33,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1720 [2022-12-13 02:03:33,252 INFO L420 AbstractCegarLoop]: === Iteration 1722 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:33,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:33,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1762579545, now seen corresponding path program 1 times [2022-12-13 02:03:33,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:33,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772971199] [2022-12-13 02:03:33,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:33,328 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 02:03:33,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:33,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772971199] [2022-12-13 02:03:33,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772971199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:33,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:33,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645224168] [2022-12-13 02:03:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:33,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:33,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:33,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:33,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:33,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:33,391 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:33,391 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:33,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:33,392 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:33,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:33,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:33,392 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:33,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:33,393 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,393 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:33,393 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:33,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:33,393 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:33,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:33,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,396 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:33,396 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:33,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:33,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:33,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:33,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:03:33,526 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:33,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:33,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:33,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1721 [2022-12-13 02:03:33,527 INFO L420 AbstractCegarLoop]: === Iteration 1723 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:33,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:33,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1819837847, now seen corresponding path program 1 times [2022-12-13 02:03:33,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:33,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421260867] [2022-12-13 02:03:33,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:33,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:33,595 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 02:03:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421260867] [2022-12-13 02:03:33,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421260867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:33,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:33,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172937337] [2022-12-13 02:03:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:33,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:33,596 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:33,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:33,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:33,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:33,658 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:33,658 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:33,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:33,659 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:33,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:33,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:33,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:33,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:33,661 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:33,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:33,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:33,661 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:33,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:33,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,665 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:33,665 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:33,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:33,666 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,666 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:33,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:33,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:33,799 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:33,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:33,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:33,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1722 [2022-12-13 02:03:33,799 INFO L420 AbstractCegarLoop]: === Iteration 1724 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1877096149, now seen corresponding path program 1 times [2022-12-13 02:03:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:33,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977621428] [2022-12-13 02:03:33,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:33,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:33,878 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 02:03:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:33,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977621428] [2022-12-13 02:03:33,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977621428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:33,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:33,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029548613] [2022-12-13 02:03:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:33,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:33,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:33,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:33,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:33,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:33,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:33,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:33,935 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:33,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:33,935 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:33,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:33,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:33,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:33,936 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:33,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:33,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:33,937 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:33,937 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:33,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:33,937 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:33,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:33,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:33,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,940 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:33,940 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:33,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:33,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:34,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:34,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:34,076 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:34,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:34,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:34,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1723 [2022-12-13 02:03:34,076 INFO L420 AbstractCegarLoop]: === Iteration 1725 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:34,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1934354451, now seen corresponding path program 1 times [2022-12-13 02:03:34,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:34,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370853903] [2022-12-13 02:03:34,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:34,147 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 02:03:34,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:34,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370853903] [2022-12-13 02:03:34,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370853903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:34,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:34,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:34,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395644534] [2022-12-13 02:03:34,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:34,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:34,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:34,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:34,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:34,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:34,203 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:34,204 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:34,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:34,204 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:34,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:34,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:34,205 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:34,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:34,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:34,206 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:34,206 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:34,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:34,206 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:34,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:34,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:34,209 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:34,209 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:34,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:34,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:34,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:34,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:34,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:34,344 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:34,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:34,344 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:34,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1724 [2022-12-13 02:03:34,344 INFO L420 AbstractCegarLoop]: === Iteration 1726 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:34,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1991612753, now seen corresponding path program 1 times [2022-12-13 02:03:34,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:34,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074561011] [2022-12-13 02:03:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:34,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:34,407 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 02:03:34,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:34,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074561011] [2022-12-13 02:03:34,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074561011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:34,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:34,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:34,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021573302] [2022-12-13 02:03:34,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:34,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:34,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:34,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:34,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:34,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:34,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:34,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:34,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:34,471 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:34,471 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:34,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:34,472 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:34,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:34,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:34,472 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:34,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:34,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:34,473 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,473 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:34,473 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:34,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:34,474 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:34,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:34,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:34,476 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:34,477 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:34,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:34,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:34,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:34,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:34,612 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:34,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:34,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:34,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1725 [2022-12-13 02:03:34,612 INFO L420 AbstractCegarLoop]: === Iteration 1727 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2048871055, now seen corresponding path program 1 times [2022-12-13 02:03:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:34,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720104723] [2022-12-13 02:03:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:34,675 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 02:03:34,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:34,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720104723] [2022-12-13 02:03:34,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720104723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:34,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:34,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619762688] [2022-12-13 02:03:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:34,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:34,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:34,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:34,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:34,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:34,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:34,730 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:34,730 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:34,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:34,731 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:34,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:34,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:34,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:34,732 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:34,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:34,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:34,733 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:34,733 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:34,733 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:34,733 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:34,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:34,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:34,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:34,736 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:34,736 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:34,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:34,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:34,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:34,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:34,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:34,873 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:34,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:34,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:34,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1726 [2022-12-13 02:03:34,873 INFO L420 AbstractCegarLoop]: === Iteration 1728 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 2106129357, now seen corresponding path program 1 times [2022-12-13 02:03:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:34,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961024914] [2022-12-13 02:03:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:34,946 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 02:03:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:34,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961024914] [2022-12-13 02:03:34,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961024914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:34,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:34,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:34,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666101507] [2022-12-13 02:03:34,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:34,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:34,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:34,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:34,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:34,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:34,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:34,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:34,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:34,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:35,019 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:35,020 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:35,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:35,020 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:35,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:35,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:35,021 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:35,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:35,022 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,022 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:35,023 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:35,023 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:35,023 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:35,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:35,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,026 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:35,027 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:35,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:35,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:35,172 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:35,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 02:03:35,173 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:35,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:35,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1727 [2022-12-13 02:03:35,174 INFO L420 AbstractCegarLoop]: === Iteration 1729 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2131579637, now seen corresponding path program 1 times [2022-12-13 02:03:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:35,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324778222] [2022-12-13 02:03:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:35,250 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 02:03:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:35,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324778222] [2022-12-13 02:03:35,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324778222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:35,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:35,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478153097] [2022-12-13 02:03:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:35,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:35,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:35,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:35,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:35,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:35,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:35,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:35,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:35,303 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:35,304 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:35,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:35,304 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:35,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:35,305 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:35,305 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:35,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:35,306 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:35,306 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:35,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:35,306 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,306 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:35,306 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:35,306 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,309 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:35,309 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:35,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:35,309 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,310 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:35,437 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:35,438 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:03:35,438 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:35,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,438 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:35,438 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:35,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1728 [2022-12-13 02:03:35,438 INFO L420 AbstractCegarLoop]: === Iteration 1730 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:35,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2074321335, now seen corresponding path program 1 times [2022-12-13 02:03:35,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:35,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293186392] [2022-12-13 02:03:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:35,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:35,491 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 02:03:35,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:35,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293186392] [2022-12-13 02:03:35,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293186392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:35,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:35,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:35,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421915595] [2022-12-13 02:03:35,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:35,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:35,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:35,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:35,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:35,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:35,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:35,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:35,536 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:35,536 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:35,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:35,537 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:35,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:35,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:35,537 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:35,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:35,538 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:35,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:35,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:35,538 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:35,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:35,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,541 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:35,541 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:35,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:35,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:35,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:35,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:35,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:35,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:35,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:35,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1729 [2022-12-13 02:03:35,659 INFO L420 AbstractCegarLoop]: === Iteration 1731 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:35,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2017063033, now seen corresponding path program 1 times [2022-12-13 02:03:35,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:35,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808206717] [2022-12-13 02:03:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:35,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:35,714 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 02:03:35,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:35,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808206717] [2022-12-13 02:03:35,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808206717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:35,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:35,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656458902] [2022-12-13 02:03:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:35,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:35,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:35,715 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:35,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:35,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:35,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:35,765 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:35,765 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:35,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:35,766 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:35,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:35,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:35,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:35,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:35,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:35,767 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:35,767 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:35,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:35,767 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,767 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:35,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:35,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:35,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,770 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:35,770 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:35,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:35,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:35,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:35,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:35,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:03:35,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:35,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:35,894 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:35,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1730 [2022-12-13 02:03:35,894 INFO L420 AbstractCegarLoop]: === Iteration 1732 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:35,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:35,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1959804731, now seen corresponding path program 1 times [2022-12-13 02:03:35,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:35,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531026959] [2022-12-13 02:03:35,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:35,986 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 02:03:35,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:35,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531026959] [2022-12-13 02:03:35,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531026959] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:35,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:35,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:35,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635795033] [2022-12-13 02:03:35,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:35,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:35,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:35,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:35,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:35,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:35,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:35,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:35,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:35,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:36,047 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:36,048 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:36,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:36,048 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:36,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:36,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:36,049 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:36,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:36,049 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:36,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:36,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:36,050 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:36,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:36,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,053 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:36,053 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:36,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:36,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:36,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:36,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:36,171 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:36,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:36,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:36,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1731 [2022-12-13 02:03:36,171 INFO L420 AbstractCegarLoop]: === Iteration 1733 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1902546429, now seen corresponding path program 1 times [2022-12-13 02:03:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:36,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488314872] [2022-12-13 02:03:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:36,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:36,226 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 02:03:36,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:36,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488314872] [2022-12-13 02:03:36,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488314872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:36,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:36,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756745912] [2022-12-13 02:03:36,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:36,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:36,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:36,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:36,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:36,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:36,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:36,269 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:36,270 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:36,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:36,270 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:36,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:36,270 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:36,270 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:36,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:36,271 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,271 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:36,271 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:36,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:36,272 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,272 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:36,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:36,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,274 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:36,274 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:36,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:36,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:36,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:36,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:03:36,413 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:36,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:36,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:36,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1732 [2022-12-13 02:03:36,413 INFO L420 AbstractCegarLoop]: === Iteration 1734 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1845288127, now seen corresponding path program 1 times [2022-12-13 02:03:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081211980] [2022-12-13 02:03:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:36,468 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 02:03:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081211980] [2022-12-13 02:03:36,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081211980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:36,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:36,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671510515] [2022-12-13 02:03:36,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:36,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:36,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:36,469 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:36,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:36,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:36,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:36,512 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:36,512 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:36,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:36,513 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:36,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:36,513 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:36,513 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:36,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:36,514 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,514 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:36,514 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:36,514 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:36,515 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,515 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:36,515 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:36,515 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,517 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:36,517 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:36,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:36,518 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,518 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:36,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:36,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:03:36,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:36,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:36,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:36,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1733 [2022-12-13 02:03:36,639 INFO L420 AbstractCegarLoop]: === Iteration 1735 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1788029825, now seen corresponding path program 1 times [2022-12-13 02:03:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358303084] [2022-12-13 02:03:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:36,693 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 02:03:36,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358303084] [2022-12-13 02:03:36,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358303084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:36,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:36,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:36,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562021318] [2022-12-13 02:03:36,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:36,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:36,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:36,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:36,694 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:36,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:36,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:36,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:36,738 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:36,738 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:36,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:36,738 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:36,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:36,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:36,739 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:36,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:36,740 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:36,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:36,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:36,740 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:36,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:36,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,743 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:36,743 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:36,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:36,743 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:36,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:36,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:36,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:36,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:36,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:36,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1734 [2022-12-13 02:03:36,865 INFO L420 AbstractCegarLoop]: === Iteration 1736 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:36,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:36,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1730771523, now seen corresponding path program 1 times [2022-12-13 02:03:36,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:36,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356891813] [2022-12-13 02:03:36,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:36,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:36,928 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 02:03:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:36,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356891813] [2022-12-13 02:03:36,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356891813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:36,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:36,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201639693] [2022-12-13 02:03:36,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:36,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:36,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:36,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:36,929 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:36,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:36,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:36,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:36,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:36,973 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:36,973 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:36,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:36,974 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:36,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:36,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:36,974 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:36,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:36,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:36,975 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:36,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:36,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:36,975 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:36,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:36,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:36,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,978 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:36,978 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:36,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:36,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:36,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:37,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:37,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:37,095 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:37,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:37,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:37,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1735 [2022-12-13 02:03:37,095 INFO L420 AbstractCegarLoop]: === Iteration 1737 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1673513221, now seen corresponding path program 1 times [2022-12-13 02:03:37,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:37,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740489850] [2022-12-13 02:03:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:37,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:37,158 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 02:03:37,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:37,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740489850] [2022-12-13 02:03:37,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740489850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:37,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:37,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:37,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241250418] [2022-12-13 02:03:37,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:37,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:37,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:37,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:37,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:37,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:37,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:37,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:37,203 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:37,203 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:37,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:37,204 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:37,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:37,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:37,204 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:37,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:37,205 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:37,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:37,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:37,206 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:37,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:37,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,209 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:37,209 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:37,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:37,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:37,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:37,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:37,325 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:37,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,325 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:37,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:37,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1736 [2022-12-13 02:03:37,325 INFO L420 AbstractCegarLoop]: === Iteration 1738 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:37,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:37,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1616254919, now seen corresponding path program 1 times [2022-12-13 02:03:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:37,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363520956] [2022-12-13 02:03:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:37,379 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 02:03:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363520956] [2022-12-13 02:03:37,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363520956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:37,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:37,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136300414] [2022-12-13 02:03:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:37,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:37,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:37,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:37,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:37,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:37,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:37,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:37,423 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:37,423 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:37,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:37,423 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:37,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:37,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:37,424 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:37,424 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:37,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:37,425 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:37,425 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:37,425 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:37,425 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,425 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:37,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:37,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,428 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:37,428 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:37,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:37,428 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,428 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:37,543 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:37,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:37,544 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:37,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:37,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:37,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1737 [2022-12-13 02:03:37,544 INFO L420 AbstractCegarLoop]: === Iteration 1739 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:37,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:37,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1558996617, now seen corresponding path program 1 times [2022-12-13 02:03:37,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:37,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953867811] [2022-12-13 02:03:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:37,610 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 02:03:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:37,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953867811] [2022-12-13 02:03:37,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953867811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:37,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:37,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203480385] [2022-12-13 02:03:37,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:37,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:37,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:37,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:37,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:37,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:37,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:37,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:37,654 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:37,654 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:37,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:37,655 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:37,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:37,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:37,655 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:37,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:37,656 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,656 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:37,656 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:37,656 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:37,656 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,656 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:37,656 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:37,656 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,659 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:37,659 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:37,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:37,659 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,659 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:37,773 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:37,774 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:37,774 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:37,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,774 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:37,774 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:37,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1738 [2022-12-13 02:03:37,774 INFO L420 AbstractCegarLoop]: === Iteration 1740 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:37,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1501738315, now seen corresponding path program 1 times [2022-12-13 02:03:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:37,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053862514] [2022-12-13 02:03:37,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:37,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:37,829 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 02:03:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:37,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053862514] [2022-12-13 02:03:37,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053862514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:37,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:37,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:37,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332600115] [2022-12-13 02:03:37,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:37,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:37,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:37,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:37,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:37,872 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:37,872 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:37,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:37,873 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:37,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:37,873 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:37,873 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:37,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:37,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:37,874 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,874 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:37,874 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:37,874 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:37,874 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,875 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:37,875 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:37,875 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:37,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,877 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:37,877 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:37,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:37,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:37,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:37,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:37,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:37,993 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:37,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:37,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:37,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:37,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1739 [2022-12-13 02:03:37,994 INFO L420 AbstractCegarLoop]: === Iteration 1741 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:37,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:37,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1444480013, now seen corresponding path program 1 times [2022-12-13 02:03:37,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:37,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229009115] [2022-12-13 02:03:37,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:37,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:38,050 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 02:03:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:38,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229009115] [2022-12-13 02:03:38,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229009115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:38,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:38,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410837579] [2022-12-13 02:03:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:38,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:38,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:38,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:38,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:38,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:38,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:38,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:38,094 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:38,094 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:38,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:38,095 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:38,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:38,095 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:38,095 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:38,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:38,096 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,096 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:38,096 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:38,096 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:38,097 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,097 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:38,097 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:38,097 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,099 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:38,099 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:38,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:38,100 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,100 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:38,215 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:38,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:38,216 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:38,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:38,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:38,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1740 [2022-12-13 02:03:38,216 INFO L420 AbstractCegarLoop]: === Iteration 1742 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1387221711, now seen corresponding path program 1 times [2022-12-13 02:03:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:38,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308998317] [2022-12-13 02:03:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:38,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:38,269 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 02:03:38,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308998317] [2022-12-13 02:03:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308998317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249096938] [2022-12-13 02:03:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:38,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:38,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:38,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:38,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:38,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:38,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:38,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:38,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:38,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:38,320 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:38,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:38,321 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:38,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:38,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:38,321 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:38,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:38,322 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,322 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:38,322 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:38,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:38,322 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,322 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:38,322 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:38,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,325 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:38,325 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:38,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:38,325 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,326 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:38,444 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:38,445 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:03:38,445 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:38,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,445 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:38,445 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:38,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1741 [2022-12-13 02:03:38,445 INFO L420 AbstractCegarLoop]: === Iteration 1743 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:38,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1329963409, now seen corresponding path program 1 times [2022-12-13 02:03:38,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:38,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190005250] [2022-12-13 02:03:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:38,500 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 02:03:38,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:38,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190005250] [2022-12-13 02:03:38,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190005250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:38,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:38,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:38,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412115076] [2022-12-13 02:03:38,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:38,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:38,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:38,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:38,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:38,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:38,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:38,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:38,545 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:38,545 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:38,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:38,545 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:38,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:38,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:38,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:38,546 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:38,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:38,547 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,547 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:38,547 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:38,547 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:38,547 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:38,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:38,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,550 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:38,550 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:38,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:38,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:38,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:38,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:38,667 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:38,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,667 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:38,667 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:38,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1742 [2022-12-13 02:03:38,667 INFO L420 AbstractCegarLoop]: === Iteration 1744 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1272705107, now seen corresponding path program 1 times [2022-12-13 02:03:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:38,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860153053] [2022-12-13 02:03:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:38,744 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 02:03:38,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:38,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860153053] [2022-12-13 02:03:38,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860153053] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:38,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:38,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:38,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017859604] [2022-12-13 02:03:38,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:38,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:38,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:38,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:38,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:38,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:38,793 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:38,793 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:38,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:38,794 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:38,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:38,795 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:38,795 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:38,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:38,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:38,796 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,796 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:38,796 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:38,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:38,796 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,797 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:38,797 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:38,797 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:38,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:38,818 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:38,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:38,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:38,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:38,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:38,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 172 [2022-12-13 02:03:38,968 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:38,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:38,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:38,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:38,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1743 [2022-12-13 02:03:38,969 INFO L420 AbstractCegarLoop]: === Iteration 1745 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:38,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1215446805, now seen corresponding path program 1 times [2022-12-13 02:03:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:38,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224028770] [2022-12-13 02:03:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:39,035 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 02:03:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:39,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224028770] [2022-12-13 02:03:39,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224028770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:39,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:39,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938108927] [2022-12-13 02:03:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:39,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:39,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:39,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:39,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:39,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:39,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:39,115 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:39,115 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:39,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:39,116 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:39,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:39,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:39,117 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:39,117 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:39,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:39,118 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,118 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:39,118 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:39,118 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:39,119 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,119 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:39,119 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:39,119 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:39,123 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:39,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:39,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:39,256 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:39,258 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:39,258 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:39,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,258 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:39,258 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:39,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1744 [2022-12-13 02:03:39,258 INFO L420 AbstractCegarLoop]: === Iteration 1746 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1158188503, now seen corresponding path program 1 times [2022-12-13 02:03:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:39,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297746400] [2022-12-13 02:03:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:39,328 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 02:03:39,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:39,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297746400] [2022-12-13 02:03:39,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297746400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:39,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:39,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887223811] [2022-12-13 02:03:39,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:39,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:39,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:39,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:39,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:39,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:39,373 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:39,373 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:39,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:39,374 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:39,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:39,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:39,374 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:39,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:39,375 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,375 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:39,375 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:39,375 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:39,375 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:39,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:39,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,378 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:39,378 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:39,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:39,495 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:39,496 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:39,496 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:39,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,496 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:39,496 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:39,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1745 [2022-12-13 02:03:39,496 INFO L420 AbstractCegarLoop]: === Iteration 1747 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1100930201, now seen corresponding path program 1 times [2022-12-13 02:03:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701305493] [2022-12-13 02:03:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:39,552 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 02:03:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:39,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701305493] [2022-12-13 02:03:39,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701305493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:39,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:39,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118208492] [2022-12-13 02:03:39,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:39,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:39,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:39,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:39,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:39,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:39,604 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:39,604 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:39,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:39,604 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:39,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:39,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:39,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:39,605 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:39,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:39,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:39,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:39,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:39,606 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:39,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:39,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,609 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:39,609 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:39,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:39,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:39,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:39,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:39,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:39,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:39,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:39,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1746 [2022-12-13 02:03:39,724 INFO L420 AbstractCegarLoop]: === Iteration 1748 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1043671899, now seen corresponding path program 1 times [2022-12-13 02:03:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:39,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795272380] [2022-12-13 02:03:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:39,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:39,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795272380] [2022-12-13 02:03:39,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795272380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:39,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:39,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:39,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518394055] [2022-12-13 02:03:39,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:39,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:39,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:39,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:39,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:39,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:39,821 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:39,822 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:39,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:39,822 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:39,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:39,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:39,823 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:39,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:39,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:39,823 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:39,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:39,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:39,824 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:39,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:39,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:39,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,827 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:39,827 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:39,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:39,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:39,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:39,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:39,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:39,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:39,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:39,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:39,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1747 [2022-12-13 02:03:39,943 INFO L420 AbstractCegarLoop]: === Iteration 1749 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:39,943 INFO L85 PathProgramCache]: Analyzing trace with hash -986413597, now seen corresponding path program 1 times [2022-12-13 02:03:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:39,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545790159] [2022-12-13 02:03:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:39,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:39,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 02:03:39,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:39,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545790159] [2022-12-13 02:03:39,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545790159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:39,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:39,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:39,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3390610] [2022-12-13 02:03:39,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:39,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:39,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:39,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:39,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:39,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:39,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:40,047 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:40,047 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:40,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:40,047 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:40,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:40,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:40,048 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:40,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:40,049 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,049 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:40,049 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:40,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:40,049 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:40,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:40,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,052 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:40,052 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:40,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:40,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:40,167 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:40,168 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:40,168 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:40,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,168 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:40,168 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:40,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1748 [2022-12-13 02:03:40,168 INFO L420 AbstractCegarLoop]: === Iteration 1750 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash -929155295, now seen corresponding path program 1 times [2022-12-13 02:03:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112004174] [2022-12-13 02:03:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:40,230 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 02:03:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:40,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112004174] [2022-12-13 02:03:40,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112004174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:40,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:40,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754589461] [2022-12-13 02:03:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:40,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:40,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:40,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:40,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:40,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:40,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:40,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:40,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:40,283 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:40,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:40,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:40,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:40,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:40,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:40,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:40,286 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:40,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:40,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:40,286 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:40,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:40,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,289 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:40,289 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:40,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:40,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:40,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:40,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:40,408 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:40,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:40,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:40,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1749 [2022-12-13 02:03:40,408 INFO L420 AbstractCegarLoop]: === Iteration 1751 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:40,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash -871896993, now seen corresponding path program 1 times [2022-12-13 02:03:40,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:40,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014594284] [2022-12-13 02:03:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:40,463 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 02:03:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:40,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014594284] [2022-12-13 02:03:40,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014594284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:40,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:40,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501267960] [2022-12-13 02:03:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:40,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:40,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:40,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:40,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:40,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:40,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:40,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:40,506 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:40,506 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:40,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:40,507 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:40,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:40,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:40,507 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:40,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:40,508 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:40,508 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:40,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:40,508 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:40,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:40,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,511 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:40,511 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:40,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:40,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:40,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:40,632 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:40,632 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:40,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,632 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:40,632 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:40,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1750 [2022-12-13 02:03:40,632 INFO L420 AbstractCegarLoop]: === Iteration 1752 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:40,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash -814638691, now seen corresponding path program 1 times [2022-12-13 02:03:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:40,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767728426] [2022-12-13 02:03:40,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:40,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:40,688 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 02:03:40,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:40,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767728426] [2022-12-13 02:03:40,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767728426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:40,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:40,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152618282] [2022-12-13 02:03:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:40,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:40,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:40,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:40,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:40,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:40,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:40,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:40,741 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:40,741 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:40,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:40,742 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:40,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:40,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:40,742 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:40,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:40,743 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:40,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:40,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:40,743 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:40,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:40,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,746 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:40,746 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:40,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:40,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:40,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:40,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:03:40,868 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:40,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:40,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:40,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1751 [2022-12-13 02:03:40,869 INFO L420 AbstractCegarLoop]: === Iteration 1753 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:40,869 INFO L85 PathProgramCache]: Analyzing trace with hash -757380389, now seen corresponding path program 1 times [2022-12-13 02:03:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:40,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767733536] [2022-12-13 02:03:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:40,929 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 02:03:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:40,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767733536] [2022-12-13 02:03:40,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767733536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:40,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:40,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628531489] [2022-12-13 02:03:40,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:40,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:40,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:40,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:40,930 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:40,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:40,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:40,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:40,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:40,975 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:40,975 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:40,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:40,975 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:40,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:40,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:40,976 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:40,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:40,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:40,977 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:40,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:40,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:40,977 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:40,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:40,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:40,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,980 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:40,980 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:40,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:40,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:40,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:41,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:41,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:41,099 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:41,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:41,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:41,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1752 [2022-12-13 02:03:41,100 INFO L420 AbstractCegarLoop]: === Iteration 1754 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -700122087, now seen corresponding path program 1 times [2022-12-13 02:03:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:41,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584758562] [2022-12-13 02:03:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:41,155 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 02:03:41,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:41,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584758562] [2022-12-13 02:03:41,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584758562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:41,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:41,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:41,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652209205] [2022-12-13 02:03:41,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:41,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:41,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:41,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:41,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:41,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:41,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:41,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:41,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:41,206 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:41,206 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:41,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:41,206 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:41,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:41,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:41,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:41,207 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:41,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:41,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:41,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:41,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:41,208 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:41,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:41,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:41,211 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:41,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:41,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:41,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:41,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:03:41,327 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:41,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:41,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:41,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1753 [2022-12-13 02:03:41,327 INFO L420 AbstractCegarLoop]: === Iteration 1755 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash -642863785, now seen corresponding path program 1 times [2022-12-13 02:03:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791699931] [2022-12-13 02:03:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:41,379 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 02:03:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:41,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791699931] [2022-12-13 02:03:41,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791699931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:41,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:41,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:41,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905602493] [2022-12-13 02:03:41,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:41,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:41,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:41,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:41,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:41,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:41,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:41,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:41,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:41,438 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:41,438 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:41,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:41,439 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:41,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:41,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:41,439 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:41,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:41,440 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,440 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:41,440 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:41,440 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:41,440 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:41,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:41,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,443 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:41,443 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:41,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:41,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:41,559 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:41,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:41,560 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:41,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:41,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:41,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1754 [2022-12-13 02:03:41,561 INFO L420 AbstractCegarLoop]: === Iteration 1756 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash -585605483, now seen corresponding path program 1 times [2022-12-13 02:03:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9098394] [2022-12-13 02:03:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:41,614 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 02:03:41,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:41,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9098394] [2022-12-13 02:03:41,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9098394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:41,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:41,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049135315] [2022-12-13 02:03:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:41,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:41,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:41,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:41,615 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,615 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:41,615 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:41,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:41,658 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:41,658 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:41,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:41,659 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:41,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:41,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:41,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:41,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:41,660 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:41,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:41,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:41,660 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:41,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:41,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,663 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:41,663 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:41,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:41,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:41,780 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:41,781 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:41,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:41,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:41,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:41,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1755 [2022-12-13 02:03:41,781 INFO L420 AbstractCegarLoop]: === Iteration 1757 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:41,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -528347181, now seen corresponding path program 1 times [2022-12-13 02:03:41,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:41,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989807290] [2022-12-13 02:03:41,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:41,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:41,836 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 02:03:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:41,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989807290] [2022-12-13 02:03:41,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989807290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:41,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:41,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246266721] [2022-12-13 02:03:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:41,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:41,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:41,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:41,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:41,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:41,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:41,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:41,881 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:41,881 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:41,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:41,882 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:41,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:41,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:41,882 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:41,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:41,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:41,883 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:41,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:41,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:41,884 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:41,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:41,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:41,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,886 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:41,886 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:41,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:41,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:41,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:42,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:42,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:42,005 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:42,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:42,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:42,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1756 [2022-12-13 02:03:42,005 INFO L420 AbstractCegarLoop]: === Iteration 1758 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:42,006 INFO L85 PathProgramCache]: Analyzing trace with hash -471088879, now seen corresponding path program 1 times [2022-12-13 02:03:42,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:42,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234056495] [2022-12-13 02:03:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:42,059 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 02:03:42,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:42,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234056495] [2022-12-13 02:03:42,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234056495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:42,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:42,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:42,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362691293] [2022-12-13 02:03:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:42,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:42,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:42,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:42,060 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:42,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:42,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:42,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:42,112 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:42,112 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:42,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:42,112 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:42,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:42,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:42,113 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:42,113 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:42,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:42,114 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:42,114 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:42,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:42,114 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:42,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:42,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,117 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:42,117 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:42,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:42,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:42,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:42,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:03:42,237 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:42,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:42,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:42,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1757 [2022-12-13 02:03:42,237 INFO L420 AbstractCegarLoop]: === Iteration 1759 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:42,238 INFO L85 PathProgramCache]: Analyzing trace with hash -413830577, now seen corresponding path program 1 times [2022-12-13 02:03:42,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:42,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250574357] [2022-12-13 02:03:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:42,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:42,291 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 02:03:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:42,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250574357] [2022-12-13 02:03:42,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250574357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:42,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:42,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697911920] [2022-12-13 02:03:42,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:42,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:42,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:42,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:42,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:42,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:42,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:42,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:42,342 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:42,343 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:42,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:42,343 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:42,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:42,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:42,344 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:42,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:42,344 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:42,345 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:42,345 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:42,345 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,345 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:42,345 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:42,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,347 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:42,348 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:42,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:42,348 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,348 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:42,465 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:42,466 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:42,466 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:42,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,466 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:42,466 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:42,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1758 [2022-12-13 02:03:42,466 INFO L420 AbstractCegarLoop]: === Iteration 1760 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:42,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash -356572275, now seen corresponding path program 1 times [2022-12-13 02:03:42,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931761477] [2022-12-13 02:03:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:42,523 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 02:03:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:42,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931761477] [2022-12-13 02:03:42,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931761477] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:42,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:42,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:42,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065051202] [2022-12-13 02:03:42,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:42,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:42,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:42,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:42,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:42,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:42,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:42,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:42,569 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:42,569 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:42,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:42,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:42,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:42,570 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:42,570 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:42,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:42,571 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,571 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:42,571 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:42,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:42,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:42,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:42,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,574 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:42,575 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:42,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:42,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:42,694 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:42,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:42,695 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:42,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:42,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:42,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1759 [2022-12-13 02:03:42,695 INFO L420 AbstractCegarLoop]: === Iteration 1761 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash -299313973, now seen corresponding path program 1 times [2022-12-13 02:03:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:42,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110720996] [2022-12-13 02:03:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:42,757 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 02:03:42,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:42,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110720996] [2022-12-13 02:03:42,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110720996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:42,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:42,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:42,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663873853] [2022-12-13 02:03:42,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:42,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:42,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:42,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:42,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:42,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:42,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:42,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:42,809 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:42,809 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:42,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:42,810 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:42,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:42,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:42,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:42,810 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:42,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:42,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:42,811 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:42,811 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:42,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:42,811 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:42,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:42,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:42,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,814 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:42,814 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:42,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:42,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:42,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:42,938 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:42,939 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:03:42,939 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:42,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:42,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:42,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1760 [2022-12-13 02:03:42,939 INFO L420 AbstractCegarLoop]: === Iteration 1762 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash -242055671, now seen corresponding path program 1 times [2022-12-13 02:03:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:42,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825005789] [2022-12-13 02:03:42,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:42,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:42,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:42,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825005789] [2022-12-13 02:03:42,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825005789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:42,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:42,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046156152] [2022-12-13 02:03:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:42,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:42,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:42,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:42,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:42,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:42,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:43,045 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:43,045 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:43,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:43,046 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:43,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:43,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:43,046 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:43,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:43,047 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:43,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:43,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:43,047 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:43,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:43,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,050 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:43,050 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:43,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:43,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:43,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:43,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:43,167 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:43,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:43,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:43,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1761 [2022-12-13 02:03:43,168 INFO L420 AbstractCegarLoop]: === Iteration 1763 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:43,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash -184797369, now seen corresponding path program 1 times [2022-12-13 02:03:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:43,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136095613] [2022-12-13 02:03:43,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:43,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:43,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136095613] [2022-12-13 02:03:43,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136095613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:43,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:43,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:43,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130482470] [2022-12-13 02:03:43,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:43,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:43,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:43,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:43,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:43,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:43,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:43,268 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:43,268 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:43,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:43,268 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:43,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:43,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:43,269 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:43,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:43,270 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:43,270 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:43,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:43,270 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:43,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:43,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,273 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:43,273 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:43,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:43,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:43,405 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:43,406 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:43,406 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:43,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,406 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:43,406 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:43,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1762 [2022-12-13 02:03:43,406 INFO L420 AbstractCegarLoop]: === Iteration 1764 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:43,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:43,406 INFO L85 PathProgramCache]: Analyzing trace with hash -127539067, now seen corresponding path program 1 times [2022-12-13 02:03:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:43,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940616249] [2022-12-13 02:03:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:43,473 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 02:03:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:43,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940616249] [2022-12-13 02:03:43,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940616249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:43,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:43,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166011062] [2022-12-13 02:03:43,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:43,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:43,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:43,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:43,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:43,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:43,539 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:43,539 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:43,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:43,540 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:43,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:43,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:43,541 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:43,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:43,542 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:43,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:43,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:43,542 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:43,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:43,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,546 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:43,546 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:43,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:43,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:43,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:43,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:43,677 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:43,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:43,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:43,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1763 [2022-12-13 02:03:43,678 INFO L420 AbstractCegarLoop]: === Iteration 1765 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:43,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash -70280765, now seen corresponding path program 1 times [2022-12-13 02:03:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:43,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045558988] [2022-12-13 02:03:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:43,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:43,744 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 02:03:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045558988] [2022-12-13 02:03:43,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045558988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:43,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:43,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:43,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783294905] [2022-12-13 02:03:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:43,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:43,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:43,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:43,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:43,745 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:43,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:43,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:43,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:43,790 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:43,790 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:43,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:43,791 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:43,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:43,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:43,792 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:43,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:43,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:43,793 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:43,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:43,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:43,793 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:43,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:43,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,797 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:43,797 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:43,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:43,797 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:43,797 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:43,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:43,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:43,928 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:43,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:43,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:43,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:43,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1764 [2022-12-13 02:03:43,929 INFO L420 AbstractCegarLoop]: === Iteration 1766 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash -13022463, now seen corresponding path program 1 times [2022-12-13 02:03:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:43,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080427870] [2022-12-13 02:03:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:43,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:44,013 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 02:03:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:44,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080427870] [2022-12-13 02:03:44,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080427870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:44,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:44,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743006637] [2022-12-13 02:03:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:44,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:44,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:44,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:44,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:44,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:44,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:44,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:44,065 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:44,065 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:44,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:44,065 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:44,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:44,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:44,066 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:44,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:44,067 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:44,067 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:44,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:44,067 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:44,067 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:44,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,070 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:44,070 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:44,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:44,070 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,070 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:44,187 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:44,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:44,188 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:44,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,188 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:44,188 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1765 [2022-12-13 02:03:44,188 INFO L420 AbstractCegarLoop]: === Iteration 1767 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash 44235839, now seen corresponding path program 1 times [2022-12-13 02:03:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:44,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606546508] [2022-12-13 02:03:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:44,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:44,243 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 02:03:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:44,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606546508] [2022-12-13 02:03:44,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606546508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:44,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:44,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872784243] [2022-12-13 02:03:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:44,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:44,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:44,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:44,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:44,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:44,287 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:44,287 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:44,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:44,288 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:44,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:44,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:44,288 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:44,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:44,289 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:44,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:44,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:44,289 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:44,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:44,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,292 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:44,292 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:44,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:44,293 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,293 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:44,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:44,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:44,410 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:44,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:44,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:44,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1766 [2022-12-13 02:03:44,410 INFO L420 AbstractCegarLoop]: === Iteration 1768 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:44,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 101494141, now seen corresponding path program 1 times [2022-12-13 02:03:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:44,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424854942] [2022-12-13 02:03:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:44,464 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 02:03:44,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:44,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424854942] [2022-12-13 02:03:44,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424854942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:44,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:44,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540117836] [2022-12-13 02:03:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:44,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:44,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:44,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:44,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:44,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:44,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:44,515 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:44,515 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:44,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:44,516 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:44,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:44,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:44,516 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:44,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:44,517 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:44,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:44,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:44,518 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,518 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:44,518 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:44,518 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:44,521 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:44,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:44,521 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:44,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:44,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:44,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:44,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:44,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:44,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1767 [2022-12-13 02:03:44,639 INFO L420 AbstractCegarLoop]: === Iteration 1769 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:44,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 158752443, now seen corresponding path program 1 times [2022-12-13 02:03:44,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:44,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031181515] [2022-12-13 02:03:44,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:44,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:44,715 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 02:03:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:44,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031181515] [2022-12-13 02:03:44,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031181515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:44,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:44,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:44,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368156208] [2022-12-13 02:03:44,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:44,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:44,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:44,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:44,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:44,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:44,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:44,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:44,774 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:44,775 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:44,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:44,775 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:44,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:44,776 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:44,776 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:44,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:44,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:44,777 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:44,777 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:44,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:44,777 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:44,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:44,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:44,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,780 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:44,780 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:44,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:44,780 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:44,780 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:44,901 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:44,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:03:44,902 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:44,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,902 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:44,902 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:44,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1768 [2022-12-13 02:03:44,903 INFO L420 AbstractCegarLoop]: === Iteration 1770 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 216010745, now seen corresponding path program 1 times [2022-12-13 02:03:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:44,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213696057] [2022-12-13 02:03:44,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:44,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 02:03:44,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:44,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213696057] [2022-12-13 02:03:44,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213696057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:44,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:44,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:44,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940496939] [2022-12-13 02:03:44,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:44,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:44,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:44,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:44,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:44,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:44,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:44,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:44,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:44,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:45,002 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:45,003 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:45,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:45,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:45,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:45,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:45,004 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:45,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:45,005 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:45,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:45,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:45,005 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:45,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:45,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,008 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:45,008 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:45,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:45,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:45,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:45,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:45,124 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:45,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:45,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:45,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1769 [2022-12-13 02:03:45,125 INFO L420 AbstractCegarLoop]: === Iteration 1771 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:45,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash 273269047, now seen corresponding path program 1 times [2022-12-13 02:03:45,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:45,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782507080] [2022-12-13 02:03:45,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:45,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:45,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 02:03:45,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:45,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782507080] [2022-12-13 02:03:45,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782507080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:45,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:45,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779312155] [2022-12-13 02:03:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:45,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:45,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:45,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:45,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:45,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:45,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:45,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:45,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:45,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:45,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:45,238 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:45,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:45,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:45,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:45,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:45,239 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:45,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:45,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:45,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:45,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:45,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,242 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:45,242 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:45,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:45,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:45,390 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:45,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 02:03:45,391 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:45,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:45,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:45,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1770 [2022-12-13 02:03:45,392 INFO L420 AbstractCegarLoop]: === Iteration 1772 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:45,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 330527349, now seen corresponding path program 1 times [2022-12-13 02:03:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:45,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749057349] [2022-12-13 02:03:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:45,448 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 02:03:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749057349] [2022-12-13 02:03:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749057349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878709100] [2022-12-13 02:03:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:45,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:45,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:45,449 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:45,449 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:45,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:45,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:45,493 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:45,493 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:45,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:45,494 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:45,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:45,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:45,495 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:45,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:45,495 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:45,496 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:45,496 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:45,496 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:45,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:45,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,499 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:45,499 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:45,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:45,499 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,499 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:45,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:45,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:03:45,623 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:45,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:45,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:45,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1771 [2022-12-13 02:03:45,623 INFO L420 AbstractCegarLoop]: === Iteration 1773 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash 387785651, now seen corresponding path program 1 times [2022-12-13 02:03:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:45,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016226685] [2022-12-13 02:03:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:45,678 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 02:03:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:45,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016226685] [2022-12-13 02:03:45,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016226685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:45,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:45,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:45,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956656000] [2022-12-13 02:03:45,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:45,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:45,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:45,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:45,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:45,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:45,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:45,721 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:45,722 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:45,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:45,722 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:45,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:45,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:45,723 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:45,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:45,723 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,724 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:45,724 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:45,724 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:45,724 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:45,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:45,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,727 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:45,727 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:45,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:45,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:45,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:45,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:45,843 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:45,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:45,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:45,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1772 [2022-12-13 02:03:45,843 INFO L420 AbstractCegarLoop]: === Iteration 1774 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:45,843 INFO L85 PathProgramCache]: Analyzing trace with hash 445043953, now seen corresponding path program 1 times [2022-12-13 02:03:45,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:45,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227593979] [2022-12-13 02:03:45,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:45,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:45,900 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 02:03:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:45,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227593979] [2022-12-13 02:03:45,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227593979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:45,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:45,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892891024] [2022-12-13 02:03:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:45,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:45,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:45,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:45,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:45,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:45,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:45,943 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:45,943 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:45,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:45,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:45,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:45,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:45,944 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:45,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:45,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:45,945 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:45,945 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:45,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:45,945 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:45,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:45,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,948 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:45,948 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:45,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:45,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:45,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:46,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:46,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:03:46,068 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:46,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:46,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:46,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1773 [2022-12-13 02:03:46,068 INFO L420 AbstractCegarLoop]: === Iteration 1775 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:46,068 INFO L85 PathProgramCache]: Analyzing trace with hash 502302255, now seen corresponding path program 1 times [2022-12-13 02:03:46,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:46,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10547875] [2022-12-13 02:03:46,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:46,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:46,138 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 02:03:46,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:46,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10547875] [2022-12-13 02:03:46,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10547875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:46,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:46,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:46,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125660862] [2022-12-13 02:03:46,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:46,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:46,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:46,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:46,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:46,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:46,193 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:46,193 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:46,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:46,194 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:46,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:46,194 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:46,195 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:46,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:46,195 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,195 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:46,196 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:46,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:46,196 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:46,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:46,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,199 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:46,199 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:46,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:46,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:46,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:46,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:03:46,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:46,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:46,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:46,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1774 [2022-12-13 02:03:46,324 INFO L420 AbstractCegarLoop]: === Iteration 1776 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 559560557, now seen corresponding path program 1 times [2022-12-13 02:03:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:46,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109439651] [2022-12-13 02:03:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:46,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:46,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109439651] [2022-12-13 02:03:46,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109439651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:46,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:46,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:46,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284070208] [2022-12-13 02:03:46,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:46,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:46,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:46,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:46,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:46,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:46,429 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:46,429 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:46,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:46,430 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:46,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:46,430 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:46,430 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:46,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:46,431 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,431 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:46,431 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:46,431 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:46,432 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,432 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:46,432 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:46,432 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,434 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:46,434 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:46,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:46,435 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,435 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:46,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:46,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:46,551 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:46,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:46,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:46,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1775 [2022-12-13 02:03:46,551 INFO L420 AbstractCegarLoop]: === Iteration 1777 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:46,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash 616818859, now seen corresponding path program 1 times [2022-12-13 02:03:46,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:46,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947900482] [2022-12-13 02:03:46,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:46,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:46,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 02:03:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:46,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947900482] [2022-12-13 02:03:46,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947900482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:46,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:46,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939460675] [2022-12-13 02:03:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:46,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:46,622 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:46,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:46,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:46,670 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:46,670 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:46,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:46,671 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:46,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:46,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:46,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:46,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:46,671 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:46,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:46,672 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:46,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:46,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:46,673 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:46,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:46,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,676 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:46,676 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:46,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:46,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:46,798 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:46,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:03:46,799 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:46,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:46,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:46,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1776 [2022-12-13 02:03:46,800 INFO L420 AbstractCegarLoop]: === Iteration 1778 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash 674077161, now seen corresponding path program 1 times [2022-12-13 02:03:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:46,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284475974] [2022-12-13 02:03:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:46,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:46,860 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 02:03:46,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:46,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284475974] [2022-12-13 02:03:46,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284475974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:46,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:46,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300588197] [2022-12-13 02:03:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:46,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:46,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:46,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:46,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:46,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:46,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:46,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:46,910 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:46,910 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:46,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:46,911 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:46,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:46,912 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:46,912 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:46,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:46,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:46,913 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,913 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:46,913 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:46,913 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:46,913 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,914 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:46,914 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:46,914 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:46,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,917 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:46,917 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:46,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:46,918 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:46,918 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:47,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:47,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:03:47,045 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:47,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:47,045 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:47,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1777 [2022-12-13 02:03:47,045 INFO L420 AbstractCegarLoop]: === Iteration 1779 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:47,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 731335463, now seen corresponding path program 1 times [2022-12-13 02:03:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:47,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945767381] [2022-12-13 02:03:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:47,102 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 02:03:47,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:47,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945767381] [2022-12-13 02:03:47,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945767381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:47,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:47,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:47,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439018215] [2022-12-13 02:03:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:47,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:47,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:47,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:47,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:47,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:47,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:47,152 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:47,153 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:47,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:47,153 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:47,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:47,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:47,154 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:47,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:47,155 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:47,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:47,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:47,155 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:47,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:47,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,158 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:47,158 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:47,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:47,158 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,158 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:47,275 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:47,275 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:47,276 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:47,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:47,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:47,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1778 [2022-12-13 02:03:47,276 INFO L420 AbstractCegarLoop]: === Iteration 1780 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:47,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash 788593765, now seen corresponding path program 1 times [2022-12-13 02:03:47,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:47,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132198488] [2022-12-13 02:03:47,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:47,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:47,331 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 02:03:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132198488] [2022-12-13 02:03:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132198488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119672134] [2022-12-13 02:03:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:47,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:47,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:47,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:47,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:47,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:47,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:47,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:47,375 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:47,375 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:47,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:47,375 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:47,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:47,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:47,376 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:47,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:47,377 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:47,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:47,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:47,377 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:47,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:47,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,380 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:47,380 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:47,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:47,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:47,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:47,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:03:47,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:47,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:47,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1779 [2022-12-13 02:03:47,501 INFO L420 AbstractCegarLoop]: === Iteration 1781 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 845852067, now seen corresponding path program 1 times [2022-12-13 02:03:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:47,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249289376] [2022-12-13 02:03:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:47,561 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 02:03:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:47,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249289376] [2022-12-13 02:03:47,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249289376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:47,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:47,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325739486] [2022-12-13 02:03:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:47,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:47,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:47,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:47,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:47,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:47,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:47,616 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:47,616 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:47,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:47,617 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:47,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:47,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:47,617 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:47,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:47,618 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:47,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:47,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:47,618 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:47,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:47,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,621 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:47,621 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:47,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:47,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:47,756 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:47,757 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:47,757 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:47,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:47,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:47,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1780 [2022-12-13 02:03:47,758 INFO L420 AbstractCegarLoop]: === Iteration 1782 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash 903110369, now seen corresponding path program 1 times [2022-12-13 02:03:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:47,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059016567] [2022-12-13 02:03:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:47,819 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 02:03:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:47,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059016567] [2022-12-13 02:03:47,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059016567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:47,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:47,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836472748] [2022-12-13 02:03:47,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:47,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:47,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:47,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:47,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:47,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:47,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:47,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:47,880 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:47,880 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:47,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:47,881 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:47,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:47,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:47,882 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:47,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:47,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:47,883 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:47,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:47,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:47,883 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:47,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:47,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:47,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,887 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:47,887 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:47,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:47,887 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:47,887 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:48,026 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:48,027 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:03:48,027 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:48,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,027 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:48,027 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:48,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1781 [2022-12-13 02:03:48,027 INFO L420 AbstractCegarLoop]: === Iteration 1783 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 960368671, now seen corresponding path program 1 times [2022-12-13 02:03:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:48,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014433769] [2022-12-13 02:03:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:48,093 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 02:03:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:48,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014433769] [2022-12-13 02:03:48,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014433769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:48,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:48,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:48,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304047118] [2022-12-13 02:03:48,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:48,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:48,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:48,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:48,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:48,094 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:48,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:48,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:48,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:48,154 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:48,154 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:48,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:48,155 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:48,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:48,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:48,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:48,155 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:48,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:48,156 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,156 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:48,156 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:48,156 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:48,156 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:48,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:48,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,159 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:48,159 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:48,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:48,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:48,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:48,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:48,292 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:48,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:48,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:48,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1782 [2022-12-13 02:03:48,293 INFO L420 AbstractCegarLoop]: === Iteration 1784 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:48,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:48,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1017626973, now seen corresponding path program 1 times [2022-12-13 02:03:48,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:48,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235590315] [2022-12-13 02:03:48,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:48,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:48,354 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 02:03:48,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:48,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235590315] [2022-12-13 02:03:48,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235590315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:48,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:48,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:48,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987914492] [2022-12-13 02:03:48,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:48,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:48,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:48,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:48,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:48,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:48,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:48,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:48,407 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:48,408 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:48,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:48,408 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:48,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:48,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:48,409 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:48,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:48,410 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:48,410 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:48,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:48,410 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:48,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:48,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,413 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:48,413 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:48,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:48,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:48,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:48,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:48,549 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:48,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:48,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:48,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1783 [2022-12-13 02:03:48,549 INFO L420 AbstractCegarLoop]: === Iteration 1785 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1074885275, now seen corresponding path program 1 times [2022-12-13 02:03:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:48,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894081222] [2022-12-13 02:03:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:48,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:48,612 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 02:03:48,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:48,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894081222] [2022-12-13 02:03:48,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894081222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:48,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:48,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031105702] [2022-12-13 02:03:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:48,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:48,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:48,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:48,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:48,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:48,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:48,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:48,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:48,674 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:48,674 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:48,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:48,674 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:48,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:48,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:48,675 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:48,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:48,676 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:48,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:48,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:48,676 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:48,676 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:48,676 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,679 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:48,679 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:48,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:48,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:48,813 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:48,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:48,814 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:48,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:48,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:48,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1784 [2022-12-13 02:03:48,814 INFO L420 AbstractCegarLoop]: === Iteration 1786 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:48,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1132143577, now seen corresponding path program 1 times [2022-12-13 02:03:48,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:48,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992482821] [2022-12-13 02:03:48,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:48,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:48,875 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 02:03:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992482821] [2022-12-13 02:03:48,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992482821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:48,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:48,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252780900] [2022-12-13 02:03:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:48,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:48,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:48,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:48,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:48,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:48,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:48,927 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:48,928 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:48,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:48,928 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:48,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:48,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:48,929 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:48,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:48,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:48,930 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:48,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:48,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:48,930 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:48,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:48,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:48,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,934 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:48,934 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:48,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:48,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:48,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:49,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:49,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:49,069 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:49,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:49,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:49,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1785 [2022-12-13 02:03:49,069 INFO L420 AbstractCegarLoop]: === Iteration 1787 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:49,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1189401879, now seen corresponding path program 1 times [2022-12-13 02:03:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:49,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976093095] [2022-12-13 02:03:49,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:49,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:49,129 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 02:03:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:49,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976093095] [2022-12-13 02:03:49,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976093095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:49,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:49,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:49,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082813323] [2022-12-13 02:03:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:49,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:49,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:49,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:49,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:49,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:49,190 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:49,191 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:49,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:49,191 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:49,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:49,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:49,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:49,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:49,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:49,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:49,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:49,193 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:49,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:49,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:49,193 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:49,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:49,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:49,196 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:49,196 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:49,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:49,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:49,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:49,329 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:49,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:49,330 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:49,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:49,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:49,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1786 [2022-12-13 02:03:49,330 INFO L420 AbstractCegarLoop]: === Iteration 1788 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1246660181, now seen corresponding path program 1 times [2022-12-13 02:03:49,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:49,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72194716] [2022-12-13 02:03:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:49,391 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 02:03:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72194716] [2022-12-13 02:03:49,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72194716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:49,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:49,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448762417] [2022-12-13 02:03:49,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:49,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:49,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:49,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:49,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:49,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:49,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:49,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:49,445 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:49,445 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:49,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:49,445 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:49,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:49,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:49,446 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:49,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:49,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:49,447 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,447 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:49,447 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:49,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:49,447 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:49,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:49,448 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:49,450 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:49,450 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:49,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:49,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:49,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:49,583 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:49,584 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:49,584 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:49,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,584 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:49,584 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:49,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1787 [2022-12-13 02:03:49,585 INFO L420 AbstractCegarLoop]: === Iteration 1789 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:49,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1303918483, now seen corresponding path program 1 times [2022-12-13 02:03:49,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:49,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155261253] [2022-12-13 02:03:49,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:49,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:49,671 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 02:03:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:49,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155261253] [2022-12-13 02:03:49,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155261253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:49,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:49,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701457014] [2022-12-13 02:03:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:49,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:49,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:49,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:49,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:49,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:49,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:49,724 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:49,724 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:49,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:49,725 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:49,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:49,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:49,725 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:49,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:49,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:49,726 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:49,726 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:49,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:49,727 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:49,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:49,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:49,730 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:49,730 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:49,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:49,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:49,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:49,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:49,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:49,865 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:49,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:49,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:49,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1788 [2022-12-13 02:03:49,866 INFO L420 AbstractCegarLoop]: === Iteration 1790 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1361176785, now seen corresponding path program 1 times [2022-12-13 02:03:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:49,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474258647] [2022-12-13 02:03:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:49,950 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 02:03:49,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:49,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474258647] [2022-12-13 02:03:49,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474258647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:49,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:49,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129007163] [2022-12-13 02:03:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:49,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:49,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:49,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:49,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:49,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:49,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:49,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:49,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:50,009 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:50,010 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:50,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:50,010 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:50,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:50,011 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:50,011 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:50,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:50,012 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,012 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:50,012 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:50,012 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:50,012 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:50,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:50,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,015 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:50,015 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:50,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:50,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,016 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:50,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:50,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:50,151 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:50,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:50,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:50,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1789 [2022-12-13 02:03:50,152 INFO L420 AbstractCegarLoop]: === Iteration 1791 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:50,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1418435087, now seen corresponding path program 1 times [2022-12-13 02:03:50,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:50,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086354986] [2022-12-13 02:03:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:50,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:50,225 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 02:03:50,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:50,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086354986] [2022-12-13 02:03:50,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086354986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:50,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:50,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326981453] [2022-12-13 02:03:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:50,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:50,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:50,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:50,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:50,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:50,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:50,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:50,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:50,279 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:50,279 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:50,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:50,280 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:50,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:50,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:50,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:50,280 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:50,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:50,281 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:50,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:50,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:50,282 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:50,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:50,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,286 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:50,286 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:50,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:50,286 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,286 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:50,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:50,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:50,422 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:50,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:50,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:50,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1790 [2022-12-13 02:03:50,423 INFO L420 AbstractCegarLoop]: === Iteration 1792 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:50,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:50,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1475693389, now seen corresponding path program 1 times [2022-12-13 02:03:50,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:50,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559609115] [2022-12-13 02:03:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:50,479 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 02:03:50,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:50,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559609115] [2022-12-13 02:03:50,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559609115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:50,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:50,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:50,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233963432] [2022-12-13 02:03:50,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:50,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:50,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:50,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:50,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:50,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:50,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:50,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:50,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:50,525 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:50,525 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:50,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:50,526 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:50,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:50,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:50,526 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:50,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:50,527 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:50,527 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:50,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:50,527 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:50,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:50,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,530 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:50,530 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:50,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:50,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:50,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:50,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:03:50,655 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:50,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:50,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:50,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1791 [2022-12-13 02:03:50,656 INFO L420 AbstractCegarLoop]: === Iteration 1793 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:50,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1532951691, now seen corresponding path program 1 times [2022-12-13 02:03:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:50,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905611681] [2022-12-13 02:03:50,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:50,712 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 02:03:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905611681] [2022-12-13 02:03:50,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905611681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:50,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:50,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209698444] [2022-12-13 02:03:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:50,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:50,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:50,713 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:50,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:50,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:50,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:50,810 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:50,810 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:50,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:50,811 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:50,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:50,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:50,812 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:50,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:50,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:50,813 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:50,813 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:50,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:50,813 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:50,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:50,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:50,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,816 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:50,816 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:50,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:50,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:50,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:50,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:50,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:03:50,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:50,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:50,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:50,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1792 [2022-12-13 02:03:50,937 INFO L420 AbstractCegarLoop]: === Iteration 1794 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:50,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1590209993, now seen corresponding path program 1 times [2022-12-13 02:03:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115838270] [2022-12-13 02:03:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:03:50,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:50,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115838270] [2022-12-13 02:03:50,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115838270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:50,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:50,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69365074] [2022-12-13 02:03:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:50,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:50,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:50,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:50,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:50,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:50,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:51,035 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:51,035 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:51,035 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:51,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:51,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:51,036 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:51,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:51,037 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:51,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:51,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:51,037 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:51,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:51,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,040 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:51,040 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:51,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:51,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:51,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:51,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:03:51,163 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:51,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:51,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:51,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1793 [2022-12-13 02:03:51,163 INFO L420 AbstractCegarLoop]: === Iteration 1795 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:51,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:51,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1647468295, now seen corresponding path program 1 times [2022-12-13 02:03:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:51,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631310023] [2022-12-13 02:03:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:51,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:51,222 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 02:03:51,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:51,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631310023] [2022-12-13 02:03:51,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631310023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:51,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:51,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:51,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276793156] [2022-12-13 02:03:51,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:51,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:51,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:51,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:51,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:51,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:51,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:51,275 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:51,275 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:51,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:51,276 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:51,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:51,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:51,277 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:51,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:51,277 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:51,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:51,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:51,278 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:51,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:51,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,281 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:51,281 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:51,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:51,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:51,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:51,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:51,412 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:51,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:51,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:51,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1794 [2022-12-13 02:03:51,413 INFO L420 AbstractCegarLoop]: === Iteration 1796 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1704726597, now seen corresponding path program 1 times [2022-12-13 02:03:51,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:51,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210746858] [2022-12-13 02:03:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:51,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:51,486 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 02:03:51,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:51,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210746858] [2022-12-13 02:03:51,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210746858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:51,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:51,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:51,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023188001] [2022-12-13 02:03:51,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:51,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:51,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:51,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:51,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:51,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:51,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:51,548 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:51,549 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:51,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:51,549 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:51,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:51,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:51,550 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:51,550 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:51,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:51,551 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,551 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:51,551 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:51,551 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:51,551 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,551 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:51,551 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:51,551 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,554 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:51,554 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:51,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:51,554 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,554 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:51,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:51,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:51,685 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:51,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:51,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:51,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1795 [2022-12-13 02:03:51,686 INFO L420 AbstractCegarLoop]: === Iteration 1797 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:51,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1761984899, now seen corresponding path program 1 times [2022-12-13 02:03:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:51,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115660029] [2022-12-13 02:03:51,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:51,746 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 02:03:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:51,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115660029] [2022-12-13 02:03:51,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115660029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:51,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:51,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460802082] [2022-12-13 02:03:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:51,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:51,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:51,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:51,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:51,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:51,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:51,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:51,809 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:51,809 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:51,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:51,810 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:51,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:51,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:51,811 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:51,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:51,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:51,812 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:51,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:51,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:51,812 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:51,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:51,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:51,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,815 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:51,815 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:51,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:51,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:51,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:51,946 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:51,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:51,947 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:51,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:51,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:51,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:51,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1796 [2022-12-13 02:03:51,948 INFO L420 AbstractCegarLoop]: === Iteration 1798 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:51,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1819243201, now seen corresponding path program 1 times [2022-12-13 02:03:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:51,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204231987] [2022-12-13 02:03:51,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:51,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:52,021 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 02:03:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204231987] [2022-12-13 02:03:52,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204231987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:52,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:52,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585685943] [2022-12-13 02:03:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:52,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:52,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:52,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:52,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:52,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:52,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:52,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:52,075 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:52,075 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:52,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:52,076 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:52,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:52,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:52,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:52,077 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:52,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:52,077 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:52,078 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:52,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:52,078 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:52,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:52,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,081 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:52,081 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:52,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:52,214 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:52,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:52,215 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:52,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:52,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:52,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1797 [2022-12-13 02:03:52,215 INFO L420 AbstractCegarLoop]: === Iteration 1799 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:52,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:52,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1876501503, now seen corresponding path program 1 times [2022-12-13 02:03:52,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:52,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421840728] [2022-12-13 02:03:52,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:52,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:52,287 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 02:03:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:52,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421840728] [2022-12-13 02:03:52,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421840728] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:52,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:52,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297600623] [2022-12-13 02:03:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:52,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:52,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:52,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:52,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:52,351 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:52,351 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:52,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:52,352 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:52,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:52,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:52,353 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:52,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:52,354 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:52,354 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:52,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:52,354 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,354 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:52,354 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:52,354 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,357 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:52,357 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:52,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:52,357 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,357 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:52,491 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:52,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:52,493 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:52,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:52,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:52,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1798 [2022-12-13 02:03:52,493 INFO L420 AbstractCegarLoop]: === Iteration 1800 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:52,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1933759805, now seen corresponding path program 1 times [2022-12-13 02:03:52,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:52,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011468316] [2022-12-13 02:03:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:52,564 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 02:03:52,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:52,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011468316] [2022-12-13 02:03:52,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011468316] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:52,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:52,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171938953] [2022-12-13 02:03:52,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:52,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:52,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:52,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:52,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:52,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:52,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:52,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:52,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:52,618 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:52,619 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:52,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:52,619 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:52,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:52,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:52,620 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:52,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:52,621 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:52,621 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:52,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:52,621 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:52,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:52,622 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,624 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:52,624 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:52,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:52,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:52,759 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:52,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:03:52,760 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:52,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:52,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1799 [2022-12-13 02:03:52,761 INFO L420 AbstractCegarLoop]: === Iteration 1801 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:52,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1991018107, now seen corresponding path program 1 times [2022-12-13 02:03:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:52,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466891462] [2022-12-13 02:03:52,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:52,830 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 02:03:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466891462] [2022-12-13 02:03:52,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466891462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:52,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:52,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349193691] [2022-12-13 02:03:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:52,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:52,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:52,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:52,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:52,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:52,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:52,884 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:52,884 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:52,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:52,885 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:52,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:52,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:52,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:52,886 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:52,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:52,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:52,887 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:52,887 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:52,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:52,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:52,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:52,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:52,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,890 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:52,890 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:52,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:52,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:52,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:53,024 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:53,025 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:53,025 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:53,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,026 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:53,026 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:53,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1800 [2022-12-13 02:03:53,026 INFO L420 AbstractCegarLoop]: === Iteration 1802 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2048276409, now seen corresponding path program 1 times [2022-12-13 02:03:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:53,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144659685] [2022-12-13 02:03:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:53,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:53,091 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 02:03:53,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:53,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144659685] [2022-12-13 02:03:53,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144659685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:53,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:53,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:53,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511841384] [2022-12-13 02:03:53,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:53,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:53,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:53,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:53,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:53,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:53,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:53,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:53,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:53,147 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:53,147 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:53,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:53,148 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:53,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:53,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:53,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:53,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:53,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:53,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:53,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:53,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:53,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:53,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:53,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,154 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:53,155 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:53,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:53,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:53,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:53,293 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:03:53,293 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:53,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:53,293 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1801 [2022-12-13 02:03:53,293 INFO L420 AbstractCegarLoop]: === Iteration 1803 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:53,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2105534711, now seen corresponding path program 1 times [2022-12-13 02:03:53,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:53,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054202262] [2022-12-13 02:03:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:53,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:53,378 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 02:03:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:53,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054202262] [2022-12-13 02:03:53,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054202262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:53,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:53,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691142386] [2022-12-13 02:03:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:53,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:53,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:53,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:53,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:53,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:53,438 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:53,438 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:53,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:53,439 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:53,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:53,439 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:53,439 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:53,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:53,441 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:53,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:53,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:53,441 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:53,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:53,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,445 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:53,445 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:53,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:53,445 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,445 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:53,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:53,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:53,578 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:53,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:53,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:53,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1802 [2022-12-13 02:03:53,579 INFO L420 AbstractCegarLoop]: === Iteration 1804 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2132174283, now seen corresponding path program 1 times [2022-12-13 02:03:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:53,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770494770] [2022-12-13 02:03:53,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:53,634 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 02:03:53,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:53,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770494770] [2022-12-13 02:03:53,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770494770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:53,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:53,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:53,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663047883] [2022-12-13 02:03:53,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:53,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:53,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:53,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:53,635 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:53,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:53,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:53,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:53,687 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:53,687 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:53,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:53,688 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:53,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:53,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:53,688 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:53,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:53,689 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:53,689 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:53,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:53,689 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:53,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:53,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,692 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:53,692 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:53,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:53,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:53,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:53,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:53,810 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:53,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:53,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1803 [2022-12-13 02:03:53,811 INFO L420 AbstractCegarLoop]: === Iteration 1805 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:53,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2074915981, now seen corresponding path program 1 times [2022-12-13 02:03:53,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:53,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916442592] [2022-12-13 02:03:53,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:53,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:53,865 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 02:03:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:53,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916442592] [2022-12-13 02:03:53,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916442592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:53,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:53,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414627390] [2022-12-13 02:03:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:53,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:53,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:53,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:53,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:53,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:53,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:53,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:53,908 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:53,909 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:53,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:53,909 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:53,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:53,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:53,910 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:53,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:53,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:53,911 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:53,911 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:53,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:53,911 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:53,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:53,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:53,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,914 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:53,914 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:53,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:53,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:53,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:54,030 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:54,031 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:54,031 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:54,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:54,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:54,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1804 [2022-12-13 02:03:54,032 INFO L420 AbstractCegarLoop]: === Iteration 1806 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:54,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:54,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2017657679, now seen corresponding path program 1 times [2022-12-13 02:03:54,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:54,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083879359] [2022-12-13 02:03:54,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:54,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:54,084 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 02:03:54,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:54,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083879359] [2022-12-13 02:03:54,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083879359] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:54,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:54,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:54,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863670254] [2022-12-13 02:03:54,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:54,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:54,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:54,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:54,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:54,085 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:54,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:54,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:54,128 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:54,128 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:54,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:54,129 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:54,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:54,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:54,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:54,129 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:54,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:54,130 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:54,130 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:54,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:54,130 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:54,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:54,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,133 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:54,133 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:54,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:54,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:54,249 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:54,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:54,250 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:54,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:54,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1805 [2022-12-13 02:03:54,250 INFO L420 AbstractCegarLoop]: === Iteration 1807 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:54,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1960399377, now seen corresponding path program 1 times [2022-12-13 02:03:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:54,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781855727] [2022-12-13 02:03:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:54,303 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 02:03:54,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:54,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781855727] [2022-12-13 02:03:54,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781855727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:54,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:54,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366692515] [2022-12-13 02:03:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:54,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:54,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:54,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:54,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:54,304 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:54,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:54,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:54,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:54,355 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:54,355 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:54,355 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:54,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:54,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:54,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:54,356 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:54,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:54,357 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:54,357 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:54,357 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:54,357 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,357 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:54,357 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:54,357 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,360 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:54,360 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:54,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:54,360 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,360 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:54,475 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:54,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:03:54,476 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:54,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:54,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:54,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1806 [2022-12-13 02:03:54,476 INFO L420 AbstractCegarLoop]: === Iteration 1808 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1903141075, now seen corresponding path program 1 times [2022-12-13 02:03:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:54,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111286902] [2022-12-13 02:03:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:54,531 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 02:03:54,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:54,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111286902] [2022-12-13 02:03:54,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111286902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:54,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:54,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:54,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989080173] [2022-12-13 02:03:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:54,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:54,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:54,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:54,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:54,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:54,583 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:54,583 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:54,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:54,584 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:54,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:54,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:54,584 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:54,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:54,585 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:54,585 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:54,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:54,585 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:54,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:54,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,588 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:54,588 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:54,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:54,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:54,705 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:54,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:03:54,706 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:54,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:54,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:54,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1807 [2022-12-13 02:03:54,706 INFO L420 AbstractCegarLoop]: === Iteration 1809 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:54,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1845882773, now seen corresponding path program 1 times [2022-12-13 02:03:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:54,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393342740] [2022-12-13 02:03:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:54,760 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 02:03:54,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:54,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393342740] [2022-12-13 02:03:54,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393342740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:54,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:54,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132740779] [2022-12-13 02:03:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:54,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:54,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:54,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:54,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:54,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:54,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:54,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:54,822 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:54,822 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:54,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:54,822 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:54,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:54,823 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:54,823 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:54,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:54,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:54,824 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,824 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:54,824 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:54,824 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:54,824 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,824 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:54,824 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:54,824 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:54,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,827 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:54,827 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:54,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:54,827 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:54,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:54,960 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:54,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:54,960 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:54,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:54,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:54,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:54,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1808 [2022-12-13 02:03:54,961 INFO L420 AbstractCegarLoop]: === Iteration 1810 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:54,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:54,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1788624471, now seen corresponding path program 1 times [2022-12-13 02:03:54,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:54,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123105376] [2022-12-13 02:03:54,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:55,015 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 02:03:55,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:55,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123105376] [2022-12-13 02:03:55,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123105376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:55,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:55,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95851609] [2022-12-13 02:03:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:55,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:55,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:55,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:55,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:55,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:55,061 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:55,061 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:55,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:55,061 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:55,061 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:55,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:55,062 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:55,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:55,063 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:55,063 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:55,063 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:55,063 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,063 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:55,063 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:55,063 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,066 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:55,066 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:55,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:55,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:55,184 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:55,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:03:55,185 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:55,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:55,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:55,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1809 [2022-12-13 02:03:55,185 INFO L420 AbstractCegarLoop]: === Iteration 1811 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:55,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1731366169, now seen corresponding path program 1 times [2022-12-13 02:03:55,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:55,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880029538] [2022-12-13 02:03:55,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:55,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:55,243 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 02:03:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:55,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880029538] [2022-12-13 02:03:55,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880029538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:55,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:55,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:55,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874080791] [2022-12-13 02:03:55,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:55,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:55,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:55,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:55,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:55,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:55,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:55,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:55,295 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:55,295 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:55,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:55,296 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:55,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:55,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:55,296 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:55,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:55,297 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:55,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:55,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:55,297 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:55,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:55,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,300 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:55,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:55,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:55,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:55,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:55,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:55,417 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:55,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:55,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:55,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1810 [2022-12-13 02:03:55,417 INFO L420 AbstractCegarLoop]: === Iteration 1812 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1674107867, now seen corresponding path program 1 times [2022-12-13 02:03:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316441435] [2022-12-13 02:03:55,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:55,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:55,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 02:03:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:55,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316441435] [2022-12-13 02:03:55,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316441435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:55,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:55,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414440332] [2022-12-13 02:03:55,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:55,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:55,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:55,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:55,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:55,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:55,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:55,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:55,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:55,526 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:55,526 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:55,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:55,527 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:55,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:55,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:55,527 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:55,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:55,528 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:55,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:55,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:55,528 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:55,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:55,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,531 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:55,531 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:55,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:55,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:55,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:55,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:03:55,648 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:55,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:55,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:55,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1811 [2022-12-13 02:03:55,649 INFO L420 AbstractCegarLoop]: === Iteration 1813 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1616849565, now seen corresponding path program 1 times [2022-12-13 02:03:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:55,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710303719] [2022-12-13 02:03:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:55,705 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 02:03:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710303719] [2022-12-13 02:03:55,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710303719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:55,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:55,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508481580] [2022-12-13 02:03:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:55,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:55,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:55,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:55,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:55,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:55,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:55,759 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:55,759 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:55,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:55,760 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:55,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:55,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:55,761 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:55,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:55,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:55,761 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,762 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:55,762 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:55,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:55,762 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:55,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:55,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:55,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,765 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:55,765 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:55,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:55,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:55,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:55,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:55,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:55,900 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:55,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:55,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:55,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1812 [2022-12-13 02:03:55,900 INFO L420 AbstractCegarLoop]: === Iteration 1814 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:55,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1559591263, now seen corresponding path program 1 times [2022-12-13 02:03:55,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:55,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482237657] [2022-12-13 02:03:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:55,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:55,958 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 02:03:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:55,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482237657] [2022-12-13 02:03:55,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482237657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:55,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:55,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:55,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462840764] [2022-12-13 02:03:55,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:55,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:55,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:55,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:55,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:55,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:55,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:55,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:55,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:56,011 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:56,011 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:56,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:56,012 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:56,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:56,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:56,012 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:56,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:56,013 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,013 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:56,013 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:56,013 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:56,013 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,013 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:56,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:56,014 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,016 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:56,016 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:56,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:56,016 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:56,146 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:56,147 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:03:56,147 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:56,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,147 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:56,147 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1813 [2022-12-13 02:03:56,148 INFO L420 AbstractCegarLoop]: === Iteration 1815 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1502332961, now seen corresponding path program 1 times [2022-12-13 02:03:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075431827] [2022-12-13 02:03:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:56,214 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 02:03:56,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:56,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075431827] [2022-12-13 02:03:56,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075431827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:56,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:56,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:56,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551459598] [2022-12-13 02:03:56,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:56,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:56,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:56,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:56,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:56,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:56,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:56,267 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:56,268 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:56,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:56,268 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:56,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:56,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:56,269 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:56,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:56,270 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:56,270 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:56,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:56,270 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:56,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:56,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,273 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:56,273 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:56,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:56,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:56,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:56,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:56,408 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:56,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:56,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:56,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1814 [2022-12-13 02:03:56,408 INFO L420 AbstractCegarLoop]: === Iteration 1816 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1445074659, now seen corresponding path program 1 times [2022-12-13 02:03:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:56,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088940134] [2022-12-13 02:03:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:56,480 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 02:03:56,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:56,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088940134] [2022-12-13 02:03:56,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088940134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:56,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:56,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:56,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885079107] [2022-12-13 02:03:56,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:56,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:56,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:56,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:56,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:56,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:56,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:56,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:56,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:56,533 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:56,533 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:56,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:56,534 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:56,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:56,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:56,534 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:56,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:56,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:56,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:56,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:56,535 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,536 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:56,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:56,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,538 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:56,538 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:56,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:56,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:56,671 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:56,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:03:56,673 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:56,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:56,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:56,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1815 [2022-12-13 02:03:56,673 INFO L420 AbstractCegarLoop]: === Iteration 1817 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:56,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1387816357, now seen corresponding path program 1 times [2022-12-13 02:03:56,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:56,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434284481] [2022-12-13 02:03:56,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:56,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:56,734 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 02:03:56,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:56,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434284481] [2022-12-13 02:03:56,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434284481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:56,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:56,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:56,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915340445] [2022-12-13 02:03:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:56,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:56,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:56,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:56,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:56,735 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:56,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:56,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:56,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:56,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:56,789 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:56,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:56,789 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:56,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:56,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:56,790 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:56,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:56,791 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:56,791 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:56,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:56,791 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:56,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:56,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:56,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,794 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:56,794 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:56,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:56,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:56,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:56,927 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:56,928 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:56,928 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:56,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,928 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:56,928 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:56,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1816 [2022-12-13 02:03:56,928 INFO L420 AbstractCegarLoop]: === Iteration 1818 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:56,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1330558055, now seen corresponding path program 1 times [2022-12-13 02:03:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:56,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377696782] [2022-12-13 02:03:56,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:56,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:56,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 02:03:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:56,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377696782] [2022-12-13 02:03:56,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377696782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:56,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:56,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18084569] [2022-12-13 02:03:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:56,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:56,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:56,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:56,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:56,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:56,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:57,051 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:57,051 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:57,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:57,052 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:57,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:57,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:57,052 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:57,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:57,053 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,053 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:57,053 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:57,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:57,053 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:57,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:57,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,056 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:57,056 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:57,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:57,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:57,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:57,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:57,190 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:57,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:57,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:57,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:57,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1817 [2022-12-13 02:03:57,190 INFO L420 AbstractCegarLoop]: === Iteration 1819 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:57,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1273299753, now seen corresponding path program 1 times [2022-12-13 02:03:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:57,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569115381] [2022-12-13 02:03:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:57,268 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 02:03:57,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:57,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569115381] [2022-12-13 02:03:57,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569115381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:57,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:57,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238411397] [2022-12-13 02:03:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:57,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:57,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:57,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:57,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:57,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:57,334 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:57,335 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:57,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:57,335 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:57,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:57,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:57,336 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:57,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:57,337 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:57,337 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:57,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:57,337 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:57,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:57,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,340 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:57,340 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:57,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:57,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:57,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:57,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:57,474 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:57,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:57,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:57,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:57,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1818 [2022-12-13 02:03:57,475 INFO L420 AbstractCegarLoop]: === Iteration 1820 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1216041451, now seen corresponding path program 1 times [2022-12-13 02:03:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:57,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534438218] [2022-12-13 02:03:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:57,536 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 02:03:57,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:57,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534438218] [2022-12-13 02:03:57,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534438218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:57,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:57,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386892274] [2022-12-13 02:03:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:57,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:57,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:57,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:57,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:57,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:57,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:57,598 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:57,598 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:57,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:57,599 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:57,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:57,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:57,599 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:57,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:57,600 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:57,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:57,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:57,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:57,601 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:57,601 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:57,603 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:57,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:57,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:57,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:57,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:57,737 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:57,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:57,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:57,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:57,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1819 [2022-12-13 02:03:57,737 INFO L420 AbstractCegarLoop]: === Iteration 1821 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:57,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1158783149, now seen corresponding path program 1 times [2022-12-13 02:03:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:57,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827786137] [2022-12-13 02:03:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:57,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:57,817 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 02:03:57,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827786137] [2022-12-13 02:03:57,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827786137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:57,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:57,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134107385] [2022-12-13 02:03:57,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:57,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:57,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:57,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:57,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:57,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:57,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:57,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:57,878 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:57,878 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:57,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:57,879 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:57,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:57,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:57,880 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:57,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:57,881 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:57,881 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:57,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:57,881 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:57,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:57,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:57,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,885 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:57,885 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:57,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:57,886 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:57,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:58,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:58,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:58,018 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:58,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:58,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:58,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1820 [2022-12-13 02:03:58,018 INFO L420 AbstractCegarLoop]: === Iteration 1822 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:58,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1101524847, now seen corresponding path program 1 times [2022-12-13 02:03:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:58,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832864398] [2022-12-13 02:03:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:58,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:58,104 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 02:03:58,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:58,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832864398] [2022-12-13 02:03:58,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832864398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:58,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:58,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:58,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488860761] [2022-12-13 02:03:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:58,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:58,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:58,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:58,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:58,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:58,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:58,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:58,156 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:58,157 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:58,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:58,157 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:58,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:58,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:58,158 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:58,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:58,159 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:58,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:58,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:58,159 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:58,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:58,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,162 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:58,162 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:58,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:58,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:58,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:03:58,294 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:58,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:58,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:58,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1821 [2022-12-13 02:03:58,295 INFO L420 AbstractCegarLoop]: === Iteration 1823 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:58,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1044266545, now seen corresponding path program 1 times [2022-12-13 02:03:58,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:58,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711827775] [2022-12-13 02:03:58,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:58,355 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 02:03:58,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711827775] [2022-12-13 02:03:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711827775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:58,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:58,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:58,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559235801] [2022-12-13 02:03:58,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:58,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:58,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:58,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:58,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:58,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:58,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:58,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:58,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:58,408 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:58,408 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:58,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:58,409 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:58,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:58,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:58,410 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:58,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:58,411 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:58,411 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:58,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:58,411 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:58,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:58,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,414 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:58,414 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:58,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:58,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:58,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:58,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:58,547 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:58,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:58,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1822 [2022-12-13 02:03:58,547 INFO L420 AbstractCegarLoop]: === Iteration 1824 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:58,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -987008243, now seen corresponding path program 1 times [2022-12-13 02:03:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:58,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080630034] [2022-12-13 02:03:58,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:58,603 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 02:03:58,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:58,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080630034] [2022-12-13 02:03:58,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080630034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:58,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:58,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:58,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011191345] [2022-12-13 02:03:58,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:58,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:58,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:58,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:58,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:58,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:58,657 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:58,657 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:58,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:58,658 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:58,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:58,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:58,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:58,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:58,660 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:58,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:58,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:58,660 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:58,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:58,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,663 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:58,663 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:58,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:58,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:58,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:58,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:03:58,800 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:58,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1823 [2022-12-13 02:03:58,800 INFO L420 AbstractCegarLoop]: === Iteration 1825 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -929749941, now seen corresponding path program 1 times [2022-12-13 02:03:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:58,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579744518] [2022-12-13 02:03:58,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:58,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:58,880 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 02:03:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:58,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579744518] [2022-12-13 02:03:58,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579744518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:58,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:58,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264608911] [2022-12-13 02:03:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:58,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:58,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:58,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:58,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:58,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:58,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:58,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:58,944 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:58,944 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:58,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:58,945 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:58,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:58,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:58,945 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:58,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:58,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:58,946 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:58,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:58,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:58,947 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:58,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:58,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:58,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,949 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:58,950 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:58,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:58,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:58,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:59,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:59,088 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:03:59,088 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:59,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:59,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:59,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1824 [2022-12-13 02:03:59,088 INFO L420 AbstractCegarLoop]: === Iteration 1826 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:59,089 INFO L85 PathProgramCache]: Analyzing trace with hash -872491639, now seen corresponding path program 1 times [2022-12-13 02:03:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:59,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762487536] [2022-12-13 02:03:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:59,166 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 02:03:59,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:59,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762487536] [2022-12-13 02:03:59,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762487536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:59,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:59,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126370896] [2022-12-13 02:03:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:59,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:59,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:59,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:59,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:59,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:59,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:59,230 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:59,231 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:59,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:59,231 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:59,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:59,232 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:59,232 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:59,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:59,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:59,233 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:59,233 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:59,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:59,233 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,233 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:59,233 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:59,233 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:59,236 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:59,236 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:59,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:59,236 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:59,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:59,368 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:59,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:03:59,369 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:59,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:59,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:59,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1825 [2022-12-13 02:03:59,370 INFO L420 AbstractCegarLoop]: === Iteration 1827 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash -815233337, now seen corresponding path program 1 times [2022-12-13 02:03:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:59,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415317016] [2022-12-13 02:03:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:59,443 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 02:03:59,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:59,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415317016] [2022-12-13 02:03:59,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415317016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:59,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:59,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431071775] [2022-12-13 02:03:59,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:59,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:59,444 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:59,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:59,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:59,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:59,505 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:59,505 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:03:59,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:59,506 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:59,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:59,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:59,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:59,506 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:59,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:59,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:59,507 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:59,507 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:59,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:59,507 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:59,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:59,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:59,510 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:59,510 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:03:59,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:59,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:59,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:59,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:59,644 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:03:59,644 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:59,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:59,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:59,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1826 [2022-12-13 02:03:59,644 INFO L420 AbstractCegarLoop]: === Iteration 1828 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash -757975035, now seen corresponding path program 1 times [2022-12-13 02:03:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:59,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666109681] [2022-12-13 02:03:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:59,706 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 02:03:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:59,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666109681] [2022-12-13 02:03:59,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666109681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:59,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:59,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002741114] [2022-12-13 02:03:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:59,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:59,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:59,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:59,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:59,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:59,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:03:59,759 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:03:59,759 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:03:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:03:59,760 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:03:59,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:03:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:03:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:03:59,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:03:59,760 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:03:59,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:03:59,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:03:59,761 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:03:59,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:03:59,762 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:03:59,762 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:03:59,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:03:59,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:03:59,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:59,764 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:03:59,764 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:03:59,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:03:59,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:03:59,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:03:59,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:03:59,918 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 02:03:59,918 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:03:59,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:03:59,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:03:59,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1827 [2022-12-13 02:03:59,918 INFO L420 AbstractCegarLoop]: === Iteration 1829 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:03:59,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:03:59,918 INFO L85 PathProgramCache]: Analyzing trace with hash -700716733, now seen corresponding path program 1 times [2022-12-13 02:03:59,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:03:59,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428349887] [2022-12-13 02:03:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:03:59,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:03:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:03:59,982 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 02:03:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:03:59,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428349887] [2022-12-13 02:03:59,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428349887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:03:59,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:03:59,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:03:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989365971] [2022-12-13 02:03:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:03:59,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:03:59,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:03:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:03:59,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:03:59,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:03:59,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:03:59,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:03:59,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:03:59,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:00,036 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:00,036 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:00,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:00,037 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:00,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:00,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:00,037 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:00,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:00,038 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,038 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:00,038 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:00,038 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:00,038 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,039 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:00,039 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:00,039 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,041 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:00,041 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:00,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:00,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:00,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:00,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:00,161 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:00,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:00,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:00,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1828 [2022-12-13 02:04:00,162 INFO L420 AbstractCegarLoop]: === Iteration 1830 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:00,162 INFO L85 PathProgramCache]: Analyzing trace with hash -643458431, now seen corresponding path program 1 times [2022-12-13 02:04:00,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:00,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91571722] [2022-12-13 02:04:00,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:00,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:00,217 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 02:04:00,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:00,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91571722] [2022-12-13 02:04:00,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91571722] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:00,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:00,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040006978] [2022-12-13 02:04:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:00,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:00,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:00,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:00,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:00,218 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:00,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:00,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:00,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:00,260 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:00,261 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:00,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:00,261 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:00,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:00,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:00,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:00,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:00,262 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:00,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:00,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:00,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:00,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:00,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:00,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:00,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:00,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:00,383 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:00,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:00,384 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:00,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,384 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:00,384 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:00,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1829 [2022-12-13 02:04:00,384 INFO L420 AbstractCegarLoop]: === Iteration 1831 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:00,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:00,384 INFO L85 PathProgramCache]: Analyzing trace with hash -586200129, now seen corresponding path program 1 times [2022-12-13 02:04:00,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:00,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955479987] [2022-12-13 02:04:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:00,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:00,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:00,438 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 02:04:00,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:00,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955479987] [2022-12-13 02:04:00,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955479987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:00,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:00,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:00,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065374379] [2022-12-13 02:04:00,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:00,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:00,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:00,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:00,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:00,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:00,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:00,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:00,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:00,488 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:00,489 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:00,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:00,489 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:00,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:00,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:00,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:00,490 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:00,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:00,490 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,490 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:00,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:00,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:00,491 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:00,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:00,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,493 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:00,493 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:00,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:00,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:00,609 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:00,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:00,610 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:00,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:00,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:00,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1830 [2022-12-13 02:04:00,610 INFO L420 AbstractCegarLoop]: === Iteration 1832 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -528941827, now seen corresponding path program 1 times [2022-12-13 02:04:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684051056] [2022-12-13 02:04:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:00,663 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 02:04:00,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:00,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684051056] [2022-12-13 02:04:00,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684051056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:00,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:00,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051560779] [2022-12-13 02:04:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:00,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:00,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:00,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:00,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:00,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:00,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:00,714 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:00,714 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:00,714 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:00,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:00,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:00,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:00,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:00,715 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:00,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:00,716 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,716 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:00,716 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:00,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:00,716 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:00,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:00,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,719 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:00,719 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:00,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:00,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:00,834 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:00,835 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:00,835 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:00,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,835 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:00,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:00,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1831 [2022-12-13 02:04:00,835 INFO L420 AbstractCegarLoop]: === Iteration 1833 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:00,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:00,836 INFO L85 PathProgramCache]: Analyzing trace with hash -471683525, now seen corresponding path program 1 times [2022-12-13 02:04:00,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:00,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508577539] [2022-12-13 02:04:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:00,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:00,898 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 02:04:00,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:00,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508577539] [2022-12-13 02:04:00,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508577539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:00,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:00,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:00,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133228826] [2022-12-13 02:04:00,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:00,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:00,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:00,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:00,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:00,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:00,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:00,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:00,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:00,943 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:00,943 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:00,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:00,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:00,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:00,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:00,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:00,944 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:00,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:00,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:00,945 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:00,945 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:00,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:00,946 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:00,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:00,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:00,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,948 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:00,948 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:00,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:00,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:00,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:01,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:01,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:01,064 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:01,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:01,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:01,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1832 [2022-12-13 02:04:01,064 INFO L420 AbstractCegarLoop]: === Iteration 1834 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash -414425223, now seen corresponding path program 1 times [2022-12-13 02:04:01,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:01,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942144475] [2022-12-13 02:04:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:01,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:01,119 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 02:04:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:01,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942144475] [2022-12-13 02:04:01,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942144475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:01,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:01,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:01,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392750651] [2022-12-13 02:04:01,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:01,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:01,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:01,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:01,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:01,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:01,170 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:01,170 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:01,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:01,171 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:01,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:01,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:01,171 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:01,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:01,172 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:01,172 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:01,172 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:01,172 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:01,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:01,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,175 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:01,175 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:01,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:01,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:01,291 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:01,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:01,292 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:01,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:01,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:01,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1833 [2022-12-13 02:04:01,292 INFO L420 AbstractCegarLoop]: === Iteration 1835 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash -357166921, now seen corresponding path program 1 times [2022-12-13 02:04:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661771721] [2022-12-13 02:04:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:01,360 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 02:04:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:01,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661771721] [2022-12-13 02:04:01,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661771721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:01,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:01,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236870757] [2022-12-13 02:04:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:01,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:01,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:01,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:01,361 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:01,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:01,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:01,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:01,412 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:01,412 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:01,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:01,413 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:01,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:01,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:01,414 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:01,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:01,414 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:01,415 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:01,415 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:01,415 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:01,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:01,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,418 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:01,418 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:01,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:01,418 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,418 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:01,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:01,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:01,536 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:01,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:01,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:01,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1834 [2022-12-13 02:04:01,536 INFO L420 AbstractCegarLoop]: === Iteration 1836 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash -299908619, now seen corresponding path program 1 times [2022-12-13 02:04:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:01,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107652625] [2022-12-13 02:04:01,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:01,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:01,592 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 02:04:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:01,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107652625] [2022-12-13 02:04:01,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107652625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:01,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:01,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:01,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910302551] [2022-12-13 02:04:01,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:01,593 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:01,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:01,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:01,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:01,651 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:01,652 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:01,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:01,652 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:01,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:01,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:01,653 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:01,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:01,654 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:01,654 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:01,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:01,654 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:01,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:01,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,657 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:01,657 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:01,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:01,657 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:01,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:01,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:01,792 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:01,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,793 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:01,793 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:01,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1835 [2022-12-13 02:04:01,793 INFO L420 AbstractCegarLoop]: === Iteration 1837 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash -242650317, now seen corresponding path program 1 times [2022-12-13 02:04:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:01,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420863262] [2022-12-13 02:04:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:01,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:01,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420863262] [2022-12-13 02:04:01,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420863262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:01,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:01,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:01,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828656963] [2022-12-13 02:04:01,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:01,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:01,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:01,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:01,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:01,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:01,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:01,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:01,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:01,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:01,917 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:01,917 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:01,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:01,918 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:01,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:01,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:01,918 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:01,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:01,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:01,919 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:01,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:01,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:01,919 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:01,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:01,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:01,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:01,922 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:01,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:01,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:01,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:02,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:02,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:02,057 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:02,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:02,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:02,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1836 [2022-12-13 02:04:02,057 INFO L420 AbstractCegarLoop]: === Iteration 1838 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:02,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -185392015, now seen corresponding path program 1 times [2022-12-13 02:04:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:02,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307596684] [2022-12-13 02:04:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:02,118 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 02:04:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:02,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307596684] [2022-12-13 02:04:02,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307596684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:02,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:02,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530837582] [2022-12-13 02:04:02,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:02,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:02,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:02,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:02,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:02,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:02,172 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:02,172 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:02,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:02,172 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:02,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:02,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:02,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:02,173 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:02,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:02,174 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,174 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:02,174 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:02,174 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:02,174 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,174 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:02,174 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:02,174 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,177 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:02,177 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:02,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:02,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:02,311 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:02,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:02,312 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:02,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:02,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:02,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1837 [2022-12-13 02:04:02,313 INFO L420 AbstractCegarLoop]: === Iteration 1839 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:02,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:02,313 INFO L85 PathProgramCache]: Analyzing trace with hash -128133713, now seen corresponding path program 1 times [2022-12-13 02:04:02,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:02,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757323484] [2022-12-13 02:04:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:02,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757323484] [2022-12-13 02:04:02,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757323484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:02,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:02,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:02,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135590862] [2022-12-13 02:04:02,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:02,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:02,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:02,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:02,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:02,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:02,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:02,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:02,441 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:02,441 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:02,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:02,442 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:02,442 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:02,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:02,442 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:02,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:02,443 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:02,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:02,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:02,443 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:02,444 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:02,444 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,446 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:02,446 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:02,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:02,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:02,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:02,580 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:02,581 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:02,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:02,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:02,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1838 [2022-12-13 02:04:02,581 INFO L420 AbstractCegarLoop]: === Iteration 1840 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -70875411, now seen corresponding path program 1 times [2022-12-13 02:04:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141153893] [2022-12-13 02:04:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:02,640 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 02:04:02,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141153893] [2022-12-13 02:04:02,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141153893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:02,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:02,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116351717] [2022-12-13 02:04:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:02,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:02,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:02,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:02,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:02,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:02,692 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:02,693 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:02,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:02,693 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:02,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:02,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:02,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:02,694 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:02,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:02,695 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:02,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:02,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:02,695 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:02,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:02,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,698 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:02,698 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:02,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:02,698 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,698 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:02,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:02,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:04:02,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:02,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:02,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:02,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1839 [2022-12-13 02:04:02,839 INFO L420 AbstractCegarLoop]: === Iteration 1841 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:02,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:02,839 INFO L85 PathProgramCache]: Analyzing trace with hash -13617109, now seen corresponding path program 1 times [2022-12-13 02:04:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:02,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562864558] [2022-12-13 02:04:02,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:02,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:02,906 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 02:04:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:02,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562864558] [2022-12-13 02:04:02,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562864558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:02,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:02,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121976418] [2022-12-13 02:04:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:02,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:02,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:02,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:02,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:02,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:02,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:02,959 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:02,959 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:02,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:02,960 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:02,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:02,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:02,960 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:02,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:02,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:02,961 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,962 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:02,962 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:02,962 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:02,962 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:02,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:02,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:02,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,977 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:02,978 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:02,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:02,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:02,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:03,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:03,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 02:04:03,113 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:03,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:03,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:03,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1840 [2022-12-13 02:04:03,114 INFO L420 AbstractCegarLoop]: === Iteration 1842 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:03,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:03,114 INFO L85 PathProgramCache]: Analyzing trace with hash 43641193, now seen corresponding path program 1 times [2022-12-13 02:04:03,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:03,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87376570] [2022-12-13 02:04:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:03,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:03,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:03,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87376570] [2022-12-13 02:04:03,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87376570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:03,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:03,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33601028] [2022-12-13 02:04:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:03,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:03,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:03,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:03,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:03,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:03,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:03,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:03,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:03,237 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:03,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:03,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:03,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:03,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:03,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:03,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:03,239 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:03,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:03,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:03,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:03,239 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:03,239 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:03,242 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:03,242 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:03,242 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:03,242 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:03,375 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:03,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:03,376 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:03,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:03,376 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:03,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1841 [2022-12-13 02:04:03,376 INFO L420 AbstractCegarLoop]: === Iteration 1843 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:03,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:03,376 INFO L85 PathProgramCache]: Analyzing trace with hash 100899495, now seen corresponding path program 1 times [2022-12-13 02:04:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:03,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067310606] [2022-12-13 02:04:03,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:03,441 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 02:04:03,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:03,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067310606] [2022-12-13 02:04:03,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067310606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:03,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:03,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306873943] [2022-12-13 02:04:03,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:03,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:03,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:03,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:03,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:03,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:03,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:03,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:03,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:03,504 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:03,504 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:03,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:03,505 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:03,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:03,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:03,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:03,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:03,506 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:03,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:03,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:03,506 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:03,507 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:03,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:03,507 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,507 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:03,507 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:03,507 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:03,510 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:03,510 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:03,510 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:03,510 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:03,643 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:03,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:03,645 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:03,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:03,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:03,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1842 [2022-12-13 02:04:03,645 INFO L420 AbstractCegarLoop]: === Iteration 1844 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:03,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:03,645 INFO L85 PathProgramCache]: Analyzing trace with hash 158157797, now seen corresponding path program 1 times [2022-12-13 02:04:03,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:03,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277677781] [2022-12-13 02:04:03,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:03,718 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 02:04:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:03,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277677781] [2022-12-13 02:04:03,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277677781] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:03,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:03,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:03,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493516397] [2022-12-13 02:04:03,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:03,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:03,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:03,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:03,719 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:03,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:03,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:03,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:03,781 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:03,781 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:03,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:03,782 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:03,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:03,782 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:03,782 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:03,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:03,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:03,783 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,783 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:03,783 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:03,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:03,784 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:03,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:03,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:03,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:03,786 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:03,786 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:03,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:03,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:03,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:03,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:03,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:03,922 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:03,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:03,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:03,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1843 [2022-12-13 02:04:03,922 INFO L420 AbstractCegarLoop]: === Iteration 1845 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 215416099, now seen corresponding path program 1 times [2022-12-13 02:04:03,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:03,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048267050] [2022-12-13 02:04:03,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:03,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:03,993 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 02:04:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:03,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048267050] [2022-12-13 02:04:03,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048267050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:03,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:03,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674521387] [2022-12-13 02:04:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:03,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:03,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:03,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:03,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:03,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:03,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:03,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:03,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:04,063 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:04,063 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:04,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:04,064 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:04,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:04,065 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:04,065 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:04,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:04,066 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,066 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:04,066 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:04,066 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:04,066 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,066 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:04,066 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:04,067 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,070 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:04,070 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:04,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:04,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:04,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:04,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 301 [2022-12-13 02:04:04,367 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:04,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:04,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:04,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:04,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1844 [2022-12-13 02:04:04,367 INFO L420 AbstractCegarLoop]: === Iteration 1846 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 272674401, now seen corresponding path program 1 times [2022-12-13 02:04:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:04,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982091417] [2022-12-13 02:04:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:04,425 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 02:04:04,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:04,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982091417] [2022-12-13 02:04:04,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982091417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:04,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:04,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095458662] [2022-12-13 02:04:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:04,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:04,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:04,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:04,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:04,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:04,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:04,476 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:04,476 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:04,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:04,477 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:04,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:04,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:04,478 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:04,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:04,478 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,479 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:04,479 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:04,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:04,479 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:04,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:04,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,482 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:04,482 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:04,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:04,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:04,600 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:04,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:04,601 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:04,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:04,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:04,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:04,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1845 [2022-12-13 02:04:04,601 INFO L420 AbstractCegarLoop]: === Iteration 1847 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:04,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 329932703, now seen corresponding path program 1 times [2022-12-13 02:04:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:04,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642563962] [2022-12-13 02:04:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:04,654 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 02:04:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:04,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642563962] [2022-12-13 02:04:04,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642563962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:04,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:04,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765923296] [2022-12-13 02:04:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:04,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:04,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:04,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:04,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:04,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:04,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:04,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:04,707 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:04,707 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:04,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:04,708 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:04,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:04,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:04,708 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:04,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:04,709 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:04,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:04,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:04,709 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:04,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:04,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,712 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:04,712 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:04,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:04,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:04,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:04,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:04,831 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:04,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:04,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:04,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:04,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1846 [2022-12-13 02:04:04,831 INFO L420 AbstractCegarLoop]: === Iteration 1848 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:04,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:04,831 INFO L85 PathProgramCache]: Analyzing trace with hash 387191005, now seen corresponding path program 1 times [2022-12-13 02:04:04,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:04,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125751445] [2022-12-13 02:04:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:04,906 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 02:04:04,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:04,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125751445] [2022-12-13 02:04:04,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125751445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:04,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:04,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:04,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351542056] [2022-12-13 02:04:04,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:04,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:04,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:04,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:04,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:04,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:04,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:04,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:04,960 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:04,960 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:04,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:04,961 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:04,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:04,961 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:04,961 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:04,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:04,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:04,962 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,962 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:04,962 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:04,962 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:04,962 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:04,963 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:04,963 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:04,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,965 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:04,965 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:04,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:04,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:04,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:05,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:05,090 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:04:05,090 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:05,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,090 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:05,090 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:05,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1847 [2022-12-13 02:04:05,091 INFO L420 AbstractCegarLoop]: === Iteration 1849 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 444449307, now seen corresponding path program 1 times [2022-12-13 02:04:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:05,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705457400] [2022-12-13 02:04:05,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:05,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:05,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 02:04:05,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:05,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705457400] [2022-12-13 02:04:05,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705457400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:05,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:05,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551544569] [2022-12-13 02:04:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:05,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:05,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:05,146 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:05,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:05,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:05,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:05,189 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:05,189 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:05,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:05,190 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:05,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:05,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:05,190 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:05,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:05,191 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,191 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:05,191 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:05,192 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:05,192 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:05,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:05,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,194 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:05,194 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:05,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:05,195 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,195 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:05,311 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:05,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:05,312 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:05,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:05,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1848 [2022-12-13 02:04:05,312 INFO L420 AbstractCegarLoop]: === Iteration 1850 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:05,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:05,312 INFO L85 PathProgramCache]: Analyzing trace with hash 501707609, now seen corresponding path program 1 times [2022-12-13 02:04:05,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:05,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172073320] [2022-12-13 02:04:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:05,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:05,375 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 02:04:05,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:05,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172073320] [2022-12-13 02:04:05,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172073320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:05,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:05,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:05,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931276029] [2022-12-13 02:04:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:05,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:05,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:05,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:05,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,377 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:05,377 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:05,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:05,428 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:05,428 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:05,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:05,429 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:05,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:05,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:05,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:05,429 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:05,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:05,430 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:05,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:05,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:05,430 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:05,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:05,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,433 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:05,433 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:05,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:05,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:05,550 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:05,551 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:05,551 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:05,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,551 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:05,551 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:05,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1849 [2022-12-13 02:04:05,551 INFO L420 AbstractCegarLoop]: === Iteration 1851 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 558965911, now seen corresponding path program 1 times [2022-12-13 02:04:05,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:05,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779307957] [2022-12-13 02:04:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:05,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:05,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:05,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:05,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779307957] [2022-12-13 02:04:05,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779307957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:05,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:05,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440958503] [2022-12-13 02:04:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:05,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:05,605 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:05,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:05,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:05,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:05,655 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:05,656 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:05,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:05,656 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:05,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:05,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:05,657 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:05,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:05,658 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:05,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:05,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:05,658 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:05,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:05,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,661 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:05,661 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:05,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:05,661 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:05,778 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:05,779 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:05,779 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:05,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:05,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:05,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1850 [2022-12-13 02:04:05,779 INFO L420 AbstractCegarLoop]: === Iteration 1852 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:05,780 INFO L85 PathProgramCache]: Analyzing trace with hash 616224213, now seen corresponding path program 1 times [2022-12-13 02:04:05,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:05,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649821855] [2022-12-13 02:04:05,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:05,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:05,849 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 02:04:05,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:05,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649821855] [2022-12-13 02:04:05,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649821855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:05,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:05,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188210775] [2022-12-13 02:04:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:05,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:05,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:05,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:05,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:05,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:05,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:05,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:05,893 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:05,894 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:05,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:05,894 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:05,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:05,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:05,895 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:05,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:05,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:05,896 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:05,896 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:05,896 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:05,896 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,896 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:05,896 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:05,896 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:05,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,899 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:05,899 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:05,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:05,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:05,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:06,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:06,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:06,018 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:06,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:06,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:06,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1851 [2022-12-13 02:04:06,018 INFO L420 AbstractCegarLoop]: === Iteration 1853 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash 673482515, now seen corresponding path program 1 times [2022-12-13 02:04:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:06,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947687110] [2022-12-13 02:04:06,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:06,072 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 02:04:06,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:06,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947687110] [2022-12-13 02:04:06,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947687110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:06,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:06,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:06,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394374481] [2022-12-13 02:04:06,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:06,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:06,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:06,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:06,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:06,073 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:06,073 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:06,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:06,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:06,115 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:06,116 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:06,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:06,116 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:06,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:06,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:06,119 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:06,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:06,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:06,120 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:06,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:06,120 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,120 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:06,120 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:06,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:06,123 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:06,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:06,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:06,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:06,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:06,260 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:06,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:06,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:06,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1852 [2022-12-13 02:04:06,260 INFO L420 AbstractCegarLoop]: === Iteration 1854 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash 730740817, now seen corresponding path program 1 times [2022-12-13 02:04:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218469098] [2022-12-13 02:04:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:06,318 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 02:04:06,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:06,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218469098] [2022-12-13 02:04:06,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218469098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:06,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:06,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:06,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641093592] [2022-12-13 02:04:06,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:06,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:06,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:06,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:06,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:06,319 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:06,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:06,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:06,399 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:06,399 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:06,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:06,399 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:06,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:06,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:06,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:06,400 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:06,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:06,401 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:06,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:06,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:06,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:06,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:06,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,404 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:06,404 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:06,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:06,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:06,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:06,525 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:06,525 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:06,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,526 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:06,526 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:06,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1853 [2022-12-13 02:04:06,526 INFO L420 AbstractCegarLoop]: === Iteration 1855 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:06,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:06,526 INFO L85 PathProgramCache]: Analyzing trace with hash 787999119, now seen corresponding path program 1 times [2022-12-13 02:04:06,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:06,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203064816] [2022-12-13 02:04:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:06,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:06,581 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 02:04:06,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:06,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203064816] [2022-12-13 02:04:06,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203064816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:06,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:06,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504581282] [2022-12-13 02:04:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:06,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:06,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:06,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:06,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:06,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:06,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:06,634 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:06,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:06,634 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:06,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:06,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:06,635 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:06,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:06,636 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:06,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:06,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:06,636 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,636 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:06,636 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:06,636 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,639 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:06,639 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:06,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:06,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:06,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:06,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:06,755 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:06,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:06,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1854 [2022-12-13 02:04:06,755 INFO L420 AbstractCegarLoop]: === Iteration 1856 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 845257421, now seen corresponding path program 1 times [2022-12-13 02:04:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:06,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994327334] [2022-12-13 02:04:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:06,809 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 02:04:06,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:06,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994327334] [2022-12-13 02:04:06,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994327334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:06,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:06,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:06,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503905554] [2022-12-13 02:04:06,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:06,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:06,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:06,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:06,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:06,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:06,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:06,854 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:06,854 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:06,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:06,855 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:06,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:06,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:06,855 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:06,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:06,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:06,856 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:06,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:06,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:06,856 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:06,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:06,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:06,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,859 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:06,859 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:06,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:06,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:06,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:06,985 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:06,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:04:06,986 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:06,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:06,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:06,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:06,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1855 [2022-12-13 02:04:06,986 INFO L420 AbstractCegarLoop]: === Iteration 1857 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 902515723, now seen corresponding path program 1 times [2022-12-13 02:04:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:06,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635761329] [2022-12-13 02:04:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:06,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:07,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635761329] [2022-12-13 02:04:07,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635761329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:07,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691503357] [2022-12-13 02:04:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:07,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:07,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:07,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:07,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:07,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:07,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:07,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:07,083 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:07,083 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:07,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:07,084 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:07,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:07,084 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:07,084 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:07,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:07,085 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,085 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:07,085 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:07,085 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:07,085 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,085 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:07,085 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:07,085 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,088 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:07,088 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:07,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:07,088 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,088 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:07,208 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:07,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:07,209 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:07,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:07,209 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:07,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1856 [2022-12-13 02:04:07,209 INFO L420 AbstractCegarLoop]: === Iteration 1858 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash 959774025, now seen corresponding path program 1 times [2022-12-13 02:04:07,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:07,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086622228] [2022-12-13 02:04:07,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:07,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:07,281 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 02:04:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:07,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086622228] [2022-12-13 02:04:07,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086622228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:07,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:07,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059607235] [2022-12-13 02:04:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:07,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:07,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:07,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:07,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:07,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:07,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:07,335 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:07,335 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:07,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:07,336 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:07,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:07,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:07,336 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:07,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:07,337 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:07,337 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:07,337 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:07,337 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:07,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:07,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,340 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:07,340 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:07,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:07,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:07,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:07,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:07,474 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:07,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:07,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:07,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1857 [2022-12-13 02:04:07,474 INFO L420 AbstractCegarLoop]: === Iteration 1859 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:07,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:07,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1017032327, now seen corresponding path program 1 times [2022-12-13 02:04:07,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:07,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349956806] [2022-12-13 02:04:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:07,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:07,549 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 02:04:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349956806] [2022-12-13 02:04:07,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349956806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:07,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:07,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:07,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635038782] [2022-12-13 02:04:07,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:07,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:07,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:07,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:07,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:07,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:07,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:07,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:07,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:07,611 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:07,612 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:07,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:07,612 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:07,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:07,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:07,612 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:07,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:07,613 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:07,613 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:07,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:07,614 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:07,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:07,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,616 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:07,616 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:07,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:07,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:07,732 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:07,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:07,733 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:07,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:07,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:07,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1858 [2022-12-13 02:04:07,733 INFO L420 AbstractCegarLoop]: === Iteration 1860 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1074290629, now seen corresponding path program 1 times [2022-12-13 02:04:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:07,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48268514] [2022-12-13 02:04:07,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:07,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:07,787 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 02:04:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:07,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48268514] [2022-12-13 02:04:07,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48268514] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:07,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:07,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153030352] [2022-12-13 02:04:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:07,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:07,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:07,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:07,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:07,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:07,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:07,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:07,838 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:07,838 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:07,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:07,839 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:07,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:07,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:07,839 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:07,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:07,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:07,840 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:07,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:07,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:07,841 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:07,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:07,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:07,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,844 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:07,844 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:07,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:07,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:07,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:07,961 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:07,962 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:07,962 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:07,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:07,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:07,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:07,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1859 [2022-12-13 02:04:07,962 INFO L420 AbstractCegarLoop]: === Iteration 1861 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:07,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1131548931, now seen corresponding path program 1 times [2022-12-13 02:04:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:07,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491024472] [2022-12-13 02:04:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:08,028 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 02:04:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:08,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491024472] [2022-12-13 02:04:08,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491024472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:08,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:08,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075834527] [2022-12-13 02:04:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:08,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:08,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:08,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:08,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:08,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:08,077 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:08,077 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:08,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:08,078 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:08,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:08,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:08,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:08,078 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:08,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:08,079 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,079 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:08,079 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:08,079 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:08,079 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:08,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:08,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,082 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:08,082 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:08,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:08,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:08,198 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:08,198 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:08,198 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:08,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:08,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:08,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1860 [2022-12-13 02:04:08,199 INFO L420 AbstractCegarLoop]: === Iteration 1862 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1188807233, now seen corresponding path program 1 times [2022-12-13 02:04:08,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:08,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314594656] [2022-12-13 02:04:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:08,252 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 02:04:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314594656] [2022-12-13 02:04:08,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314594656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:08,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:08,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405064322] [2022-12-13 02:04:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:08,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:08,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:08,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:08,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:08,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:08,296 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:08,296 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:08,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:08,296 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:08,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:08,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:08,297 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:08,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:08,298 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,298 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:08,298 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:08,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:08,298 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:08,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:08,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,301 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:08,301 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:08,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:08,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,301 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:08,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:08,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:08,417 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:08,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:08,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:08,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1861 [2022-12-13 02:04:08,417 INFO L420 AbstractCegarLoop]: === Iteration 1863 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1246065535, now seen corresponding path program 1 times [2022-12-13 02:04:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:08,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117998918] [2022-12-13 02:04:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:08,473 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 02:04:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:08,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117998918] [2022-12-13 02:04:08,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117998918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:08,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:08,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:08,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017318909] [2022-12-13 02:04:08,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:08,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:08,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:08,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:08,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:08,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:08,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:08,522 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:08,523 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:08,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:08,523 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:08,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:08,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:08,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:08,524 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:08,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:08,524 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:08,524 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:08,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:08,525 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:08,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:08,525 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,527 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:08,527 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:08,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:08,528 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,528 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:08,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:08,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:04:08,643 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:08,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:08,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:08,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1862 [2022-12-13 02:04:08,643 INFO L420 AbstractCegarLoop]: === Iteration 1864 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:08,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1303323837, now seen corresponding path program 1 times [2022-12-13 02:04:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:08,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285381665] [2022-12-13 02:04:08,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:08,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:08,698 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 02:04:08,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:08,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285381665] [2022-12-13 02:04:08,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285381665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:08,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:08,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:08,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046739899] [2022-12-13 02:04:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:08,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:08,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:08,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:08,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:08,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:08,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:08,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:08,742 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:08,742 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:08,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:08,743 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:08,743 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:08,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:08,743 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:08,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:08,744 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:08,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:08,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:08,744 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:08,745 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:08,745 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,747 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:08,747 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:08,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:08,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:08,862 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:08,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:08,863 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:08,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,863 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:08,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1863 [2022-12-13 02:04:08,864 INFO L420 AbstractCegarLoop]: === Iteration 1865 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:08,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1360582139, now seen corresponding path program 1 times [2022-12-13 02:04:08,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:08,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448876460] [2022-12-13 02:04:08,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:08,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:08,919 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 02:04:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448876460] [2022-12-13 02:04:08,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448876460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:08,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:08,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746308495] [2022-12-13 02:04:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:08,920 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:08,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:08,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:08,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:08,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:08,974 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:08,974 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:08,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:08,975 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:08,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:08,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:08,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:08,975 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:08,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:08,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:08,976 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:08,976 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:08,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:08,976 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:08,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:08,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:08,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,979 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:08,979 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:08,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:08,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:08,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:09,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:09,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:04:09,105 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:09,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:09,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:09,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1864 [2022-12-13 02:04:09,105 INFO L420 AbstractCegarLoop]: === Iteration 1866 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1417840441, now seen corresponding path program 1 times [2022-12-13 02:04:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718346318] [2022-12-13 02:04:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:09,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:09,167 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 02:04:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:09,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718346318] [2022-12-13 02:04:09,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718346318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:09,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:09,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:09,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552207207] [2022-12-13 02:04:09,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:09,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:09,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:09,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:09,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:09,168 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:09,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:09,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:09,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:09,211 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:09,211 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:09,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:09,212 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:09,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:09,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:09,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:09,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:09,212 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:09,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:09,213 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:09,213 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:09,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:09,213 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:09,214 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:09,214 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,216 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:09,216 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:09,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:09,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,217 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:09,334 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:09,335 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:09,335 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:09,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,335 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:09,335 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:09,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1865 [2022-12-13 02:04:09,335 INFO L420 AbstractCegarLoop]: === Iteration 1867 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:09,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1475098743, now seen corresponding path program 1 times [2022-12-13 02:04:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:09,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978946507] [2022-12-13 02:04:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:09,408 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 02:04:09,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:09,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978946507] [2022-12-13 02:04:09,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978946507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:09,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:09,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:09,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827863468] [2022-12-13 02:04:09,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:09,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:09,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:09,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:09,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:09,456 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:09,456 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:09,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:09,457 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:09,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:09,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:09,457 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:09,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:09,458 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,458 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:09,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:09,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:09,458 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:09,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:09,459 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,461 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:09,461 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:09,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:09,462 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,462 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:09,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:09,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:04:09,586 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:09,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:09,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:09,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1866 [2022-12-13 02:04:09,586 INFO L420 AbstractCegarLoop]: === Iteration 1868 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1532357045, now seen corresponding path program 1 times [2022-12-13 02:04:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:09,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669081446] [2022-12-13 02:04:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:09,645 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 02:04:09,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:09,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669081446] [2022-12-13 02:04:09,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669081446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:09,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346929036] [2022-12-13 02:04:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:09,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:09,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:09,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:09,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:09,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:09,700 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:09,700 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:09,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:09,701 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:09,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:09,701 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:09,702 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:09,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:09,702 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:09,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:09,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:09,703 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:09,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:09,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:09,706 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:09,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:09,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:09,821 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:09,822 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:09,822 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:09,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:09,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:09,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1867 [2022-12-13 02:04:09,822 INFO L420 AbstractCegarLoop]: === Iteration 1869 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:09,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:09,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1589615347, now seen corresponding path program 1 times [2022-12-13 02:04:09,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:09,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163000069] [2022-12-13 02:04:09,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:09,878 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 02:04:09,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:09,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163000069] [2022-12-13 02:04:09,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163000069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:09,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:09,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:09,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276248927] [2022-12-13 02:04:09,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:09,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:09,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:09,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:09,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:09,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:09,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:09,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:09,930 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:09,930 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:09,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:09,931 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:09,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:09,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:09,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:09,932 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:09,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:09,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:09,933 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,933 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:09,933 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:09,933 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:09,933 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,933 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:09,933 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:09,933 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:09,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,936 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:09,936 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:09,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:09,936 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:09,936 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:10,083 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:10,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 02:04:10,084 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:10,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,084 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:10,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:10,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1868 [2022-12-13 02:04:10,085 INFO L420 AbstractCegarLoop]: === Iteration 1870 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:10,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:10,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1646873649, now seen corresponding path program 1 times [2022-12-13 02:04:10,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:10,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274576796] [2022-12-13 02:04:10,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:10,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:10,164 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 02:04:10,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:10,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274576796] [2022-12-13 02:04:10,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274576796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:10,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:10,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:10,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382051052] [2022-12-13 02:04:10,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:10,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:10,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:10,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:10,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:10,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:10,229 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:10,229 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:10,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:10,230 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:10,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:10,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:10,230 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:10,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:10,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:10,232 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:10,232 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:10,232 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:10,232 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,232 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:10,232 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:10,232 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:10,236 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:10,236 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:10,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:10,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:10,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:10,372 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:10,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:10,373 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:10,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:10,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:10,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1869 [2022-12-13 02:04:10,374 INFO L420 AbstractCegarLoop]: === Iteration 1871 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1704131951, now seen corresponding path program 1 times [2022-12-13 02:04:10,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:10,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377673674] [2022-12-13 02:04:10,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:10,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:10,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 02:04:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377673674] [2022-12-13 02:04:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377673674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:10,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300901364] [2022-12-13 02:04:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:10,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:10,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:10,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:10,438 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:10,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:10,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:10,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:10,490 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:10,490 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:10,491 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:10,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:10,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:10,492 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:10,492 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:10,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:10,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:10,493 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,493 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:10,493 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:10,493 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:10,493 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:10,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:10,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:10,496 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:10,496 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:10,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:10,496 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:10,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:10,631 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:10,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:10,633 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:10,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:10,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:10,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1870 [2022-12-13 02:04:10,633 INFO L420 AbstractCegarLoop]: === Iteration 1872 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1761390253, now seen corresponding path program 1 times [2022-12-13 02:04:10,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:10,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992791128] [2022-12-13 02:04:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:10,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:10,713 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 02:04:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:10,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992791128] [2022-12-13 02:04:10,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992791128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:10,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:10,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:10,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012260314] [2022-12-13 02:04:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:10,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:10,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:10,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:10,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:10,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:10,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:10,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:10,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:10,769 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:10,769 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:10,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:10,770 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:10,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:10,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:10,770 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:10,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:10,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:10,771 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,771 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:10,771 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:10,771 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:10,771 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,772 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:10,772 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:10,772 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:10,774 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:10,774 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:10,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:10,775 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:10,775 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:10,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:10,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:10,913 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:10,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:10,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:10,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1871 [2022-12-13 02:04:10,914 INFO L420 AbstractCegarLoop]: === Iteration 1873 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1818648555, now seen corresponding path program 1 times [2022-12-13 02:04:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:10,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850875875] [2022-12-13 02:04:10,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:10,979 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 02:04:10,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:10,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850875875] [2022-12-13 02:04:10,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850875875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:10,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:10,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:10,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949456443] [2022-12-13 02:04:10,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:10,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:10,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:10,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:10,980 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:10,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:10,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:10,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:10,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:11,042 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:11,042 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:11,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:11,043 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:11,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:11,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:11,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:11,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:11,044 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:11,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:11,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:11,045 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:11,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:11,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,048 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:11,048 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:11,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:11,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:11,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 156 [2022-12-13 02:04:11,202 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:11,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:11,202 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:11,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:11,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1872 [2022-12-13 02:04:11,202 INFO L420 AbstractCegarLoop]: === Iteration 1874 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1875906857, now seen corresponding path program 1 times [2022-12-13 02:04:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:11,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241694656] [2022-12-13 02:04:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:11,272 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 02:04:11,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:11,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241694656] [2022-12-13 02:04:11,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241694656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:11,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:11,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:11,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265813338] [2022-12-13 02:04:11,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:11,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:11,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:11,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:11,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:11,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:11,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:11,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:11,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:11,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:11,326 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:11,326 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:11,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:11,327 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:11,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:11,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:11,328 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:11,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:11,328 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:11,329 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:11,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:11,329 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:11,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:11,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,332 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:11,332 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:11,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:11,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:11,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:04:11,479 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:11,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:11,479 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:11,479 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:11,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1873 [2022-12-13 02:04:11,479 INFO L420 AbstractCegarLoop]: === Iteration 1875 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:11,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:11,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1933165159, now seen corresponding path program 1 times [2022-12-13 02:04:11,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:11,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363540807] [2022-12-13 02:04:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:11,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:11,540 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 02:04:11,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:11,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363540807] [2022-12-13 02:04:11,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363540807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:11,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:11,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:11,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120696168] [2022-12-13 02:04:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:11,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:11,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:11,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:11,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:11,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:11,604 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:11,604 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:11,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:11,605 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:11,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:11,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:11,605 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:11,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:11,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:11,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:11,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:11,606 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:11,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:11,607 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,609 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:11,609 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:11,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:11,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,610 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:11,744 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:11,746 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:11,746 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:11,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:11,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:11,746 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1874 [2022-12-13 02:04:11,746 INFO L420 AbstractCegarLoop]: === Iteration 1876 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:11,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1990423461, now seen corresponding path program 1 times [2022-12-13 02:04:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:11,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492603610] [2022-12-13 02:04:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:11,806 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 02:04:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:11,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492603610] [2022-12-13 02:04:11,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492603610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:11,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:11,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:11,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727281525] [2022-12-13 02:04:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:11,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:11,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:11,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:11,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:11,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:11,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:11,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:11,861 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:11,862 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:11,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:11,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:11,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:11,863 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:11,863 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:11,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:11,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:11,864 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,864 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:11,864 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:11,864 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:11,864 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:11,864 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:11,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:11,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,867 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:11,867 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:11,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:11,868 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:11,868 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:12,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:12,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:12,005 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:12,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,005 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:12,005 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:12,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1875 [2022-12-13 02:04:12,005 INFO L420 AbstractCegarLoop]: === Iteration 1877 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2047681763, now seen corresponding path program 1 times [2022-12-13 02:04:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:12,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302390095] [2022-12-13 02:04:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:12,076 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 02:04:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:12,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302390095] [2022-12-13 02:04:12,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302390095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:12,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:12,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:12,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027447025] [2022-12-13 02:04:12,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:12,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:12,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:12,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:12,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:12,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:12,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:12,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:12,131 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:12,132 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:12,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:12,132 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:12,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:12,133 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:12,133 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:12,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:12,134 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:12,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:12,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:12,134 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:12,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:12,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,137 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:12,137 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:12,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:12,137 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,137 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:12,275 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:12,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:04:12,276 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:12,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,276 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:12,276 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:12,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1876 [2022-12-13 02:04:12,276 INFO L420 AbstractCegarLoop]: === Iteration 1878 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:12,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:12,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2104940065, now seen corresponding path program 1 times [2022-12-13 02:04:12,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:12,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403624742] [2022-12-13 02:04:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:12,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:12,347 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 02:04:12,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:12,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403624742] [2022-12-13 02:04:12,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403624742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:12,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:12,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848096142] [2022-12-13 02:04:12,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:12,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:12,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:12,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:12,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:12,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:12,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:12,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:12,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:12,406 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:12,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:12,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:12,407 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:12,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:12,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:12,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:12,408 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:12,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:12,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:12,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:12,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:12,409 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:12,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:12,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,412 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:12,412 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:12,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:12,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:12,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:12,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:12,531 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:12,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:12,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:12,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1877 [2022-12-13 02:04:12,531 INFO L420 AbstractCegarLoop]: === Iteration 1879 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:12,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2132768929, now seen corresponding path program 1 times [2022-12-13 02:04:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:12,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543503989] [2022-12-13 02:04:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:12,588 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 02:04:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:12,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543503989] [2022-12-13 02:04:12,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543503989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:12,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:12,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885006790] [2022-12-13 02:04:12,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:12,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:12,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:12,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:12,589 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:12,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:12,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:12,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:12,639 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:12,640 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:12,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:12,640 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:12,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:12,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:12,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:12,641 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:12,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:12,642 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,642 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:12,642 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:12,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:12,642 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,642 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:12,642 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:12,642 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,645 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:12,645 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:12,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:12,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:12,763 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:12,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:12,763 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:12,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:12,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:12,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1878 [2022-12-13 02:04:12,764 INFO L420 AbstractCegarLoop]: === Iteration 1880 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2075510627, now seen corresponding path program 1 times [2022-12-13 02:04:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:12,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210375370] [2022-12-13 02:04:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:12,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:12,831 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 02:04:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:12,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210375370] [2022-12-13 02:04:12,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210375370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:12,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:12,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:12,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556523512] [2022-12-13 02:04:12,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:12,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:12,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:12,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:12,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:12,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:12,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:12,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:12,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:12,876 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:12,877 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:12,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:12,877 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:12,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:12,878 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:12,878 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:12,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:12,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:12,878 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,879 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:12,879 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:12,879 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:12,879 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:12,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:12,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:12,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,882 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:12,882 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:12,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:12,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:12,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:12,999 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:13,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:13,000 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:13,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,000 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:13,000 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:13,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1879 [2022-12-13 02:04:13,000 INFO L420 AbstractCegarLoop]: === Iteration 1881 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2018252325, now seen corresponding path program 1 times [2022-12-13 02:04:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:13,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636889252] [2022-12-13 02:04:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:13,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:13,056 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 02:04:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:13,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636889252] [2022-12-13 02:04:13,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636889252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:13,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:13,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:13,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770092504] [2022-12-13 02:04:13,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:13,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:13,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:13,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:13,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:13,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:13,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:13,100 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:13,101 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:13,101 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:13,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:13,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:13,102 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:13,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:13,102 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:13,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:13,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:13,103 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:13,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:13,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,106 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:13,106 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:13,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:13,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:13,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:13,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:13,222 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:13,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:13,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:13,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1880 [2022-12-13 02:04:13,223 INFO L420 AbstractCegarLoop]: === Iteration 1882 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:13,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:13,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1960994023, now seen corresponding path program 1 times [2022-12-13 02:04:13,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:13,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778468291] [2022-12-13 02:04:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:13,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:13,277 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 02:04:13,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:13,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778468291] [2022-12-13 02:04:13,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778468291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:13,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:13,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209817034] [2022-12-13 02:04:13,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:13,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:13,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:13,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:13,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:13,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:13,328 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:13,328 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:13,329 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:13,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:13,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:13,330 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:13,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:13,330 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:13,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:13,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:13,331 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:13,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:13,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,333 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:13,334 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:13,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:13,334 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,334 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:13,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:13,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:13,450 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:13,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:13,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:13,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1881 [2022-12-13 02:04:13,451 INFO L420 AbstractCegarLoop]: === Iteration 1883 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1903735721, now seen corresponding path program 1 times [2022-12-13 02:04:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:13,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359021548] [2022-12-13 02:04:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:13,514 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 02:04:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:13,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359021548] [2022-12-13 02:04:13,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359021548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:13,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:13,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:13,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655827314] [2022-12-13 02:04:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:13,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:13,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:13,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:13,515 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:13,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:13,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:13,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:13,567 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:13,567 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:13,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:13,568 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:13,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:13,568 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:13,568 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:13,569 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:13,569 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:13,569 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:13,569 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,569 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:13,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:13,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,572 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:13,572 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:13,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:13,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:13,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:13,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:13,689 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:13,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:13,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:13,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1882 [2022-12-13 02:04:13,689 INFO L420 AbstractCegarLoop]: === Iteration 1884 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:13,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1846477419, now seen corresponding path program 1 times [2022-12-13 02:04:13,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:13,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215897559] [2022-12-13 02:04:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:13,753 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 02:04:13,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:13,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215897559] [2022-12-13 02:04:13,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215897559] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:13,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:13,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663042942] [2022-12-13 02:04:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:13,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:13,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:13,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:13,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:13,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:13,808 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:13,808 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:13,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:13,808 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:13,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:13,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:13,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:13,809 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:13,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:13,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:13,810 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,810 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:13,810 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:13,810 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:13,810 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:13,810 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:13,810 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:13,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,813 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:13,813 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:13,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:13,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:13,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:13,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:13,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:13,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:13,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:13,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:13,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:13,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1883 [2022-12-13 02:04:13,935 INFO L420 AbstractCegarLoop]: === Iteration 1885 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:13,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1789219117, now seen corresponding path program 1 times [2022-12-13 02:04:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:13,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879529862] [2022-12-13 02:04:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:14,000 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 02:04:14,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879529862] [2022-12-13 02:04:14,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879529862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:14,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:14,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:14,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519114458] [2022-12-13 02:04:14,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:14,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:14,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:14,001 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:14,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:14,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:14,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:14,056 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:14,056 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:14,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:14,057 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:14,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:14,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:14,057 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:14,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:14,058 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:14,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:14,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:14,059 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:14,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:14,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:14,062 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:14,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:14,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:14,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:14,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:14,182 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:14,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:14,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:14,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1884 [2022-12-13 02:04:14,183 INFO L420 AbstractCegarLoop]: === Iteration 1886 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1731960815, now seen corresponding path program 1 times [2022-12-13 02:04:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:14,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003383072] [2022-12-13 02:04:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:14,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:14,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003383072] [2022-12-13 02:04:14,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003383072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:14,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:14,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:14,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585627378] [2022-12-13 02:04:14,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:14,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:14,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:14,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:14,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:14,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:14,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:14,311 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:14,311 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:14,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:14,312 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:14,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:14,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:14,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:14,312 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:14,313 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:14,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:14,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:14,313 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:14,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:14,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,316 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:14,316 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:14,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:14,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:14,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:14,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:14,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:14,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:14,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1885 [2022-12-13 02:04:14,433 INFO L420 AbstractCegarLoop]: === Iteration 1887 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:14,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1674702513, now seen corresponding path program 1 times [2022-12-13 02:04:14,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:14,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920472622] [2022-12-13 02:04:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:14,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:14,488 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 02:04:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:14,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920472622] [2022-12-13 02:04:14,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920472622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:14,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:14,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:14,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651305629] [2022-12-13 02:04:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:14,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:14,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:14,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:14,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:14,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:14,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:14,533 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:14,533 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:14,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:14,534 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:14,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:14,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:14,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:14,534 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:14,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:14,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:14,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:14,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:14,535 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:14,536 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:14,536 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,538 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:14,538 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:14,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:14,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:14,670 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:14,672 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:14,672 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:14,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,672 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:14,672 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:14,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1886 [2022-12-13 02:04:14,672 INFO L420 AbstractCegarLoop]: === Iteration 1888 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1617444211, now seen corresponding path program 1 times [2022-12-13 02:04:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:14,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478710542] [2022-12-13 02:04:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:14,737 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 02:04:14,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:14,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478710542] [2022-12-13 02:04:14,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478710542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:14,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:14,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:14,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31704564] [2022-12-13 02:04:14,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:14,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:14,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:14,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:14,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:14,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:14,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:14,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:14,790 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:14,790 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:14,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:14,791 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:14,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:14,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:14,791 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:14,791 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:14,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:14,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:14,792 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,792 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:14,792 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:14,792 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:14,792 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:14,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:14,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:14,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,795 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:14,795 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:14,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:14,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:14,928 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:14,929 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:14,929 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:14,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,929 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:14,929 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:14,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1887 [2022-12-13 02:04:14,929 INFO L420 AbstractCegarLoop]: === Iteration 1889 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1560185909, now seen corresponding path program 1 times [2022-12-13 02:04:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:14,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198354831] [2022-12-13 02:04:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:14,989 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 02:04:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198354831] [2022-12-13 02:04:14,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198354831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:14,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:14,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:14,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060068336] [2022-12-13 02:04:14,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:14,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:14,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:14,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:14,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:14,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:14,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:14,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:14,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:14,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:15,050 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:15,050 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:15,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:15,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:15,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:15,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:15,051 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:15,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:15,052 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:15,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:15,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:15,052 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:15,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:15,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,055 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:15,055 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:15,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:15,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:15,192 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:15,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:15,193 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:15,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:15,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:15,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:15,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1888 [2022-12-13 02:04:15,193 INFO L420 AbstractCegarLoop]: === Iteration 1890 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1502927607, now seen corresponding path program 1 times [2022-12-13 02:04:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:15,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108048217] [2022-12-13 02:04:15,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:15,268 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 02:04:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108048217] [2022-12-13 02:04:15,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108048217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:15,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:15,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:15,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064247258] [2022-12-13 02:04:15,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:15,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:15,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:15,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:15,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:15,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:15,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:15,344 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:15,344 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:15,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:15,345 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:15,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:15,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:15,346 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:15,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:15,347 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,347 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:15,347 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:15,347 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:15,347 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,347 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:15,347 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:15,347 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,350 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:15,350 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:15,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:15,350 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,350 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:15,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:15,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:15,485 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:15,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:15,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:15,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:15,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1889 [2022-12-13 02:04:15,486 INFO L420 AbstractCegarLoop]: === Iteration 1891 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1445669305, now seen corresponding path program 1 times [2022-12-13 02:04:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090184246] [2022-12-13 02:04:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:15,559 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 02:04:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:15,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090184246] [2022-12-13 02:04:15,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090184246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:15,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:15,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608492222] [2022-12-13 02:04:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:15,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:15,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:15,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:15,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:15,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:15,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:15,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:15,627 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:15,628 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:15,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:15,628 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:15,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:15,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:15,629 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:15,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:15,630 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,630 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:15,630 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:15,630 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:15,630 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:15,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:15,630 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,633 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:15,633 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:15,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:15,633 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,633 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:15,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:15,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:15,769 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:15,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:15,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:15,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:15,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1890 [2022-12-13 02:04:15,770 INFO L420 AbstractCegarLoop]: === Iteration 1892 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1388411003, now seen corresponding path program 1 times [2022-12-13 02:04:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:15,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860320735] [2022-12-13 02:04:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:15,837 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 02:04:15,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:15,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860320735] [2022-12-13 02:04:15,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860320735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:15,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:15,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:15,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864100325] [2022-12-13 02:04:15,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:15,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:15,838 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:15,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:15,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:15,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:15,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:15,891 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:15,892 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:15,892 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:15,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:15,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:15,893 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:15,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:15,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:15,894 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:15,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:15,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:15,894 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:15,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:15,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,897 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:15,897 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:15,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:15,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:15,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:16,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:16,045 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 02:04:16,045 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:16,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:16,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:16,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1891 [2022-12-13 02:04:16,046 INFO L420 AbstractCegarLoop]: === Iteration 1893 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:16,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:16,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1331152701, now seen corresponding path program 1 times [2022-12-13 02:04:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:16,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88924803] [2022-12-13 02:04:16,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:16,132 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 02:04:16,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:16,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88924803] [2022-12-13 02:04:16,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88924803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:16,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:16,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:16,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194325803] [2022-12-13 02:04:16,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:16,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:16,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:16,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:16,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:16,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:16,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:16,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:16,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:16,193 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:16,194 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:16,194 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:16,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:16,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:16,195 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:16,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:16,196 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:16,196 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:16,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:16,196 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:16,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:16,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,199 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:16,199 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:16,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:16,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:16,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:16,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:16,332 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:16,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:16,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:16,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1892 [2022-12-13 02:04:16,333 INFO L420 AbstractCegarLoop]: === Iteration 1894 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:16,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1273894399, now seen corresponding path program 1 times [2022-12-13 02:04:16,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:16,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533147937] [2022-12-13 02:04:16,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:16,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:16,393 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 02:04:16,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:16,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533147937] [2022-12-13 02:04:16,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533147937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:16,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:16,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:16,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651793436] [2022-12-13 02:04:16,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:16,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:16,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:16,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:16,394 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:16,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:16,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:16,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:16,447 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:16,447 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:16,448 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:16,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:16,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:16,448 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:16,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:16,449 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:16,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:16,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:16,449 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:16,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:16,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:16,452 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:16,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:16,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:16,588 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:16,589 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:16,589 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:16,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,589 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:16,589 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:16,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1893 [2022-12-13 02:04:16,590 INFO L420 AbstractCegarLoop]: === Iteration 1895 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:16,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:16,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1216636097, now seen corresponding path program 1 times [2022-12-13 02:04:16,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:16,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932709320] [2022-12-13 02:04:16,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:16,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:16,659 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 02:04:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:16,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932709320] [2022-12-13 02:04:16,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932709320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:16,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:16,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399776725] [2022-12-13 02:04:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:16,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:16,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:16,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:16,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:16,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:16,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:16,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:16,710 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:16,710 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:16,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:16,711 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:16,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:16,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:16,712 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:16,712 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:16,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:16,713 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,713 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:16,713 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:16,713 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:16,713 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:16,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:16,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,717 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:16,717 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:16,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:16,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:16,848 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:16,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:16,850 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:16,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:16,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:16,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1894 [2022-12-13 02:04:16,850 INFO L420 AbstractCegarLoop]: === Iteration 1896 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1159377795, now seen corresponding path program 1 times [2022-12-13 02:04:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:16,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263919980] [2022-12-13 02:04:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:16,917 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 02:04:16,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:16,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263919980] [2022-12-13 02:04:16,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263919980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:16,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:16,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753328265] [2022-12-13 02:04:16,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:16,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:16,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:16,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:16,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:16,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:16,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:16,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:16,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:16,969 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:16,969 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:16,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:16,969 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:16,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:16,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:16,970 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:16,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:16,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:16,971 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:16,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:16,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:16,971 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:16,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:16,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:16,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,974 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:16,974 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:16,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:16,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:16,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:17,091 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:17,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:17,092 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:17,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:17,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:17,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1895 [2022-12-13 02:04:17,092 INFO L420 AbstractCegarLoop]: === Iteration 1897 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1102119493, now seen corresponding path program 1 times [2022-12-13 02:04:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:17,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867642904] [2022-12-13 02:04:17,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:17,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867642904] [2022-12-13 02:04:17,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867642904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:17,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:17,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:17,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793088117] [2022-12-13 02:04:17,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:17,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:17,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:17,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:17,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:17,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:17,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:17,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:17,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:17,202 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:17,202 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:17,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:17,203 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:17,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:17,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:17,203 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:17,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:17,204 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:17,204 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:17,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:17,204 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:17,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:17,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,207 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:17,207 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:17,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:17,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:17,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:17,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:17,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:17,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:17,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:17,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1896 [2022-12-13 02:04:17,324 INFO L420 AbstractCegarLoop]: === Iteration 1898 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:17,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:17,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1044861191, now seen corresponding path program 1 times [2022-12-13 02:04:17,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:17,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740055128] [2022-12-13 02:04:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:17,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:17,380 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 02:04:17,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:17,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740055128] [2022-12-13 02:04:17,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740055128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:17,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:17,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:17,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542373881] [2022-12-13 02:04:17,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:17,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:17,381 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:17,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:17,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:17,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:17,431 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:17,432 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:17,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:17,432 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:17,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:17,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:17,433 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:17,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:17,434 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:17,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:17,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:17,434 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:17,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:17,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:17,437 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:17,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:17,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:17,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:17,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:17,554 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:17,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:17,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1897 [2022-12-13 02:04:17,555 INFO L420 AbstractCegarLoop]: === Iteration 1899 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -987602889, now seen corresponding path program 1 times [2022-12-13 02:04:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:17,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119767717] [2022-12-13 02:04:17,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:17,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:17,633 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 02:04:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:17,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119767717] [2022-12-13 02:04:17,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119767717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:17,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:17,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:17,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112176494] [2022-12-13 02:04:17,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:17,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:17,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:17,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:17,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:17,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:17,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:17,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:17,686 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:17,686 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:17,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:17,686 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:17,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:17,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:17,687 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:17,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:17,688 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:17,688 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:17,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:17,688 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:17,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:17,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,691 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:17,691 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:17,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:17,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:17,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:17,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:04:17,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:17,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:17,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:17,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1898 [2022-12-13 02:04:17,821 INFO L420 AbstractCegarLoop]: === Iteration 1900 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:17,821 INFO L85 PathProgramCache]: Analyzing trace with hash -930344587, now seen corresponding path program 1 times [2022-12-13 02:04:17,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:17,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036728995] [2022-12-13 02:04:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:17,877 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 02:04:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:17,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036728995] [2022-12-13 02:04:17,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036728995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:17,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:17,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:17,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186251115] [2022-12-13 02:04:17,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:17,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:17,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:17,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:17,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:17,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:17,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:17,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:17,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:17,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:17,928 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:17,928 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:17,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:17,929 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:17,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:17,929 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:17,929 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:17,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:17,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:17,930 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:17,930 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:17,930 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:17,930 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:17,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:17,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:17,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,933 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:17,933 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:17,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:17,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:17,934 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:18,050 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:18,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:18,051 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:18,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,052 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:18,052 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:18,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1899 [2022-12-13 02:04:18,052 INFO L420 AbstractCegarLoop]: === Iteration 1901 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash -873086285, now seen corresponding path program 1 times [2022-12-13 02:04:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:18,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42614713] [2022-12-13 02:04:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:18,106 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 02:04:18,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42614713] [2022-12-13 02:04:18,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42614713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:18,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:18,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:18,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935749918] [2022-12-13 02:04:18,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:18,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:18,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:18,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:18,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:18,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:18,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:18,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:18,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:18,159 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:18,159 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:18,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:18,159 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:18,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:18,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:18,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:18,160 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:18,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:18,161 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,161 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:18,161 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:18,161 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:18,161 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,161 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:18,161 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:18,161 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,164 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:18,164 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:18,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:18,164 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,164 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:18,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:18,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:18,282 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:18,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:18,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:18,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1900 [2022-12-13 02:04:18,282 INFO L420 AbstractCegarLoop]: === Iteration 1902 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash -815827983, now seen corresponding path program 1 times [2022-12-13 02:04:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:18,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178709231] [2022-12-13 02:04:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:18,336 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 02:04:18,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:18,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178709231] [2022-12-13 02:04:18,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178709231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:18,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:18,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:18,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799707057] [2022-12-13 02:04:18,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:18,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:18,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:18,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:18,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:18,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:18,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:18,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:18,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:18,386 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:18,387 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:18,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:18,387 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:18,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:18,388 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:18,388 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:18,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:18,389 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:18,389 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:18,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:18,389 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:18,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:18,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,393 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:18,393 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:18,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:18,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,394 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:18,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:18,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:18,514 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:18,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:18,515 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:18,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1901 [2022-12-13 02:04:18,515 INFO L420 AbstractCegarLoop]: === Iteration 1903 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash -758569681, now seen corresponding path program 1 times [2022-12-13 02:04:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:18,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262547078] [2022-12-13 02:04:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:18,569 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 02:04:18,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:18,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262547078] [2022-12-13 02:04:18,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262547078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:18,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:18,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:18,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370693196] [2022-12-13 02:04:18,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:18,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:18,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:18,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:18,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:18,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:18,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:18,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:18,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:18,621 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:18,622 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:18,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:18,622 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:18,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:18,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:18,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:18,623 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:18,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:18,624 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,624 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:18,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:18,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:18,624 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:18,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:18,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,627 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:18,627 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:18,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:18,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:18,749 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:18,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:18,750 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:18,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:18,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:18,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1902 [2022-12-13 02:04:18,750 INFO L420 AbstractCegarLoop]: === Iteration 1904 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash -701311379, now seen corresponding path program 1 times [2022-12-13 02:04:18,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:18,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726300740] [2022-12-13 02:04:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:18,806 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 02:04:18,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:18,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726300740] [2022-12-13 02:04:18,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726300740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:18,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:18,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:18,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430239042] [2022-12-13 02:04:18,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:18,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:18,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:18,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:18,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:18,806 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:18,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:18,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:18,849 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:18,849 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:18,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:18,850 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:18,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:18,850 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:18,850 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:18,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:18,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:18,851 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,851 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:18,851 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:18,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:18,852 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:18,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:18,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:18,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,854 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:18,854 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:18,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:18,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:18,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:18,970 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:18,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:18,971 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:18,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:18,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:18,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:18,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1903 [2022-12-13 02:04:18,971 INFO L420 AbstractCegarLoop]: === Iteration 1905 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash -644053077, now seen corresponding path program 1 times [2022-12-13 02:04:18,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:18,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567083623] [2022-12-13 02:04:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:19,026 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 02:04:19,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:19,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567083623] [2022-12-13 02:04:19,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567083623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:19,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:19,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:19,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871930042] [2022-12-13 02:04:19,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:19,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:19,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:19,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:19,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:19,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:19,070 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:19,070 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:19,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:19,070 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:19,071 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:19,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:19,071 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:19,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:19,072 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,072 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:19,072 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:19,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:19,072 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:19,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:19,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,075 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:19,075 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:19,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:19,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:19,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:19,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:19,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:19,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:19,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1904 [2022-12-13 02:04:19,213 INFO L420 AbstractCegarLoop]: === Iteration 1906 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:19,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -586794775, now seen corresponding path program 1 times [2022-12-13 02:04:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530180265] [2022-12-13 02:04:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:19,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:19,272 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 02:04:19,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:19,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530180265] [2022-12-13 02:04:19,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530180265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:19,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:19,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703629239] [2022-12-13 02:04:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:19,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:19,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:19,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:19,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:19,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:19,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:19,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:19,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:19,324 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:19,324 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:19,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:19,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:19,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:19,325 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:19,325 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:19,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:19,326 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:19,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:19,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:19,326 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:19,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:19,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,329 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:19,329 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:19,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:19,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:19,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:19,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:04:19,461 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:19,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:19,461 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:19,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1905 [2022-12-13 02:04:19,461 INFO L420 AbstractCegarLoop]: === Iteration 1907 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:19,461 INFO L85 PathProgramCache]: Analyzing trace with hash -529536473, now seen corresponding path program 1 times [2022-12-13 02:04:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:19,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242309933] [2022-12-13 02:04:19,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:19,525 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 02:04:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:19,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242309933] [2022-12-13 02:04:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242309933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:19,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:19,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813436333] [2022-12-13 02:04:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:19,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:19,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:19,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:19,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:19,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:19,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:19,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:19,575 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:19,576 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:19,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:19,576 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:19,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:19,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:19,577 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:19,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:19,578 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:19,578 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:19,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:19,578 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:19,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:19,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:19,583 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:19,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:19,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:19,714 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:19,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:19,715 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:19,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:19,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:19,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1906 [2022-12-13 02:04:19,716 INFO L420 AbstractCegarLoop]: === Iteration 1908 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:19,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -472278171, now seen corresponding path program 1 times [2022-12-13 02:04:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:19,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731554605] [2022-12-13 02:04:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:19,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731554605] [2022-12-13 02:04:19,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731554605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:19,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:19,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732336321] [2022-12-13 02:04:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:19,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:19,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:19,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:19,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:19,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:19,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:19,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:19,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:19,831 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:19,831 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:19,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:19,832 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:19,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:19,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:19,833 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:19,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:19,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:19,833 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:19,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:19,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:19,834 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,834 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:19,834 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:19,834 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:19,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,836 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:19,837 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:19,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:19,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:19,837 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:19,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:19,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:19,970 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:19,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:19,970 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:19,970 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:19,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1907 [2022-12-13 02:04:19,971 INFO L420 AbstractCegarLoop]: === Iteration 1909 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash -415019869, now seen corresponding path program 1 times [2022-12-13 02:04:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:19,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197049137] [2022-12-13 02:04:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:20,043 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 02:04:20,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:20,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197049137] [2022-12-13 02:04:20,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197049137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:20,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:20,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520606274] [2022-12-13 02:04:20,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:20,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:20,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:20,044 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:20,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:20,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:20,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:20,097 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:20,097 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:20,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:20,098 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:20,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:20,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:20,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:20,098 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:20,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:20,099 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:20,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:20,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:20,099 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:20,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:20,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,102 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:20,102 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:20,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:20,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:20,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:20,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:20,238 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:20,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:20,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:20,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1908 [2022-12-13 02:04:20,238 INFO L420 AbstractCegarLoop]: === Iteration 1910 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:20,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:20,238 INFO L85 PathProgramCache]: Analyzing trace with hash -357761567, now seen corresponding path program 1 times [2022-12-13 02:04:20,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:20,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244274151] [2022-12-13 02:04:20,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:20,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:20,306 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 02:04:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244274151] [2022-12-13 02:04:20,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244274151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:20,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:20,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963465768] [2022-12-13 02:04:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:20,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:20,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:20,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:20,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:20,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:20,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:20,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:20,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:20,361 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:20,361 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:20,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:20,361 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:20,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:20,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:20,362 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:20,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:20,363 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:20,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:20,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:20,363 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:20,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:20,363 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,366 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:20,366 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:20,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:20,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:20,501 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:20,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:20,502 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:20,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:20,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:20,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1909 [2022-12-13 02:04:20,502 INFO L420 AbstractCegarLoop]: === Iteration 1911 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash -300503265, now seen corresponding path program 1 times [2022-12-13 02:04:20,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:20,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244308827] [2022-12-13 02:04:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:20,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:20,563 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 02:04:20,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:20,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244308827] [2022-12-13 02:04:20,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244308827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:20,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:20,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843932586] [2022-12-13 02:04:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:20,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:20,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:20,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:20,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:20,564 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:20,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:20,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:20,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:20,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:20,617 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:20,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:20,618 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:20,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:20,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:20,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:20,618 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:20,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:20,619 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:20,619 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:20,619 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:20,619 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:20,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:20,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,622 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:20,623 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:20,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:20,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:20,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:20,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:20,758 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:20,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:20,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:20,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1910 [2022-12-13 02:04:20,759 INFO L420 AbstractCegarLoop]: === Iteration 1912 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:20,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:20,759 INFO L85 PathProgramCache]: Analyzing trace with hash -243244963, now seen corresponding path program 1 times [2022-12-13 02:04:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:20,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926280596] [2022-12-13 02:04:20,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:20,852 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 02:04:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:20,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926280596] [2022-12-13 02:04:20,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926280596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:20,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:20,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:20,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23214698] [2022-12-13 02:04:20,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:20,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:20,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:20,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:20,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:20,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:20,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:20,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:20,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:20,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:20,907 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:20,907 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:20,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:20,908 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:20,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:20,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:20,909 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:20,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:20,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:20,910 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:20,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:20,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:20,910 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:20,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:20,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:20,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,913 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:20,913 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:20,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:20,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:20,913 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:21,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:21,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:21,046 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:21,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:21,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1911 [2022-12-13 02:04:21,046 INFO L420 AbstractCegarLoop]: === Iteration 1913 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:21,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash -185986661, now seen corresponding path program 1 times [2022-12-13 02:04:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:21,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136978398] [2022-12-13 02:04:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:21,112 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 02:04:21,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:21,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136978398] [2022-12-13 02:04:21,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136978398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:21,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:21,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671320969] [2022-12-13 02:04:21,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:21,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:21,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:21,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:21,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:21,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:21,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:21,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:21,170 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:21,170 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:21,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:21,170 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:21,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:21,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:21,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:21,171 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:21,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:21,172 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:21,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:21,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:21,173 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:21,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:21,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,177 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:21,177 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:21,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:21,177 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,177 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:21,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:21,310 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:21,310 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:21,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,310 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:21,310 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:21,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1912 [2022-12-13 02:04:21,310 INFO L420 AbstractCegarLoop]: === Iteration 1914 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:21,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash -128728359, now seen corresponding path program 1 times [2022-12-13 02:04:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:21,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636546479] [2022-12-13 02:04:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:21,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:21,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636546479] [2022-12-13 02:04:21,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636546479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:21,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:21,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511704019] [2022-12-13 02:04:21,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:21,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:21,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:21,384 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:21,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:21,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:21,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:21,439 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:21,439 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:21,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:21,440 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:21,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:21,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:21,441 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:21,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:21,442 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:21,442 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:21,442 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:21,442 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:21,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:21,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,446 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:21,446 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:21,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:21,447 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,447 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:21,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:21,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:21,582 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:21,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:21,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:21,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1913 [2022-12-13 02:04:21,583 INFO L420 AbstractCegarLoop]: === Iteration 1915 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:21,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:21,583 INFO L85 PathProgramCache]: Analyzing trace with hash -71470057, now seen corresponding path program 1 times [2022-12-13 02:04:21,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:21,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285862605] [2022-12-13 02:04:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:21,646 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 02:04:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:21,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285862605] [2022-12-13 02:04:21,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285862605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:21,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:21,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962339758] [2022-12-13 02:04:21,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:21,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:21,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:21,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:21,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:21,700 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:21,701 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:21,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:21,701 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:21,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:21,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:21,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:21,702 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:21,703 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:21,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:21,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:21,703 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,703 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:21,703 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:21,703 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:21,706 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:21,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:21,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,706 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:21,825 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:21,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:21,826 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:21,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:21,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:21,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1914 [2022-12-13 02:04:21,826 INFO L420 AbstractCegarLoop]: === Iteration 1916 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:21,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash -14211755, now seen corresponding path program 1 times [2022-12-13 02:04:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:21,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615228949] [2022-12-13 02:04:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:21,883 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 02:04:21,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:21,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615228949] [2022-12-13 02:04:21,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615228949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:21,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:21,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:21,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053740615] [2022-12-13 02:04:21,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:21,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:21,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:21,884 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:21,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:21,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:21,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:21,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:21,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:21,935 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:21,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:21,935 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:21,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:21,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:21,936 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:21,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:21,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:21,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:21,937 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:21,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:21,937 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,937 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:21,937 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:21,937 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:21,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,940 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:21,940 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:21,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:21,940 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:21,940 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:22,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:22,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:22,058 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:22,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:22,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:22,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1915 [2022-12-13 02:04:22,058 INFO L420 AbstractCegarLoop]: === Iteration 1917 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:22,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash 43046547, now seen corresponding path program 1 times [2022-12-13 02:04:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:22,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015593216] [2022-12-13 02:04:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:22,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:22,124 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 02:04:22,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:22,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015593216] [2022-12-13 02:04:22,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015593216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:22,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:22,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:22,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412944239] [2022-12-13 02:04:22,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:22,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:22,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:22,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:22,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:22,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:22,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:22,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:22,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:22,183 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:22,183 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:22,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:22,184 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:22,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:22,184 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:22,184 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:22,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:22,185 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,185 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:22,185 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:22,185 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:22,185 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:22,186 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:22,186 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,188 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:22,188 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:22,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:22,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:22,306 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:22,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:22,307 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:22,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:22,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:22,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1916 [2022-12-13 02:04:22,307 INFO L420 AbstractCegarLoop]: === Iteration 1918 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 100304849, now seen corresponding path program 1 times [2022-12-13 02:04:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:22,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607588064] [2022-12-13 02:04:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:22,363 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 02:04:22,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:22,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607588064] [2022-12-13 02:04:22,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607588064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:22,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:22,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432623114] [2022-12-13 02:04:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:22,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:22,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:22,364 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:22,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:22,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:22,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:22,418 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:22,418 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:22,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:22,419 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:22,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:22,419 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:22,420 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:22,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:22,420 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:22,421 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:22,421 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:22,421 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,421 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:22,421 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:22,421 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,423 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:22,424 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:22,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:22,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:22,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:22,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:22,540 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:22,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:22,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:22,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1917 [2022-12-13 02:04:22,541 INFO L420 AbstractCegarLoop]: === Iteration 1919 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 157563151, now seen corresponding path program 1 times [2022-12-13 02:04:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:22,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915711501] [2022-12-13 02:04:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:22,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 02:04:22,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:22,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915711501] [2022-12-13 02:04:22,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915711501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:22,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:22,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331064994] [2022-12-13 02:04:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:22,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:22,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:22,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:22,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:22,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:22,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:22,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:22,638 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:22,638 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:22,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:22,639 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:22,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:22,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:22,640 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:22,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:22,640 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,640 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:22,640 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:22,641 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:22,641 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,641 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:22,641 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:22,641 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,643 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:22,643 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:22,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:22,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:22,759 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:22,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:22,760 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:22,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:22,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:22,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1918 [2022-12-13 02:04:22,760 INFO L420 AbstractCegarLoop]: === Iteration 1920 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:22,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:22,760 INFO L85 PathProgramCache]: Analyzing trace with hash 214821453, now seen corresponding path program 1 times [2022-12-13 02:04:22,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:22,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26298519] [2022-12-13 02:04:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:22,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:22,814 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 02:04:22,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:22,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26298519] [2022-12-13 02:04:22,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26298519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:22,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:22,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:22,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151431567] [2022-12-13 02:04:22,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:22,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:22,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:22,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:22,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:22,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:22,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:22,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:22,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:22,867 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:22,868 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:22,868 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:22,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:22,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:22,869 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:22,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:22,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:22,870 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:22,870 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:22,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:22,870 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:22,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:22,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:22,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,873 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:22,873 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:22,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:22,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:22,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:23,010 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:23,011 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:23,011 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:23,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,011 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:23,011 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:23,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1919 [2022-12-13 02:04:23,012 INFO L420 AbstractCegarLoop]: === Iteration 1921 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 272079755, now seen corresponding path program 1 times [2022-12-13 02:04:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:23,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320638390] [2022-12-13 02:04:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:23,067 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 02:04:23,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:23,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320638390] [2022-12-13 02:04:23,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320638390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:23,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:23,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266048291] [2022-12-13 02:04:23,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:23,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:23,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:23,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:23,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:23,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:23,068 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:23,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:23,114 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:23,114 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:23,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:23,114 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:23,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:23,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:23,115 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:23,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:23,116 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:23,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:23,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:23,116 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:23,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:23,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,119 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:23,119 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:23,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:23,119 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,119 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:23,240 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:23,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:23,241 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:23,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,242 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:23,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:23,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1920 [2022-12-13 02:04:23,242 INFO L420 AbstractCegarLoop]: === Iteration 1922 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:23,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 329338057, now seen corresponding path program 1 times [2022-12-13 02:04:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:23,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341411384] [2022-12-13 02:04:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:23,298 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 02:04:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:23,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341411384] [2022-12-13 02:04:23,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341411384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:23,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:23,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:23,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926529677] [2022-12-13 02:04:23,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:23,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:23,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:23,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:23,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:23,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:23,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:23,342 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:23,342 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:23,343 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:23,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:23,343 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:23,343 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:23,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:23,344 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,344 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:23,344 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:23,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:23,344 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:23,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:23,345 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,347 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:23,347 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:23,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:23,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:23,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:23,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:23,463 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:23,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:23,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:23,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1921 [2022-12-13 02:04:23,464 INFO L420 AbstractCegarLoop]: === Iteration 1923 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 386596359, now seen corresponding path program 1 times [2022-12-13 02:04:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798387173] [2022-12-13 02:04:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:23,516 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 02:04:23,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:23,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798387173] [2022-12-13 02:04:23,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798387173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:23,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:23,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598257165] [2022-12-13 02:04:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:23,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:23,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:23,517 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:23,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:23,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:23,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:23,560 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:23,560 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:23,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:23,561 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:23,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:23,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:23,561 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:23,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:23,562 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:23,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:23,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:23,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:23,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:23,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,565 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:23,565 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:23,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:23,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:23,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:23,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:23,682 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:23,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:23,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:23,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1922 [2022-12-13 02:04:23,682 INFO L420 AbstractCegarLoop]: === Iteration 1924 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash 443854661, now seen corresponding path program 1 times [2022-12-13 02:04:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:23,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662892250] [2022-12-13 02:04:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:23,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 02:04:23,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:23,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662892250] [2022-12-13 02:04:23,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662892250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:23,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:23,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:23,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537975569] [2022-12-13 02:04:23,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:23,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:23,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:23,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:23,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:23,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:23,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:23,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:23,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:23,800 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:23,800 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:23,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:23,800 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:23,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:23,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:23,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:23,801 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:23,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:23,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:23,802 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:23,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:23,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:23,802 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,803 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:23,803 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:23,803 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:23,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,807 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:23,807 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:23,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:23,807 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:23,807 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:23,940 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:23,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:23,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:23,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:23,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:23,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1923 [2022-12-13 02:04:23,942 INFO L420 AbstractCegarLoop]: === Iteration 1925 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:23,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:23,942 INFO L85 PathProgramCache]: Analyzing trace with hash 501112963, now seen corresponding path program 1 times [2022-12-13 02:04:23,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:23,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261029280] [2022-12-13 02:04:23,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:24,016 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 02:04:24,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:24,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261029280] [2022-12-13 02:04:24,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261029280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:24,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:24,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:24,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211724568] [2022-12-13 02:04:24,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:24,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:24,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:24,017 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:24,017 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,017 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:24,017 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:24,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:24,068 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:24,068 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:24,068 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:24,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:24,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:24,069 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:24,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:24,070 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:24,071 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:24,071 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:24,071 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,071 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:24,071 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:24,071 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,075 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:24,075 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:24,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:24,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:24,206 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:24,207 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:24,207 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:24,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,207 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:24,207 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:24,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1924 [2022-12-13 02:04:24,207 INFO L420 AbstractCegarLoop]: === Iteration 1926 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:24,207 INFO L85 PathProgramCache]: Analyzing trace with hash 558371265, now seen corresponding path program 1 times [2022-12-13 02:04:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:24,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977710636] [2022-12-13 02:04:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:24,287 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 02:04:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:24,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977710636] [2022-12-13 02:04:24,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977710636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:24,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:24,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547255954] [2022-12-13 02:04:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:24,287 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:24,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:24,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:24,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:24,341 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:24,341 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:24,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:24,342 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:24,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:24,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:24,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:24,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:24,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:24,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:24,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:24,344 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:24,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:24,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:24,346 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:24,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:24,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:24,479 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:24,480 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:24,480 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:24,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,480 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:24,480 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:24,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1925 [2022-12-13 02:04:24,480 INFO L420 AbstractCegarLoop]: === Iteration 1927 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:24,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:24,481 INFO L85 PathProgramCache]: Analyzing trace with hash 615629567, now seen corresponding path program 1 times [2022-12-13 02:04:24,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:24,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712050006] [2022-12-13 02:04:24,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:24,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:24,540 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 02:04:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:24,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712050006] [2022-12-13 02:04:24,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712050006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:24,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:24,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620816358] [2022-12-13 02:04:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:24,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:24,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:24,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:24,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:24,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:24,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:24,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:24,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:24,602 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:24,603 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:24,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:24,603 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:24,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:24,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:24,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:24,604 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:24,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:24,605 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:24,605 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:24,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:24,605 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:24,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:24,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,608 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:24,608 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:24,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:24,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:24,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:24,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:24,744 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:24,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:24,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1926 [2022-12-13 02:04:24,744 INFO L420 AbstractCegarLoop]: === Iteration 1928 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:24,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 672887869, now seen corresponding path program 1 times [2022-12-13 02:04:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124025086] [2022-12-13 02:04:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:24,815 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 02:04:24,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:24,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124025086] [2022-12-13 02:04:24,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124025086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:24,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:24,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508824687] [2022-12-13 02:04:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:24,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:24,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:24,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:24,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:24,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:24,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:24,876 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:24,876 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:24,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:24,877 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:24,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:24,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:24,877 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:24,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:24,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:24,878 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:24,878 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:24,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:24,879 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,879 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:24,879 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:24,879 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:24,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,881 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:24,881 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:24,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:24,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:24,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:25,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:25,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:25,017 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:25,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:25,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:25,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1927 [2022-12-13 02:04:25,017 INFO L420 AbstractCegarLoop]: === Iteration 1929 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:25,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:25,017 INFO L85 PathProgramCache]: Analyzing trace with hash 730146171, now seen corresponding path program 1 times [2022-12-13 02:04:25,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:25,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291270505] [2022-12-13 02:04:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:25,090 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 02:04:25,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:25,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291270505] [2022-12-13 02:04:25,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291270505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:25,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:25,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:25,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205507962] [2022-12-13 02:04:25,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:25,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:25,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:25,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:25,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:25,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:25,144 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:25,145 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:25,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:25,145 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:25,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:25,146 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:25,146 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:25,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:25,147 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:25,147 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:25,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:25,147 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:25,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:25,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,150 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:25,150 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:25,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:25,150 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,150 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:25,271 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:25,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:25,272 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:25,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:25,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:25,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1928 [2022-12-13 02:04:25,273 INFO L420 AbstractCegarLoop]: === Iteration 1930 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:25,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:25,273 INFO L85 PathProgramCache]: Analyzing trace with hash 787404473, now seen corresponding path program 1 times [2022-12-13 02:04:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320210943] [2022-12-13 02:04:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:25,329 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 02:04:25,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:25,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320210943] [2022-12-13 02:04:25,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320210943] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:25,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:25,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:25,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285677788] [2022-12-13 02:04:25,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:25,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:25,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:25,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:25,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:25,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:25,374 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:25,374 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:25,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:25,375 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:25,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:25,375 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:25,375 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:25,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:25,376 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,376 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:25,376 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:25,376 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:25,376 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,376 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:25,376 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:25,376 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,379 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:25,379 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:25,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:25,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:25,496 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:25,497 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:25,497 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:25,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,497 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:25,497 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:25,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1929 [2022-12-13 02:04:25,497 INFO L420 AbstractCegarLoop]: === Iteration 1931 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash 844662775, now seen corresponding path program 1 times [2022-12-13 02:04:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:25,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576215541] [2022-12-13 02:04:25,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:25,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:25,567 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 02:04:25,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:25,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576215541] [2022-12-13 02:04:25,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576215541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:25,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:25,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:25,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828696131] [2022-12-13 02:04:25,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:25,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:25,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:25,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:25,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:25,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:25,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:25,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:25,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:25,617 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:25,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:25,618 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:25,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:25,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:25,619 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:25,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:25,620 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:25,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:25,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:25,620 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:25,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:25,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,624 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:25,624 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:25,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:25,625 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,625 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:25,764 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:25,766 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:04:25,767 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:25,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,767 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:25,767 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:25,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1930 [2022-12-13 02:04:25,767 INFO L420 AbstractCegarLoop]: === Iteration 1932 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:25,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 901921077, now seen corresponding path program 1 times [2022-12-13 02:04:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:25,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932613975] [2022-12-13 02:04:25,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:25,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:25,834 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 02:04:25,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:25,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932613975] [2022-12-13 02:04:25,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932613975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:25,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:25,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588128582] [2022-12-13 02:04:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:25,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:25,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:25,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:25,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:25,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:25,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:25,896 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:25,896 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:25,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:25,897 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:25,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:25,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:25,898 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:25,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:25,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:25,899 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,899 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:25,900 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:25,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:25,900 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:25,900 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:25,900 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:25,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,904 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:25,904 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:25,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:25,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:25,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:26,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:26,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:26,039 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:26,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:26,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:26,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1931 [2022-12-13 02:04:26,039 INFO L420 AbstractCegarLoop]: === Iteration 1933 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:26,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 959179379, now seen corresponding path program 1 times [2022-12-13 02:04:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:26,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331141338] [2022-12-13 02:04:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:26,099 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 02:04:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331141338] [2022-12-13 02:04:26,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331141338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:26,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:26,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949260072] [2022-12-13 02:04:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:26,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:26,100 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:26,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:26,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:26,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:26,148 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:26,148 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:26,149 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:26,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:26,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:26,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:26,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:26,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:26,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:26,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:26,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,151 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:26,151 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:26,151 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,153 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:26,154 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:26,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:26,154 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,154 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:26,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:26,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:26,274 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:26,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:26,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:26,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1932 [2022-12-13 02:04:26,275 INFO L420 AbstractCegarLoop]: === Iteration 1934 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1016437681, now seen corresponding path program 1 times [2022-12-13 02:04:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134810162] [2022-12-13 02:04:26,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:26,333 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 02:04:26,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:26,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134810162] [2022-12-13 02:04:26,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134810162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:26,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:26,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073778451] [2022-12-13 02:04:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:26,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:26,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:26,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:26,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:26,378 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:26,378 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:26,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:26,379 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:26,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:26,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:26,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:26,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:26,380 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:26,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:26,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:26,381 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:26,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:26,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,383 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:26,383 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:26,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:26,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:26,503 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:26,504 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:26,504 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:26,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,504 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:26,504 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:26,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1933 [2022-12-13 02:04:26,504 INFO L420 AbstractCegarLoop]: === Iteration 1935 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:26,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1073695983, now seen corresponding path program 1 times [2022-12-13 02:04:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:26,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898870490] [2022-12-13 02:04:26,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:26,559 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 02:04:26,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:26,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898870490] [2022-12-13 02:04:26,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898870490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:26,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413273919] [2022-12-13 02:04:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:26,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:26,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:26,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:26,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:26,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:26,604 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:26,604 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:26,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:26,604 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:26,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:26,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:26,605 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:26,605 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:26,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:26,606 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,606 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:26,606 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:26,606 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:26,606 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,606 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:26,606 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:26,606 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,609 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:26,609 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:26,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:26,609 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,609 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:26,727 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:26,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:26,728 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:26,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:26,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:26,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1934 [2022-12-13 02:04:26,729 INFO L420 AbstractCegarLoop]: === Iteration 1936 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1130954285, now seen corresponding path program 1 times [2022-12-13 02:04:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:26,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494271235] [2022-12-13 02:04:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:26,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:26,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494271235] [2022-12-13 02:04:26,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494271235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:26,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:26,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:26,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49999449] [2022-12-13 02:04:26,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:26,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:26,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:26,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:26,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:26,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:26,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:26,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:26,829 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:26,829 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:26,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:26,830 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:26,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:26,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:26,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:26,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:26,830 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:26,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:26,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:26,831 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:26,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:26,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:26,831 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:26,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:26,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:26,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,834 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:26,834 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:26,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:26,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:26,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:26,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:26,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:26,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:26,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:26,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:26,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:26,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1935 [2022-12-13 02:04:26,953 INFO L420 AbstractCegarLoop]: === Iteration 1937 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:26,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:26,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1188212587, now seen corresponding path program 1 times [2022-12-13 02:04:26,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:26,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533049772] [2022-12-13 02:04:26,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:27,008 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 02:04:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:27,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533049772] [2022-12-13 02:04:27,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533049772] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:27,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:27,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947354994] [2022-12-13 02:04:27,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:27,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:27,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:27,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:27,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:27,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:27,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:27,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:27,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:27,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:27,053 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:27,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:27,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:27,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:27,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:27,054 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:27,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:27,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:27,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:27,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:27,055 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:27,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:27,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,058 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:27,058 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:27,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:27,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:27,192 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:27,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:27,193 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:27,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:27,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:27,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1936 [2022-12-13 02:04:27,193 INFO L420 AbstractCegarLoop]: === Iteration 1938 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1245470889, now seen corresponding path program 1 times [2022-12-13 02:04:27,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:27,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195599914] [2022-12-13 02:04:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:27,250 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 02:04:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:27,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195599914] [2022-12-13 02:04:27,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195599914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:27,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:27,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481768373] [2022-12-13 02:04:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:27,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:27,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:27,251 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:27,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:27,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:27,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:27,295 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:27,295 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:27,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:27,295 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:27,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:27,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:27,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:27,296 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:27,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:27,296 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:27,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:27,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:27,297 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:27,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:27,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,300 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:27,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:27,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:27,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:27,421 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:27,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:27,422 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:27,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:27,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:27,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1937 [2022-12-13 02:04:27,422 INFO L420 AbstractCegarLoop]: === Iteration 1939 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:27,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1302729191, now seen corresponding path program 1 times [2022-12-13 02:04:27,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:27,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670666997] [2022-12-13 02:04:27,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:27,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:27,482 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 02:04:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:27,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670666997] [2022-12-13 02:04:27,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670666997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:27,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:27,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825341093] [2022-12-13 02:04:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:27,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:27,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:27,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:27,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:27,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:27,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:27,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:27,545 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:27,545 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:27,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:27,546 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:27,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:27,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:27,547 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:27,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:27,548 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,548 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:27,548 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:27,548 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:27,548 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,548 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:27,548 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:27,548 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,551 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:27,551 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:27,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:27,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:27,684 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:27,685 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:27,685 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:27,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:27,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1938 [2022-12-13 02:04:27,685 INFO L420 AbstractCegarLoop]: === Iteration 1940 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:27,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1359987493, now seen corresponding path program 1 times [2022-12-13 02:04:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:27,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008136415] [2022-12-13 02:04:27,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:27,755 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 02:04:27,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:27,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008136415] [2022-12-13 02:04:27,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008136415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:27,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:27,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:27,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508575903] [2022-12-13 02:04:27,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:27,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:27,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:27,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:27,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:27,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:27,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:27,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:27,818 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:27,818 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:27,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:27,819 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:27,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:27,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:27,820 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:27,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:27,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:27,821 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:27,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:27,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:27,821 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:27,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:27,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:27,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,824 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:27,824 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:27,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:27,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:27,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:27,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:27,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:04:27,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:27,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:27,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:27,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:27,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1939 [2022-12-13 02:04:27,952 INFO L420 AbstractCegarLoop]: === Iteration 1941 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1417245795, now seen corresponding path program 1 times [2022-12-13 02:04:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:27,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462009942] [2022-12-13 02:04:27,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:27,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:28,012 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 02:04:28,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462009942] [2022-12-13 02:04:28,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462009942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:28,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:28,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:28,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826925889] [2022-12-13 02:04:28,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:28,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:28,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:28,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:28,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:28,013 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:28,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:28,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:28,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:28,057 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:28,058 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:28,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:28,058 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:28,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:28,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:28,059 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:28,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:28,059 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:28,060 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:28,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:28,060 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:28,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:28,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,062 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:28,063 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:28,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:28,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:28,188 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:28,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:04:28,189 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:28,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:28,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:28,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1940 [2022-12-13 02:04:28,189 INFO L420 AbstractCegarLoop]: === Iteration 1942 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:28,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1474504097, now seen corresponding path program 1 times [2022-12-13 02:04:28,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:28,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279870496] [2022-12-13 02:04:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:28,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:28,243 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 02:04:28,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:28,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279870496] [2022-12-13 02:04:28,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279870496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:28,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:28,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:28,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671327136] [2022-12-13 02:04:28,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:28,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:28,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:28,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:28,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:28,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:28,295 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:28,295 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:28,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:28,295 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:28,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:28,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:28,296 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:28,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:28,297 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:28,297 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:28,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:28,297 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:28,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:28,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,300 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:28,300 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:28,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:28,300 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:28,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:28,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:28,421 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:28,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:28,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:28,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1941 [2022-12-13 02:04:28,421 INFO L420 AbstractCegarLoop]: === Iteration 1943 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:28,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:28,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1531762399, now seen corresponding path program 1 times [2022-12-13 02:04:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:28,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626274968] [2022-12-13 02:04:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:28,474 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 02:04:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626274968] [2022-12-13 02:04:28,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626274968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:28,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:28,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209409083] [2022-12-13 02:04:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:28,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:28,475 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:28,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:28,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:28,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:28,518 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:28,518 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:28,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:28,519 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:28,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:28,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:28,519 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:28,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:28,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:28,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:28,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:28,520 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:28,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:28,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,523 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:28,523 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:28,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:28,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:28,643 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:28,644 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:28,644 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:28,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,644 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:28,644 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:28,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1942 [2022-12-13 02:04:28,644 INFO L420 AbstractCegarLoop]: === Iteration 1944 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1589020701, now seen corresponding path program 1 times [2022-12-13 02:04:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:28,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746445565] [2022-12-13 02:04:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:28,732 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 02:04:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:28,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746445565] [2022-12-13 02:04:28,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746445565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:28,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:28,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313470284] [2022-12-13 02:04:28,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:28,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:28,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:28,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:28,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:28,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:28,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:28,795 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:28,795 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:28,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:28,796 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:28,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:28,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:28,796 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:28,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:28,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:28,797 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,797 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:28,797 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:28,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:28,797 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:28,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:28,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:28,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,800 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:28,800 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:28,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:28,801 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:28,801 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:28,932 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:28,933 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:28,933 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:28,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:28,933 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:28,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:28,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1943 [2022-12-13 02:04:28,933 INFO L420 AbstractCegarLoop]: === Iteration 1945 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1646279003, now seen corresponding path program 1 times [2022-12-13 02:04:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065064039] [2022-12-13 02:04:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:28,999 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 02:04:29,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:29,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065064039] [2022-12-13 02:04:29,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065064039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:29,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:29,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886833432] [2022-12-13 02:04:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:29,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:29,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:29,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:29,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:29,000 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:29,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:29,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:29,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:29,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:29,053 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:29,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:29,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:29,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:29,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:29,054 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:29,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:29,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:29,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:29,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:29,056 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:29,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:29,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,058 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:29,059 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:29,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:29,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:29,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:29,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:04:29,190 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:29,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,190 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:29,190 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:29,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1944 [2022-12-13 02:04:29,191 INFO L420 AbstractCegarLoop]: === Iteration 1946 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:29,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1703537305, now seen corresponding path program 1 times [2022-12-13 02:04:29,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:29,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565160338] [2022-12-13 02:04:29,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:29,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:29,261 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 02:04:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:29,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565160338] [2022-12-13 02:04:29,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565160338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:29,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:29,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717121696] [2022-12-13 02:04:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:29,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:29,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:29,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:29,262 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:29,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:29,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:29,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:29,313 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:29,314 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:29,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:29,314 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:29,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:29,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:29,315 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:29,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:29,316 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:29,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:29,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:29,316 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:29,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:29,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,319 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:29,319 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:29,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:29,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:29,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:29,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:29,453 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:29,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:29,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:29,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1945 [2022-12-13 02:04:29,454 INFO L420 AbstractCegarLoop]: === Iteration 1947 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1760795607, now seen corresponding path program 1 times [2022-12-13 02:04:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:29,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062977238] [2022-12-13 02:04:29,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:29,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:29,526 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 02:04:29,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:29,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062977238] [2022-12-13 02:04:29,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062977238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:29,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:29,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:29,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291830375] [2022-12-13 02:04:29,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:29,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:29,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:29,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:29,528 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:29,528 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:29,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:29,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:29,580 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:29,580 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:29,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:29,581 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:29,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:29,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:29,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:29,582 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:29,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:29,583 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:29,583 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:29,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:29,583 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,583 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:29,583 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:29,583 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,586 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:29,586 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:29,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:29,586 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,586 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:29,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:29,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:29,722 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:29,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:29,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:29,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1946 [2022-12-13 02:04:29,723 INFO L420 AbstractCegarLoop]: === Iteration 1948 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:29,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1818053909, now seen corresponding path program 1 times [2022-12-13 02:04:29,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:29,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972629612] [2022-12-13 02:04:29,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:29,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:29,798 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 02:04:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:29,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972629612] [2022-12-13 02:04:29,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972629612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:29,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:29,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327963501] [2022-12-13 02:04:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:29,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:29,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:29,799 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:29,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:29,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:29,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:29,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:29,853 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:29,854 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:29,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:29,854 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:29,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:29,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:29,855 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:29,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:29,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:29,856 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:29,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:29,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:29,856 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:29,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:29,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:29,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,859 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:29,859 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:29,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:29,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:29,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:30,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:30,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:04:30,001 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:30,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:30,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:30,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1947 [2022-12-13 02:04:30,002 INFO L420 AbstractCegarLoop]: === Iteration 1949 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:30,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1875312211, now seen corresponding path program 1 times [2022-12-13 02:04:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:30,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552568719] [2022-12-13 02:04:30,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:30,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:30,065 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 02:04:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552568719] [2022-12-13 02:04:30,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552568719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:30,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:30,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:30,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997842410] [2022-12-13 02:04:30,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:30,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:30,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:30,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:30,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:30,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:30,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:30,119 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:30,120 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:30,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:30,120 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:30,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:30,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:30,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:30,121 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:30,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:30,122 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:30,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:30,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:30,122 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:30,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:30,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,125 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:30,125 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:30,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:30,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:30,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:30,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:30,262 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:30,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:30,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:30,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1948 [2022-12-13 02:04:30,262 INFO L420 AbstractCegarLoop]: === Iteration 1950 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1932570513, now seen corresponding path program 1 times [2022-12-13 02:04:30,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:30,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755956090] [2022-12-13 02:04:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:30,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:30,326 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 02:04:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:30,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755956090] [2022-12-13 02:04:30,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755956090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:30,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:30,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:30,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995046261] [2022-12-13 02:04:30,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:30,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:30,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:30,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:30,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:30,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:30,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:30,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:30,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:30,401 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:30,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:30,401 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:30,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:30,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:30,402 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:30,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:30,403 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:30,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:30,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:30,403 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:30,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:30,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,406 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:30,406 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:30,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:30,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:30,540 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:30,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:30,541 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:30,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:30,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:30,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1949 [2022-12-13 02:04:30,541 INFO L420 AbstractCegarLoop]: === Iteration 1951 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1989828815, now seen corresponding path program 1 times [2022-12-13 02:04:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:30,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788228818] [2022-12-13 02:04:30,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:30,612 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 02:04:30,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:30,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788228818] [2022-12-13 02:04:30,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788228818] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:30,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:30,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483192225] [2022-12-13 02:04:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:30,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:30,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:30,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:30,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:30,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:30,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:30,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:30,667 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:30,667 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:30,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:30,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:30,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:30,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:30,668 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:30,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:30,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:30,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:30,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:30,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:30,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:30,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,674 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:30,674 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:30,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:30,674 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:30,814 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:30,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:04:30,815 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:30,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:30,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1950 [2022-12-13 02:04:30,815 INFO L420 AbstractCegarLoop]: === Iteration 1952 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:30,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2047087117, now seen corresponding path program 1 times [2022-12-13 02:04:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:30,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963657262] [2022-12-13 02:04:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:30,889 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 02:04:30,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:30,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963657262] [2022-12-13 02:04:30,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963657262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:30,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:30,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:30,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146875815] [2022-12-13 02:04:30,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:30,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:30,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:30,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:30,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:30,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:30,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:30,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:30,944 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:30,944 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:30,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:30,945 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:30,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:30,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:30,946 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:30,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:30,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:30,947 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:30,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:30,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:30,947 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:30,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:30,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:30,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,951 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:30,951 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:30,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:30,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:30,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:31,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:31,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:31,087 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:31,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:31,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:31,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1951 [2022-12-13 02:04:31,087 INFO L420 AbstractCegarLoop]: === Iteration 1953 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2104345419, now seen corresponding path program 1 times [2022-12-13 02:04:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:31,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795149603] [2022-12-13 02:04:31,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:31,158 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 02:04:31,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795149603] [2022-12-13 02:04:31,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795149603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:31,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:31,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:31,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152436426] [2022-12-13 02:04:31,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:31,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:31,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:31,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:31,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:31,159 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:31,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:31,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:31,215 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:31,215 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:31,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:31,216 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:31,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:31,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:31,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:31,216 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:31,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:31,217 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,217 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:31,217 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:31,217 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:31,217 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,218 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:31,218 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:31,218 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,220 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:31,220 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:31,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:31,221 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,221 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:31,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:31,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:31,338 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:31,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:31,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:31,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1952 [2022-12-13 02:04:31,338 INFO L420 AbstractCegarLoop]: === Iteration 1954 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash -2133363575, now seen corresponding path program 1 times [2022-12-13 02:04:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:31,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477683146] [2022-12-13 02:04:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:31,404 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 02:04:31,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:31,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477683146] [2022-12-13 02:04:31,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477683146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:31,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:31,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682382994] [2022-12-13 02:04:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:31,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:31,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:31,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:31,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:31,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:31,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:31,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:31,448 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:31,448 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:31,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:31,449 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:31,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:31,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:31,450 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:31,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:31,450 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,450 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:31,450 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:31,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:31,451 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,451 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:31,451 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:31,451 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,454 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:31,454 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:31,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:31,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:31,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:31,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:31,574 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:31,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:31,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:31,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1953 [2022-12-13 02:04:31,574 INFO L420 AbstractCegarLoop]: === Iteration 1955 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:31,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:31,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2076105273, now seen corresponding path program 1 times [2022-12-13 02:04:31,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:31,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094625488] [2022-12-13 02:04:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:31,629 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 02:04:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:31,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094625488] [2022-12-13 02:04:31,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094625488] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:31,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:31,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:31,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878457551] [2022-12-13 02:04:31,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:31,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:31,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:31,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:31,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:31,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:31,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:31,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:31,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:31,681 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:31,682 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:31,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:31,682 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:31,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:31,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:31,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:31,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:31,683 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,683 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:31,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:31,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:31,684 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,684 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:31,684 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:31,684 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,687 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:31,687 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:31,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:31,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:31,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:31,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:31,804 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:31,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:31,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:31,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1954 [2022-12-13 02:04:31,804 INFO L420 AbstractCegarLoop]: === Iteration 1956 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:31,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2018846971, now seen corresponding path program 1 times [2022-12-13 02:04:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:31,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572187485] [2022-12-13 02:04:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:31,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:31,861 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 02:04:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:31,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572187485] [2022-12-13 02:04:31,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572187485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:31,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:31,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:31,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187008130] [2022-12-13 02:04:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:31,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:31,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:31,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:31,862 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:31,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:31,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:31,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:31,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:31,906 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:31,906 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:31,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:31,906 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:31,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:31,907 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:31,907 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:31,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:31,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:31,908 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:31,908 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:31,908 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:31,908 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,908 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:31,908 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:31,908 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:31,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,911 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:31,911 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:31,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:31,911 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:31,911 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:32,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:32,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:04:32,039 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:32,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:32,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1955 [2022-12-13 02:04:32,039 INFO L420 AbstractCegarLoop]: === Iteration 1957 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1961588669, now seen corresponding path program 1 times [2022-12-13 02:04:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:32,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794660326] [2022-12-13 02:04:32,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:32,095 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 02:04:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:32,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794660326] [2022-12-13 02:04:32,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794660326] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:32,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:32,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:32,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447963144] [2022-12-13 02:04:32,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:32,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:32,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:32,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:32,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:32,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:32,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:32,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:32,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:32,139 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:32,139 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:32,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:32,140 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:32,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:32,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:32,141 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:32,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:32,141 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:32,142 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:32,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:32,142 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:32,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:32,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,144 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:32,145 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:32,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:32,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:32,261 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:32,262 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:32,262 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:32,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:32,262 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:32,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1956 [2022-12-13 02:04:32,262 INFO L420 AbstractCegarLoop]: === Iteration 1958 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:32,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:32,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1904330367, now seen corresponding path program 1 times [2022-12-13 02:04:32,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:32,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819400735] [2022-12-13 02:04:32,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:32,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:32,319 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 02:04:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:32,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819400735] [2022-12-13 02:04:32,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819400735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:32,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:32,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878100143] [2022-12-13 02:04:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:32,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:32,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:32,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:32,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:32,320 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:32,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:32,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:32,370 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:32,371 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:32,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:32,371 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:32,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:32,372 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:32,372 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:32,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:32,372 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,372 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:32,373 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:32,373 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:32,373 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,373 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:32,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:32,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,375 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:32,376 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:32,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:32,376 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:32,493 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:32,494 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:32,494 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:32,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,494 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:32,494 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:32,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1957 [2022-12-13 02:04:32,494 INFO L420 AbstractCegarLoop]: === Iteration 1959 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:32,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1847072065, now seen corresponding path program 1 times [2022-12-13 02:04:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:32,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363541800] [2022-12-13 02:04:32,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:32,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:32,549 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 02:04:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:32,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363541800] [2022-12-13 02:04:32,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363541800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:32,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:32,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442156652] [2022-12-13 02:04:32,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:32,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:32,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:32,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:32,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:32,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:32,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:32,593 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:32,593 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:32,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:32,594 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:32,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:32,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:32,594 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:32,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:32,595 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:32,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:32,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:32,595 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:32,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:32,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,598 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:32,598 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:32,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:32,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:32,722 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:32,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:04:32,723 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:32,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:32,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:32,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1958 [2022-12-13 02:04:32,723 INFO L420 AbstractCegarLoop]: === Iteration 1960 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1789813763, now seen corresponding path program 1 times [2022-12-13 02:04:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:32,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857225479] [2022-12-13 02:04:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:32,779 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 02:04:32,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:32,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857225479] [2022-12-13 02:04:32,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857225479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:32,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:32,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:32,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648714424] [2022-12-13 02:04:32,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:32,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:32,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:32,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:32,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:32,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:32,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:32,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:32,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:32,831 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:32,831 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:32,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:32,831 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:32,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:32,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:32,832 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:32,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:32,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:32,833 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,833 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:32,833 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:32,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:32,833 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,833 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:32,833 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:32,833 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:32,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,836 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:32,836 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:32,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:32,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:32,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:32,953 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:32,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:32,954 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:32,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:32,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:32,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:32,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1959 [2022-12-13 02:04:32,955 INFO L420 AbstractCegarLoop]: === Iteration 1961 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1732555461, now seen corresponding path program 1 times [2022-12-13 02:04:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:32,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145106126] [2022-12-13 02:04:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:33,008 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 02:04:33,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:33,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145106126] [2022-12-13 02:04:33,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145106126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:33,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:33,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439370495] [2022-12-13 02:04:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:33,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:33,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:33,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:33,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:33,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:33,052 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:33,052 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:33,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:33,052 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:33,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:33,053 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:33,053 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:33,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:33,054 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:33,054 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:33,054 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:33,054 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,054 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:33,054 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:33,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,057 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:33,057 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:33,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:33,057 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:33,172 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:33,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:33,173 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:33,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:33,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:33,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1960 [2022-12-13 02:04:33,173 INFO L420 AbstractCegarLoop]: === Iteration 1962 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:33,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1675297159, now seen corresponding path program 1 times [2022-12-13 02:04:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:33,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961596525] [2022-12-13 02:04:33,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:33,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:33,228 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 02:04:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:33,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961596525] [2022-12-13 02:04:33,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961596525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:33,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:33,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787009546] [2022-12-13 02:04:33,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:33,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:33,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:33,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:33,229 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:33,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:33,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:33,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:33,279 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:33,279 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:33,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:33,279 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:33,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:33,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:33,280 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:33,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:33,281 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:33,281 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:33,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:33,281 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:33,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:33,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,284 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:33,284 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:33,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:33,284 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,284 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:33,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:33,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:33,405 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:33,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:33,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:33,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1961 [2022-12-13 02:04:33,405 INFO L420 AbstractCegarLoop]: === Iteration 1963 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:33,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:33,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1618038857, now seen corresponding path program 1 times [2022-12-13 02:04:33,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:33,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870020593] [2022-12-13 02:04:33,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:33,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:33,476 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 02:04:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:33,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870020593] [2022-12-13 02:04:33,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870020593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:33,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:33,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471527146] [2022-12-13 02:04:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:33,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:33,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:33,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:33,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:33,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:33,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:33,520 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:33,520 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:33,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:33,521 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:33,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:33,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:33,522 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:33,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:33,522 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,522 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:33,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:33,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:33,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:33,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:33,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,526 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:33,526 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:33,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:33,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:33,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:33,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:33,643 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:33,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:33,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:33,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1962 [2022-12-13 02:04:33,643 INFO L420 AbstractCegarLoop]: === Iteration 1964 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:33,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1560780555, now seen corresponding path program 1 times [2022-12-13 02:04:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:33,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222547532] [2022-12-13 02:04:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:33,697 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 02:04:33,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:33,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222547532] [2022-12-13 02:04:33,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222547532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:33,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:33,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:33,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310903404] [2022-12-13 02:04:33,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:33,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:33,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:33,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:33,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:33,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:33,749 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:33,749 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:33,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:33,749 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:33,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:33,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:33,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:33,750 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:33,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:33,751 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:33,751 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:33,751 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:33,751 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:33,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:33,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,754 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:33,754 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:33,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:33,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:33,871 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:33,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:33,872 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:33,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:33,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:33,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1963 [2022-12-13 02:04:33,872 INFO L420 AbstractCegarLoop]: === Iteration 1965 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:33,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:33,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1503522253, now seen corresponding path program 1 times [2022-12-13 02:04:33,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:33,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800225708] [2022-12-13 02:04:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:33,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:33,930 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 02:04:33,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:33,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800225708] [2022-12-13 02:04:33,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800225708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:33,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:33,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:33,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832345204] [2022-12-13 02:04:33,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:33,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:33,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:33,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:33,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:33,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:33,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:33,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:33,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:33,975 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:33,975 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:33,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:33,975 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:33,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:33,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:33,976 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:33,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:33,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:33,977 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:33,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:33,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:33,977 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:33,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:33,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:33,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,980 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:33,980 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:33,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:33,980 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:33,980 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:34,098 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:34,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:34,098 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:34,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:34,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:34,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1964 [2022-12-13 02:04:34,099 INFO L420 AbstractCegarLoop]: === Iteration 1966 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:34,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1446263951, now seen corresponding path program 1 times [2022-12-13 02:04:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:34,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571362787] [2022-12-13 02:04:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:34,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:34,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:34,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571362787] [2022-12-13 02:04:34,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571362787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:34,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:34,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60640060] [2022-12-13 02:04:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:34,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:34,157 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:34,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:34,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:34,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:34,200 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:34,200 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:34,200 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:34,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:34,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:34,201 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:34,201 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:34,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:34,202 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,202 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:34,202 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:34,202 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:34,202 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,202 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:34,202 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:34,202 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,205 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:34,205 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:34,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:34,205 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,205 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:34,322 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:34,323 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:34,323 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:34,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:34,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:34,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1965 [2022-12-13 02:04:34,323 INFO L420 AbstractCegarLoop]: === Iteration 1967 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1389005649, now seen corresponding path program 1 times [2022-12-13 02:04:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:34,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049545842] [2022-12-13 02:04:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:34,379 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 02:04:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:34,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049545842] [2022-12-13 02:04:34,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049545842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:34,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:34,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:34,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321600069] [2022-12-13 02:04:34,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:34,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:34,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:34,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:34,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:34,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:34,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:34,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:34,428 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:34,428 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:34,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:34,428 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:34,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:34,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:34,429 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:34,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:34,430 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:34,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:34,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:34,430 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:34,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:34,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,433 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:34,433 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:34,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:34,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:34,551 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:34,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:34,552 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:34,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:34,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:34,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1966 [2022-12-13 02:04:34,552 INFO L420 AbstractCegarLoop]: === Iteration 1968 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:34,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1331747347, now seen corresponding path program 1 times [2022-12-13 02:04:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:34,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794023793] [2022-12-13 02:04:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:34,607 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 02:04:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:34,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794023793] [2022-12-13 02:04:34,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794023793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:34,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:34,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227729041] [2022-12-13 02:04:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:34,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:34,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:34,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:34,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:34,659 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:34,659 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:34,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:34,659 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:34,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:34,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:34,660 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:34,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:34,661 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:34,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:34,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:34,661 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:34,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:34,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,664 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:34,664 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:34,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:34,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:34,799 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:34,802 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:34,802 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:34,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,802 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:34,802 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:34,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1967 [2022-12-13 02:04:34,802 INFO L420 AbstractCegarLoop]: === Iteration 1969 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:34,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1274489045, now seen corresponding path program 1 times [2022-12-13 02:04:34,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:34,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111414730] [2022-12-13 02:04:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:34,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:34,865 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 02:04:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:34,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111414730] [2022-12-13 02:04:34,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111414730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:34,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:34,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900198668] [2022-12-13 02:04:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:34,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:34,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:34,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:34,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:34,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:34,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:34,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:34,933 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:34,934 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:34,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:34,934 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:34,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:34,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:34,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:34,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:34,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:34,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:34,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:34,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:34,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:34,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:34,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:34,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:34,939 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:34,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:34,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:34,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:35,074 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:35,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:35,076 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:35,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:35,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:35,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1968 [2022-12-13 02:04:35,076 INFO L420 AbstractCegarLoop]: === Iteration 1970 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1217230743, now seen corresponding path program 1 times [2022-12-13 02:04:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:35,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235764398] [2022-12-13 02:04:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:35,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:35,148 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 02:04:35,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:35,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235764398] [2022-12-13 02:04:35,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235764398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:35,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:35,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:35,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29309901] [2022-12-13 02:04:35,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:35,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:35,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:35,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:35,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:35,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:35,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:35,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:35,201 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:35,202 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:35,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:35,202 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:35,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:35,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:35,203 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:35,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:35,203 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:35,204 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:35,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:35,204 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,204 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:35,204 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:35,204 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,207 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:35,207 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:35,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:35,207 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,207 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:35,323 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:35,324 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:35,324 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:35,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:35,325 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:35,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1969 [2022-12-13 02:04:35,325 INFO L420 AbstractCegarLoop]: === Iteration 1971 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:35,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1159972441, now seen corresponding path program 1 times [2022-12-13 02:04:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:35,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266701983] [2022-12-13 02:04:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:35,381 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 02:04:35,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:35,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266701983] [2022-12-13 02:04:35,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266701983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:35,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:35,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449086095] [2022-12-13 02:04:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:35,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:35,382 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:35,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:35,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:35,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:35,432 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:35,432 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:35,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:35,433 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:35,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:35,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:35,433 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:35,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:35,434 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:35,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:35,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:35,435 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,435 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:35,435 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:35,435 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:35,437 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:35,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:35,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:35,554 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:35,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:35,555 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:35,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,556 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:35,556 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:35,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1970 [2022-12-13 02:04:35,556 INFO L420 AbstractCegarLoop]: === Iteration 1972 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:35,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1102714139, now seen corresponding path program 1 times [2022-12-13 02:04:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:35,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390130216] [2022-12-13 02:04:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:35,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 02:04:35,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:35,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390130216] [2022-12-13 02:04:35,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390130216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:35,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:35,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:35,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618723625] [2022-12-13 02:04:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:35,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:35,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:35,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:35,612 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:35,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:35,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:35,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:35,663 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:35,663 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:35,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:35,664 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:35,664 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:35,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:35,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:35,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:35,664 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:35,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:35,665 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:35,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:35,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:35,665 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:35,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:35,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,668 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:35,668 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:35,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:35,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:35,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:35,786 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:35,786 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:35,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,786 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:35,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:35,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1971 [2022-12-13 02:04:35,787 INFO L420 AbstractCegarLoop]: === Iteration 1973 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:35,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1045455837, now seen corresponding path program 1 times [2022-12-13 02:04:35,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:35,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853191041] [2022-12-13 02:04:35,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:35,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:35,841 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 02:04:35,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:35,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853191041] [2022-12-13 02:04:35,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853191041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:35,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:35,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559946443] [2022-12-13 02:04:35,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:35,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:35,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:35,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:35,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:35,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:35,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:35,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:35,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:35,886 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:35,886 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:35,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:35,886 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:35,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:35,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:35,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:35,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:35,887 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:35,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:35,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:35,888 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:35,888 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:35,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:35,888 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:35,888 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:35,888 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:35,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,891 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:35,891 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:35,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:35,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:35,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:36,013 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:36,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:04:36,014 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:36,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:36,014 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:36,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1972 [2022-12-13 02:04:36,014 INFO L420 AbstractCegarLoop]: === Iteration 1974 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:36,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:36,014 INFO L85 PathProgramCache]: Analyzing trace with hash -988197535, now seen corresponding path program 1 times [2022-12-13 02:04:36,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:36,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311407960] [2022-12-13 02:04:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:36,069 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 02:04:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:36,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311407960] [2022-12-13 02:04:36,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311407960] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:36,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:36,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460366513] [2022-12-13 02:04:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:36,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:36,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:36,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:36,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:36,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:36,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:36,113 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:36,113 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:36,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:36,114 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:36,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:36,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:36,115 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:36,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:36,115 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,115 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:36,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:36,116 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:36,116 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,116 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:36,116 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:36,116 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,119 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:36,119 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:36,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:36,122 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,122 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:36,240 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:36,240 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:04:36,240 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:36,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:36,241 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:36,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1973 [2022-12-13 02:04:36,241 INFO L420 AbstractCegarLoop]: === Iteration 1975 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:36,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash -930939233, now seen corresponding path program 1 times [2022-12-13 02:04:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:36,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016160475] [2022-12-13 02:04:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:36,297 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 02:04:36,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:36,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016160475] [2022-12-13 02:04:36,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016160475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:36,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:36,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328015870] [2022-12-13 02:04:36,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:36,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:36,298 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:36,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:36,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:36,341 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:36,341 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:36,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:36,342 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:36,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:36,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:36,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:36,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:36,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:36,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:36,344 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:36,344 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,344 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:36,344 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:36,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:36,346 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:36,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:36,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:36,471 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:36,472 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:04:36,473 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:36,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:36,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1974 [2022-12-13 02:04:36,484 INFO L420 AbstractCegarLoop]: === Iteration 1976 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:36,484 INFO L85 PathProgramCache]: Analyzing trace with hash -873680931, now seen corresponding path program 1 times [2022-12-13 02:04:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:36,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630232896] [2022-12-13 02:04:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:36,555 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 02:04:36,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:36,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630232896] [2022-12-13 02:04:36,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630232896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:36,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:36,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:36,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90598746] [2022-12-13 02:04:36,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:36,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:36,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:36,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:36,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:36,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:36,601 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:36,601 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:36,601 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:36,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:36,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:36,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:36,602 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:36,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:36,603 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:36,603 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:36,603 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:36,603 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,603 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:36,603 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:36,603 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,606 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:36,606 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:36,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:36,606 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,606 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:36,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:36,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:36,742 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:36,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:36,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:36,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1975 [2022-12-13 02:04:36,742 INFO L420 AbstractCegarLoop]: === Iteration 1977 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:36,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash -816422629, now seen corresponding path program 1 times [2022-12-13 02:04:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:36,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742777170] [2022-12-13 02:04:36,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:36,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:36,801 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 02:04:36,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:36,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742777170] [2022-12-13 02:04:36,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742777170] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:36,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:36,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:36,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603630726] [2022-12-13 02:04:36,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:36,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:36,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:36,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:36,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:36,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:36,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:36,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:36,853 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:36,854 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:36,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:36,854 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:36,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:36,855 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:36,855 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:36,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:36,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:36,856 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:36,856 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:36,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:36,856 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,856 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:36,856 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:36,856 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:36,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,859 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:36,859 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:36,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:36,859 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:36,859 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:36,977 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:36,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:36,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:36,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:36,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:36,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:36,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1976 [2022-12-13 02:04:36,978 INFO L420 AbstractCegarLoop]: === Iteration 1978 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:36,978 INFO L85 PathProgramCache]: Analyzing trace with hash -759164327, now seen corresponding path program 1 times [2022-12-13 02:04:36,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:36,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325906472] [2022-12-13 02:04:36,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,032 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 02:04:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:37,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325906472] [2022-12-13 02:04:37,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325906472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:37,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:37,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138101606] [2022-12-13 02:04:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:37,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:37,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:37,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:37,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:37,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:37,078 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:37,078 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:37,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:37,078 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:37,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:37,079 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:37,079 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:37,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:37,080 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,080 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:37,080 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:37,080 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:37,080 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,080 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:37,080 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:37,080 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,083 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:37,083 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:37,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:37,083 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,083 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:37,204 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:37,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:37,205 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:37,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:37,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:37,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1977 [2022-12-13 02:04:37,206 INFO L420 AbstractCegarLoop]: === Iteration 1979 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -701906025, now seen corresponding path program 1 times [2022-12-13 02:04:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63640123] [2022-12-13 02:04:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,266 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 02:04:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:37,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63640123] [2022-12-13 02:04:37,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63640123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:37,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:37,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005022776] [2022-12-13 02:04:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:37,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:37,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:37,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:37,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:37,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:37,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:37,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:37,310 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:37,310 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:37,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:37,310 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:37,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:37,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:37,311 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:37,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:37,312 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:37,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:37,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:37,312 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:37,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:37,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,315 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:37,315 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:37,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:37,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:37,430 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:37,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:37,431 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:37,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:37,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:37,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1978 [2022-12-13 02:04:37,431 INFO L420 AbstractCegarLoop]: === Iteration 1980 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash -644647723, now seen corresponding path program 1 times [2022-12-13 02:04:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:37,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735333829] [2022-12-13 02:04:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,487 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 02:04:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:37,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735333829] [2022-12-13 02:04:37,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735333829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:37,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:37,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:37,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475217140] [2022-12-13 02:04:37,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:37,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:37,488 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:37,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:37,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:37,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:37,537 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:37,537 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:37,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:37,538 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:37,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:37,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:37,538 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:37,538 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:37,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:37,539 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,539 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:37,539 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:37,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:37,539 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:37,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:37,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,542 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:37,542 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:37,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:37,542 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,542 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:37,666 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:37,667 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:04:37,668 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:37,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:37,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:37,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1979 [2022-12-13 02:04:37,668 INFO L420 AbstractCegarLoop]: === Iteration 1981 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash -587389421, now seen corresponding path program 1 times [2022-12-13 02:04:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:37,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074312805] [2022-12-13 02:04:37,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,724 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 02:04:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:37,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074312805] [2022-12-13 02:04:37,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074312805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:37,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:37,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349266581] [2022-12-13 02:04:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:37,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:37,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:37,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:37,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:37,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:37,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:37,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:37,768 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:37,768 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:37,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:37,769 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:37,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:37,769 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:37,769 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:37,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:37,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:37,770 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:37,770 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:37,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:37,770 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:37,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:37,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:37,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,773 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:37,773 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:37,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:37,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:37,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:37,904 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:37,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:04:37,905 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:37,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:37,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:37,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1980 [2022-12-13 02:04:37,905 INFO L420 AbstractCegarLoop]: === Iteration 1982 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:37,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash -530131119, now seen corresponding path program 1 times [2022-12-13 02:04:37,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:37,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663934747] [2022-12-13 02:04:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:37,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:37,992 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 02:04:37,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:37,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663934747] [2022-12-13 02:04:37,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663934747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:37,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:37,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340623557] [2022-12-13 02:04:37,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:37,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:37,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:37,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:37,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:37,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:37,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:37,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:38,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:38,053 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:38,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:38,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:38,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:38,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:38,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:38,054 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:38,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:38,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:38,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:38,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:38,055 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:38,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:38,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,058 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:38,058 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:38,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:38,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:38,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:38,194 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:38,194 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:38,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:38,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1981 [2022-12-13 02:04:38,195 INFO L420 AbstractCegarLoop]: === Iteration 1983 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:38,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:38,195 INFO L85 PathProgramCache]: Analyzing trace with hash -472872817, now seen corresponding path program 1 times [2022-12-13 02:04:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:38,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370763440] [2022-12-13 02:04:38,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:38,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:38,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 02:04:38,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:38,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370763440] [2022-12-13 02:04:38,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370763440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:38,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:38,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320385880] [2022-12-13 02:04:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:38,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:38,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:38,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:38,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:38,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:38,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:38,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:38,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:38,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:38,331 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:38,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:38,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:38,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:38,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:38,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:38,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:38,333 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,333 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:38,333 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:38,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:38,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:38,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:38,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,336 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:38,336 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:38,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:38,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:38,469 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:38,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:38,470 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:38,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:38,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:38,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1982 [2022-12-13 02:04:38,470 INFO L420 AbstractCegarLoop]: === Iteration 1984 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash -415614515, now seen corresponding path program 1 times [2022-12-13 02:04:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167339563] [2022-12-13 02:04:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:38,533 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 02:04:38,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:38,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167339563] [2022-12-13 02:04:38,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167339563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:38,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:38,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812953357] [2022-12-13 02:04:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:38,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:38,534 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:38,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:38,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:38,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:38,594 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:38,594 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:38,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:38,595 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:38,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:38,596 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:38,596 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:38,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:38,596 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,597 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:38,597 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:38,597 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:38,597 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:38,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:38,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,600 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:38,600 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:38,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:38,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:38,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:38,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:38,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:38,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:38,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:38,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1983 [2022-12-13 02:04:38,735 INFO L420 AbstractCegarLoop]: === Iteration 1985 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash -358356213, now seen corresponding path program 1 times [2022-12-13 02:04:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:38,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230486274] [2022-12-13 02:04:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:38,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:38,794 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 02:04:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:38,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230486274] [2022-12-13 02:04:38,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230486274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:38,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:38,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097068527] [2022-12-13 02:04:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:38,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:38,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:38,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:38,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:38,795 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:38,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:38,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:38,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:38,851 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:38,851 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:38,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:38,852 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:38,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:38,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:38,853 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:38,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:38,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:38,853 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:38,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:38,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:38,854 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:38,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:38,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:38,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,857 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:38,857 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:38,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:38,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:38,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:38,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:38,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:38,995 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:38,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:38,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:38,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:38,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1984 [2022-12-13 02:04:38,995 INFO L420 AbstractCegarLoop]: === Iteration 1986 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash -301097911, now seen corresponding path program 1 times [2022-12-13 02:04:38,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:38,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634444668] [2022-12-13 02:04:38,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:38,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:39,058 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 02:04:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634444668] [2022-12-13 02:04:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634444668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:39,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:39,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:39,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394453819] [2022-12-13 02:04:39,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:39,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:39,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:39,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:39,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:39,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:39,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:39,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:39,119 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:39,119 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:39,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:39,119 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:39,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:39,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:39,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:39,120 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:39,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:39,121 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,121 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:39,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:39,122 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:39,122 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,122 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:39,122 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:39,122 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,126 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:39,126 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:39,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:39,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:39,258 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:39,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:39,260 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:39,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:39,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:39,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1985 [2022-12-13 02:04:39,260 INFO L420 AbstractCegarLoop]: === Iteration 1987 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash -243839609, now seen corresponding path program 1 times [2022-12-13 02:04:39,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:39,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036635932] [2022-12-13 02:04:39,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:39,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:39,329 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 02:04:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:39,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036635932] [2022-12-13 02:04:39,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036635932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:39,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:39,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:39,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089332877] [2022-12-13 02:04:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:39,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:39,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:39,330 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:39,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:39,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:39,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:39,378 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:39,378 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:39,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:39,378 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:39,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:39,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:39,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:39,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:39,380 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:39,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:39,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:39,380 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:39,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:39,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,383 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:39,383 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:39,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:39,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:39,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:39,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:39,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:39,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:39,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:39,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1986 [2022-12-13 02:04:39,502 INFO L420 AbstractCegarLoop]: === Iteration 1988 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:39,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:39,502 INFO L85 PathProgramCache]: Analyzing trace with hash -186581307, now seen corresponding path program 1 times [2022-12-13 02:04:39,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:39,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977947887] [2022-12-13 02:04:39,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:39,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:39,557 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 02:04:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:39,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977947887] [2022-12-13 02:04:39,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977947887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:39,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:39,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579027044] [2022-12-13 02:04:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:39,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:39,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:39,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:39,558 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:39,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:39,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:39,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:39,618 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:39,619 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:39,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:39,619 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:39,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:39,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:39,620 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:39,620 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:39,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:39,620 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:39,621 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:39,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:39,621 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,621 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:39,621 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:39,621 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,624 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:39,624 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:39,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:39,624 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:39,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:39,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:39,741 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:39,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:39,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:39,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1987 [2022-12-13 02:04:39,741 INFO L420 AbstractCegarLoop]: === Iteration 1989 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -129323005, now seen corresponding path program 1 times [2022-12-13 02:04:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688886004] [2022-12-13 02:04:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:39,795 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 02:04:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688886004] [2022-12-13 02:04:39,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688886004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:39,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:39,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995510230] [2022-12-13 02:04:39,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:39,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:39,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:39,796 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:39,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:39,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:39,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:39,838 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:39,838 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:39,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:39,839 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:39,839 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:39,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:39,839 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:39,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:39,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:39,840 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:39,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:39,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:39,840 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:39,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:39,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:39,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,843 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:39,843 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:39,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:39,844 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:39,844 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:39,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:39,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:04:39,958 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:39,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:39,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:39,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:39,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1988 [2022-12-13 02:04:39,958 INFO L420 AbstractCegarLoop]: === Iteration 1990 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:39,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash -72064703, now seen corresponding path program 1 times [2022-12-13 02:04:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:39,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021202513] [2022-12-13 02:04:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:40,013 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 02:04:40,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:40,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021202513] [2022-12-13 02:04:40,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021202513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:40,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:40,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:40,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817979601] [2022-12-13 02:04:40,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:40,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:40,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:40,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:40,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:40,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:40,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:40,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:40,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:40,056 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:40,057 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:40,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:40,057 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:40,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:40,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:40,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:40,058 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:40,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:40,058 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:40,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:40,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:40,059 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,059 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:40,059 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:40,059 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:40,061 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:40,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:40,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:40,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:40,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:04:40,178 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:40,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:40,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:40,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1989 [2022-12-13 02:04:40,178 INFO L420 AbstractCegarLoop]: === Iteration 1991 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -14806401, now seen corresponding path program 1 times [2022-12-13 02:04:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:40,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567904127] [2022-12-13 02:04:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:40,232 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 02:04:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:40,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567904127] [2022-12-13 02:04:40,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567904127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:40,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:40,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:40,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536433341] [2022-12-13 02:04:40,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:40,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:40,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:40,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:40,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:40,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:40,277 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:40,278 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:40,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:40,278 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:40,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:40,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:40,279 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:40,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:40,279 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,279 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:40,279 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:40,280 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:40,280 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,280 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:40,280 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:40,280 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,282 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:40,282 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:40,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:40,283 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,283 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:40,400 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:40,400 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:04:40,400 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:40,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:40,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1990 [2022-12-13 02:04:40,401 INFO L420 AbstractCegarLoop]: === Iteration 1992 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:40,401 INFO L85 PathProgramCache]: Analyzing trace with hash 42451901, now seen corresponding path program 1 times [2022-12-13 02:04:40,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:40,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715340504] [2022-12-13 02:04:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:40,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:40,456 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 02:04:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:40,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715340504] [2022-12-13 02:04:40,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715340504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:40,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:40,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384188723] [2022-12-13 02:04:40,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:40,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:40,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:40,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:40,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:40,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:40,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:40,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:40,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:40,506 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:40,506 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:40,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:40,507 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:40,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:40,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:40,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:40,507 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:40,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:40,508 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:40,508 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:40,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:40,508 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:40,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:40,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,511 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:40,511 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:40,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:40,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:40,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:40,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:40,627 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:40,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:40,627 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:40,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1991 [2022-12-13 02:04:40,627 INFO L420 AbstractCegarLoop]: === Iteration 1993 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash 99710203, now seen corresponding path program 1 times [2022-12-13 02:04:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:40,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930727416] [2022-12-13 02:04:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:40,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:40,681 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 02:04:40,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:40,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930727416] [2022-12-13 02:04:40,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930727416] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:40,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:40,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:40,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921948631] [2022-12-13 02:04:40,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:40,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:40,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:40,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:40,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:40,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:40,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:40,724 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:40,725 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:40,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:40,725 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:40,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:40,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:40,725 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:40,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:40,726 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:40,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:40,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:40,727 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:40,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:40,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,729 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:40,730 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:40,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:40,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:40,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:40,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:04:40,860 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:40,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,860 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:40,860 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:40,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1992 [2022-12-13 02:04:40,860 INFO L420 AbstractCegarLoop]: === Iteration 1994 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash 156968505, now seen corresponding path program 1 times [2022-12-13 02:04:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:40,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113935970] [2022-12-13 02:04:40,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:40,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:40,918 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 02:04:40,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:40,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113935970] [2022-12-13 02:04:40,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113935970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:40,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:40,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420977635] [2022-12-13 02:04:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:40,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:40,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:40,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:40,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:40,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:40,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:40,963 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:40,963 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:40,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:40,964 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:40,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:40,964 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:40,964 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:40,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:40,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:40,965 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,965 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:40,965 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:40,965 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:40,965 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:40,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:40,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:40,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,968 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:40,968 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:40,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:40,968 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:40,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:41,087 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:41,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:41,087 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:41,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:41,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1993 [2022-12-13 02:04:41,088 INFO L420 AbstractCegarLoop]: === Iteration 1995 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 214226807, now seen corresponding path program 1 times [2022-12-13 02:04:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:41,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466512913] [2022-12-13 02:04:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:41,170 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 02:04:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466512913] [2022-12-13 02:04:41,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466512913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:41,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:41,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456276506] [2022-12-13 02:04:41,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:41,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:41,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:41,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:41,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:41,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:41,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:41,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:41,214 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:41,214 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:41,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:41,214 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:41,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:41,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:41,215 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:41,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:41,216 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:41,216 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:41,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:41,216 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:41,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:41,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,219 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:41,219 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:41,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:41,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:41,336 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:41,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:41,337 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:41,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:41,337 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:41,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1994 [2022-12-13 02:04:41,337 INFO L420 AbstractCegarLoop]: === Iteration 1996 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:41,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:41,337 INFO L85 PathProgramCache]: Analyzing trace with hash 271485109, now seen corresponding path program 1 times [2022-12-13 02:04:41,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:41,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333237917] [2022-12-13 02:04:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:41,391 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 02:04:41,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:41,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333237917] [2022-12-13 02:04:41,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333237917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:41,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:41,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:41,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031442106] [2022-12-13 02:04:41,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:41,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:41,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:41,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:41,392 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:41,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:41,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:41,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:41,438 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:41,438 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:41,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:41,439 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:41,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:41,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:41,440 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:41,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:41,440 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:41,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:41,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:41,441 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:41,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:41,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,444 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:41,444 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:41,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:41,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:41,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:41,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 116 [2022-12-13 02:04:41,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:41,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:41,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:41,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1995 [2022-12-13 02:04:41,558 INFO L420 AbstractCegarLoop]: === Iteration 1997 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 328743411, now seen corresponding path program 1 times [2022-12-13 02:04:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614269773] [2022-12-13 02:04:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:41,612 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 02:04:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614269773] [2022-12-13 02:04:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614269773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:41,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232574325] [2022-12-13 02:04:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:41,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:41,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:41,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:41,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:41,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:41,664 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:41,665 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:41,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:41,665 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:41,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:41,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:41,666 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:41,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:41,667 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:41,667 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:41,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:41,667 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:41,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:41,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,670 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:41,670 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:41,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:41,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:41,804 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:41,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:41,805 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:41,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:41,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:41,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1996 [2022-12-13 02:04:41,806 INFO L420 AbstractCegarLoop]: === Iteration 1998 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:41,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 386001713, now seen corresponding path program 1 times [2022-12-13 02:04:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:41,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125123320] [2022-12-13 02:04:41,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:41,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:41,865 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 02:04:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:41,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125123320] [2022-12-13 02:04:41,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125123320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:41,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:41,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806836812] [2022-12-13 02:04:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:41,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:41,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:41,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:41,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:41,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:41,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:41,926 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:41,926 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:41,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:41,927 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:41,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:41,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:41,927 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:41,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:41,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:41,928 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,928 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:41,928 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:41,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:41,928 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,929 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:41,929 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:41,929 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:41,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,931 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:41,931 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:41,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:41,932 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:41,932 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:42,064 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:42,065 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:42,065 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:42,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:42,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:42,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1997 [2022-12-13 02:04:42,065 INFO L420 AbstractCegarLoop]: === Iteration 1999 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash 443260015, now seen corresponding path program 1 times [2022-12-13 02:04:42,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:42,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152335580] [2022-12-13 02:04:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:42,133 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 02:04:42,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:42,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152335580] [2022-12-13 02:04:42,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152335580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:42,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:42,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748057436] [2022-12-13 02:04:42,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:42,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:42,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:42,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:42,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:42,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:42,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:42,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:42,191 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:42,192 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:42,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:42,192 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:42,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:42,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:42,193 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:42,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:42,194 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:42,194 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:42,194 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:42,194 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,194 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:42,194 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:42,194 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:42,197 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:42,197 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:42,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:42,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:42,197 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:42,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:42,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:04:42,331 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:42,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:42,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:42,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1998 [2022-12-13 02:04:42,331 INFO L420 AbstractCegarLoop]: === Iteration 2000 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash 500518317, now seen corresponding path program 1 times [2022-12-13 02:04:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770166817] [2022-12-13 02:04:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:42,402 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 02:04:42,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:42,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770166817] [2022-12-13 02:04:42,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770166817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:42,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:42,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:42,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488869468] [2022-12-13 02:04:42,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:42,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:42,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:42,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:42,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:42,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:42,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:42,464 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:42,464 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:42,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:42,465 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:42,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:42,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:42,465 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:42,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:42,466 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:42,466 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:42,467 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:42,467 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,467 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:42,467 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:42,467 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:42,469 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:42,469 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:42,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:42,470 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:42,470 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:42,600 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:42,601 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:04:42,601 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:42,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:42,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:42,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1999 [2022-12-13 02:04:42,601 INFO L420 AbstractCegarLoop]: === Iteration 2001 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:42,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:42,602 INFO L85 PathProgramCache]: Analyzing trace with hash 557776619, now seen corresponding path program 1 times [2022-12-13 02:04:42,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:42,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635011673] [2022-12-13 02:04:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:42,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:42,682 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 02:04:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:42,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635011673] [2022-12-13 02:04:42,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635011673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:42,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:42,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934956095] [2022-12-13 02:04:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:42,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:42,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:42,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:42,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:42,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:42,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:42,735 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:42,736 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:42,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:42,736 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:42,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:42,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:42,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:42,737 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:42,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:42,738 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:42,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:42,738 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:42,738 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,738 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:42,738 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:42,738 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:42,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:42,741 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:42,741 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:42,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:42,741 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:42,741 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:42,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:42,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:04:42,873 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:42,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:42,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:42,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2000 [2022-12-13 02:04:42,874 INFO L420 AbstractCegarLoop]: === Iteration 2002 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:42,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 615034921, now seen corresponding path program 1 times [2022-12-13 02:04:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:42,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17294101] [2022-12-13 02:04:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:42,935 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 02:04:42,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:42,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17294101] [2022-12-13 02:04:42,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17294101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:42,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:42,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:42,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218202998] [2022-12-13 02:04:42,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:42,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:42,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:42,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:42,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:42,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:42,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:42,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:42,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:42,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:42,998 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:42,998 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:42,999 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:42,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:42,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:43,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:43,000 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:43,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:43,001 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:43,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:43,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:43,001 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:43,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:43,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,006 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:43,006 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:43,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:43,006 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,006 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:43,143 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:43,144 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:04:43,144 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:43,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:43,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:43,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2001 [2022-12-13 02:04:43,144 INFO L420 AbstractCegarLoop]: === Iteration 2003 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:43,145 INFO L85 PathProgramCache]: Analyzing trace with hash 672293223, now seen corresponding path program 1 times [2022-12-13 02:04:43,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:43,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643884717] [2022-12-13 02:04:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:43,214 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 02:04:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:43,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643884717] [2022-12-13 02:04:43,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643884717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:43,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:43,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410447623] [2022-12-13 02:04:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:43,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:43,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:43,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:43,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:43,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:43,279 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:43,279 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:43,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:43,280 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:43,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:43,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:43,280 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:43,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:43,281 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:43,281 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:43,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:43,281 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:43,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:43,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,284 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:43,285 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:43,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:43,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:43,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:43,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:43,419 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:43,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:43,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:43,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2002 [2022-12-13 02:04:43,420 INFO L420 AbstractCegarLoop]: === Iteration 2004 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash 729551525, now seen corresponding path program 1 times [2022-12-13 02:04:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:43,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786402576] [2022-12-13 02:04:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:43,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:43,480 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 02:04:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:43,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786402576] [2022-12-13 02:04:43,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786402576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:43,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:43,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044774959] [2022-12-13 02:04:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:43,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:43,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:43,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:43,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:43,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:43,537 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:43,537 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:43,538 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:43,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:43,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:43,539 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:43,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:43,540 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:43,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:43,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:43,540 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:43,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:43,541 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,544 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:43,544 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:43,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:43,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:43,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:43,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:43,679 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:43,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,679 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:43,679 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:43,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2003 [2022-12-13 02:04:43,679 INFO L420 AbstractCegarLoop]: === Iteration 2005 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:43,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 786809827, now seen corresponding path program 1 times [2022-12-13 02:04:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:43,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237078715] [2022-12-13 02:04:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:43,759 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 02:04:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237078715] [2022-12-13 02:04:43,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237078715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:43,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:43,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92379360] [2022-12-13 02:04:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:43,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:43,760 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:43,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:43,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:43,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:43,815 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:43,815 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:43,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:43,815 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:43,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:43,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:43,816 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:43,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:43,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:43,816 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:43,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:43,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:43,817 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:43,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:43,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:43,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,820 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:43,820 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:43,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:43,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:43,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:43,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:43,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:04:43,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:43,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:43,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:43,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:43,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2004 [2022-12-13 02:04:43,953 INFO L420 AbstractCegarLoop]: === Iteration 2006 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:43,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 844068129, now seen corresponding path program 1 times [2022-12-13 02:04:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:43,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77744408] [2022-12-13 02:04:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:44,011 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 02:04:44,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:44,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77744408] [2022-12-13 02:04:44,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77744408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:44,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:44,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710035693] [2022-12-13 02:04:44,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:44,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:44,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:44,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:44,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:44,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:44,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:44,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:44,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:44,066 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:44,067 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:44,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:44,067 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:44,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:44,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:44,068 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:44,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:44,069 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,069 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:44,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:44,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:44,070 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:44,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:44,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,074 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:44,074 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:44,074 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,074 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:44,195 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:44,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:44,195 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:44,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:44,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:44,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2005 [2022-12-13 02:04:44,196 INFO L420 AbstractCegarLoop]: === Iteration 2007 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash 901326431, now seen corresponding path program 1 times [2022-12-13 02:04:44,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253208886] [2022-12-13 02:04:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:44,251 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 02:04:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:44,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253208886] [2022-12-13 02:04:44,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253208886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:44,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:44,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:44,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417454984] [2022-12-13 02:04:44,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:44,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:44,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:44,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:44,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:44,252 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:44,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:44,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:44,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:44,308 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:44,308 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:44,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:44,308 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:44,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:44,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:44,309 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:44,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:44,309 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:44,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:44,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:44,310 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:44,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:44,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,313 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:44,313 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:44,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:44,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:44,428 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:44,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:44,429 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:44,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:44,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:44,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2006 [2022-12-13 02:04:44,429 INFO L420 AbstractCegarLoop]: === Iteration 2008 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 958584733, now seen corresponding path program 1 times [2022-12-13 02:04:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:44,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211436227] [2022-12-13 02:04:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:44,483 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 02:04:44,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:44,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211436227] [2022-12-13 02:04:44,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211436227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:44,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:44,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607358299] [2022-12-13 02:04:44,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:44,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:44,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:44,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:44,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:44,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:44,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:44,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:44,526 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:44,526 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:44,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:44,526 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:44,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:44,527 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:44,527 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:44,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:44,528 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,528 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:44,528 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:44,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:44,528 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:44,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:44,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,531 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:44,531 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:44,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:44,531 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,531 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:44,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:44,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:44,647 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:44,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:44,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:44,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2007 [2022-12-13 02:04:44,647 INFO L420 AbstractCegarLoop]: === Iteration 2009 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:44,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1015843035, now seen corresponding path program 1 times [2022-12-13 02:04:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:44,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243501665] [2022-12-13 02:04:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:44,703 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 02:04:44,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:44,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243501665] [2022-12-13 02:04:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243501665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:44,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022512057] [2022-12-13 02:04:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:44,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:44,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:44,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:44,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:44,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:44,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:44,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:44,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:44,754 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:44,754 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:44,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:44,754 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:44,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:44,755 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:44,755 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:44,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:44,756 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,756 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:44,756 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:44,756 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:44,756 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:44,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:44,756 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,759 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:44,759 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:44,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:44,759 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,759 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:44,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:44,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:44,877 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:44,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:44,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:44,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2008 [2022-12-13 02:04:44,878 INFO L420 AbstractCegarLoop]: === Iteration 2010 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:44,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:44,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1073101337, now seen corresponding path program 1 times [2022-12-13 02:04:44,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:44,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283644443] [2022-12-13 02:04:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:44,934 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 02:04:44,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:44,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283644443] [2022-12-13 02:04:44,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283644443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:44,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:44,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105829096] [2022-12-13 02:04:44,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:44,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:44,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:44,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:44,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:44,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:44,977 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:44,977 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:44,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:44,978 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:44,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:44,978 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:44,978 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:44,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:44,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:44,979 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,979 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:44,979 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:44,979 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:44,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:44,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:44,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:44,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,982 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:44,982 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:44,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:44,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:44,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:45,101 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:45,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:45,102 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:45,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:45,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:45,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2009 [2022-12-13 02:04:45,102 INFO L420 AbstractCegarLoop]: === Iteration 2011 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:45,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1130359639, now seen corresponding path program 1 times [2022-12-13 02:04:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:45,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932693351] [2022-12-13 02:04:45,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:45,170 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 02:04:45,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:45,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932693351] [2022-12-13 02:04:45,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932693351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:45,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:45,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840342203] [2022-12-13 02:04:45,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:45,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:45,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:45,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:45,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:45,218 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:45,218 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:45,219 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:45,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:45,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:45,219 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:45,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:45,220 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:45,220 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:45,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:45,220 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,221 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:45,221 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:45,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,223 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:45,223 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:45,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:45,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:45,349 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:45,350 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:04:45,350 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:45,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,350 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:45,350 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:45,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2010 [2022-12-13 02:04:45,350 INFO L420 AbstractCegarLoop]: === Iteration 2012 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:45,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1187617941, now seen corresponding path program 1 times [2022-12-13 02:04:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:45,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506698493] [2022-12-13 02:04:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:45,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:45,408 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 02:04:45,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:45,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506698493] [2022-12-13 02:04:45,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506698493] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:45,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:45,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754226973] [2022-12-13 02:04:45,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:45,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:45,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:45,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:45,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:45,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:45,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:45,452 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:45,452 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:45,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:45,453 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:45,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:45,454 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:45,454 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:45,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:45,455 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,455 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:45,455 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:45,455 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:45,455 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,455 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:45,455 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:45,455 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,459 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:45,459 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:45,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:45,459 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,459 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:45,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:45,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:04:45,582 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:45,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,582 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:45,582 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:45,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2011 [2022-12-13 02:04:45,582 INFO L420 AbstractCegarLoop]: === Iteration 2013 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:45,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1244876243, now seen corresponding path program 1 times [2022-12-13 02:04:45,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:45,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084652784] [2022-12-13 02:04:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:45,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:45,648 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 02:04:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:45,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084652784] [2022-12-13 02:04:45,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084652784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:45,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:45,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:45,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929406400] [2022-12-13 02:04:45,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:45,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:45,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:45,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:45,649 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:45,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:45,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:45,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:45,694 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:45,694 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:45,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:45,694 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:45,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:45,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:45,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:45,695 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:45,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:45,696 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,696 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:45,696 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:45,696 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:45,696 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:45,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:45,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,699 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:45,699 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:45,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:45,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:45,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:45,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 02:04:45,846 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:45,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:45,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:45,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2012 [2022-12-13 02:04:45,846 INFO L420 AbstractCegarLoop]: === Iteration 2014 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:45,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1302134545, now seen corresponding path program 1 times [2022-12-13 02:04:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:45,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404995103] [2022-12-13 02:04:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:45,900 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 02:04:45,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:45,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404995103] [2022-12-13 02:04:45,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404995103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:45,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:45,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357233957] [2022-12-13 02:04:45,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:45,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:45,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:45,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:45,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:45,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:45,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:45,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:45,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:45,943 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:45,943 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:45,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:45,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:45,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:45,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:45,944 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:45,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:45,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:45,945 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:45,945 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:45,945 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:45,945 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,945 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:45,945 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:45,945 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,948 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:45,948 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:45,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:45,948 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:45,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:46,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:46,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:04:46,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:46,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:46,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:46,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2013 [2022-12-13 02:04:46,064 INFO L420 AbstractCegarLoop]: === Iteration 2015 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:46,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1359392847, now seen corresponding path program 1 times [2022-12-13 02:04:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:46,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658367422] [2022-12-13 02:04:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:46,119 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 02:04:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658367422] [2022-12-13 02:04:46,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658367422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:46,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:46,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040366435] [2022-12-13 02:04:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:46,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:46,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:46,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:46,120 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:46,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:46,120 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:46,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:46,163 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:46,163 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:46,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:46,163 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:46,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:46,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:46,164 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:46,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:46,165 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,165 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:46,165 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:46,165 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:46,165 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,165 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:46,165 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:46,165 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,168 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:46,168 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:46,168 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,168 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:46,307 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:46,308 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:04:46,308 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:46,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,308 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:46,308 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:46,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2014 [2022-12-13 02:04:46,308 INFO L420 AbstractCegarLoop]: === Iteration 2016 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:46,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1416651149, now seen corresponding path program 1 times [2022-12-13 02:04:46,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:46,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218009913] [2022-12-13 02:04:46,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:46,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:46,368 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 02:04:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:46,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218009913] [2022-12-13 02:04:46,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218009913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:46,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:46,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148400696] [2022-12-13 02:04:46,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:46,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:46,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:46,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:46,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:46,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:46,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:46,430 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:46,430 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:46,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:46,431 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:46,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:46,431 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:46,431 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:46,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:46,433 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:46,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:46,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:46,433 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:46,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:46,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:46,437 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:46,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:46,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:46,566 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:46,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:04:46,567 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:46,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:46,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:46,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2015 [2022-12-13 02:04:46,568 INFO L420 AbstractCegarLoop]: === Iteration 2017 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1473909451, now seen corresponding path program 1 times [2022-12-13 02:04:46,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:46,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414688148] [2022-12-13 02:04:46,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:46,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:46,629 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 02:04:46,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:46,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414688148] [2022-12-13 02:04:46,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414688148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:46,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:46,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133606935] [2022-12-13 02:04:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:46,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:46,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:46,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:46,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:46,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:46,683 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:46,684 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:46,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:46,684 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:46,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:46,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:46,685 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:46,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:46,686 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:46,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:46,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:46,686 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:46,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:46,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,690 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:46,690 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:46,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:46,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:46,823 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:46,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:46,824 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:46,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:46,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:46,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2016 [2022-12-13 02:04:46,824 INFO L420 AbstractCegarLoop]: === Iteration 2018 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:46,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:46,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1531167753, now seen corresponding path program 1 times [2022-12-13 02:04:46,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:46,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547416804] [2022-12-13 02:04:46,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:46,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:46,889 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 02:04:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:46,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547416804] [2022-12-13 02:04:46,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547416804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:46,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:46,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893931712] [2022-12-13 02:04:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:46,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:46,890 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:46,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:46,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:46,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:46,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:46,950 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:46,950 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:46,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:46,951 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:46,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:46,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:46,951 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:46,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:46,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:46,952 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,952 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:46,952 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:46,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:46,953 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:46,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:46,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:46,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,955 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:46,955 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:46,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:46,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:46,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:47,089 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:47,091 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:47,091 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:47,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,091 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:47,091 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:47,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2017 [2022-12-13 02:04:47,091 INFO L420 AbstractCegarLoop]: === Iteration 2019 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1588426055, now seen corresponding path program 1 times [2022-12-13 02:04:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:47,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513984398] [2022-12-13 02:04:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:47,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:47,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513984398] [2022-12-13 02:04:47,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513984398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:47,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:47,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3737873] [2022-12-13 02:04:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:47,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:47,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:47,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:47,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:47,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:47,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:47,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:47,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:47,217 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:47,218 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:47,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:47,218 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:47,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:47,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:47,219 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:47,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:47,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:47,220 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:47,220 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:47,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:47,220 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:47,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:47,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:47,223 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:47,223 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:47,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:47,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:47,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:47,358 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:47,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:47,360 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:47,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:47,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:47,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2018 [2022-12-13 02:04:47,360 INFO L420 AbstractCegarLoop]: === Iteration 2020 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1645684357, now seen corresponding path program 1 times [2022-12-13 02:04:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:47,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851942851] [2022-12-13 02:04:47,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:47,453 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 02:04:47,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:47,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851942851] [2022-12-13 02:04:47,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851942851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:47,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:47,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:47,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445763358] [2022-12-13 02:04:47,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:47,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:47,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:47,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:47,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:47,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:47,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:47,509 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:47,509 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:47,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:47,510 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:47,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:47,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:47,510 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:47,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:47,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:47,512 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,512 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:47,512 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:47,512 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:47,512 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,512 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:47,512 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:47,513 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:47,516 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:47,517 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:47,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:47,517 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:47,517 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:47,653 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:47,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:04:47,655 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:47,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,655 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:47,655 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:47,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2019 [2022-12-13 02:04:47,655 INFO L420 AbstractCegarLoop]: === Iteration 2021 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1702942659, now seen corresponding path program 1 times [2022-12-13 02:04:47,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:47,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599781417] [2022-12-13 02:04:47,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:47,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:47,717 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 02:04:47,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599781417] [2022-12-13 02:04:47,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599781417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:47,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:47,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049385425] [2022-12-13 02:04:47,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:47,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:47,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:47,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:47,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:47,718 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:47,719 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,719 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:47,719 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:47,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:47,782 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:47,782 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:47,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:47,783 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:47,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:47,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:47,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:47,784 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:47,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:47,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:47,785 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:47,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:47,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:47,785 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:47,785 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:47,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:47,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:47,788 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:47,788 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:47,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:47,788 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:47,788 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:47,924 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:47,925 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:47,925 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:47,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:47,926 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:47,926 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:47,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2020 [2022-12-13 02:04:47,926 INFO L420 AbstractCegarLoop]: === Iteration 2022 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:47,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1760200961, now seen corresponding path program 1 times [2022-12-13 02:04:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:47,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770228320] [2022-12-13 02:04:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:48,001 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 02:04:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:48,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770228320] [2022-12-13 02:04:48,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770228320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:48,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:48,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387601476] [2022-12-13 02:04:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:48,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:48,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:48,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:48,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:48,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:48,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:48,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:48,067 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:48,068 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:48,068 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:48,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:48,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:48,069 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:48,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:48,070 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:48,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:48,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:48,070 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:48,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:48,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,073 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:48,073 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:48,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:48,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:48,214 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:48,216 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:04:48,216 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:48,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,216 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:48,216 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:48,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2021 [2022-12-13 02:04:48,216 INFO L420 AbstractCegarLoop]: === Iteration 2023 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:48,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:48,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1817459263, now seen corresponding path program 1 times [2022-12-13 02:04:48,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:48,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145174051] [2022-12-13 02:04:48,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:48,292 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 02:04:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:48,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145174051] [2022-12-13 02:04:48,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145174051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:48,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:48,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651522104] [2022-12-13 02:04:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:48,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:48,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:48,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:48,293 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:48,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:48,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:48,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:48,358 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:48,358 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:48,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:48,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:48,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:48,359 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:48,359 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:48,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:48,361 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:48,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:48,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:48,361 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:48,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:48,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,365 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:48,365 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:48,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:48,365 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,365 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:48,501 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:48,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:04:48,502 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:48,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:48,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:48,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2022 [2022-12-13 02:04:48,503 INFO L420 AbstractCegarLoop]: === Iteration 2024 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:48,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:48,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1874717565, now seen corresponding path program 1 times [2022-12-13 02:04:48,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:48,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203104475] [2022-12-13 02:04:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:48,575 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 02:04:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:48,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203104475] [2022-12-13 02:04:48,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203104475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:48,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:48,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696267517] [2022-12-13 02:04:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:48,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:48,576 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:48,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:48,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:48,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:48,629 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:48,629 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:48,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:48,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:48,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:48,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:48,630 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:48,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:48,631 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:48,631 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:48,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:48,631 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:48,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:48,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,634 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:48,634 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:48,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:48,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:48,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:48,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:48,754 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:48,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:48,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:48,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2023 [2022-12-13 02:04:48,755 INFO L420 AbstractCegarLoop]: === Iteration 2025 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1931975867, now seen corresponding path program 1 times [2022-12-13 02:04:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:48,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29786895] [2022-12-13 02:04:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:48,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:48,811 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 02:04:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:48,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29786895] [2022-12-13 02:04:48,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29786895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:48,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:48,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:48,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148512279] [2022-12-13 02:04:48,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:48,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:48,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:48,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:48,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:48,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:48,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:48,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:48,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:48,864 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:48,865 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:48,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:48,865 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:48,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:48,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:48,866 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:48,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:48,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:48,867 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:48,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:48,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:48,867 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:48,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:48,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:48,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,870 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:48,870 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:48,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:48,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:48,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:48,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:48,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:48,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:48,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:48,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:48,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:48,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2024 [2022-12-13 02:04:48,989 INFO L420 AbstractCegarLoop]: === Iteration 2026 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:48,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1989234169, now seen corresponding path program 1 times [2022-12-13 02:04:48,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:48,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88210191] [2022-12-13 02:04:48,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:48,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:49,057 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 02:04:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:49,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88210191] [2022-12-13 02:04:49,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88210191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:49,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:49,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627633989] [2022-12-13 02:04:49,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:49,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:49,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:49,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:49,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:49,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:49,101 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:49,101 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:49,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:49,101 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:49,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:49,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:49,102 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:49,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:49,103 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,103 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:49,103 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:49,103 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:49,103 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:49,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:49,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,106 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:49,106 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:49,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:49,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:49,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:49,224 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:49,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:49,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:49,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2025 [2022-12-13 02:04:49,224 INFO L420 AbstractCegarLoop]: === Iteration 2027 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2046492471, now seen corresponding path program 1 times [2022-12-13 02:04:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:49,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538212527] [2022-12-13 02:04:49,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:49,280 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 02:04:49,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:49,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538212527] [2022-12-13 02:04:49,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538212527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:49,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:49,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011802286] [2022-12-13 02:04:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:49,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:49,281 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:49,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:49,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:49,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:49,330 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:49,331 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:49,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:49,331 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:49,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:49,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:49,332 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:49,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:49,332 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,332 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:49,332 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:49,333 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:49,333 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,333 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:49,333 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:49,333 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,335 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:49,335 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:49,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:49,336 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,336 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:49,453 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:49,454 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:49,454 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:49,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:49,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:49,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2026 [2022-12-13 02:04:49,454 INFO L420 AbstractCegarLoop]: === Iteration 2028 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 2103750773, now seen corresponding path program 1 times [2022-12-13 02:04:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:49,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732364169] [2022-12-13 02:04:49,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:49,510 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 02:04:49,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:49,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732364169] [2022-12-13 02:04:49,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732364169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:49,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:49,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097062865] [2022-12-13 02:04:49,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:49,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:49,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:49,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:49,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:49,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:49,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:49,561 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:49,561 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:49,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:49,561 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:49,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:49,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:49,562 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:49,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:49,563 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,563 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:49,563 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:49,563 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:49,563 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:49,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:49,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,566 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:49,566 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:49,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:49,566 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,566 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:49,683 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:49,684 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:49,684 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:49,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:49,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:49,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2027 [2022-12-13 02:04:49,685 INFO L420 AbstractCegarLoop]: === Iteration 2029 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2133958221, now seen corresponding path program 1 times [2022-12-13 02:04:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730547419] [2022-12-13 02:04:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:49,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 02:04:49,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:49,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730547419] [2022-12-13 02:04:49,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730547419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:49,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:49,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:49,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79528759] [2022-12-13 02:04:49,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:49,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:49,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:49,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:49,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:49,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:49,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:49,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:49,782 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:49,782 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:49,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:49,782 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:49,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:49,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:49,783 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:49,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:49,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:49,784 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,784 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:49,784 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:49,784 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:49,784 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:49,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:49,784 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:49,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,787 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:49,787 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:49,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:49,787 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:49,787 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:49,903 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:49,903 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:04:49,904 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:49,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,904 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:49,904 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:49,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2028 [2022-12-13 02:04:49,904 INFO L420 AbstractCegarLoop]: === Iteration 2030 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:49,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:49,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2076699919, now seen corresponding path program 1 times [2022-12-13 02:04:49,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:49,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348928069] [2022-12-13 02:04:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:49,971 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 02:04:49,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:49,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348928069] [2022-12-13 02:04:49,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348928069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:49,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:49,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:49,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318219498] [2022-12-13 02:04:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:49,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:49,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:49,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:49,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:49,972 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:49,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:49,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:49,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:49,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:50,025 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:50,026 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:50,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:50,026 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:50,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:50,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:50,027 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:50,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:50,028 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:50,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:50,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:50,028 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:50,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:50,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,031 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:50,031 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:50,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:50,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:50,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:04:50,155 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:50,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:50,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:50,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2029 [2022-12-13 02:04:50,155 INFO L420 AbstractCegarLoop]: === Iteration 2031 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash -2019441617, now seen corresponding path program 1 times [2022-12-13 02:04:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:50,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596942345] [2022-12-13 02:04:50,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:50,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:50,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:50,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596942345] [2022-12-13 02:04:50,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596942345] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:50,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:50,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:50,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416941054] [2022-12-13 02:04:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:50,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:50,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:50,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:50,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:50,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:50,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:50,266 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:50,267 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:50,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:50,267 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:50,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:50,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:50,268 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:50,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:50,268 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,268 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:50,269 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:50,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:50,269 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:50,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:50,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,271 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:50,272 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:50,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:50,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:50,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:04:50,398 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:50,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:50,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:50,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2030 [2022-12-13 02:04:50,399 INFO L420 AbstractCegarLoop]: === Iteration 2032 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1962183315, now seen corresponding path program 1 times [2022-12-13 02:04:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:50,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716282632] [2022-12-13 02:04:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:50,453 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 02:04:50,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:50,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716282632] [2022-12-13 02:04:50,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716282632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:50,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:50,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:50,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659617800] [2022-12-13 02:04:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:50,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:50,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:50,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:50,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:50,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:50,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:50,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:50,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:50,496 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:50,496 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:50,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:50,496 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:50,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:50,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:50,497 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:50,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:50,497 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:50,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:50,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:50,498 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:50,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:50,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:50,500 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:50,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:50,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:50,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:50,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:04:50,628 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:50,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:50,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:50,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2031 [2022-12-13 02:04:50,629 INFO L420 AbstractCegarLoop]: === Iteration 2033 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:50,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:50,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1904925013, now seen corresponding path program 1 times [2022-12-13 02:04:50,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:50,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237670721] [2022-12-13 02:04:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:50,687 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 02:04:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:50,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237670721] [2022-12-13 02:04:50,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237670721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:50,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:50,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382839852] [2022-12-13 02:04:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:50,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:50,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:50,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:50,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:50,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:50,731 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:50,732 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:50,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:50,732 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:50,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:50,733 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:50,733 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:50,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:50,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:50,733 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,733 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:50,734 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:50,734 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:50,734 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,734 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:50,734 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:50,734 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:50,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,736 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:50,737 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:50,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:50,737 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:50,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:50,862 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:50,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:04:50,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:50,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:50,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:50,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2032 [2022-12-13 02:04:50,864 INFO L420 AbstractCegarLoop]: === Iteration 2034 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:50,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:50,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1847666711, now seen corresponding path program 1 times [2022-12-13 02:04:50,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:50,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234695708] [2022-12-13 02:04:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:50,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:50,936 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 02:04:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:50,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234695708] [2022-12-13 02:04:50,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234695708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:50,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:50,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402860201] [2022-12-13 02:04:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:50,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:50,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:50,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:50,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:50,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:50,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:50,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:50,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:51,009 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:51,009 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:51,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:51,009 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:51,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:51,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:51,010 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:51,011 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:51,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:51,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:51,011 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,011 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:51,011 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:51,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,014 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:51,014 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:51,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:51,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:51,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:51,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:51,150 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:51,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:51,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:51,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2033 [2022-12-13 02:04:51,151 INFO L420 AbstractCegarLoop]: === Iteration 2035 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1790408409, now seen corresponding path program 1 times [2022-12-13 02:04:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:51,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27447198] [2022-12-13 02:04:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:51,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:51,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:51,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27447198] [2022-12-13 02:04:51,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27447198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:51,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:51,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:51,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062546091] [2022-12-13 02:04:51,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:51,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:51,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:51,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:51,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:51,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:51,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:51,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:51,282 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:51,282 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:51,283 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:51,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:51,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:51,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:51,284 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:51,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:51,285 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,285 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:51,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:51,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:51,285 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:51,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:51,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,288 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:51,288 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:51,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:51,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:51,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:51,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:51,421 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:51,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:51,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:51,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2034 [2022-12-13 02:04:51,421 INFO L420 AbstractCegarLoop]: === Iteration 2036 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1733150107, now seen corresponding path program 1 times [2022-12-13 02:04:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:51,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947296632] [2022-12-13 02:04:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:51,490 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 02:04:51,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:51,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947296632] [2022-12-13 02:04:51,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947296632] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:51,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:51,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:51,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001205816] [2022-12-13 02:04:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:51,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:51,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:51,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:51,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:51,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:51,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:51,552 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:51,552 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:51,553 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:51,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:51,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:51,553 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:51,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:51,554 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:51,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:51,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:51,554 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:51,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:51,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,557 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:51,557 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:51,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:51,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:51,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:51,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:51,692 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:51,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:51,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2035 [2022-12-13 02:04:51,692 INFO L420 AbstractCegarLoop]: === Iteration 2037 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1675891805, now seen corresponding path program 1 times [2022-12-13 02:04:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:51,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016523478] [2022-12-13 02:04:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:51,762 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 02:04:51,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:51,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016523478] [2022-12-13 02:04:51,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016523478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:51,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:51,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879185108] [2022-12-13 02:04:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:51,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:51,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:51,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:51,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:51,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:51,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:51,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:51,816 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:51,816 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:51,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:51,817 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:51,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:51,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:51,818 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:51,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:51,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:51,818 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:51,819 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:51,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:51,819 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,819 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:51,819 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:51,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:51,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:51,822 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:51,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:51,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:51,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:51,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:51,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:04:51,957 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:51,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:51,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2036 [2022-12-13 02:04:51,958 INFO L420 AbstractCegarLoop]: === Iteration 2038 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1618633503, now seen corresponding path program 1 times [2022-12-13 02:04:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:51,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200835834] [2022-12-13 02:04:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:52,022 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 02:04:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:52,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200835834] [2022-12-13 02:04:52,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200835834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:52,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:52,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595154287] [2022-12-13 02:04:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:52,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:52,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:52,023 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:52,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:52,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:52,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:52,084 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:52,084 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:52,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:52,085 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:52,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:52,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:52,085 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:52,086 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:52,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:52,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:52,086 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,087 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:52,087 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:52,087 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,089 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:52,089 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:52,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:52,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:52,256 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:52,257 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-13 02:04:52,257 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:52,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:52,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2037 [2022-12-13 02:04:52,257 INFO L420 AbstractCegarLoop]: === Iteration 2039 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:52,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1561375201, now seen corresponding path program 1 times [2022-12-13 02:04:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:52,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299442918] [2022-12-13 02:04:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:52,331 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 02:04:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:52,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299442918] [2022-12-13 02:04:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299442918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450776829] [2022-12-13 02:04:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:52,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:52,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:52,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:52,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:52,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:52,392 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:52,392 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:52,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:52,393 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:52,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:52,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:52,393 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:52,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:52,394 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:52,394 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:52,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:52,394 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:52,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:52,395 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,397 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:52,397 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:52,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:52,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:52,520 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:52,521 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:04:52,521 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:52,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,521 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:52,521 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:52,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2038 [2022-12-13 02:04:52,521 INFO L420 AbstractCegarLoop]: === Iteration 2040 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1504116899, now seen corresponding path program 1 times [2022-12-13 02:04:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:52,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837369091] [2022-12-13 02:04:52,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:52,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 02:04:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:52,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837369091] [2022-12-13 02:04:52,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837369091] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:52,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:52,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439824580] [2022-12-13 02:04:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:52,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:52,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:52,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:52,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:52,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:52,621 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:52,622 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:52,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:52,622 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:52,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:52,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:52,623 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:52,623 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:52,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:52,623 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:52,624 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:52,624 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:52,624 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,624 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:52,624 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:52,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,626 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:52,626 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:52,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:52,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:52,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:52,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:52,763 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:52,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,763 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:52,763 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:52,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2039 [2022-12-13 02:04:52,763 INFO L420 AbstractCegarLoop]: === Iteration 2041 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:52,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1446858597, now seen corresponding path program 1 times [2022-12-13 02:04:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:52,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696413616] [2022-12-13 02:04:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:52,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:52,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696413616] [2022-12-13 02:04:52,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696413616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:52,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:52,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289300144] [2022-12-13 02:04:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:52,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:52,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:52,825 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:52,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:52,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:52,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:52,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:52,884 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:52,884 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:52,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:52,885 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:52,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:52,885 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:52,885 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:52,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:52,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:52,886 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,886 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:52,886 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:52,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:52,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:52,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:52,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:52,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,890 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:52,890 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:52,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:52,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:52,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:53,019 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:53,020 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:04:53,020 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:53,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,020 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:53,021 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:53,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2040 [2022-12-13 02:04:53,021 INFO L420 AbstractCegarLoop]: === Iteration 2042 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1389600295, now seen corresponding path program 1 times [2022-12-13 02:04:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:53,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498142379] [2022-12-13 02:04:53,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:53,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:53,094 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 02:04:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:53,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498142379] [2022-12-13 02:04:53,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498142379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:53,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:53,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113869057] [2022-12-13 02:04:53,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:53,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:53,095 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:53,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:53,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:53,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:53,153 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:53,153 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:53,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:53,154 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:53,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:53,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:53,154 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:53,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:53,155 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:53,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:53,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:53,156 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:53,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:53,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,158 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:53,158 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:53,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:53,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:53,281 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:53,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:04:53,282 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:53,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:53,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:53,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2041 [2022-12-13 02:04:53,282 INFO L420 AbstractCegarLoop]: === Iteration 2043 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1332341993, now seen corresponding path program 1 times [2022-12-13 02:04:53,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:53,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385223217] [2022-12-13 02:04:53,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:53,343 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 02:04:53,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:53,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385223217] [2022-12-13 02:04:53,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385223217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:53,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:53,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:53,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477536764] [2022-12-13 02:04:53,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:53,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:53,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:53,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:53,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:53,344 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:53,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:53,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:53,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:53,397 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:53,397 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:53,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:53,398 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:53,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:53,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:53,398 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:53,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:53,399 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,399 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:53,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:53,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:53,400 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:53,400 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:53,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,403 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:53,403 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:53,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:53,403 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:53,536 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:53,536 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:04:53,536 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:53,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:53,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:53,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2042 [2022-12-13 02:04:53,537 INFO L420 AbstractCegarLoop]: === Iteration 2044 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1275083691, now seen corresponding path program 1 times [2022-12-13 02:04:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:53,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039790234] [2022-12-13 02:04:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:53,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 02:04:53,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:53,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039790234] [2022-12-13 02:04:53,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039790234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:53,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:53,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81418501] [2022-12-13 02:04:53,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:53,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:53,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:53,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:53,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:53,595 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:53,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:53,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:53,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:53,645 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:53,645 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:53,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:53,646 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:53,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:53,646 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:53,646 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:53,647 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,647 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:53,647 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:53,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:53,647 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:53,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:53,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,650 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:53,650 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:53,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:53,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:53,767 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:53,768 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:53,768 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:53,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:53,768 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:53,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2043 [2022-12-13 02:04:53,768 INFO L420 AbstractCegarLoop]: === Iteration 2045 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:53,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1217825389, now seen corresponding path program 1 times [2022-12-13 02:04:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:53,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530381294] [2022-12-13 02:04:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:53,845 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 02:04:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530381294] [2022-12-13 02:04:53,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530381294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:53,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:53,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677908612] [2022-12-13 02:04:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:53,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:53,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:53,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:53,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:53,846 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:53,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:53,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:53,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:53,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:53,891 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:53,891 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:53,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:53,891 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:53,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:53,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:53,892 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:53,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:53,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:53,893 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:53,893 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:53,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:53,893 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:53,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:53,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:53,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,896 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:53,896 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:53,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:53,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:53,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:54,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:54,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:04:54,022 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:54,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:54,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:54,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2044 [2022-12-13 02:04:54,023 INFO L420 AbstractCegarLoop]: === Iteration 2046 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1160567087, now seen corresponding path program 1 times [2022-12-13 02:04:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:54,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670019381] [2022-12-13 02:04:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:54,080 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 02:04:54,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:54,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670019381] [2022-12-13 02:04:54,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670019381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:54,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:54,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127628656] [2022-12-13 02:04:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:54,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:54,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:54,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:54,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:54,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:54,125 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:54,126 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:54,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:54,126 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:54,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:54,126 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:54,126 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:54,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:54,127 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,127 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:54,127 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:54,127 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:54,128 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,128 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:54,128 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:54,128 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,130 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:54,130 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:54,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:54,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:54,249 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:54,250 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:54,250 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:54,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:54,251 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:54,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2045 [2022-12-13 02:04:54,251 INFO L420 AbstractCegarLoop]: === Iteration 2047 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1103308785, now seen corresponding path program 1 times [2022-12-13 02:04:54,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:54,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532675207] [2022-12-13 02:04:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:54,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:54,308 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 02:04:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532675207] [2022-12-13 02:04:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532675207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:54,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:54,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376076660] [2022-12-13 02:04:54,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:54,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:54,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:54,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:54,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:54,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:54,359 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:54,359 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:54,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:54,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:54,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:54,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:54,360 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:54,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:54,361 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:54,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:54,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:54,361 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:54,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:54,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,364 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:54,364 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:54,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:54,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:54,485 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:54,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:54,486 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:54,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:54,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:54,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2046 [2022-12-13 02:04:54,487 INFO L420 AbstractCegarLoop]: === Iteration 2048 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:54,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:54,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1046050483, now seen corresponding path program 1 times [2022-12-13 02:04:54,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:54,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856411775] [2022-12-13 02:04:54,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:54,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:54,544 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 02:04:54,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:54,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856411775] [2022-12-13 02:04:54,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856411775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:54,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:54,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891595371] [2022-12-13 02:04:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:54,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:54,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:54,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:54,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:54,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:54,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:54,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:54,591 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:54,591 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:54,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:54,592 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:54,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:54,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:54,592 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:54,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:54,593 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:54,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:54,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:54,593 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:54,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:54,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,596 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:54,596 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:54,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:54,596 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:54,713 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:54,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:54,714 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:54,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:54,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:54,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2047 [2022-12-13 02:04:54,714 INFO L420 AbstractCegarLoop]: === Iteration 2049 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:54,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:54,715 INFO L85 PathProgramCache]: Analyzing trace with hash -988792181, now seen corresponding path program 1 times [2022-12-13 02:04:54,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:54,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793451367] [2022-12-13 02:04:54,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:54,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:54,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 02:04:54,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:54,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793451367] [2022-12-13 02:04:54,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793451367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:54,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:54,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:54,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323544777] [2022-12-13 02:04:54,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:54,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:54,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:54,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:54,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:54,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:54,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:54,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:54,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:54,817 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:54,817 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:54,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:54,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:54,818 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:54,818 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:54,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:54,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:54,819 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,819 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:54,819 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:54,819 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:54,819 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:54,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:54,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:54,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:54,822 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:54,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:54,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:54,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:54,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:54,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:54,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:54,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:54,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:54,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2048 [2022-12-13 02:04:54,940 INFO L420 AbstractCegarLoop]: === Iteration 2050 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash -931533879, now seen corresponding path program 1 times [2022-12-13 02:04:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017268206] [2022-12-13 02:04:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:54,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 02:04:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:54,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017268206] [2022-12-13 02:04:54,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017268206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:54,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:54,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:54,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84049890] [2022-12-13 02:04:54,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:54,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:54,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:54,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:54,998 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:54,998 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:54,998 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:54,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:54,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:55,042 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:55,042 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:55,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:55,043 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:55,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:55,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:55,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:55,043 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:55,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:55,044 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:55,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:55,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:55,044 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:55,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:55,045 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,047 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:55,047 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:55,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:55,048 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,048 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:55,166 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:55,167 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:55,167 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:55,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:55,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2049 [2022-12-13 02:04:55,167 INFO L420 AbstractCegarLoop]: === Iteration 2051 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash -874275577, now seen corresponding path program 1 times [2022-12-13 02:04:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:55,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099407216] [2022-12-13 02:04:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:55,222 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 02:04:55,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:55,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099407216] [2022-12-13 02:04:55,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099407216] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:55,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:55,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834171930] [2022-12-13 02:04:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:55,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:55,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:55,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:55,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:55,223 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:55,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:55,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:55,284 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:55,284 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:55,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:55,285 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:55,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:55,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:55,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:55,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:55,286 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:55,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:55,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:55,286 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:55,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:55,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,289 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:55,289 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:55,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:55,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:55,408 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:55,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:55,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:55,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:55,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:55,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2050 [2022-12-13 02:04:55,410 INFO L420 AbstractCegarLoop]: === Iteration 2052 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:55,410 INFO L85 PathProgramCache]: Analyzing trace with hash -817017275, now seen corresponding path program 1 times [2022-12-13 02:04:55,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:55,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499785050] [2022-12-13 02:04:55,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:55,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:55,466 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 02:04:55,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:55,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499785050] [2022-12-13 02:04:55,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499785050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:55,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:55,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:55,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27573991] [2022-12-13 02:04:55,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:55,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:55,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:55,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:55,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:55,467 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:55,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:55,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:55,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:55,518 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:55,518 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:55,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:55,519 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:55,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:55,519 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:55,519 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:55,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:55,520 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,520 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:55,520 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:55,520 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:55,520 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,520 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:55,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:55,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,523 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:55,523 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:55,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:55,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,524 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:55,642 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:55,643 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:55,643 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:55,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,643 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:55,643 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:55,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2051 [2022-12-13 02:04:55,643 INFO L420 AbstractCegarLoop]: === Iteration 2053 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:55,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:55,643 INFO L85 PathProgramCache]: Analyzing trace with hash -759758973, now seen corresponding path program 1 times [2022-12-13 02:04:55,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:55,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237185209] [2022-12-13 02:04:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:55,700 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 02:04:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:55,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237185209] [2022-12-13 02:04:55,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237185209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:55,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:55,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662088857] [2022-12-13 02:04:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:55,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:55,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:55,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:55,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:55,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:55,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:55,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:55,751 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:55,751 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:55,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:55,752 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:55,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:55,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:55,752 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:55,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:55,753 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:55,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:55,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:55,753 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,754 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:55,754 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:55,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,756 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:55,756 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:55,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:55,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:55,874 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:55,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:04:55,875 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:55,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:55,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:55,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2052 [2022-12-13 02:04:55,875 INFO L420 AbstractCegarLoop]: === Iteration 2054 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -702500671, now seen corresponding path program 1 times [2022-12-13 02:04:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:55,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288147698] [2022-12-13 02:04:55,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:55,934 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 02:04:55,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:55,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288147698] [2022-12-13 02:04:55,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288147698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:55,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:55,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137391241] [2022-12-13 02:04:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:55,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:55,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:55,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:55,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:55,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:55,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:55,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:55,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:55,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:55,978 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:55,979 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:55,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:55,979 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:55,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:55,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:55,980 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:55,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:55,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:55,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:55,981 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:55,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:55,981 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:55,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:55,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:55,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,984 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:55,984 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:55,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:55,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:55,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:56,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:56,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:04:56,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:56,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:56,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:56,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2053 [2022-12-13 02:04:56,108 INFO L420 AbstractCegarLoop]: === Iteration 2055 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -645242369, now seen corresponding path program 1 times [2022-12-13 02:04:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:56,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722711376] [2022-12-13 02:04:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:04:56,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:56,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722711376] [2022-12-13 02:04:56,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722711376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:56,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:56,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:56,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223907050] [2022-12-13 02:04:56,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:56,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:56,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:56,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:56,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:56,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:56,244 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:56,244 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:56,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:56,245 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:56,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:56,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:56,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:56,246 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:56,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:56,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:56,246 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:56,247 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:56,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:56,247 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:56,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:56,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:56,250 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:56,250 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:56,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:56,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:56,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:56,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:56,386 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:56,386 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:56,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,386 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:56,386 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:56,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2054 [2022-12-13 02:04:56,386 INFO L420 AbstractCegarLoop]: === Iteration 2056 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:56,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:56,387 INFO L85 PathProgramCache]: Analyzing trace with hash -587984067, now seen corresponding path program 1 times [2022-12-13 02:04:56,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:56,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105509631] [2022-12-13 02:04:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:56,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:56,449 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 02:04:56,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:56,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105509631] [2022-12-13 02:04:56,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105509631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:56,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:56,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:56,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940555948] [2022-12-13 02:04:56,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:56,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:56,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:56,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:56,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:56,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:56,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:56,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:56,505 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:56,506 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:56,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:56,506 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:56,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:56,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:56,507 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:56,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:56,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:56,508 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:56,508 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:56,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:56,508 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:56,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:56,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:56,511 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:56,511 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:56,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:56,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:56,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:56,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:56,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:04:56,647 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:56,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:56,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:56,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2055 [2022-12-13 02:04:56,648 INFO L420 AbstractCegarLoop]: === Iteration 2057 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:56,648 INFO L85 PathProgramCache]: Analyzing trace with hash -530725765, now seen corresponding path program 1 times [2022-12-13 02:04:56,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:56,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886872934] [2022-12-13 02:04:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:56,713 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 02:04:56,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:56,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886872934] [2022-12-13 02:04:56,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886872934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:56,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:56,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803524304] [2022-12-13 02:04:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:56,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:56,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:56,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,714 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:56,714 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:56,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:56,776 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:56,777 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:56,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:56,777 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:56,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:56,778 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:56,778 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:56,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:56,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:56,779 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,779 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:56,779 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:56,779 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:56,779 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:56,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:56,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:56,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:56,782 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:56,782 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:56,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:56,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:56,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:56,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:56,930 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 02:04:56,930 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:56,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,930 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:56,930 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:56,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2056 [2022-12-13 02:04:56,931 INFO L420 AbstractCegarLoop]: === Iteration 2058 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:56,931 INFO L85 PathProgramCache]: Analyzing trace with hash -473467463, now seen corresponding path program 1 times [2022-12-13 02:04:56,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:56,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773094848] [2022-12-13 02:04:56,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:56,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:56,992 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 02:04:56,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:56,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773094848] [2022-12-13 02:04:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773094848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666395143] [2022-12-13 02:04:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:56,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:56,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:56,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:56,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:56,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:56,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:57,047 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:57,047 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:57,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:57,048 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:57,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:57,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:57,049 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:57,049 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:57,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:57,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:57,050 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:57,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:57,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,053 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:57,053 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:57,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:57,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:57,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:57,190 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:04:57,190 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:57,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:57,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:57,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2057 [2022-12-13 02:04:57,191 INFO L420 AbstractCegarLoop]: === Iteration 2059 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash -416209161, now seen corresponding path program 1 times [2022-12-13 02:04:57,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:57,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737345739] [2022-12-13 02:04:57,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:57,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:57,266 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 02:04:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737345739] [2022-12-13 02:04:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737345739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:57,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486895292] [2022-12-13 02:04:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:57,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:57,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:57,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:57,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:57,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:57,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:57,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:57,327 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:57,327 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:57,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:57,328 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:57,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:57,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:57,329 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:57,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:57,329 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,330 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:57,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:57,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:57,330 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:57,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:57,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,333 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:57,333 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:57,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:57,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:57,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:57,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:04:57,464 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:57,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:57,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:57,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2058 [2022-12-13 02:04:57,465 INFO L420 AbstractCegarLoop]: === Iteration 2060 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:57,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -358950859, now seen corresponding path program 1 times [2022-12-13 02:04:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:57,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263948471] [2022-12-13 02:04:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:57,530 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 02:04:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:57,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263948471] [2022-12-13 02:04:57,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263948471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:57,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:57,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456481408] [2022-12-13 02:04:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:57,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:57,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:57,531 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:57,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:57,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:57,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:57,585 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:57,585 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:57,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:57,585 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:57,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:57,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:57,586 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:57,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:57,587 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,587 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:57,587 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:57,587 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:57,587 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,588 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:57,588 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:57,588 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,591 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:57,591 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:57,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:57,591 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,591 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:57,714 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:57,715 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:04:57,715 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:57,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,715 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:57,715 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:57,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2059 [2022-12-13 02:04:57,715 INFO L420 AbstractCegarLoop]: === Iteration 2061 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash -301692557, now seen corresponding path program 1 times [2022-12-13 02:04:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:57,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534127483] [2022-12-13 02:04:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:57,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 02:04:57,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:57,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534127483] [2022-12-13 02:04:57,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534127483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:57,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:57,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211232001] [2022-12-13 02:04:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:57,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:57,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:57,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:57,773 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:57,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:57,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:57,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:57,824 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:57,824 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:57,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:57,824 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:57,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:57,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:57,825 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:57,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:57,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:57,826 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:57,826 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:57,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:57,826 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:57,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:57,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:57,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,829 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:57,829 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:57,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:57,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:57,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:57,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:57,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:57,949 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:57,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:57,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:57,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:57,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2060 [2022-12-13 02:04:57,949 INFO L420 AbstractCegarLoop]: === Iteration 2062 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:57,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -244434255, now seen corresponding path program 1 times [2022-12-13 02:04:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:57,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539900550] [2022-12-13 02:04:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:57,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,005 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 02:04:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539900550] [2022-12-13 02:04:58,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539900550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247050855] [2022-12-13 02:04:58,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:58,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:58,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:58,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:58,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:58,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,050 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:58,050 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:58,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:58,051 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:58,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:58,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:58,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:58,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:58,051 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:58,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:58,052 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:58,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:58,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,052 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,053 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,055 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:58,055 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:58,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:58,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:58,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:58,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:04:58,178 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:58,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:58,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:58,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2061 [2022-12-13 02:04:58,179 INFO L420 AbstractCegarLoop]: === Iteration 2063 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -187175953, now seen corresponding path program 1 times [2022-12-13 02:04:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:58,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888169383] [2022-12-13 02:04:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,237 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 02:04:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888169383] [2022-12-13 02:04:58,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888169383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670629092] [2022-12-13 02:04:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:58,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:58,238 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:58,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:58,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,282 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:58,282 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:58,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:58,282 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:58,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:58,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:58,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:58,283 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:58,284 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:58,284 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:58,284 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,284 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,287 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:58,287 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:58,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:58,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:58,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:58,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:58,407 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:58,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,407 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:58,407 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:58,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2062 [2022-12-13 02:04:58,407 INFO L420 AbstractCegarLoop]: === Iteration 2064 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash -129917651, now seen corresponding path program 1 times [2022-12-13 02:04:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:58,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590724899] [2022-12-13 02:04:58,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:58,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,482 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 02:04:58,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590724899] [2022-12-13 02:04:58,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590724899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571380900] [2022-12-13 02:04:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:58,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:58,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:58,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:58,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:58,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,527 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:58,527 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:58,527 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:58,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:58,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:58,528 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:58,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:58,529 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:58,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:58,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,529 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,529 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,529 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,529 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,532 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:58,532 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:58,532 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,532 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:58,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:58,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:04:58,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:58,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:58,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2063 [2022-12-13 02:04:58,659 INFO L420 AbstractCegarLoop]: === Iteration 2065 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -72659349, now seen corresponding path program 1 times [2022-12-13 02:04:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124726277] [2022-12-13 02:04:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,715 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 02:04:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124726277] [2022-12-13 02:04:58,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124726277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:58,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796696190] [2022-12-13 02:04:58,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:58,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:58,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:58,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:58,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:58,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:58,766 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:58,766 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:58,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:58,767 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:58,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:58,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:58,768 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:58,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:58,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:58,768 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:58,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:58,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:58,769 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:58,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:58,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:58,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,772 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:58,772 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:58,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:58,772 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:58,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:58,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:58,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:04:58,892 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:58,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:58,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2064 [2022-12-13 02:04:58,893 INFO L420 AbstractCegarLoop]: === Iteration 2066 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -15401047, now seen corresponding path program 1 times [2022-12-13 02:04:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:58,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120921088] [2022-12-13 02:04:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:58,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:58,950 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 02:04:58,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120921088] [2022-12-13 02:04:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120921088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908028731] [2022-12-13 02:04:58,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:58,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:58,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:58,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:58,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:58,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:58,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:58,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:58,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:59,002 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:59,002 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:59,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:59,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:59,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:59,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:59,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:59,003 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:59,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:59,004 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:59,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:59,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:59,005 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:59,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:59,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,007 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:59,007 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:59,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:59,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:59,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:59,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:59,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:59,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:59,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:59,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2065 [2022-12-13 02:04:59,125 INFO L420 AbstractCegarLoop]: === Iteration 2067 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:59,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 41857255, now seen corresponding path program 1 times [2022-12-13 02:04:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:59,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487745890] [2022-12-13 02:04:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:59,191 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 02:04:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:59,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487745890] [2022-12-13 02:04:59,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487745890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:59,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:59,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721596925] [2022-12-13 02:04:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:59,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:59,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:59,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:59,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:59,245 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:59,245 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:59,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:59,246 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:59,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:59,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:59,246 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:59,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:59,247 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:59,247 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:59,248 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:59,248 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:59,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:59,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,250 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:59,251 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:59,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:59,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:59,368 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:59,369 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:59,369 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:59,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,369 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:59,369 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2066 [2022-12-13 02:04:59,370 INFO L420 AbstractCegarLoop]: === Iteration 2068 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:59,370 INFO L85 PathProgramCache]: Analyzing trace with hash 99115557, now seen corresponding path program 1 times [2022-12-13 02:04:59,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:59,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824659677] [2022-12-13 02:04:59,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:59,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:59,432 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 02:04:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:59,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824659677] [2022-12-13 02:04:59,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824659677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:59,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:59,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739466891] [2022-12-13 02:04:59,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:59,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:59,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:59,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:59,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:59,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:59,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:59,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:59,484 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:59,484 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:59,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:59,485 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:59,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:59,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:59,486 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:59,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:59,487 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:59,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:59,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:59,487 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:59,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:59,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,490 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:59,490 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:59,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:59,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:59,611 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:59,612 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:04:59,612 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:59,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:59,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:59,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2067 [2022-12-13 02:04:59,613 INFO L420 AbstractCegarLoop]: === Iteration 2069 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash 156373859, now seen corresponding path program 1 times [2022-12-13 02:04:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:59,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518129147] [2022-12-13 02:04:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:59,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:59,672 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 02:04:59,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:59,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518129147] [2022-12-13 02:04:59,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518129147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:59,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:59,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907094602] [2022-12-13 02:04:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:59,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:59,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:59,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:59,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:59,724 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:59,724 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:04:59,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:59,724 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:59,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:59,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:59,725 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:59,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:59,726 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,726 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:59,726 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:59,726 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:59,726 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:59,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:59,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,729 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:59,729 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:04:59,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:59,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:04:59,846 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:04:59,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:04:59,848 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:04:59,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,848 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:04:59,848 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:04:59,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2068 [2022-12-13 02:04:59,848 INFO L420 AbstractCegarLoop]: === Iteration 2070 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:04:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:04:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 213632161, now seen corresponding path program 1 times [2022-12-13 02:04:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:04:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100777295] [2022-12-13 02:04:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:04:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:04:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:04:59,920 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 02:04:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:04:59,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100777295] [2022-12-13 02:04:59,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100777295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:04:59,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:04:59,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:04:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614562916] [2022-12-13 02:04:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:04:59,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:04:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:04:59,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:04:59,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:04:59,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:04:59,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:04:59,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:04:59,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:04:59,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:04:59,972 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:04:59,972 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:04:59,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:04:59,972 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:04:59,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:04:59,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:04:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:04:59,973 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:04:59,973 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:04:59,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:04:59,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:04:59,974 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,974 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:04:59,974 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:04:59,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:04:59,974 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,974 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:04:59,974 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:04:59,974 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:04:59,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,977 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:04:59,977 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:04:59,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:04:59,977 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:04:59,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:00,096 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:00,097 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:00,097 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:00,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,097 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:00,097 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:00,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2069 [2022-12-13 02:05:00,097 INFO L420 AbstractCegarLoop]: === Iteration 2071 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:00,097 INFO L85 PathProgramCache]: Analyzing trace with hash 270890463, now seen corresponding path program 1 times [2022-12-13 02:05:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:00,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99261538] [2022-12-13 02:05:00,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:00,155 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 02:05:00,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:00,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99261538] [2022-12-13 02:05:00,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99261538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:00,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:00,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:00,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678089851] [2022-12-13 02:05:00,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:00,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:00,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:00,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:00,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:00,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:00,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:00,206 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:00,206 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:00,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:00,207 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:00,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:00,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:00,208 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:00,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:00,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:00,209 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:00,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:00,209 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:00,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:00,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:00,212 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:00,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:00,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:00,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:00,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:00,331 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:00,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:00,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2070 [2022-12-13 02:05:00,331 INFO L420 AbstractCegarLoop]: === Iteration 2072 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 328148765, now seen corresponding path program 1 times [2022-12-13 02:05:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259958063] [2022-12-13 02:05:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:00,389 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 02:05:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:00,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259958063] [2022-12-13 02:05:00,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259958063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:00,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:00,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848991307] [2022-12-13 02:05:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:00,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:00,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:00,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:00,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:00,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:00,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:00,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:00,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:00,449 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:00,449 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:00,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:00,450 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:00,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:00,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:00,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:00,450 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:00,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:00,451 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:00,451 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:00,451 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:00,452 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:00,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:00,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,454 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:00,455 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:00,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:00,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:00,578 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:00,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:05:00,579 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:00,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:00,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2071 [2022-12-13 02:05:00,579 INFO L420 AbstractCegarLoop]: === Iteration 2073 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash 385407067, now seen corresponding path program 1 times [2022-12-13 02:05:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:00,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301780613] [2022-12-13 02:05:00,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:00,638 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 02:05:00,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:00,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301780613] [2022-12-13 02:05:00,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301780613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:00,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:00,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927751505] [2022-12-13 02:05:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:00,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:00,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:00,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:00,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:00,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:00,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:00,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:00,691 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:00,692 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:00,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:00,692 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:00,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:00,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:00,693 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:00,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:00,694 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:00,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:00,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:00,694 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:00,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:00,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,697 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:00,697 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:00,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:00,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:00,817 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:00,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:00,818 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:00,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:00,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:00,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2072 [2022-12-13 02:05:00,818 INFO L420 AbstractCegarLoop]: === Iteration 2074 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:00,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:00,818 INFO L85 PathProgramCache]: Analyzing trace with hash 442665369, now seen corresponding path program 1 times [2022-12-13 02:05:00,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:00,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855849391] [2022-12-13 02:05:00,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:00,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:00,876 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 02:05:00,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855849391] [2022-12-13 02:05:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855849391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70645699] [2022-12-13 02:05:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:00,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:00,877 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:00,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:00,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:00,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:00,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:00,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:00,929 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:00,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:00,930 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:00,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:00,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:00,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:00,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:00,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:00,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:00,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:00,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:00,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:00,932 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:00,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:00,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:00,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,935 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:00,935 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:00,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:00,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:00,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:01,056 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:01,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:05:01,057 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:01,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:01,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:01,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2073 [2022-12-13 02:05:01,058 INFO L420 AbstractCegarLoop]: === Iteration 2075 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:01,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash 499923671, now seen corresponding path program 1 times [2022-12-13 02:05:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993735481] [2022-12-13 02:05:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:01,115 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 02:05:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:01,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993735481] [2022-12-13 02:05:01,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993735481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:01,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:01,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927513524] [2022-12-13 02:05:01,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:01,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:01,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:01,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:01,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:01,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:01,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:01,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:01,166 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:01,166 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:01,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:01,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:01,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:01,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:01,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:01,168 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:01,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:01,168 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:01,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:01,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:01,169 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:01,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:01,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,172 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:01,172 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:01,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:01,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:01,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:01,291 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:01,291 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:01,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:01,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:01,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2074 [2022-12-13 02:05:01,292 INFO L420 AbstractCegarLoop]: === Iteration 2076 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 557181973, now seen corresponding path program 1 times [2022-12-13 02:05:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943020904] [2022-12-13 02:05:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:01,350 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 02:05:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:01,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943020904] [2022-12-13 02:05:01,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943020904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:01,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:01,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:01,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248194101] [2022-12-13 02:05:01,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:01,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:01,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:01,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:01,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:01,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:01,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:01,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:01,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:01,395 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:01,395 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:01,396 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:01,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:01,397 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:01,397 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:01,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:01,408 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:01,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:01,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:01,408 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:01,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:01,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,411 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:01,411 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:01,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:01,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:01,534 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:01,535 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:05:01,535 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:01,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,536 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:01,536 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:01,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2075 [2022-12-13 02:05:01,536 INFO L420 AbstractCegarLoop]: === Iteration 2077 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 614440275, now seen corresponding path program 1 times [2022-12-13 02:05:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:01,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971665557] [2022-12-13 02:05:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:01,597 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 02:05:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:01,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971665557] [2022-12-13 02:05:01,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971665557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:01,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:01,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:01,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467462822] [2022-12-13 02:05:01,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:01,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:01,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:01,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:01,598 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:01,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:01,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:01,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:01,642 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:01,642 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:01,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:01,642 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:01,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:01,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:01,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:01,643 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:01,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:01,644 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:01,644 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:01,644 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:01,644 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,644 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:01,644 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:01,644 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,647 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:01,647 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:01,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:01,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,647 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:01,768 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:01,769 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:05:01,769 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:01,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,769 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:01,769 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:01,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2076 [2022-12-13 02:05:01,769 INFO L420 AbstractCegarLoop]: === Iteration 2078 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:01,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:01,770 INFO L85 PathProgramCache]: Analyzing trace with hash 671698577, now seen corresponding path program 1 times [2022-12-13 02:05:01,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:01,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31039825] [2022-12-13 02:05:01,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:01,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:01,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 02:05:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:01,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31039825] [2022-12-13 02:05:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31039825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570416226] [2022-12-13 02:05:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:01,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:01,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:01,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:01,827 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:01,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:01,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:01,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:01,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:01,880 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:01,881 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:01,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:01,881 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:01,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:01,882 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:01,882 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:01,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:01,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:01,883 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,883 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:01,883 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:01,883 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:01,883 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,884 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:01,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:01,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:01,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,887 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:01,887 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:01,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:01,888 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:01,888 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:02,018 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:02,019 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:02,019 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:02,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:02,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:02,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2077 [2022-12-13 02:05:02,019 INFO L420 AbstractCegarLoop]: === Iteration 2079 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:02,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 728956879, now seen corresponding path program 1 times [2022-12-13 02:05:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:02,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665680140] [2022-12-13 02:05:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:02,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:02,089 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 02:05:02,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:02,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665680140] [2022-12-13 02:05:02,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665680140] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:02,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:02,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258326575] [2022-12-13 02:05:02,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:02,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:02,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:02,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:02,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:02,090 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:02,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:02,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:02,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:02,153 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:02,153 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:02,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:02,153 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:02,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:02,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:02,154 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:02,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:02,155 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:02,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:02,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:02,155 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,155 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:02,155 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:02,155 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,158 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:02,159 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:02,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:02,292 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:02,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:02,294 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:02,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:02,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:02,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2078 [2022-12-13 02:05:02,294 INFO L420 AbstractCegarLoop]: === Iteration 2080 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash 786215181, now seen corresponding path program 1 times [2022-12-13 02:05:02,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:02,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704516797] [2022-12-13 02:05:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:02,361 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 02:05:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:02,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704516797] [2022-12-13 02:05:02,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704516797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:02,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:02,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188136748] [2022-12-13 02:05:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:02,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:02,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:02,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:02,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:02,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:02,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:02,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:02,414 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:02,414 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:02,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:02,415 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:02,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:02,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:02,415 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:02,416 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:02,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:02,416 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,416 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:02,417 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:02,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:02,417 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,417 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:02,417 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:02,417 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,419 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:02,420 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:02,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:02,420 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,420 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:02,555 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:02,556 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:02,556 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:02,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:02,557 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:02,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2079 [2022-12-13 02:05:02,557 INFO L420 AbstractCegarLoop]: === Iteration 2081 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:02,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash 843473483, now seen corresponding path program 1 times [2022-12-13 02:05:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:02,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313569475] [2022-12-13 02:05:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:02,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313569475] [2022-12-13 02:05:02,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313569475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:02,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:02,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:02,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261714720] [2022-12-13 02:05:02,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:02,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:02,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:02,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:02,629 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:02,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:02,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:02,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:02,682 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:02,682 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:02,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:02,683 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:02,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:02,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:02,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:02,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:02,684 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:02,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:02,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:02,684 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:02,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:02,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,687 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:02,687 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:02,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:02,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:02,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:02,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:02,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:02,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,822 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:02,822 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:02,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2080 [2022-12-13 02:05:02,822 INFO L420 AbstractCegarLoop]: === Iteration 2082 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash 900731785, now seen corresponding path program 1 times [2022-12-13 02:05:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:02,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242133820] [2022-12-13 02:05:02,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:02,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:02,898 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 02:05:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242133820] [2022-12-13 02:05:02,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242133820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:02,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:02,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763142949] [2022-12-13 02:05:02,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:02,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:02,899 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:02,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:02,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:02,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:02,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:02,961 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:02,961 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:02,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:02,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:02,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:02,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:02,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:02,962 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:02,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:02,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:02,963 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:02,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:02,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:02,963 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,963 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:02,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:02,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:02,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,966 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:02,966 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:02,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:02,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:02,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:03,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:03,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:03,100 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:03,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:03,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:03,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2081 [2022-12-13 02:05:03,100 INFO L420 AbstractCegarLoop]: === Iteration 2083 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash 957990087, now seen corresponding path program 1 times [2022-12-13 02:05:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:03,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438899854] [2022-12-13 02:05:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:03,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 02:05:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:03,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438899854] [2022-12-13 02:05:03,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438899854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:03,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:03,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:03,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827558830] [2022-12-13 02:05:03,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:03,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:03,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:03,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:03,181 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:03,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:03,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:03,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:03,242 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:03,242 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:03,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:03,243 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:03,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:03,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:03,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:03,243 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:03,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:03,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:03,244 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:03,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:03,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:03,244 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:03,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:03,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:03,247 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:03,247 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:03,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:03,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:03,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:03,382 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:03,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:03,383 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:03,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:03,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:03,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2082 [2022-12-13 02:05:03,383 INFO L420 AbstractCegarLoop]: === Iteration 2084 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:03,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1015248389, now seen corresponding path program 1 times [2022-12-13 02:05:03,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:03,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666807547] [2022-12-13 02:05:03,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:03,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:03,446 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 02:05:03,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:03,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666807547] [2022-12-13 02:05:03,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666807547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:03,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:03,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:03,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997361206] [2022-12-13 02:05:03,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:03,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:03,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:03,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:03,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:03,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:03,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:03,502 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:03,502 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:03,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:03,503 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:03,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:03,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:03,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:03,504 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:03,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:03,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:03,504 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,504 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:03,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:03,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:03,505 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:03,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:03,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:03,508 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:03,508 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:03,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:03,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:03,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:03,625 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:03,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:03,626 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:03,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,626 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:03,626 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:03,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2083 [2022-12-13 02:05:03,626 INFO L420 AbstractCegarLoop]: === Iteration 2085 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:03,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:03,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1072506691, now seen corresponding path program 1 times [2022-12-13 02:05:03,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:03,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840415246] [2022-12-13 02:05:03,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:03,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:03,691 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 02:05:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840415246] [2022-12-13 02:05:03,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840415246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:03,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:03,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350964054] [2022-12-13 02:05:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:03,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:03,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:03,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:03,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:03,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:03,746 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:03,746 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:03,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:03,747 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:03,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:03,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:03,747 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:03,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:03,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:03,748 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:03,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:03,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:03,748 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:03,749 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:03,749 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:03,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:03,751 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:03,751 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:03,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:03,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:03,752 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:03,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:03,885 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:03,885 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:03,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,885 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:03,885 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:03,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2084 [2022-12-13 02:05:03,885 INFO L420 AbstractCegarLoop]: === Iteration 2086 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:03,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1129764993, now seen corresponding path program 1 times [2022-12-13 02:05:03,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:03,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748127101] [2022-12-13 02:05:03,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:03,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:03,950 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 02:05:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:03,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748127101] [2022-12-13 02:05:03,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748127101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:03,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:03,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988402503] [2022-12-13 02:05:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:03,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:03,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:03,951 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:03,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:03,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:03,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:03,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:04,002 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:04,003 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:04,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:04,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:04,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:04,004 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:04,004 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:04,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:04,005 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,005 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:04,005 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:04,005 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:04,005 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:04,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:04,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,008 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:04,008 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:04,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:04,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:04,139 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:04,140 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:05:04,140 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:04,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,140 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:04,140 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:04,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2085 [2022-12-13 02:05:04,140 INFO L420 AbstractCegarLoop]: === Iteration 2087 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:04,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1187023295, now seen corresponding path program 1 times [2022-12-13 02:05:04,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:04,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218291141] [2022-12-13 02:05:04,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:04,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:04,202 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 02:05:04,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:04,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218291141] [2022-12-13 02:05:04,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218291141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:04,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:04,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215887633] [2022-12-13 02:05:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:04,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:04,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:04,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:04,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:04,202 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:04,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:04,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:04,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:04,247 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:04,247 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:04,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:04,247 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:04,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:04,248 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:04,248 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:04,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:04,248 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:04,249 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:04,249 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:04,249 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,249 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:04,249 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:04,249 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,252 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:04,252 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:04,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:04,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:04,367 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:04,368 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:04,368 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:04,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:04,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:04,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2086 [2022-12-13 02:05:04,368 INFO L420 AbstractCegarLoop]: === Iteration 2088 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:04,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1244281597, now seen corresponding path program 1 times [2022-12-13 02:05:04,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:04,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736660874] [2022-12-13 02:05:04,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:04,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:04,425 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 02:05:04,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:04,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736660874] [2022-12-13 02:05:04,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736660874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:04,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:04,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341127111] [2022-12-13 02:05:04,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:04,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:04,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:04,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:04,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:04,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:04,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:04,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:04,475 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:04,476 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:04,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:04,476 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:04,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:04,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:04,477 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:04,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:04,477 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:04,478 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:04,478 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:04,478 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:04,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:04,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,481 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:04,481 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:04,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:04,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:04,603 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:04,604 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:04,604 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:04,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,604 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:04,604 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2087 [2022-12-13 02:05:04,604 INFO L420 AbstractCegarLoop]: === Iteration 2089 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1301539899, now seen corresponding path program 1 times [2022-12-13 02:05:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:04,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811981879] [2022-12-13 02:05:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:04,672 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 02:05:04,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:04,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811981879] [2022-12-13 02:05:04,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811981879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:04,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:04,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:04,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539741667] [2022-12-13 02:05:04,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:04,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:04,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:04,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:04,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:04,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:04,715 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:04,715 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:04,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:04,716 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:04,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:04,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:04,716 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:04,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:04,717 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,717 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:04,717 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:04,717 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:04,718 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,718 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:04,718 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:04,718 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,720 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:04,720 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:04,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:04,721 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,721 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:04,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:04,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:04,837 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:04,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:04,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:04,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2088 [2022-12-13 02:05:04,837 INFO L420 AbstractCegarLoop]: === Iteration 2090 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:04,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:04,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1358798201, now seen corresponding path program 1 times [2022-12-13 02:05:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136955592] [2022-12-13 02:05:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:04,892 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 02:05:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136955592] [2022-12-13 02:05:04,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136955592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:04,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:04,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:04,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359062405] [2022-12-13 02:05:04,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:04,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:04,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:04,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:04,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:04,893 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:04,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:04,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:04,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:04,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:04,936 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:04,936 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:04,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:04,937 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:04,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:04,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:04,937 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:04,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:04,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:04,938 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,938 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:04,938 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:04,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:04,939 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:04,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:04,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:04,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,941 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:04,941 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:04,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:04,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:04,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:05,056 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:05,057 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:05,057 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:05,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,057 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:05,057 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:05,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2089 [2022-12-13 02:05:05,057 INFO L420 AbstractCegarLoop]: === Iteration 2091 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:05,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:05,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1416056503, now seen corresponding path program 1 times [2022-12-13 02:05:05,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:05,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424169716] [2022-12-13 02:05:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:05,113 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 02:05:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:05,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424169716] [2022-12-13 02:05:05,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424169716] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:05,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:05,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881615762] [2022-12-13 02:05:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:05,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:05,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:05,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:05,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:05,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:05,156 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:05,156 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:05,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:05,156 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:05,156 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:05,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:05,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:05,157 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:05,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:05,157 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:05,158 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:05,158 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:05,158 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:05,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:05,158 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,160 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:05,160 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:05,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:05,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:05,276 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:05,277 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:05,277 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:05,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:05,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:05,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2090 [2022-12-13 02:05:05,278 INFO L420 AbstractCegarLoop]: === Iteration 2092 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:05,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:05,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1473314805, now seen corresponding path program 1 times [2022-12-13 02:05:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:05,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378295396] [2022-12-13 02:05:05,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:05,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:05,334 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 02:05:05,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:05,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378295396] [2022-12-13 02:05:05,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378295396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:05,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:05,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:05,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079855526] [2022-12-13 02:05:05,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:05,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:05,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:05,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:05,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:05,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:05,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:05,378 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:05,379 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:05,379 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:05,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:05,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:05,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:05,380 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:05,380 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:05,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:05,380 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,381 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:05,381 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:05,381 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:05,381 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,381 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:05,381 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:05,381 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,384 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:05,384 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:05,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:05,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:05,504 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:05,505 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:05,505 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:05,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,505 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:05,505 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:05,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2091 [2022-12-13 02:05:05,505 INFO L420 AbstractCegarLoop]: === Iteration 2093 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:05,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1530573107, now seen corresponding path program 1 times [2022-12-13 02:05:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:05,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334208082] [2022-12-13 02:05:05,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:05,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:05,561 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 02:05:05,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:05,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334208082] [2022-12-13 02:05:05,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334208082] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:05,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:05,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:05,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092759187] [2022-12-13 02:05:05,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:05,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:05,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:05,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:05,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:05,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:05,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:05,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:05,605 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:05,605 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:05,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:05,606 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:05,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:05,606 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:05,606 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:05,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:05,607 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,607 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:05,607 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:05,607 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:05,607 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:05,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:05,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,610 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:05,610 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:05,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:05,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:05,728 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:05,729 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:05,729 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:05,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,729 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:05,729 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:05,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2092 [2022-12-13 02:05:05,729 INFO L420 AbstractCegarLoop]: === Iteration 2094 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1587831409, now seen corresponding path program 1 times [2022-12-13 02:05:05,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:05,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771562952] [2022-12-13 02:05:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:05,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:05,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 02:05:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771562952] [2022-12-13 02:05:05,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771562952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:05,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:05,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:05,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724370726] [2022-12-13 02:05:05,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:05,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:05,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:05,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:05,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:05,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:05,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:05,836 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:05,836 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:05,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:05,837 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:05,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:05,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:05,838 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:05,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:05,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:05,838 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:05,839 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:05,839 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:05,839 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,839 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:05,839 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:05,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:05,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,842 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:05,842 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:05,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:05,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:05,842 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:05,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:05,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:05:05,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:05,988 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:05,988 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:05,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2093 [2022-12-13 02:05:05,988 INFO L420 AbstractCegarLoop]: === Iteration 2095 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1645089711, now seen corresponding path program 1 times [2022-12-13 02:05:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:05,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116321335] [2022-12-13 02:05:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:05,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:06,077 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 02:05:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:06,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116321335] [2022-12-13 02:05:06,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116321335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:06,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:06,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873050298] [2022-12-13 02:05:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:06,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:06,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:06,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:06,078 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:06,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:06,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:06,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:06,138 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:06,138 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:06,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:06,138 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:06,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:06,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:06,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:06,139 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:06,139 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:06,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:06,140 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:06,140 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:06,140 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:06,140 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:06,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:06,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,143 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:06,143 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:06,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:06,143 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,143 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:06,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:06,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:05:06,273 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:06,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:06,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:06,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2094 [2022-12-13 02:05:06,274 INFO L420 AbstractCegarLoop]: === Iteration 2096 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1702348013, now seen corresponding path program 1 times [2022-12-13 02:05:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:06,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814833096] [2022-12-13 02:05:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:06,338 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 02:05:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:06,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814833096] [2022-12-13 02:05:06,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814833096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:06,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:06,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:06,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812251301] [2022-12-13 02:05:06,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:06,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:06,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:06,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:06,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:06,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:06,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:06,386 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:06,386 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:06,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:06,386 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:06,387 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:06,387 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:06,387 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:06,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:06,388 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:06,389 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:06,389 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:06,389 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,389 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:06,389 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:06,389 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,392 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:06,393 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:06,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:06,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:06,530 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:06,531 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:06,531 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:06,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:06,531 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:06,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2095 [2022-12-13 02:05:06,531 INFO L420 AbstractCegarLoop]: === Iteration 2097 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:06,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1759606315, now seen corresponding path program 1 times [2022-12-13 02:05:06,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:06,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706497327] [2022-12-13 02:05:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:06,601 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 02:05:06,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:06,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706497327] [2022-12-13 02:05:06,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706497327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:06,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:06,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498081213] [2022-12-13 02:05:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:06,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:06,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:06,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:06,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:06,657 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:06,657 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:06,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:06,657 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:06,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:06,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:06,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:06,658 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:06,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:06,659 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:06,659 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:06,659 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:06,659 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,659 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:06,659 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:06,659 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,662 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:06,662 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:06,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:06,662 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,662 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:06,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:06,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:05:06,791 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:06,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:06,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:06,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2096 [2022-12-13 02:05:06,791 INFO L420 AbstractCegarLoop]: === Iteration 2098 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:06,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:06,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1816864617, now seen corresponding path program 1 times [2022-12-13 02:05:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:06,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336936912] [2022-12-13 02:05:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:06,853 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 02:05:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336936912] [2022-12-13 02:05:06,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336936912] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:06,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:06,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299302383] [2022-12-13 02:05:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:06,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:06,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:06,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:06,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:06,854 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:06,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:06,903 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:06,903 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:06,904 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:06,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:06,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:06,904 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:06,904 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:06,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:06,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:06,905 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,905 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:06,905 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:06,905 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:06,905 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:06,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:06,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:06,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,908 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:06,908 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:06,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:06,908 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:06,908 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:07,023 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:07,024 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:07,024 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:07,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,024 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:07,024 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:07,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2097 [2022-12-13 02:05:07,024 INFO L420 AbstractCegarLoop]: === Iteration 2099 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1874122919, now seen corresponding path program 1 times [2022-12-13 02:05:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:07,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736926886] [2022-12-13 02:05:07,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:07,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:07,082 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 02:05:07,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:07,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736926886] [2022-12-13 02:05:07,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736926886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:07,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:07,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:07,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812052365] [2022-12-13 02:05:07,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:07,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:07,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:07,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:07,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:07,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:07,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:07,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:07,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:07,126 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:07,126 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:07,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:07,127 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:07,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:07,127 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:07,127 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:07,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:07,128 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,128 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:07,128 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:07,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:07,129 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:07,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:07,129 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,131 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:07,131 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:07,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:07,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:07,249 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:07,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:07,249 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:07,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,250 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:07,250 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:07,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2098 [2022-12-13 02:05:07,250 INFO L420 AbstractCegarLoop]: === Iteration 2100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1931381221, now seen corresponding path program 1 times [2022-12-13 02:05:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:07,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366855014] [2022-12-13 02:05:07,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:07,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:07,306 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 02:05:07,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:07,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366855014] [2022-12-13 02:05:07,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366855014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:07,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:07,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:07,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273417913] [2022-12-13 02:05:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:07,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:07,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:07,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:07,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:07,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:07,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:07,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:07,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:07,357 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:07,357 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:07,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:07,358 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:07,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:07,358 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:07,358 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:07,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:07,359 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,359 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:07,359 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:07,359 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:07,359 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,359 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:07,359 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:07,359 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,362 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:07,362 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:07,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:07,362 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,362 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:07,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:07,477 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:07,477 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:07,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,477 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:07,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:07,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2099 [2022-12-13 02:05:07,477 INFO L420 AbstractCegarLoop]: === Iteration 2101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1988639523, now seen corresponding path program 1 times [2022-12-13 02:05:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:07,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234310340] [2022-12-13 02:05:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:07,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:07,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 02:05:07,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:07,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234310340] [2022-12-13 02:05:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234310340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:07,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:07,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131801617] [2022-12-13 02:05:07,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:07,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:07,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:07,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:07,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:07,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:07,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:07,584 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:07,584 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:07,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:07,585 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:07,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:07,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:07,585 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:07,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:07,596 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,596 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:07,596 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:07,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:07,596 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:07,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:07,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,599 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:07,599 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:07,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:07,600 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:07,713 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:07,714 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:07,714 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:07,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:07,714 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:07,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2100 [2022-12-13 02:05:07,714 INFO L420 AbstractCegarLoop]: === Iteration 2102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:07,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2045897825, now seen corresponding path program 1 times [2022-12-13 02:05:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:07,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304930210] [2022-12-13 02:05:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:07,778 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 02:05:07,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:07,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304930210] [2022-12-13 02:05:07,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304930210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:07,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:07,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:07,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874063643] [2022-12-13 02:05:07,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:07,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:07,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:07,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:07,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:07,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:07,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:07,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:07,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:07,823 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:07,823 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:07,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:07,823 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:07,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:07,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:07,824 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:07,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:07,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:07,825 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:07,825 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:07,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:07,825 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:07,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:07,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:07,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,828 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:07,828 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:07,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:07,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:07,942 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:07,943 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:07,943 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:07,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,943 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:07,943 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2101 [2022-12-13 02:05:07,943 INFO L420 AbstractCegarLoop]: === Iteration 2103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:07,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:07,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2103156127, now seen corresponding path program 1 times [2022-12-13 02:05:07,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101559937] [2022-12-13 02:05:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:07,998 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 02:05:07,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:07,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101559937] [2022-12-13 02:05:07,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101559937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:07,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:07,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:07,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558025790] [2022-12-13 02:05:07,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:07,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:07,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:07,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:07,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:07,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:07,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:07,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:07,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:07,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:08,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:08,049 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:08,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:08,049 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:08,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:08,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:08,050 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:08,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:08,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:08,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:08,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:08,051 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:08,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:08,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,054 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:08,054 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:08,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:08,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:08,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:08,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:08,169 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:08,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:08,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:08,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2102 [2022-12-13 02:05:08,170 INFO L420 AbstractCegarLoop]: === Iteration 2104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:08,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:08,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2134552867, now seen corresponding path program 1 times [2022-12-13 02:05:08,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:08,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463273871] [2022-12-13 02:05:08,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:08,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:08,225 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 02:05:08,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:08,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463273871] [2022-12-13 02:05:08,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463273871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:08,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:08,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:08,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274816590] [2022-12-13 02:05:08,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:08,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:08,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:08,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:08,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:08,226 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:08,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:08,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:08,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:08,276 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:08,276 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:08,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:08,276 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:08,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:08,277 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:08,277 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:08,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:08,278 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,278 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:08,278 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:08,278 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:08,278 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,278 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:08,278 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:08,278 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,281 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:08,281 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:08,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:08,281 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,281 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:08,394 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:08,395 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:05:08,395 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:08,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,396 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:08,396 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:08,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2103 [2022-12-13 02:05:08,396 INFO L420 AbstractCegarLoop]: === Iteration 2105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2077294565, now seen corresponding path program 1 times [2022-12-13 02:05:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:08,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187157838] [2022-12-13 02:05:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:08,452 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 02:05:08,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187157838] [2022-12-13 02:05:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187157838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:08,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:08,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101080583] [2022-12-13 02:05:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:08,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:08,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:08,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:08,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:08,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:08,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:08,496 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:08,496 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:08,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:08,496 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:08,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:08,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:08,497 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:08,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:08,498 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:08,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:08,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:08,498 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:08,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:08,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,501 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:08,501 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:08,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:08,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:08,615 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:08,616 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:08,616 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,616 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:08,616 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:08,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2104 [2022-12-13 02:05:08,616 INFO L420 AbstractCegarLoop]: === Iteration 2106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2020036263, now seen corresponding path program 1 times [2022-12-13 02:05:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:08,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884163624] [2022-12-13 02:05:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:08,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:08,673 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 02:05:08,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:08,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884163624] [2022-12-13 02:05:08,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884163624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:08,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:08,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:08,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032481168] [2022-12-13 02:05:08,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:08,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:08,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:08,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:08,674 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:08,674 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,674 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:08,674 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:08,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:08,720 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:08,721 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:08,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:08,721 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:08,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:08,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:08,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:08,722 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:08,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:08,723 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:08,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:08,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:08,723 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:08,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:08,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,726 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:08,726 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:08,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:08,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:08,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:08,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:05:08,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:08,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:08,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:08,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2105 [2022-12-13 02:05:08,854 INFO L420 AbstractCegarLoop]: === Iteration 2107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1962777961, now seen corresponding path program 1 times [2022-12-13 02:05:08,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:08,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261344737] [2022-12-13 02:05:08,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:08,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:08,910 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 02:05:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:08,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261344737] [2022-12-13 02:05:08,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261344737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:08,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:08,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256105245] [2022-12-13 02:05:08,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:08,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:08,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:08,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:08,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:08,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:08,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:08,957 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:08,957 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:08,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:08,958 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:08,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:08,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:08,958 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:08,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:08,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:08,959 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:08,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:08,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:08,959 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:08,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:08,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:08,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,962 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:08,962 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:08,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:08,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:08,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:09,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:09,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:09,095 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:09,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:09,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:09,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2106 [2022-12-13 02:05:09,096 INFO L420 AbstractCegarLoop]: === Iteration 2108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:09,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:09,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1905519659, now seen corresponding path program 1 times [2022-12-13 02:05:09,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:09,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930934890] [2022-12-13 02:05:09,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:09,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:09,152 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 02:05:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930934890] [2022-12-13 02:05:09,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930934890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:09,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:09,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270577729] [2022-12-13 02:05:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:09,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:09,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:09,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:09,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:09,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:09,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:09,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:09,196 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:09,196 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:09,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:09,196 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:09,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:09,197 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:09,197 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:09,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:09,198 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,198 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:09,198 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:09,198 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:09,198 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,198 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:09,198 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:09,198 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,201 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:09,201 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:09,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:09,201 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,201 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:09,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:09,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:09,318 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:09,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:09,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:09,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2107 [2022-12-13 02:05:09,318 INFO L420 AbstractCegarLoop]: === Iteration 2109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:09,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1848261357, now seen corresponding path program 1 times [2022-12-13 02:05:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:09,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523028655] [2022-12-13 02:05:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:09,375 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 02:05:09,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:09,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523028655] [2022-12-13 02:05:09,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523028655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:09,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:09,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428912896] [2022-12-13 02:05:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:09,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:09,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:09,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:09,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:09,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:09,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:09,432 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:09,432 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:09,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:09,432 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:09,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:09,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:09,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:09,433 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:09,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:09,434 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,434 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:09,434 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:09,434 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:09,434 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,434 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:09,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:09,434 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:09,437 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:09,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:09,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:09,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:09,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:09,553 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:09,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:09,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:09,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2108 [2022-12-13 02:05:09,554 INFO L420 AbstractCegarLoop]: === Iteration 2110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:09,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1791003055, now seen corresponding path program 1 times [2022-12-13 02:05:09,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:09,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492491001] [2022-12-13 02:05:09,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:09,622 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 02:05:09,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:09,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492491001] [2022-12-13 02:05:09,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492491001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:09,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:09,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:09,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875307018] [2022-12-13 02:05:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:09,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:09,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:09,623 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:09,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:09,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:09,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:09,675 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:09,675 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:09,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:09,676 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:09,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:09,676 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:09,677 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:09,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:09,677 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,677 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:09,677 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:09,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:09,678 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:09,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:09,678 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,680 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:09,681 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:09,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:09,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:09,814 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:09,815 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:09,815 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:09,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,815 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:09,815 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:09,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2109 [2022-12-13 02:05:09,816 INFO L420 AbstractCegarLoop]: === Iteration 2111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1733744753, now seen corresponding path program 1 times [2022-12-13 02:05:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317933948] [2022-12-13 02:05:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:09,892 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 02:05:09,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:09,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317933948] [2022-12-13 02:05:09,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317933948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:09,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:09,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459155273] [2022-12-13 02:05:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:09,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:09,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:09,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:09,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:09,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:09,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:09,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:09,944 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:09,944 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:09,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:09,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:09,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:09,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:09,945 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:09,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:09,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:09,946 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:09,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:09,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:09,946 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:09,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:09,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:09,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,950 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:09,950 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:09,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:09,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:09,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:10,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:10,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:05:10,081 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:10,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:10,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:10,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2110 [2022-12-13 02:05:10,081 INFO L420 AbstractCegarLoop]: === Iteration 2112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:10,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1676486451, now seen corresponding path program 1 times [2022-12-13 02:05:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:10,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022008967] [2022-12-13 02:05:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:10,155 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 02:05:10,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:10,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022008967] [2022-12-13 02:05:10,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022008967] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:10,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:10,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:10,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4854446] [2022-12-13 02:05:10,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:10,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:10,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:10,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:10,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:10,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:10,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:10,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:10,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:10,207 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:10,207 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:10,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:10,207 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:10,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:10,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:10,208 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:10,208 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:10,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:10,209 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:10,209 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:10,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:10,209 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:10,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:10,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,213 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:10,213 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:10,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:10,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:10,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:10,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:10,347 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:10,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:10,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:10,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2111 [2022-12-13 02:05:10,347 INFO L420 AbstractCegarLoop]: === Iteration 2113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1619228149, now seen corresponding path program 1 times [2022-12-13 02:05:10,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:10,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784395191] [2022-12-13 02:05:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:10,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:10,410 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 02:05:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:10,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784395191] [2022-12-13 02:05:10,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784395191] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:10,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:10,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683460151] [2022-12-13 02:05:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:10,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:10,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:10,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:10,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:10,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:10,460 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:10,460 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:10,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:10,460 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:10,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:10,461 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:10,461 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:10,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:10,462 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:10,462 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:10,462 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:10,462 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:10,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:10,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:10,467 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:10,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:10,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:10,601 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:10,602 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:10,602 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:10,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,603 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:10,603 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:10,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2112 [2022-12-13 02:05:10,603 INFO L420 AbstractCegarLoop]: === Iteration 2114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:10,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1561969847, now seen corresponding path program 1 times [2022-12-13 02:05:10,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:10,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715867577] [2022-12-13 02:05:10,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:10,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:10,690 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 02:05:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715867577] [2022-12-13 02:05:10,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715867577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:10,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:10,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:10,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010820054] [2022-12-13 02:05:10,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:10,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:10,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:10,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:10,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:10,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:10,741 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:10,742 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:10,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:10,742 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:10,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:10,743 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:10,743 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:10,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:10,744 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,744 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:10,744 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:10,744 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:10,744 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,744 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:10,744 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:10,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,747 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:10,747 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:10,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:10,747 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,747 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:10,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:10,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:10,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:10,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:10,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:10,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2113 [2022-12-13 02:05:10,864 INFO L420 AbstractCegarLoop]: === Iteration 2115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:10,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1504711545, now seen corresponding path program 1 times [2022-12-13 02:05:10,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:10,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110625301] [2022-12-13 02:05:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:10,930 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 02:05:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110625301] [2022-12-13 02:05:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110625301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:10,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:10,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:10,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8133879] [2022-12-13 02:05:10,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:10,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:10,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:10,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:10,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:10,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:10,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:10,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:10,984 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:10,984 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:10,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:10,985 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:10,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:10,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:10,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:10,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:10,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:10,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:10,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:10,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:10,986 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,986 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:10,986 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:10,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,989 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:10,989 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:10,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:10,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:10,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:11,105 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:11,106 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:11,106 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:11,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,106 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:11,106 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:11,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2114 [2022-12-13 02:05:11,106 INFO L420 AbstractCegarLoop]: === Iteration 2116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:11,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1447453243, now seen corresponding path program 1 times [2022-12-13 02:05:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:11,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096106685] [2022-12-13 02:05:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:11,162 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 02:05:11,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096106685] [2022-12-13 02:05:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096106685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:11,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:11,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979261668] [2022-12-13 02:05:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:11,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:11,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:11,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:11,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:11,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:11,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:11,212 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:11,213 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:11,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:11,213 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:11,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:11,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:11,214 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:11,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:11,214 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,214 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:11,215 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:11,215 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:11,215 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:11,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:11,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,218 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:11,218 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:11,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:11,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:11,336 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:11,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:11,337 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:11,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:11,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:11,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2115 [2022-12-13 02:05:11,338 INFO L420 AbstractCegarLoop]: === Iteration 2117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1390194941, now seen corresponding path program 1 times [2022-12-13 02:05:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:11,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795130060] [2022-12-13 02:05:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:11,421 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 02:05:11,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:11,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795130060] [2022-12-13 02:05:11,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795130060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:11,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:11,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918630237] [2022-12-13 02:05:11,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:11,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:11,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:11,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:11,422 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:11,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:11,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:11,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:11,487 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:11,488 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:11,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:11,488 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:11,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:11,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:11,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:11,489 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:11,489 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:11,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:11,489 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:11,490 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:11,490 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:11,490 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:11,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:11,490 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,492 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:11,492 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:11,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:11,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:11,620 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:11,621 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:05:11,621 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:11,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:11,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2116 [2022-12-13 02:05:11,621 INFO L420 AbstractCegarLoop]: === Iteration 2118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:11,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:11,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1332936639, now seen corresponding path program 1 times [2022-12-13 02:05:11,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:11,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108913737] [2022-12-13 02:05:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:11,688 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 02:05:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108913737] [2022-12-13 02:05:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108913737] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:11,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685007641] [2022-12-13 02:05:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:11,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:11,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:11,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:11,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:11,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:11,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:11,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:11,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:11,752 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:11,752 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:11,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:11,753 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:11,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:11,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:11,754 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:11,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:11,754 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,755 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:11,755 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:11,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:11,755 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:11,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:11,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,758 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:11,758 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:11,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:11,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:11,874 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:11,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:11,874 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:11,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:11,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:11,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2117 [2022-12-13 02:05:11,875 INFO L420 AbstractCegarLoop]: === Iteration 2119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:11,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1275678337, now seen corresponding path program 1 times [2022-12-13 02:05:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:11,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549702998] [2022-12-13 02:05:11,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:11,931 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 02:05:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:11,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549702998] [2022-12-13 02:05:11,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549702998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:11,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:11,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:11,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005685302] [2022-12-13 02:05:11,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:11,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:11,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:11,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:11,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:11,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:11,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:11,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:11,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:11,974 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:11,974 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:11,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:11,974 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:11,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:11,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:11,975 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:11,975 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:11,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:11,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:11,976 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,976 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:11,976 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:11,976 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:11,976 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:11,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:11,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:11,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,979 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:11,979 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:11,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:11,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:11,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:12,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:12,095 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:12,095 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:12,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,095 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:12,095 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:12,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2118 [2022-12-13 02:05:12,095 INFO L420 AbstractCegarLoop]: === Iteration 2120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:12,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1218420035, now seen corresponding path program 1 times [2022-12-13 02:05:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:12,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362776450] [2022-12-13 02:05:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:12,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:12,164 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 02:05:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:12,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362776450] [2022-12-13 02:05:12,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362776450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:12,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:12,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918026399] [2022-12-13 02:05:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:12,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:12,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:12,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:12,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:12,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:12,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:12,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:12,208 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:12,208 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:12,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:12,208 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:12,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:12,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:12,209 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:12,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:12,209 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,209 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:12,210 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:12,210 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:12,210 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,210 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:12,210 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:12,210 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,212 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:12,213 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:12,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:12,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:12,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:12,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:12,329 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:12,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:12,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:12,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2119 [2022-12-13 02:05:12,329 INFO L420 AbstractCegarLoop]: === Iteration 2121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:12,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1161161733, now seen corresponding path program 1 times [2022-12-13 02:05:12,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:12,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184361974] [2022-12-13 02:05:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:12,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:12,384 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 02:05:12,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:12,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184361974] [2022-12-13 02:05:12,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184361974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:12,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:12,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:12,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4997398] [2022-12-13 02:05:12,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:12,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:12,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:12,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:12,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:12,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:12,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:12,428 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:12,428 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:12,428 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:12,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:12,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:12,429 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:12,430 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:12,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:12,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:12,430 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,430 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:12,430 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:12,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,433 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:12,433 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:12,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:12,433 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,433 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:12,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:12,547 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:05:12,547 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:12,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,547 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:12,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:12,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2120 [2022-12-13 02:05:12,547 INFO L420 AbstractCegarLoop]: === Iteration 2122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:12,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1103903431, now seen corresponding path program 1 times [2022-12-13 02:05:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:12,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545425168] [2022-12-13 02:05:12,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:12,602 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 02:05:12,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545425168] [2022-12-13 02:05:12,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545425168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:12,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:12,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200129816] [2022-12-13 02:05:12,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:12,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:12,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:12,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:12,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:12,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:12,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:12,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:12,644 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:12,644 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:12,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:12,645 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:12,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:12,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:12,645 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:12,645 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:12,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:12,646 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,646 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:12,646 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:12,646 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:12,646 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:12,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:12,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,649 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:12,649 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:12,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:12,650 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,650 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:12,763 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:12,764 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:12,764 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:12,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:12,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:12,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2121 [2022-12-13 02:05:12,764 INFO L420 AbstractCegarLoop]: === Iteration 2123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:12,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1046645129, now seen corresponding path program 1 times [2022-12-13 02:05:12,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:12,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691138699] [2022-12-13 02:05:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:12,819 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 02:05:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691138699] [2022-12-13 02:05:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691138699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111517076] [2022-12-13 02:05:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:12,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:12,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:12,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:12,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:12,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:12,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:12,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:12,869 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:12,869 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:12,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:12,869 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:12,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:12,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:12,870 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:12,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:12,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:12,871 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:12,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:12,871 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:12,871 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:12,871 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:12,871 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:12,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,874 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:12,874 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:12,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:12,874 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:12,874 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:12,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:12,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:12,989 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:12,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:12,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:12,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:12,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2122 [2022-12-13 02:05:12,989 INFO L420 AbstractCegarLoop]: === Iteration 2124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash -989386827, now seen corresponding path program 1 times [2022-12-13 02:05:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:12,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563703950] [2022-12-13 02:05:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:13,046 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 02:05:13,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:13,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563703950] [2022-12-13 02:05:13,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563703950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:13,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:13,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632212845] [2022-12-13 02:05:13,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:13,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:13,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:13,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:13,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:13,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:13,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:13,089 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:13,090 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:13,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:13,090 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:13,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:13,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:13,091 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:13,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:13,091 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,091 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:13,092 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:13,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:13,092 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,092 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:13,092 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:13,092 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,094 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:13,095 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:13,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:13,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:13,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:13,212 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:13,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:13,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:13,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:13,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2123 [2022-12-13 02:05:13,213 INFO L420 AbstractCegarLoop]: === Iteration 2125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash -932128525, now seen corresponding path program 1 times [2022-12-13 02:05:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:13,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578042435] [2022-12-13 02:05:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:13,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:13,270 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 02:05:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578042435] [2022-12-13 02:05:13,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578042435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:13,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:13,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:13,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949948836] [2022-12-13 02:05:13,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:13,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:13,271 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:13,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:13,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:13,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:13,314 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:13,314 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:13,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:13,314 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:13,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:13,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:13,315 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:13,315 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:13,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:13,316 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,316 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:13,316 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:13,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:13,316 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:13,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:13,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,319 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:13,319 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:13,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:13,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:13,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:13,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:13,435 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:13,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:13,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:13,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2124 [2022-12-13 02:05:13,436 INFO L420 AbstractCegarLoop]: === Iteration 2126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash -874870223, now seen corresponding path program 1 times [2022-12-13 02:05:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:13,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593208245] [2022-12-13 02:05:13,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:13,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:13,493 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 02:05:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:13,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593208245] [2022-12-13 02:05:13,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593208245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:13,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:13,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538729945] [2022-12-13 02:05:13,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:13,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:13,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:13,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:13,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:13,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:13,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:13,555 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:13,555 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:13,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:13,555 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:13,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:13,556 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:13,556 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:13,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:13,557 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,557 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:13,557 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:13,557 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:13,557 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,557 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:13,557 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:13,557 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,560 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:13,560 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:13,560 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,560 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:13,674 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:13,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:13,675 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:13,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:13,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:13,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2125 [2022-12-13 02:05:13,675 INFO L420 AbstractCegarLoop]: === Iteration 2127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash -817611921, now seen corresponding path program 1 times [2022-12-13 02:05:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:13,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947744926] [2022-12-13 02:05:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947744926] [2022-12-13 02:05:13,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947744926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:13,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:13,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:13,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701597307] [2022-12-13 02:05:13,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:13,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:13,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:13,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:13,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:13,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:13,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:13,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:13,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:13,774 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:13,774 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:13,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:13,774 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:13,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:13,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:13,775 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:13,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:13,776 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,776 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:13,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:13,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:13,776 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:13,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:13,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:13,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,779 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:13,779 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:13,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:13,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:13,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:13,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:13,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:13,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:13,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,894 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:13,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:13,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2126 [2022-12-13 02:05:13,895 INFO L420 AbstractCegarLoop]: === Iteration 2128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash -760353619, now seen corresponding path program 1 times [2022-12-13 02:05:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223340608] [2022-12-13 02:05:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:13,952 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 02:05:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:13,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223340608] [2022-12-13 02:05:13,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223340608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:13,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:13,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37838132] [2022-12-13 02:05:13,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:13,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:13,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:13,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:13,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:13,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:13,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:13,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:13,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:13,997 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:13,998 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:13,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:13,998 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:13,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:13,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:13,999 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:13,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:13,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:13,999 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:14,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:14,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:14,000 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:14,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:14,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,003 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:14,003 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:14,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:14,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:14,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:14,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:14,121 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:14,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:14,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:14,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2127 [2022-12-13 02:05:14,121 INFO L420 AbstractCegarLoop]: === Iteration 2129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -703095317, now seen corresponding path program 1 times [2022-12-13 02:05:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:14,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934648684] [2022-12-13 02:05:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:14,179 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 02:05:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934648684] [2022-12-13 02:05:14,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934648684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:14,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:14,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506718840] [2022-12-13 02:05:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:14,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:14,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:14,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:14,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:14,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:14,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:14,229 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:14,229 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:14,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:14,229 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:14,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:14,230 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:14,230 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:14,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:14,230 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,231 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:14,231 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:14,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:14,231 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,231 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:14,231 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:14,231 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,233 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:14,234 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:14,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:14,234 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,234 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:14,350 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:14,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:14,351 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:14,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:14,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2128 [2022-12-13 02:05:14,351 INFO L420 AbstractCegarLoop]: === Iteration 2130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -645837015, now seen corresponding path program 1 times [2022-12-13 02:05:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:14,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305787225] [2022-12-13 02:05:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:14,416 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 02:05:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:14,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305787225] [2022-12-13 02:05:14,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305787225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:14,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:14,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266119088] [2022-12-13 02:05:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:14,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:14,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:14,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:14,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:14,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:14,468 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:14,468 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:14,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:14,468 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:14,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:14,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:14,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:14,469 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:14,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:14,470 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,470 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:14,470 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:14,470 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:14,470 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,470 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:14,470 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:14,470 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,473 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:14,473 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:14,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:14,473 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,473 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:14,593 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:14,595 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:05:14,595 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:14,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:14,595 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:14,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2129 [2022-12-13 02:05:14,595 INFO L420 AbstractCegarLoop]: === Iteration 2131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:14,596 INFO L85 PathProgramCache]: Analyzing trace with hash -588578713, now seen corresponding path program 1 times [2022-12-13 02:05:14,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:14,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698044951] [2022-12-13 02:05:14,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:14,659 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 02:05:14,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:14,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698044951] [2022-12-13 02:05:14,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698044951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:14,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:14,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:14,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856328770] [2022-12-13 02:05:14,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:14,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:14,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:14,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:14,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:14,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:14,720 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:14,721 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:14,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:14,721 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:14,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:14,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:14,722 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:14,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:14,723 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:14,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:14,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:14,723 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,723 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:14,723 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:14,723 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,726 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:14,726 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:14,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:14,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:14,858 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:14,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:14,859 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:14,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:14,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2130 [2022-12-13 02:05:14,859 INFO L420 AbstractCegarLoop]: === Iteration 2132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:14,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:14,859 INFO L85 PathProgramCache]: Analyzing trace with hash -531320411, now seen corresponding path program 1 times [2022-12-13 02:05:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017438277] [2022-12-13 02:05:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:14,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:14,936 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 02:05:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:14,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017438277] [2022-12-13 02:05:14,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017438277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:14,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:14,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582674644] [2022-12-13 02:05:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:14,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:14,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:14,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:14,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:14,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:14,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:14,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:14,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:14,989 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:14,990 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:14,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:14,990 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:14,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:14,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:14,991 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:14,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:14,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:14,992 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:14,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:14,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:14,992 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:14,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:14,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:14,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,995 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:14,995 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:14,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:14,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:14,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:15,144 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:15,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 02:05:15,145 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:15,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:15,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:15,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2131 [2022-12-13 02:05:15,146 INFO L420 AbstractCegarLoop]: === Iteration 2133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -474062109, now seen corresponding path program 1 times [2022-12-13 02:05:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:15,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309589162] [2022-12-13 02:05:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:15,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:15,213 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 02:05:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:15,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309589162] [2022-12-13 02:05:15,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309589162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:15,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:15,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:15,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863282501] [2022-12-13 02:05:15,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:15,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:15,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:15,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:15,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:15,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:15,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:15,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:15,274 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:15,275 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:15,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:15,275 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:15,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:15,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:15,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:15,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:15,276 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:15,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:15,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:15,277 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,277 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:15,277 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:15,277 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:15,277 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,277 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:15,277 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:15,277 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:15,280 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:15,280 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:15,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:15,280 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:15,280 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:15,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:15,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:15,414 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:15,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:15,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:15,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2132 [2022-12-13 02:05:15,414 INFO L420 AbstractCegarLoop]: === Iteration 2134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:15,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash -416803807, now seen corresponding path program 1 times [2022-12-13 02:05:15,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:15,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130899561] [2022-12-13 02:05:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:15,479 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 02:05:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:15,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130899561] [2022-12-13 02:05:15,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130899561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:15,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:15,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137309942] [2022-12-13 02:05:15,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:15,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:15,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:15,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:15,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:15,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:15,541 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:15,541 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:15,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:15,542 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:15,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:15,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:15,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:15,543 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:15,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:15,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:15,544 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:15,544 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:15,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:15,544 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:15,545 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:15,545 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:15,548 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:15,548 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:15,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:15,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:15,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:15,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:15,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:15,687 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:15,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:15,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:15,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2133 [2022-12-13 02:05:15,687 INFO L420 AbstractCegarLoop]: === Iteration 2135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:15,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:15,687 INFO L85 PathProgramCache]: Analyzing trace with hash -359545505, now seen corresponding path program 1 times [2022-12-13 02:05:15,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:15,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114129328] [2022-12-13 02:05:15,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:15,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:15,760 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 02:05:15,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:15,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114129328] [2022-12-13 02:05:15,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114129328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:15,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:15,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081601472] [2022-12-13 02:05:15,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:15,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:15,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:15,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:15,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:15,761 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:15,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:15,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:15,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:15,810 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:15,810 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:15,811 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:15,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:15,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:15,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:15,811 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:15,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:15,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:15,812 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:15,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:15,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:15,813 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,813 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:15,813 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:15,813 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:15,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:15,816 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:15,816 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:15,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:15,816 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:15,816 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:15,944 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:15,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:05:15,945 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:15,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:15,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:15,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:15,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2134 [2022-12-13 02:05:15,946 INFO L420 AbstractCegarLoop]: === Iteration 2136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -302287203, now seen corresponding path program 1 times [2022-12-13 02:05:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020170078] [2022-12-13 02:05:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:16,001 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 02:05:16,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:16,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020170078] [2022-12-13 02:05:16,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020170078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:16,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:16,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844095063] [2022-12-13 02:05:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:16,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:16,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:16,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:16,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:16,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:16,045 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:16,045 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:16,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:16,046 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:16,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:16,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:16,046 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:16,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:16,047 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:16,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:16,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:16,047 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:16,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:16,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,050 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:16,050 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:16,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:16,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:16,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:16,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:16,169 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:16,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:16,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2135 [2022-12-13 02:05:16,169 INFO L420 AbstractCegarLoop]: === Iteration 2137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:16,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash -245028901, now seen corresponding path program 1 times [2022-12-13 02:05:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:16,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496226013] [2022-12-13 02:05:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:16,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:16,224 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 02:05:16,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496226013] [2022-12-13 02:05:16,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496226013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:16,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:16,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833025930] [2022-12-13 02:05:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:16,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:16,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:16,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:16,224 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:16,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:16,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:16,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:16,267 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:16,267 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:16,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:16,267 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:16,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:16,268 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:16,268 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:16,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:16,269 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,269 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:16,269 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:16,269 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:16,269 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,269 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:16,269 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:16,269 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,272 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:16,272 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:16,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:16,272 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,272 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:16,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:16,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:16,389 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:16,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:16,390 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:16,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2136 [2022-12-13 02:05:16,390 INFO L420 AbstractCegarLoop]: === Iteration 2138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash -187770599, now seen corresponding path program 1 times [2022-12-13 02:05:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:16,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319666415] [2022-12-13 02:05:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:16,446 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 02:05:16,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:16,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319666415] [2022-12-13 02:05:16,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319666415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:16,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:16,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:16,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757528268] [2022-12-13 02:05:16,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:16,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:16,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:16,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:16,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:16,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:16,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:16,489 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:16,489 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:16,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:16,490 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:16,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:16,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:16,490 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:16,490 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:16,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:16,491 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,491 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:16,491 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:16,491 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:16,491 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,491 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:16,491 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:16,492 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,494 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:16,494 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:16,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:16,494 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,494 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:16,612 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:16,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:16,613 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:16,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,613 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:16,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:16,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2137 [2022-12-13 02:05:16,613 INFO L420 AbstractCegarLoop]: === Iteration 2139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:16,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:16,613 INFO L85 PathProgramCache]: Analyzing trace with hash -130512297, now seen corresponding path program 1 times [2022-12-13 02:05:16,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:16,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350067764] [2022-12-13 02:05:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:16,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:16,682 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 02:05:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:16,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350067764] [2022-12-13 02:05:16,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350067764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:16,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:16,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814419476] [2022-12-13 02:05:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:16,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:16,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:16,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:16,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:16,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:16,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:16,725 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:16,725 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:16,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:16,725 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:16,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:16,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:16,726 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:16,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:16,726 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:16,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:16,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:16,727 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:16,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:16,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,730 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:16,730 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:16,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:16,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:16,846 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:16,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:16,847 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:16,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:16,847 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2138 [2022-12-13 02:05:16,847 INFO L420 AbstractCegarLoop]: === Iteration 2140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -73253995, now seen corresponding path program 1 times [2022-12-13 02:05:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965081962] [2022-12-13 02:05:16,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:16,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:16,904 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 02:05:16,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:16,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965081962] [2022-12-13 02:05:16,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965081962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:16,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:16,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:16,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396234711] [2022-12-13 02:05:16,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:16,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:16,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:16,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:16,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:16,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:16,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:16,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:16,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:16,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:16,948 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:16,948 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:16,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:16,949 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:16,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:16,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:16,949 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:16,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:16,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:16,950 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:16,950 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:16,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:16,950 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,950 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:16,950 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:16,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:16,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,953 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:16,953 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:16,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:16,953 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:16,953 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:17,068 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:17,069 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:17,069 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:17,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:17,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:17,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2139 [2022-12-13 02:05:17,070 INFO L420 AbstractCegarLoop]: === Iteration 2141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:17,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:17,070 INFO L85 PathProgramCache]: Analyzing trace with hash -15995693, now seen corresponding path program 1 times [2022-12-13 02:05:17,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:17,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370343145] [2022-12-13 02:05:17,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:17,125 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 02:05:17,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:17,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370343145] [2022-12-13 02:05:17,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370343145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:17,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:17,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:17,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292214355] [2022-12-13 02:05:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:17,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:17,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:17,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:17,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:17,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:17,168 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:17,168 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:17,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:17,169 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:17,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:17,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:17,169 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:17,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:17,170 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,170 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:17,170 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:17,170 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:17,170 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:17,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:17,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,173 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:17,173 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:17,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:17,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:17,289 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:17,290 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:17,290 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:17,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,290 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:17,290 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:17,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2140 [2022-12-13 02:05:17,290 INFO L420 AbstractCegarLoop]: === Iteration 2142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:17,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash 41262609, now seen corresponding path program 1 times [2022-12-13 02:05:17,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:17,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519319750] [2022-12-13 02:05:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:17,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:17,347 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 02:05:17,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:17,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519319750] [2022-12-13 02:05:17,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519319750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:17,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:17,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678421508] [2022-12-13 02:05:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:17,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:17,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:17,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:17,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:17,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:17,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:17,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:17,397 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:17,397 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:17,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:17,398 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:17,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:17,398 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:17,398 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:17,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:17,399 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,399 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:17,399 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:17,399 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:17,399 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,399 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:17,399 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:17,400 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,402 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:17,402 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:17,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,403 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:17,522 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:17,523 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:17,523 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:17,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,523 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:17,523 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:17,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2141 [2022-12-13 02:05:17,523 INFO L420 AbstractCegarLoop]: === Iteration 2143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:17,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:17,524 INFO L85 PathProgramCache]: Analyzing trace with hash 98520911, now seen corresponding path program 1 times [2022-12-13 02:05:17,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:17,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659571980] [2022-12-13 02:05:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:17,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:17,581 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 02:05:17,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:17,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659571980] [2022-12-13 02:05:17,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659571980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:17,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:17,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:17,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722747046] [2022-12-13 02:05:17,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:17,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:17,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:17,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:17,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:17,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:17,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:17,632 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:17,632 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:17,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:17,632 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:17,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:17,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:17,633 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:17,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:17,634 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:17,634 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:17,634 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:17,634 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:17,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:17,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,637 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:17,637 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:17,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:17,637 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,637 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:17,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:17,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:17,755 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:17,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:17,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:17,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2142 [2022-12-13 02:05:17,755 INFO L420 AbstractCegarLoop]: === Iteration 2144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:17,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:17,755 INFO L85 PathProgramCache]: Analyzing trace with hash 155779213, now seen corresponding path program 1 times [2022-12-13 02:05:17,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:17,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795185592] [2022-12-13 02:05:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:17,810 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 02:05:17,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:17,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795185592] [2022-12-13 02:05:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795185592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:17,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:17,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964197098] [2022-12-13 02:05:17,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:17,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:17,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:17,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:17,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:17,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:17,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:17,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:17,861 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:17,861 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:17,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:17,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:17,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:17,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:17,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:17,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:17,862 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:17,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:17,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:17,863 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:17,863 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:17,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:17,863 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:17,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:17,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:17,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,866 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:17,866 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:17,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:17,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:17,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:17,982 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:17,983 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:17,983 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:17,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:17,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:17,983 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2143 [2022-12-13 02:05:17,983 INFO L420 AbstractCegarLoop]: === Iteration 2145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:17,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:17,983 INFO L85 PathProgramCache]: Analyzing trace with hash 213037515, now seen corresponding path program 1 times [2022-12-13 02:05:17,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:17,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903351587] [2022-12-13 02:05:17,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:17,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:18,065 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 02:05:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:18,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903351587] [2022-12-13 02:05:18,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903351587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:18,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:18,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136423963] [2022-12-13 02:05:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:18,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:18,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:18,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:18,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:18,066 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:18,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:18,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:18,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:18,109 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:18,109 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:18,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:18,110 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:18,110 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:18,110 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:18,110 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:18,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:18,111 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,111 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:18,111 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:18,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:18,111 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,111 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:18,111 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:18,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,114 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:18,114 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:18,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:18,114 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:18,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:18,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:18,231 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:18,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:18,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:18,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2144 [2022-12-13 02:05:18,231 INFO L420 AbstractCegarLoop]: === Iteration 2146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 270295817, now seen corresponding path program 1 times [2022-12-13 02:05:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:18,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436341228] [2022-12-13 02:05:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:18,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:18,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436341228] [2022-12-13 02:05:18,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436341228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:18,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:18,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:18,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920840076] [2022-12-13 02:05:18,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:18,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:18,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:18,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:18,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:18,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:18,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:18,334 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:18,334 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:18,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:18,334 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:18,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:18,335 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:18,335 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:18,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:18,336 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,336 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:18,336 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:18,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:18,336 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:18,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:18,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,339 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:18,339 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:18,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:18,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:18,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:18,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:18,475 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:18,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:18,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2145 [2022-12-13 02:05:18,475 INFO L420 AbstractCegarLoop]: === Iteration 2147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:18,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 327554119, now seen corresponding path program 1 times [2022-12-13 02:05:18,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:18,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723459500] [2022-12-13 02:05:18,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:18,532 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 02:05:18,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:18,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723459500] [2022-12-13 02:05:18,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723459500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:18,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:18,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588971148] [2022-12-13 02:05:18,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:18,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:18,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:18,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:18,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:18,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:18,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:18,576 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:18,576 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:18,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:18,577 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:18,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:18,577 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:18,577 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:18,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:18,578 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:18,578 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:18,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:18,578 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,578 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:18,578 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:18,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,581 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:18,581 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:18,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:18,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:18,698 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:18,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:18,699 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:18,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,699 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:18,699 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:18,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2146 [2022-12-13 02:05:18,699 INFO L420 AbstractCegarLoop]: === Iteration 2148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 384812421, now seen corresponding path program 1 times [2022-12-13 02:05:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:18,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179629814] [2022-12-13 02:05:18,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179629814] [2022-12-13 02:05:18,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179629814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:18,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:18,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682167118] [2022-12-13 02:05:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:18,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:18,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:18,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:18,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:18,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:18,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:18,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:18,818 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:18,819 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:18,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:18,819 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:18,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:18,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:18,820 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:18,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:18,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:18,821 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:18,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:18,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:18,821 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:18,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:18,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:18,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,824 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:18,824 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:18,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:18,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:18,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:18,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:18,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:05:18,955 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:18,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:18,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:18,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:18,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2147 [2022-12-13 02:05:18,956 INFO L420 AbstractCegarLoop]: === Iteration 2149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:18,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash 442070723, now seen corresponding path program 1 times [2022-12-13 02:05:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:18,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543000464] [2022-12-13 02:05:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:19,028 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 02:05:19,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543000464] [2022-12-13 02:05:19,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543000464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:19,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:19,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559370622] [2022-12-13 02:05:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:19,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:19,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:19,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:19,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:19,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:19,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:19,083 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:19,084 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:19,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:19,084 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:19,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:19,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:19,085 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:19,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:19,086 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,086 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:19,086 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:19,086 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:19,086 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,086 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:19,086 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:19,086 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,089 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:19,089 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:19,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:19,089 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,089 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:19,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:19,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:19,225 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:19,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:19,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2148 [2022-12-13 02:05:19,226 INFO L420 AbstractCegarLoop]: === Iteration 2150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:19,226 INFO L85 PathProgramCache]: Analyzing trace with hash 499329025, now seen corresponding path program 1 times [2022-12-13 02:05:19,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:19,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413421460] [2022-12-13 02:05:19,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:19,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:19,308 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 02:05:19,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:19,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413421460] [2022-12-13 02:05:19,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413421460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:19,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:19,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030215149] [2022-12-13 02:05:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:19,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:19,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:19,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:19,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:19,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:19,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:19,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:19,362 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:19,362 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:19,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:19,362 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:19,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:19,363 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:19,363 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:19,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:19,364 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,364 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:19,364 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:19,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:19,364 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,364 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:19,364 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:19,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,367 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:19,367 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:19,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:19,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:19,502 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:19,503 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:19,503 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,503 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:19,503 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:19,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2149 [2022-12-13 02:05:19,504 INFO L420 AbstractCegarLoop]: === Iteration 2151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:19,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash 556587327, now seen corresponding path program 1 times [2022-12-13 02:05:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:19,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890300011] [2022-12-13 02:05:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:19,577 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 02:05:19,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:19,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890300011] [2022-12-13 02:05:19,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890300011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:19,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:19,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796558024] [2022-12-13 02:05:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:19,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:19,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:19,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:19,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:19,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:19,655 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:19,655 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:19,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:19,656 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:19,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:19,657 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:19,657 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:19,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:19,658 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,658 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:19,658 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:19,658 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:19,658 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,658 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:19,658 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:19,658 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,661 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:19,661 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:19,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:19,661 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:19,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:19,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:19,796 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:19,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:19,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:19,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2150 [2022-12-13 02:05:19,796 INFO L420 AbstractCegarLoop]: === Iteration 2152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 613845629, now seen corresponding path program 1 times [2022-12-13 02:05:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907857295] [2022-12-13 02:05:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:19,881 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 02:05:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:19,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907857295] [2022-12-13 02:05:19,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907857295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:19,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:19,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402642619] [2022-12-13 02:05:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:19,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:19,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:19,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:19,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:19,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:19,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:19,936 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:19,936 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:19,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:19,937 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:19,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:19,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:19,938 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:19,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:19,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:19,938 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:19,939 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:19,939 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:19,939 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,939 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:19,939 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:19,939 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:19,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,942 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:19,942 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:19,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:19,942 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:19,942 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:20,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:20,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:20,076 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:20,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,077 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:20,077 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:20,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2151 [2022-12-13 02:05:20,077 INFO L420 AbstractCegarLoop]: === Iteration 2153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:20,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:20,077 INFO L85 PathProgramCache]: Analyzing trace with hash 671103931, now seen corresponding path program 1 times [2022-12-13 02:05:20,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:20,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549091059] [2022-12-13 02:05:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:20,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:20,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549091059] [2022-12-13 02:05:20,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549091059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:20,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:20,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:20,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101152844] [2022-12-13 02:05:20,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:20,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:20,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:20,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:20,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:20,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:20,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:20,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:20,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:20,194 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:20,194 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:20,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:20,194 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:20,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:20,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:20,195 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:20,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:20,196 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:20,196 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:20,196 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:20,196 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,196 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:20,196 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:20,196 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,199 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:20,199 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:20,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:20,199 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,199 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:20,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:20,331 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:05:20,331 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:20,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,331 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:20,331 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:20,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2152 [2022-12-13 02:05:20,331 INFO L420 AbstractCegarLoop]: === Iteration 2154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash 728362233, now seen corresponding path program 1 times [2022-12-13 02:05:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:20,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879181672] [2022-12-13 02:05:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:20,400 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 02:05:20,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:20,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879181672] [2022-12-13 02:05:20,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879181672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:20,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:20,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:20,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646326066] [2022-12-13 02:05:20,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:20,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:20,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:20,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:20,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:20,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:20,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:20,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:20,462 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:20,463 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:20,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:20,463 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:20,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:20,464 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:20,464 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:20,466 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:20,466 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:20,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:20,466 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:20,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:20,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,471 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:20,471 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:20,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:20,471 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,471 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:20,589 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:20,590 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:20,590 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:20,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,590 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:20,590 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:20,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2153 [2022-12-13 02:05:20,590 INFO L420 AbstractCegarLoop]: === Iteration 2155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:20,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 785620535, now seen corresponding path program 1 times [2022-12-13 02:05:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:20,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665374870] [2022-12-13 02:05:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:20,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:20,645 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 02:05:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:20,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665374870] [2022-12-13 02:05:20,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665374870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:20,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:20,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954593109] [2022-12-13 02:05:20,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:20,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:20,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:20,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:20,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:20,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:20,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:20,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:20,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:20,697 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:20,697 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:20,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:20,698 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:20,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:20,698 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:20,699 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:20,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:20,699 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:20,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:20,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:20,700 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:20,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:20,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,702 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:20,702 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:20,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:20,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:20,820 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:20,821 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:20,821 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:20,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,821 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:20,821 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:20,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2154 [2022-12-13 02:05:20,821 INFO L420 AbstractCegarLoop]: === Iteration 2156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:20,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:20,822 INFO L85 PathProgramCache]: Analyzing trace with hash 842878837, now seen corresponding path program 1 times [2022-12-13 02:05:20,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:20,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569154837] [2022-12-13 02:05:20,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:20,878 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 02:05:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569154837] [2022-12-13 02:05:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569154837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908641216] [2022-12-13 02:05:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:20,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:20,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:20,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:20,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:20,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:20,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:20,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:20,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:20,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:20,922 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:20,922 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:20,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:20,922 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:20,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:20,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:20,923 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:20,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:20,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:20,924 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:20,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:20,924 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:20,924 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,924 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:20,924 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:20,924 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:20,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,927 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:20,927 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:20,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:20,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:20,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:21,047 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:21,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:21,048 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:21,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:21,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:21,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2155 [2022-12-13 02:05:21,048 INFO L420 AbstractCegarLoop]: === Iteration 2157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:21,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:21,048 INFO L85 PathProgramCache]: Analyzing trace with hash 900137139, now seen corresponding path program 1 times [2022-12-13 02:05:21,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:21,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021598080] [2022-12-13 02:05:21,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:21,115 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 02:05:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:21,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021598080] [2022-12-13 02:05:21,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021598080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:21,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:21,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:21,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751029754] [2022-12-13 02:05:21,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:21,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:21,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:21,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:21,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:21,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:21,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:21,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:21,161 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:21,161 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:21,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:21,161 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:21,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:21,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:21,162 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:21,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:21,163 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,163 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:21,163 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:21,163 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:21,163 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,163 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:21,163 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:21,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,166 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:21,166 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:21,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:21,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:21,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:21,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:21,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:21,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:21,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:21,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2156 [2022-12-13 02:05:21,302 INFO L420 AbstractCegarLoop]: === Iteration 2158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:21,302 INFO L85 PathProgramCache]: Analyzing trace with hash 957395441, now seen corresponding path program 1 times [2022-12-13 02:05:21,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:21,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93839687] [2022-12-13 02:05:21,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:21,359 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 02:05:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93839687] [2022-12-13 02:05:21,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93839687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:21,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:21,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:21,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860955534] [2022-12-13 02:05:21,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:21,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:21,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:21,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:21,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:21,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:21,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:21,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:21,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:21,410 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:21,411 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:21,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:21,411 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:21,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:21,412 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:21,412 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:21,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:21,413 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:21,413 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:21,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:21,413 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:21,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:21,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,416 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:21,416 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:21,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:21,417 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,417 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:21,537 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:21,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:05:21,538 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:21,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:21,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:21,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2157 [2022-12-13 02:05:21,538 INFO L420 AbstractCegarLoop]: === Iteration 2159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1014653743, now seen corresponding path program 1 times [2022-12-13 02:05:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:21,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951862104] [2022-12-13 02:05:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:21,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:21,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 02:05:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:21,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951862104] [2022-12-13 02:05:21,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951862104] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:21,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:21,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:21,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585468094] [2022-12-13 02:05:21,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:21,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:21,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:21,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:21,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:21,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:21,645 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:21,646 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:21,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:21,646 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:21,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:21,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:21,647 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:21,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:21,648 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,648 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:21,648 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:21,648 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:21,648 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,648 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:21,648 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:21,648 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,651 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:21,651 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:21,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:21,651 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,651 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:21,772 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:21,772 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:21,773 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:21,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:21,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:21,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2158 [2022-12-13 02:05:21,773 INFO L420 AbstractCegarLoop]: === Iteration 2160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:21,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:21,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1071912045, now seen corresponding path program 1 times [2022-12-13 02:05:21,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:21,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596743952] [2022-12-13 02:05:21,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:21,834 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 02:05:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:21,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596743952] [2022-12-13 02:05:21,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596743952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:21,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:21,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142783857] [2022-12-13 02:05:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:21,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:21,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:21,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:21,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:21,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:21,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:21,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:21,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:21,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:21,884 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:21,885 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:21,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:21,885 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:21,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:21,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:21,886 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:21,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:21,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:21,886 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:21,887 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:21,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:21,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:21,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:21,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:21,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,890 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:21,890 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:21,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:21,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:22,014 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:22,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:05:22,015 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:22,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:22,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:22,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2159 [2022-12-13 02:05:22,015 INFO L420 AbstractCegarLoop]: === Iteration 2161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1129170347, now seen corresponding path program 1 times [2022-12-13 02:05:22,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:22,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301045189] [2022-12-13 02:05:22,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:22,085 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 02:05:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:22,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301045189] [2022-12-13 02:05:22,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301045189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:22,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:22,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:22,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206579364] [2022-12-13 02:05:22,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:22,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:22,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:22,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:22,086 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:22,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:22,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:22,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:22,143 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:22,144 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:22,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:22,144 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:22,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:22,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:22,145 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:22,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:22,147 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:22,147 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:22,147 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:22,147 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:22,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:22,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,152 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:22,152 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:22,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:22,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:22,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:22,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:22,273 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:22,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:22,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:22,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2160 [2022-12-13 02:05:22,274 INFO L420 AbstractCegarLoop]: === Iteration 2162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:22,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1186428649, now seen corresponding path program 1 times [2022-12-13 02:05:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:22,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778553475] [2022-12-13 02:05:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:22,332 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 02:05:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:22,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778553475] [2022-12-13 02:05:22,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778553475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:22,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:22,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:22,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264254407] [2022-12-13 02:05:22,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:22,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:22,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:22,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:22,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:22,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:22,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:22,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:22,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:22,377 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:22,377 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:22,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:22,377 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:22,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:22,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:22,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:22,378 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:22,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:22,379 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:22,379 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:22,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:22,379 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,379 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:22,379 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:22,379 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,382 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:22,382 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:22,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:22,382 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,382 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:22,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:22,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:22,501 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:22,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:22,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:22,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2161 [2022-12-13 02:05:22,502 INFO L420 AbstractCegarLoop]: === Iteration 2163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:22,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1243686951, now seen corresponding path program 1 times [2022-12-13 02:05:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:22,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33561072] [2022-12-13 02:05:22,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:22,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:22,558 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 02:05:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:22,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33561072] [2022-12-13 02:05:22,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33561072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:22,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:22,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574643358] [2022-12-13 02:05:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:22,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:22,559 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:22,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:22,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:22,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:22,602 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:22,602 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:22,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:22,603 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:22,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:22,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:22,603 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:22,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:22,604 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,604 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:22,604 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:22,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:22,604 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:22,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:22,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,607 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:22,607 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:22,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:22,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:22,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:22,745 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:05:22,745 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:22,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,745 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:22,745 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:22,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2162 [2022-12-13 02:05:22,745 INFO L420 AbstractCegarLoop]: === Iteration 2164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:22,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1300945253, now seen corresponding path program 1 times [2022-12-13 02:05:22,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:22,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154225779] [2022-12-13 02:05:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:22,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:22,830 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 02:05:22,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:22,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154225779] [2022-12-13 02:05:22,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154225779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:22,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:22,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:22,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925531873] [2022-12-13 02:05:22,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:22,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:22,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:22,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:22,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:22,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:22,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:22,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:22,883 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:22,883 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:22,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:22,884 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:22,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:22,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:22,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:22,884 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:22,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:22,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:22,885 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,885 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:22,885 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:22,885 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:22,885 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,886 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:22,886 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:22,886 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:22,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,888 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:22,889 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:22,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:22,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:22,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:23,021 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:23,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:23,022 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:23,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:23,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:23,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2163 [2022-12-13 02:05:23,022 INFO L420 AbstractCegarLoop]: === Iteration 2165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:23,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1358203555, now seen corresponding path program 1 times [2022-12-13 02:05:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:23,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989732442] [2022-12-13 02:05:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:23,091 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 02:05:23,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:23,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989732442] [2022-12-13 02:05:23,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989732442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:23,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:23,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:23,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069736810] [2022-12-13 02:05:23,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:23,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:23,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:23,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:23,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:23,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:23,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:23,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:23,143 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:23,143 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:23,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:23,144 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:23,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:23,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:23,145 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:23,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:23,146 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,146 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:23,146 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:23,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:23,146 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,146 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:23,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:23,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,150 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:23,150 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:23,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:23,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:23,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:23,284 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:23,285 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:23,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:23,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2164 [2022-12-13 02:05:23,285 INFO L420 AbstractCegarLoop]: === Iteration 2166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:23,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:23,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1415461857, now seen corresponding path program 1 times [2022-12-13 02:05:23,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:23,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667538666] [2022-12-13 02:05:23,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:23,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:23,348 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 02:05:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:23,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667538666] [2022-12-13 02:05:23,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667538666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:23,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:23,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274241043] [2022-12-13 02:05:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:23,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:23,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:23,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:23,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:23,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:23,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:23,409 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:23,409 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:23,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:23,409 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:23,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:23,410 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:23,410 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:23,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:23,411 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,411 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:23,411 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:23,411 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:23,411 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,411 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:23,411 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:23,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,414 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:23,414 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:23,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:23,414 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:23,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:23,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:23,549 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:23,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:23,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:23,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2165 [2022-12-13 02:05:23,550 INFO L420 AbstractCegarLoop]: === Iteration 2167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1472720159, now seen corresponding path program 1 times [2022-12-13 02:05:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:23,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852035771] [2022-12-13 02:05:23,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:23,613 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 02:05:23,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:23,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852035771] [2022-12-13 02:05:23,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852035771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:23,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:23,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:23,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133045064] [2022-12-13 02:05:23,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:23,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:23,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:23,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:23,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:23,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:23,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:23,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:23,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:23,669 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:23,670 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:23,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:23,670 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:23,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:23,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:23,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:23,671 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:23,672 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:23,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:23,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:23,672 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,672 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:23,672 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:23,672 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,675 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:23,675 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:23,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:23,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:23,810 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:23,811 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:23,811 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:23,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:23,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2166 [2022-12-13 02:05:23,812 INFO L420 AbstractCegarLoop]: === Iteration 2168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:23,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1529978461, now seen corresponding path program 1 times [2022-12-13 02:05:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:23,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031282371] [2022-12-13 02:05:23,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:23,894 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 02:05:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:23,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031282371] [2022-12-13 02:05:23,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031282371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:23,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:23,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:23,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195853952] [2022-12-13 02:05:23,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:23,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:23,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:23,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:23,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:23,894 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:23,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:23,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:23,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:23,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:23,954 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:23,954 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:23,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:23,955 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:23,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:23,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:23,956 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:23,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:23,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:23,956 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,957 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:23,957 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:23,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:23,957 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:23,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:23,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:23,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,960 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:23,960 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:23,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:23,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:23,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:24,094 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:24,096 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:24,096 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:24,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,096 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:24,096 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:24,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2167 [2022-12-13 02:05:24,096 INFO L420 AbstractCegarLoop]: === Iteration 2169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1587236763, now seen corresponding path program 1 times [2022-12-13 02:05:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:24,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939868825] [2022-12-13 02:05:24,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:24,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:24,174 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 02:05:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939868825] [2022-12-13 02:05:24,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939868825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:24,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:24,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:24,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892419328] [2022-12-13 02:05:24,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:24,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:24,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:24,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:24,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:24,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:24,238 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:24,239 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:24,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:24,239 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:24,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:24,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:24,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:24,240 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:24,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:24,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:24,241 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:24,241 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:24,241 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:24,241 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,241 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:24,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:24,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:24,244 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:24,244 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:24,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:24,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:24,245 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:24,379 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:24,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:24,380 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:24,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:24,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:24,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2168 [2022-12-13 02:05:24,381 INFO L420 AbstractCegarLoop]: === Iteration 2170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:24,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:24,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1644495065, now seen corresponding path program 1 times [2022-12-13 02:05:24,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:24,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455851508] [2022-12-13 02:05:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:24,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:24,470 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 02:05:24,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455851508] [2022-12-13 02:05:24,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455851508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:24,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:24,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:24,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346702398] [2022-12-13 02:05:24,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:24,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:24,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:24,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:24,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:24,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:24,526 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:24,526 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:24,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:24,527 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:24,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:24,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:24,528 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:24,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:24,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:24,529 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,529 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:24,529 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:24,529 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:24,529 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:24,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:24,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:24,533 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:24,533 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:24,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:24,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:24,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:24,668 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:24,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:24,669 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:24,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:24,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2169 [2022-12-13 02:05:24,670 INFO L420 AbstractCegarLoop]: === Iteration 2171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:24,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1701753367, now seen corresponding path program 1 times [2022-12-13 02:05:24,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:24,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090149033] [2022-12-13 02:05:24,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:24,733 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 02:05:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090149033] [2022-12-13 02:05:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090149033] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:24,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:24,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442723230] [2022-12-13 02:05:24,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:24,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:24,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:24,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:24,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:24,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:24,796 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:24,796 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:24,796 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:24,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:24,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:24,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:24,797 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:24,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:24,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:24,798 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:24,798 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:24,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:24,798 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:24,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:24,798 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:24,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:24,801 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:24,801 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:24,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:24,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:24,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:24,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:24,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:24,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:24,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:24,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:24,937 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:24,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2170 [2022-12-13 02:05:24,937 INFO L420 AbstractCegarLoop]: === Iteration 2172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:24,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1759011669, now seen corresponding path program 1 times [2022-12-13 02:05:24,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:24,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296936654] [2022-12-13 02:05:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:24,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:25,004 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 02:05:25,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:25,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296936654] [2022-12-13 02:05:25,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296936654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:25,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:25,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:25,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183936180] [2022-12-13 02:05:25,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:25,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:25,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:25,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:25,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:25,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:25,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:25,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:25,049 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:25,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:25,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:25,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:25,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:25,050 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:25,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:25,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:25,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:25,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:25,051 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:25,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:25,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,054 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:25,054 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:25,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:25,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:25,174 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:25,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:25,175 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:25,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,176 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:25,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:25,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2171 [2022-12-13 02:05:25,176 INFO L420 AbstractCegarLoop]: === Iteration 2173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:25,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1816269971, now seen corresponding path program 1 times [2022-12-13 02:05:25,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:25,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174263451] [2022-12-13 02:05:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:25,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:25,245 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 02:05:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:25,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174263451] [2022-12-13 02:05:25,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174263451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:25,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:25,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644430740] [2022-12-13 02:05:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:25,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:25,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:25,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:25,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:25,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:25,291 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:25,291 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:25,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:25,292 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:25,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:25,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:25,292 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:25,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:25,293 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,293 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:25,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:25,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:25,293 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:25,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:25,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,296 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:25,296 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:25,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:25,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:25,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:25,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:25,417 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:25,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:25,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:25,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2172 [2022-12-13 02:05:25,417 INFO L420 AbstractCegarLoop]: === Iteration 2174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:25,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1873528273, now seen corresponding path program 1 times [2022-12-13 02:05:25,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:25,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456253051] [2022-12-13 02:05:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:25,476 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 02:05:25,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:25,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456253051] [2022-12-13 02:05:25,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456253051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:25,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:25,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900396891] [2022-12-13 02:05:25,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:25,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:25,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:25,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:25,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:25,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:25,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:25,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:25,521 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:25,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:25,522 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:25,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:25,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:25,522 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:25,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:25,523 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:25,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:25,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:25,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:25,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:25,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,526 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:25,526 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:25,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:25,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:25,644 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:25,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:25,645 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:25,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:25,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:25,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2173 [2022-12-13 02:05:25,646 INFO L420 AbstractCegarLoop]: === Iteration 2175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:25,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1930786575, now seen corresponding path program 1 times [2022-12-13 02:05:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:25,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042877257] [2022-12-13 02:05:25,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:25,704 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 02:05:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:25,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042877257] [2022-12-13 02:05:25,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042877257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:25,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:25,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916395405] [2022-12-13 02:05:25,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:25,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:25,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:25,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:25,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:25,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:25,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:25,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:25,750 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:25,750 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:25,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:25,750 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:25,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:25,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:25,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:25,751 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:25,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:25,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:25,752 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:25,752 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:25,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:25,752 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,752 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:25,752 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:25,752 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:25,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,755 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:25,755 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:25,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:25,755 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:25,755 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:25,872 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:25,873 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:25,873 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:25,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:25,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:25,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2174 [2022-12-13 02:05:25,873 INFO L420 AbstractCegarLoop]: === Iteration 2176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:25,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1988044877, now seen corresponding path program 1 times [2022-12-13 02:05:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:25,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294422236] [2022-12-13 02:05:25,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:25,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:25,955 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 02:05:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:25,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294422236] [2022-12-13 02:05:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294422236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:25,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190457166] [2022-12-13 02:05:25,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:25,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:25,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:25,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:25,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:25,956 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:25,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:25,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:25,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:25,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:25,999 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:25,999 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:25,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:26,000 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:26,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:26,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:26,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:26,000 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:26,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:26,001 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:26,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:26,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:26,001 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:26,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:26,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,004 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:26,004 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:26,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:26,120 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:26,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:26,121 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:26,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:26,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:26,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2175 [2022-12-13 02:05:26,121 INFO L420 AbstractCegarLoop]: === Iteration 2177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:26,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2045303179, now seen corresponding path program 1 times [2022-12-13 02:05:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543312628] [2022-12-13 02:05:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:26,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:26,178 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 02:05:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543312628] [2022-12-13 02:05:26,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543312628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:26,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:26,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061250843] [2022-12-13 02:05:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:26,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:26,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:26,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:26,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:26,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:26,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:26,223 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:26,223 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:26,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:26,224 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:26,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:26,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:26,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:26,224 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:26,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:26,225 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,225 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:26,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:26,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:26,225 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:26,226 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:26,226 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,228 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:26,228 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:26,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:26,229 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,229 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:26,346 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:26,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:26,347 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:26,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:26,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:26,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2176 [2022-12-13 02:05:26,347 INFO L420 AbstractCegarLoop]: === Iteration 2178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2102561481, now seen corresponding path program 1 times [2022-12-13 02:05:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:26,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155049739] [2022-12-13 02:05:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:26,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:26,406 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 02:05:26,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:26,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155049739] [2022-12-13 02:05:26,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155049739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:26,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:26,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:26,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876918302] [2022-12-13 02:05:26,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:26,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:26,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:26,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:26,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:26,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:26,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:26,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:26,460 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:26,461 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:26,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:26,461 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:26,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:26,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:26,462 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:26,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:26,463 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,463 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:26,463 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:26,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:26,463 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:26,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:26,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,466 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:26,466 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:26,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:26,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:26,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:26,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:26,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:26,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:26,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:26,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2177 [2022-12-13 02:05:26,588 INFO L420 AbstractCegarLoop]: === Iteration 2179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2135147513, now seen corresponding path program 1 times [2022-12-13 02:05:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783143116] [2022-12-13 02:05:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:26,646 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 02:05:26,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:26,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783143116] [2022-12-13 02:05:26,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783143116] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:26,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:26,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:26,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620598643] [2022-12-13 02:05:26,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:26,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:26,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:26,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:26,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:26,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:26,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:26,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:26,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:26,703 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:26,703 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:26,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:26,704 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:26,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:26,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:26,704 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:26,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:26,705 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:26,705 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:26,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:26,706 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:26,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:26,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,708 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:26,708 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:26,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:26,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:26,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:26,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:26,827 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:26,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:26,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:26,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2178 [2022-12-13 02:05:26,827 INFO L420 AbstractCegarLoop]: === Iteration 2180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2077889211, now seen corresponding path program 1 times [2022-12-13 02:05:26,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:26,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240093611] [2022-12-13 02:05:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240093611] [2022-12-13 02:05:26,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240093611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:26,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:26,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438844943] [2022-12-13 02:05:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:26,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:26,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:26,886 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:26,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:26,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:26,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:26,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:26,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:26,929 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:26,930 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:26,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:26,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:26,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:26,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:26,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:26,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:26,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:26,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:26,931 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,931 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:26,931 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:26,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:26,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,934 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:26,934 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:26,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:26,934 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:26,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:27,067 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:27,068 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:27,068 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:27,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:27,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2179 [2022-12-13 02:05:27,068 INFO L420 AbstractCegarLoop]: === Iteration 2181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:27,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2020630909, now seen corresponding path program 1 times [2022-12-13 02:05:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:27,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319561540] [2022-12-13 02:05:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:27,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:27,126 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 02:05:27,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319561540] [2022-12-13 02:05:27,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319561540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:27,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:27,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:27,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671782071] [2022-12-13 02:05:27,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:27,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:27,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:27,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:27,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:27,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:27,176 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:27,176 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:27,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:27,177 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:27,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:27,177 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:27,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:27,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:27,178 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,178 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:27,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:27,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:27,179 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:27,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:27,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,181 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:27,182 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:27,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:27,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:27,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:27,317 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:27,317 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:27,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,317 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:27,317 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:27,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2180 [2022-12-13 02:05:27,317 INFO L420 AbstractCegarLoop]: === Iteration 2182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:27,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1963372607, now seen corresponding path program 1 times [2022-12-13 02:05:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:27,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543228200] [2022-12-13 02:05:27,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:27,378 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 02:05:27,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543228200] [2022-12-13 02:05:27,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543228200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:27,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:27,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518989098] [2022-12-13 02:05:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:27,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:27,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:27,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:27,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:27,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:27,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:27,443 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:27,443 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:27,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:27,444 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:27,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:27,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:27,444 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:27,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:27,445 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:27,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:27,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:27,445 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:27,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:27,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,448 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:27,448 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:27,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:27,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:27,581 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:27,582 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:27,582 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:27,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,583 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:27,583 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:27,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2181 [2022-12-13 02:05:27,583 INFO L420 AbstractCegarLoop]: === Iteration 2183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:27,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1906114305, now seen corresponding path program 1 times [2022-12-13 02:05:27,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:27,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311711627] [2022-12-13 02:05:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:27,650 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 02:05:27,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:27,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311711627] [2022-12-13 02:05:27,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311711627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:27,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:27,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:27,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958856953] [2022-12-13 02:05:27,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:27,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:27,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:27,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:27,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:27,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:27,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:27,705 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:27,705 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:27,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:27,706 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:27,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:27,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:27,706 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:27,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:27,707 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:27,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:27,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:27,707 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:27,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:27,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,710 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:27,710 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:27,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:27,710 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,711 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:27,844 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:27,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:27,846 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:27,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:27,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:27,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2182 [2022-12-13 02:05:27,846 INFO L420 AbstractCegarLoop]: === Iteration 2184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:27,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:27,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1848856003, now seen corresponding path program 1 times [2022-12-13 02:05:27,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:27,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681214314] [2022-12-13 02:05:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:27,908 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 02:05:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681214314] [2022-12-13 02:05:27,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681214314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:27,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:27,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:27,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967493245] [2022-12-13 02:05:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:27,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:27,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:27,909 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:27,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:27,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:27,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:27,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:27,969 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:27,969 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:27,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:27,970 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:27,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:27,970 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:27,970 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:27,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:27,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:27,971 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,971 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:27,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:27,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:27,972 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:27,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:27,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:27,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,974 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:27,974 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:27,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:27,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:27,975 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:28,109 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:28,110 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:28,111 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:28,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:28,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:28,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2183 [2022-12-13 02:05:28,111 INFO L420 AbstractCegarLoop]: === Iteration 2185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:28,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1791597701, now seen corresponding path program 1 times [2022-12-13 02:05:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:28,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441102550] [2022-12-13 02:05:28,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:28,173 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 02:05:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:28,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441102550] [2022-12-13 02:05:28,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441102550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:28,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:28,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978904081] [2022-12-13 02:05:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:28,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:28,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:28,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:28,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:28,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:28,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:28,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:28,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:28,238 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:28,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:28,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:28,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:28,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:28,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:28,239 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:28,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:28,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:28,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,239 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:28,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:28,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:28,242 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:28,242 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:28,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:28,243 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:28,243 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:28,376 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:28,378 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:28,378 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:28,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,378 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:28,378 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:28,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2184 [2022-12-13 02:05:28,378 INFO L420 AbstractCegarLoop]: === Iteration 2186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:28,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:28,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1734339399, now seen corresponding path program 1 times [2022-12-13 02:05:28,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:28,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599443905] [2022-12-13 02:05:28,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:28,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:28,444 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 02:05:28,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:28,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599443905] [2022-12-13 02:05:28,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599443905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:28,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:28,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:28,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976356080] [2022-12-13 02:05:28,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:28,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:28,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:28,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:28,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:28,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:28,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:28,505 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:28,505 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:28,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:28,506 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:28,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:28,506 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:28,506 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:28,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:28,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:28,507 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,507 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:28,507 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:28,507 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:28,508 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,508 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:28,508 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:28,508 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:28,510 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:28,510 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:28,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:28,511 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:28,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:28,646 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:28,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:28,648 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:28,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:28,648 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2185 [2022-12-13 02:05:28,648 INFO L420 AbstractCegarLoop]: === Iteration 2187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1677081097, now seen corresponding path program 1 times [2022-12-13 02:05:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:28,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743874604] [2022-12-13 02:05:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:28,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:28,715 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 02:05:28,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:28,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743874604] [2022-12-13 02:05:28,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743874604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:28,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:28,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:28,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471975395] [2022-12-13 02:05:28,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:28,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:28,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:28,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:28,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:28,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:28,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:28,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:28,771 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:28,771 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:28,772 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:28,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:28,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:28,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:28,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:28,772 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:28,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:28,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:28,773 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:28,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:28,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:28,773 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:28,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:28,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:28,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:28,776 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:28,776 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:28,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:28,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:28,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:28,914 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:28,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:05:28,916 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:28,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:28,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:28,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2186 [2022-12-13 02:05:28,916 INFO L420 AbstractCegarLoop]: === Iteration 2188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:28,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:28,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1619822795, now seen corresponding path program 1 times [2022-12-13 02:05:28,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:28,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5960395] [2022-12-13 02:05:28,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:28,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:28,992 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 02:05:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:28,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5960395] [2022-12-13 02:05:28,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5960395] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:28,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:28,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86612675] [2022-12-13 02:05:28,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:28,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:28,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:28,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:28,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:28,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:28,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:29,057 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:29,057 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:29,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:29,058 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:29,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:29,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:29,058 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:29,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:29,059 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:29,059 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:29,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:29,060 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:29,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:29,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,062 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:29,063 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:29,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:29,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:29,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:29,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 02:05:29,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:29,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:29,213 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:29,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2187 [2022-12-13 02:05:29,213 INFO L420 AbstractCegarLoop]: === Iteration 2189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:29,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1562564493, now seen corresponding path program 1 times [2022-12-13 02:05:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:29,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004090934] [2022-12-13 02:05:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:29,280 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 02:05:29,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:29,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004090934] [2022-12-13 02:05:29,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004090934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:29,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:29,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388643994] [2022-12-13 02:05:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:29,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:29,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:29,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:29,282 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,282 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:29,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:29,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:29,335 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:29,335 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:29,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:29,336 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:29,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:29,336 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:29,337 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:29,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:29,337 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,337 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:29,338 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:29,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:29,338 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,338 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:29,338 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:29,338 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,341 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:29,341 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:29,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:29,341 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,341 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:29,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:29,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:29,474 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:29,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:29,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:29,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2188 [2022-12-13 02:05:29,475 INFO L420 AbstractCegarLoop]: === Iteration 2190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:29,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:29,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1505306191, now seen corresponding path program 1 times [2022-12-13 02:05:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:29,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073548798] [2022-12-13 02:05:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:29,540 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 02:05:29,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:29,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073548798] [2022-12-13 02:05:29,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073548798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:29,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:29,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653098357] [2022-12-13 02:05:29,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:29,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:29,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:29,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:29,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:29,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:29,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:29,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:29,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:29,593 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:29,593 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:29,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:29,593 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:29,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:29,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:29,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:29,594 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:29,595 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:29,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:29,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:29,595 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:29,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:29,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,598 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:29,598 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:29,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:29,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:29,716 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:29,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:29,717 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:29,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:29,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:29,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2189 [2022-12-13 02:05:29,717 INFO L420 AbstractCegarLoop]: === Iteration 2191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1448047889, now seen corresponding path program 1 times [2022-12-13 02:05:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:29,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827474464] [2022-12-13 02:05:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:29,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:29,784 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 02:05:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827474464] [2022-12-13 02:05:29,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827474464] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:29,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:29,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268551993] [2022-12-13 02:05:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:29,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:29,785 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:29,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:29,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:29,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:29,829 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:29,830 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:29,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:29,830 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:29,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:29,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:29,831 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:29,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:29,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:29,831 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:29,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:29,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:29,832 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,832 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:29,832 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:29,832 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:29,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,834 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:29,835 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:29,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:29,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:29,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:29,950 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:29,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:29,951 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:29,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:29,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2190 [2022-12-13 02:05:29,952 INFO L420 AbstractCegarLoop]: === Iteration 2192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1390789587, now seen corresponding path program 1 times [2022-12-13 02:05:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:29,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585975056] [2022-12-13 02:05:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:30,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 02:05:30,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:30,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585975056] [2022-12-13 02:05:30,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585975056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:30,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:30,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094013922] [2022-12-13 02:05:30,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:30,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:30,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:30,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:30,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:30,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:30,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:30,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:30,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:30,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:30,054 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:30,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:30,054 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:30,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:30,055 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:30,055 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:30,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:30,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:30,056 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:30,056 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:30,056 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,056 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:30,056 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:30,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,059 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:30,059 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:30,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:30,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:30,176 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:30,177 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:30,177 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:30,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,177 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:30,177 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:30,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2191 [2022-12-13 02:05:30,177 INFO L420 AbstractCegarLoop]: === Iteration 2193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:30,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1333531285, now seen corresponding path program 1 times [2022-12-13 02:05:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:30,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194053054] [2022-12-13 02:05:30,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:30,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:30,236 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 02:05:30,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:30,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194053054] [2022-12-13 02:05:30,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194053054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:30,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:30,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113367924] [2022-12-13 02:05:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:30,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:30,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:30,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:30,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:30,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:30,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:30,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:30,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:30,280 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:30,280 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:30,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:30,280 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:30,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:30,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:30,281 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:30,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:30,282 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,282 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:30,282 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:30,282 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:30,282 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:30,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:30,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,285 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:30,285 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:30,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:30,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:30,404 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:30,405 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:30,405 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:30,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,405 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:30,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:30,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2192 [2022-12-13 02:05:30,405 INFO L420 AbstractCegarLoop]: === Iteration 2194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:30,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1276272983, now seen corresponding path program 1 times [2022-12-13 02:05:30,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:30,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155521303] [2022-12-13 02:05:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:30,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:30,462 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 02:05:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:30,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155521303] [2022-12-13 02:05:30,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155521303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:30,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:30,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:30,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663805366] [2022-12-13 02:05:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:30,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:30,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:30,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:30,463 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:30,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:30,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:30,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:30,506 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:30,506 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:30,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:30,507 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:30,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:30,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:30,507 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:30,507 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:30,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:30,508 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,508 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:30,508 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:30,508 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:30,508 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:30,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:30,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,511 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:30,511 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:30,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:30,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:30,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:30,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:30,629 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:30,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:30,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:30,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2193 [2022-12-13 02:05:30,630 INFO L420 AbstractCegarLoop]: === Iteration 2195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:30,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1219014681, now seen corresponding path program 1 times [2022-12-13 02:05:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:30,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230657765] [2022-12-13 02:05:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:30,695 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 02:05:30,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:30,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230657765] [2022-12-13 02:05:30,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230657765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:30,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:30,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:30,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139924783] [2022-12-13 02:05:30,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:30,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:30,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:30,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:30,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:30,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:30,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:30,740 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:30,740 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:30,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:30,741 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:30,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:30,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:30,741 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:30,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:30,742 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,742 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:30,742 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:30,742 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:30,742 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,742 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:30,742 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:30,742 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,745 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:30,745 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:30,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:30,745 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,745 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:30,873 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:30,874 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:05:30,874 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:30,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:30,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:30,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2194 [2022-12-13 02:05:30,874 INFO L420 AbstractCegarLoop]: === Iteration 2196 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1161756379, now seen corresponding path program 1 times [2022-12-13 02:05:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:30,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067707497] [2022-12-13 02:05:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:30,935 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 02:05:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067707497] [2022-12-13 02:05:30,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067707497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:30,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:30,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:30,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979513359] [2022-12-13 02:05:30,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:30,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:30,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:30,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:30,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:30,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:30,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:30,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:30,987 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:30,987 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:30,988 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:30,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:30,988 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:30,988 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:30,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:30,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:30,989 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,989 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:30,989 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:30,989 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:30,989 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,989 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:30,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:30,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:30,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,992 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:30,992 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:30,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:30,992 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:30,992 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:31,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:31,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:31,112 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:31,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:31,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:31,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2195 [2022-12-13 02:05:31,112 INFO L420 AbstractCegarLoop]: === Iteration 2197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:31,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1104498077, now seen corresponding path program 1 times [2022-12-13 02:05:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:31,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670511483] [2022-12-13 02:05:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:31,170 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 02:05:31,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:31,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670511483] [2022-12-13 02:05:31,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670511483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:31,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:31,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336309125] [2022-12-13 02:05:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:31,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:31,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:31,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:31,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:31,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:31,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:31,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:31,221 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:31,221 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:31,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:31,222 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:31,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:31,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:31,222 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:31,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:31,223 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:31,223 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:31,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:31,223 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:31,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:31,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,226 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:31,226 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:31,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:31,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:31,344 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:31,345 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:31,345 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:31,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:31,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:31,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2196 [2022-12-13 02:05:31,345 INFO L420 AbstractCegarLoop]: === Iteration 2198 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:31,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1047239775, now seen corresponding path program 1 times [2022-12-13 02:05:31,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:31,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553746520] [2022-12-13 02:05:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:31,411 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 02:05:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:31,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553746520] [2022-12-13 02:05:31,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553746520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:31,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:31,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:31,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362355016] [2022-12-13 02:05:31,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:31,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:31,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:31,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:31,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:31,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:31,464 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:31,464 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:31,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:31,464 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:31,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:31,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:31,465 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:31,465 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:31,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:31,466 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,466 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:31,466 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:31,466 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:31,466 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,466 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:31,466 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:31,466 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,469 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:31,469 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:31,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:31,469 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,469 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:31,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:31,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:31,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:31,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:31,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2197 [2022-12-13 02:05:31,587 INFO L420 AbstractCegarLoop]: === Iteration 2199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -989981473, now seen corresponding path program 1 times [2022-12-13 02:05:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453060376] [2022-12-13 02:05:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:31,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:31,653 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 02:05:31,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:31,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453060376] [2022-12-13 02:05:31,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453060376] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:31,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:31,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:31,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992322086] [2022-12-13 02:05:31,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:31,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:31,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:31,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:31,654 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:31,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:31,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:31,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:31,698 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:31,698 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:31,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:31,699 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:31,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:31,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:31,699 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:31,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:31,700 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:31,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:31,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:31,701 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:31,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:31,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:31,704 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:31,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:31,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:31,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:31,823 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:31,823 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:31,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:31,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:31,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2198 [2022-12-13 02:05:31,824 INFO L420 AbstractCegarLoop]: === Iteration 2200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash -932723171, now seen corresponding path program 1 times [2022-12-13 02:05:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:31,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074743297] [2022-12-13 02:05:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:31,882 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 02:05:31,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:31,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074743297] [2022-12-13 02:05:31,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074743297] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:31,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:31,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:31,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996847662] [2022-12-13 02:05:31,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:31,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:31,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:31,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:31,883 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:31,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:31,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:31,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:31,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:31,933 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:31,933 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:31,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:31,933 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:31,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:31,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:31,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:31,934 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:31,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:31,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:31,935 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:31,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:31,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:31,935 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:31,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:31,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:31,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,938 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:31,938 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:31,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:31,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:31,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:32,055 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:32,056 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:32,056 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:32,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,056 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:32,056 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:32,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2199 [2022-12-13 02:05:32,056 INFO L420 AbstractCegarLoop]: === Iteration 2201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash -875464869, now seen corresponding path program 1 times [2022-12-13 02:05:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:32,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666829574] [2022-12-13 02:05:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:32,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:32,125 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 02:05:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:32,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666829574] [2022-12-13 02:05:32,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666829574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:32,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:32,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:32,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486273523] [2022-12-13 02:05:32,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:32,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:32,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:32,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:32,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:32,126 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:32,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:32,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:32,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:32,175 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:32,175 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:32,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:32,176 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:32,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:32,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:32,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:32,176 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:32,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:32,177 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,177 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:32,177 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:32,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:32,177 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,177 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:32,177 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:32,178 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,180 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:32,180 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:32,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:32,180 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:32,297 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:32,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:32,299 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:32,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,299 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:32,299 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:32,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2200 [2022-12-13 02:05:32,299 INFO L420 AbstractCegarLoop]: === Iteration 2202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:32,299 INFO L85 PathProgramCache]: Analyzing trace with hash -818206567, now seen corresponding path program 1 times [2022-12-13 02:05:32,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:32,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161834717] [2022-12-13 02:05:32,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:32,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:32,355 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 02:05:32,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:32,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161834717] [2022-12-13 02:05:32,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161834717] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:32,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:32,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:32,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487237116] [2022-12-13 02:05:32,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:32,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:32,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:32,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:32,356 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:32,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:32,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:32,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:32,407 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:32,407 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:32,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:32,408 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:32,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:32,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:32,408 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:32,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:32,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:32,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:32,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:32,409 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:32,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:32,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,412 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:32,412 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:32,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:32,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,413 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:32,535 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:32,537 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:05:32,537 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:32,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:32,537 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:32,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2201 [2022-12-13 02:05:32,537 INFO L420 AbstractCegarLoop]: === Iteration 2203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:32,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash -760948265, now seen corresponding path program 1 times [2022-12-13 02:05:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:32,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976948513] [2022-12-13 02:05:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:32,602 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 02:05:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:32,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976948513] [2022-12-13 02:05:32,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976948513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:32,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:32,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:32,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842856075] [2022-12-13 02:05:32,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:32,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:32,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:32,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:32,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:32,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:32,665 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:32,665 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:32,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:32,666 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:32,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:32,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:32,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:32,667 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:32,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:32,668 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:32,668 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:32,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:32,668 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:32,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:32,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,671 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:32,671 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:32,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:32,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:32,806 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:32,807 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:32,807 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:32,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,807 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:32,807 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:32,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2202 [2022-12-13 02:05:32,807 INFO L420 AbstractCegarLoop]: === Iteration 2204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:32,808 INFO L85 PathProgramCache]: Analyzing trace with hash -703689963, now seen corresponding path program 1 times [2022-12-13 02:05:32,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:32,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282895787] [2022-12-13 02:05:32,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:32,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:32,877 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 02:05:32,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:32,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282895787] [2022-12-13 02:05:32,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282895787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:32,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:32,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:32,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361786751] [2022-12-13 02:05:32,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:32,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:32,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:32,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:32,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:32,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:32,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:32,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:32,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:32,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:32,932 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:32,932 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:32,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:32,933 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:32,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:32,934 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:32,934 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:32,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:32,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:32,935 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,935 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:32,935 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:32,935 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:32,935 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,935 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:32,935 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:32,935 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:32,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,938 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:32,938 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:32,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:32,938 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:32,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:33,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:33,074 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:33,074 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:33,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:33,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2203 [2022-12-13 02:05:33,075 INFO L420 AbstractCegarLoop]: === Iteration 2205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:33,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:33,075 INFO L85 PathProgramCache]: Analyzing trace with hash -646431661, now seen corresponding path program 1 times [2022-12-13 02:05:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:33,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272237295] [2022-12-13 02:05:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:33,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:33,140 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 02:05:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272237295] [2022-12-13 02:05:33,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272237295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:33,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:33,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985622192] [2022-12-13 02:05:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:33,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:33,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:33,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:33,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:33,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:33,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:33,184 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:33,185 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:33,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:33,185 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:33,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:33,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:33,186 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:33,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:33,187 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:33,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:33,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:33,187 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:33,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:33,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,190 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:33,190 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:33,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:33,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:33,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:33,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:33,309 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:33,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:33,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:33,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2204 [2022-12-13 02:05:33,310 INFO L420 AbstractCegarLoop]: === Iteration 2206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:33,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:33,310 INFO L85 PathProgramCache]: Analyzing trace with hash -589173359, now seen corresponding path program 1 times [2022-12-13 02:05:33,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:33,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531958548] [2022-12-13 02:05:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:33,369 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 02:05:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:33,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531958548] [2022-12-13 02:05:33,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531958548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:33,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:33,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:33,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990614687] [2022-12-13 02:05:33,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:33,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:33,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:33,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:33,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:33,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:33,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:33,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:33,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:33,420 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:33,420 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:33,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:33,420 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:33,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:33,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:33,421 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:33,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:33,422 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:33,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:33,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:33,422 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:33,422 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:33,422 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,425 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:33,425 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:33,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:33,425 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,425 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:33,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:33,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:33,546 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:33,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:33,546 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:33,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2205 [2022-12-13 02:05:33,546 INFO L420 AbstractCegarLoop]: === Iteration 2207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:33,546 INFO L85 PathProgramCache]: Analyzing trace with hash -531915057, now seen corresponding path program 1 times [2022-12-13 02:05:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:33,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172012623] [2022-12-13 02:05:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:33,635 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 02:05:33,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:33,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172012623] [2022-12-13 02:05:33,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172012623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:33,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:33,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:33,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104770380] [2022-12-13 02:05:33,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:33,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:33,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:33,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:33,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:33,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:33,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:33,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:33,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:33,698 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:33,698 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:33,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:33,699 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:33,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:33,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:33,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:33,699 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:33,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:33,700 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:33,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:33,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:33,700 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:33,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:33,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:33,703 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:33,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:33,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:33,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:33,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:33,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:33,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:33,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:33,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2206 [2022-12-13 02:05:33,838 INFO L420 AbstractCegarLoop]: === Iteration 2208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:33,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash -474656755, now seen corresponding path program 1 times [2022-12-13 02:05:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375240749] [2022-12-13 02:05:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:33,905 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 02:05:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375240749] [2022-12-13 02:05:33,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375240749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:33,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:33,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666379573] [2022-12-13 02:05:33,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:33,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:33,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:33,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:33,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:33,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:33,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:33,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:33,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:33,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:33,964 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:33,964 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:33,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:33,965 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:33,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:33,966 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:33,966 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:33,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:33,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:33,967 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,967 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:33,967 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:33,967 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:33,967 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,967 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:33,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:33,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:33,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,970 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:33,970 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:33,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:33,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:33,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:34,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:34,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:34,093 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:34,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:34,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:34,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2207 [2022-12-13 02:05:34,093 INFO L420 AbstractCegarLoop]: === Iteration 2209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash -417398453, now seen corresponding path program 1 times [2022-12-13 02:05:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:34,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497827175] [2022-12-13 02:05:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:34,150 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 02:05:34,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:34,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497827175] [2022-12-13 02:05:34,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497827175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:34,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:34,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817453928] [2022-12-13 02:05:34,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:34,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:34,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:34,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:34,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:34,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:34,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:34,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:34,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:34,194 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:34,195 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:34,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:34,195 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:34,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:34,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:34,196 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:34,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:34,196 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,197 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:34,197 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:34,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:34,197 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:34,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:34,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,200 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:34,200 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:34,200 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,200 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:34,317 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:34,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:34,318 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:34,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:34,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:34,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2208 [2022-12-13 02:05:34,319 INFO L420 AbstractCegarLoop]: === Iteration 2210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:34,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:34,319 INFO L85 PathProgramCache]: Analyzing trace with hash -360140151, now seen corresponding path program 1 times [2022-12-13 02:05:34,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:34,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327768029] [2022-12-13 02:05:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:34,374 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 02:05:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:34,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327768029] [2022-12-13 02:05:34,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327768029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:34,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:34,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345711581] [2022-12-13 02:05:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:34,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:34,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:34,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:34,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:34,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:34,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:34,425 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:34,425 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:34,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:34,425 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:34,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:34,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:34,426 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:34,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:34,427 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:34,427 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:34,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:34,427 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,427 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:34,427 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:34,427 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,430 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:34,430 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:34,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:34,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:34,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:34,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:34,549 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:34,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:34,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:34,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2209 [2022-12-13 02:05:34,550 INFO L420 AbstractCegarLoop]: === Iteration 2211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -302881849, now seen corresponding path program 1 times [2022-12-13 02:05:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:34,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820232541] [2022-12-13 02:05:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:34,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:34,608 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 02:05:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:34,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820232541] [2022-12-13 02:05:34,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820232541] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:34,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:34,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165709135] [2022-12-13 02:05:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:34,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:34,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:34,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:34,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:34,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:34,652 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:34,652 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:34,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:34,653 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:34,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:34,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:34,653 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:34,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:34,654 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,654 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:34,654 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:34,654 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:34,654 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,654 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:34,654 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:34,654 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,657 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:34,657 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:34,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:34,657 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,657 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:34,775 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:34,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:34,776 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:34,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,777 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:34,777 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:34,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2210 [2022-12-13 02:05:34,777 INFO L420 AbstractCegarLoop]: === Iteration 2212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:34,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash -245623547, now seen corresponding path program 1 times [2022-12-13 02:05:34,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:34,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922977463] [2022-12-13 02:05:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:34,836 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 02:05:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:34,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922977463] [2022-12-13 02:05:34,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922977463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:34,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:34,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:34,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085035368] [2022-12-13 02:05:34,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:34,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:34,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:34,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:34,836 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:34,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:34,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:34,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:34,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:34,880 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:34,880 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:34,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:34,880 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:34,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:34,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:34,881 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:34,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:34,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:34,882 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,882 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:34,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:34,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:34,882 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:34,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:34,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:34,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,885 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:34,885 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:34,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:34,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:34,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:35,003 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:35,004 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:35,004 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:35,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,004 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,004 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2211 [2022-12-13 02:05:35,004 INFO L420 AbstractCegarLoop]: === Iteration 2213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:35,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,004 INFO L85 PathProgramCache]: Analyzing trace with hash -188365245, now seen corresponding path program 1 times [2022-12-13 02:05:35,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150857251] [2022-12-13 02:05:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:35,080 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 02:05:35,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:35,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150857251] [2022-12-13 02:05:35,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150857251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:35,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:35,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:35,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857891086] [2022-12-13 02:05:35,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:35,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:35,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:35,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:35,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:35,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:35,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:35,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:35,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:35,131 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:35,131 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:35,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:35,131 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:35,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:35,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:35,132 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:35,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:35,133 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,133 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:35,133 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:35,133 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:35,133 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,133 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:35,133 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:35,133 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,136 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:35,136 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:35,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:35,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:35,252 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:35,253 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:35,253 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:35,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2212 [2022-12-13 02:05:35,253 INFO L420 AbstractCegarLoop]: === Iteration 2214 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash -131106943, now seen corresponding path program 1 times [2022-12-13 02:05:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252747939] [2022-12-13 02:05:35,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:35,310 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 02:05:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252747939] [2022-12-13 02:05:35,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252747939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:35,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:35,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:35,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100641428] [2022-12-13 02:05:35,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:35,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:35,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:35,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:35,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:35,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:35,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:35,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:35,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:35,359 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:35,359 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:35,360 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:35,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:35,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:35,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:35,360 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:35,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:35,361 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:35,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:35,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:35,361 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:35,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:35,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,364 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:35,364 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:35,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:35,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:35,483 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:35,484 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:35,484 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:35,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,484 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,484 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2213 [2022-12-13 02:05:35,484 INFO L420 AbstractCegarLoop]: === Iteration 2215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,484 INFO L85 PathProgramCache]: Analyzing trace with hash -73848641, now seen corresponding path program 1 times [2022-12-13 02:05:35,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797030265] [2022-12-13 02:05:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:35,543 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 02:05:35,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:35,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797030265] [2022-12-13 02:05:35,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797030265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:35,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:35,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:35,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535424075] [2022-12-13 02:05:35,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:35,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:35,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:35,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:35,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:35,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:35,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:35,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:35,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:35,588 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:35,588 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:35,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:35,589 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:35,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:35,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:35,589 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:35,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:35,590 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:35,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:35,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:35,590 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,591 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:35,591 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:35,591 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,593 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:35,593 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:35,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:35,594 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:35,712 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:35,713 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:35,713 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,713 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,713 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2214 [2022-12-13 02:05:35,714 INFO L420 AbstractCegarLoop]: === Iteration 2216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:35,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,714 INFO L85 PathProgramCache]: Analyzing trace with hash -16590339, now seen corresponding path program 1 times [2022-12-13 02:05:35,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592280511] [2022-12-13 02:05:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:35,771 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 02:05:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:35,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592280511] [2022-12-13 02:05:35,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592280511] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:35,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:35,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:35,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177394110] [2022-12-13 02:05:35,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:35,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:35,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:35,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:35,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:35,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:35,823 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:35,823 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:35,824 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:35,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:35,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:35,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:35,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:35,824 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:35,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:35,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:35,825 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:35,825 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:35,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:35,825 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:35,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:35,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:35,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,828 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:35,828 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:35,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:35,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:35,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:35,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:35,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:05:35,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:35,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:35,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:35,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:35,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2215 [2022-12-13 02:05:35,952 INFO L420 AbstractCegarLoop]: === Iteration 2217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:35,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:35,952 INFO L85 PathProgramCache]: Analyzing trace with hash 40667963, now seen corresponding path program 1 times [2022-12-13 02:05:35,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:35,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085439269] [2022-12-13 02:05:35,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,010 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 02:05:36,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085439269] [2022-12-13 02:05:36,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085439269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:36,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130215652] [2022-12-13 02:05:36,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:36,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:36,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,061 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:36,061 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:36,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:36,062 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:36,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:36,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:36,062 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:36,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:36,063 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,063 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:36,063 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:36,064 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,064 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,064 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,064 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,064 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,066 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:36,067 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:36,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:36,067 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,067 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:36,184 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:36,185 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:36,185 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:36,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,185 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2216 [2022-12-13 02:05:36,185 INFO L420 AbstractCegarLoop]: === Iteration 2218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:36,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash 97926265, now seen corresponding path program 1 times [2022-12-13 02:05:36,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996912539] [2022-12-13 02:05:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,241 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 02:05:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996912539] [2022-12-13 02:05:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996912539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547583759] [2022-12-13 02:05:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,242 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:36,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:36,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,292 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:36,293 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:36,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:36,293 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:36,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:36,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:36,294 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:36,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:36,294 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:36,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:36,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,295 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:36,298 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:36,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:36,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:36,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:36,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:36,419 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:36,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2217 [2022-12-13 02:05:36,419 INFO L420 AbstractCegarLoop]: === Iteration 2219 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,419 INFO L85 PathProgramCache]: Analyzing trace with hash 155184567, now seen corresponding path program 1 times [2022-12-13 02:05:36,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151208399] [2022-12-13 02:05:36,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,478 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 02:05:36,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151208399] [2022-12-13 02:05:36,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151208399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121354461] [2022-12-13 02:05:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:36,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:36,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,535 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:36,535 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:36,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:36,536 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:36,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:36,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:36,536 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:36,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:36,537 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:36,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:36,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,540 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:36,540 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:36,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:36,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:36,658 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:36,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:36,659 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:36,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2218 [2022-12-13 02:05:36,659 INFO L420 AbstractCegarLoop]: === Iteration 2220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash 212442869, now seen corresponding path program 1 times [2022-12-13 02:05:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271832419] [2022-12-13 02:05:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,716 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 02:05:36,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271832419] [2022-12-13 02:05:36,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271832419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545059891] [2022-12-13 02:05:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,717 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:36,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:36,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,771 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:36,771 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:36,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:36,771 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:36,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:36,772 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:36,772 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:36,773 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,773 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:36,773 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:36,773 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:36,773 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,773 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:36,773 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:36,773 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:36,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,776 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:36,776 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:36,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:36,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:36,776 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:36,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:36,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:36,897 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:36,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:36,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:36,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2219 [2022-12-13 02:05:36,897 INFO L420 AbstractCegarLoop]: === Iteration 2221 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash 269701171, now seen corresponding path program 1 times [2022-12-13 02:05:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:36,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224379119] [2022-12-13 02:05:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:36,953 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 02:05:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224379119] [2022-12-13 02:05:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224379119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:36,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:36,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913994702] [2022-12-13 02:05:36,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:36,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:36,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:36,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:36,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:36,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:36,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:36,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:36,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:36,998 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:36,998 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:36,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:36,998 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:36,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:36,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:36,999 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:36,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:36,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:37,000 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,000 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:37,000 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:37,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:37,000 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:37,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:37,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,003 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:37,003 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:37,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:37,003 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,003 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:37,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:37,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:37,123 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:37,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:37,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:37,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2220 [2022-12-13 02:05:37,123 INFO L420 AbstractCegarLoop]: === Iteration 2222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash 326959473, now seen corresponding path program 1 times [2022-12-13 02:05:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483119080] [2022-12-13 02:05:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:37,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:37,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483119080] [2022-12-13 02:05:37,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483119080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:37,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:37,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:37,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736474182] [2022-12-13 02:05:37,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:37,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:37,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:37,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:37,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:37,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:37,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:37,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:37,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:37,227 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:37,227 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:37,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:37,228 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:37,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:37,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:37,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:37,228 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:37,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:37,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:37,229 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,229 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:37,229 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:37,229 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:37,229 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,229 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:37,229 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:37,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,232 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:37,232 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:37,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:37,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:37,389 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:37,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 02:05:37,391 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:37,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,391 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:37,391 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:37,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2221 [2022-12-13 02:05:37,391 INFO L420 AbstractCegarLoop]: === Iteration 2223 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 384217775, now seen corresponding path program 1 times [2022-12-13 02:05:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:37,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352271508] [2022-12-13 02:05:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:37,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:37,449 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 02:05:37,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:37,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352271508] [2022-12-13 02:05:37,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352271508] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:37,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:37,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:37,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57398011] [2022-12-13 02:05:37,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:37,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:37,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:37,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:37,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:37,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:37,502 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:37,503 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:37,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:37,503 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:37,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:37,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:37,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:37,504 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:37,504 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:37,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:37,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:37,504 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,505 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:37,505 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:37,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:37,505 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,505 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:37,505 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:37,505 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,508 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:37,508 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:37,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:37,508 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,508 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:37,628 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:37,629 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:37,629 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:37,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:37,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:37,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2222 [2022-12-13 02:05:37,630 INFO L420 AbstractCegarLoop]: === Iteration 2224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash 441476077, now seen corresponding path program 1 times [2022-12-13 02:05:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:37,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111990946] [2022-12-13 02:05:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:37,703 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 02:05:37,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:37,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111990946] [2022-12-13 02:05:37,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111990946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:37,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:37,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:37,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028353226] [2022-12-13 02:05:37,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:37,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:37,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:37,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:37,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:37,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:37,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:37,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:37,758 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:37,758 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:37,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:37,759 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:37,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:37,759 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:37,759 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:37,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:37,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:37,761 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:37,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:37,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:37,761 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:37,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:37,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:37,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,765 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:37,765 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:37,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:37,766 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:37,766 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:37,896 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:37,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:37,898 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:37,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:37,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:37,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2223 [2022-12-13 02:05:37,898 INFO L420 AbstractCegarLoop]: === Iteration 2225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 498734379, now seen corresponding path program 1 times [2022-12-13 02:05:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549906628] [2022-12-13 02:05:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:37,977 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 02:05:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549906628] [2022-12-13 02:05:37,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549906628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:37,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:37,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938909577] [2022-12-13 02:05:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:37,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:37,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:37,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:37,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:37,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:37,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:37,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:37,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:37,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:38,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:38,031 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:38,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:38,031 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:38,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:38,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:38,032 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:38,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:38,033 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:38,033 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:38,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:38,033 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:38,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:38,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,037 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:38,037 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:38,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:38,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,038 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:38,179 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:38,180 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 02:05:38,180 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:38,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,180 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:38,180 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:38,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2224 [2022-12-13 02:05:38,180 INFO L420 AbstractCegarLoop]: === Iteration 2226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:38,180 INFO L85 PathProgramCache]: Analyzing trace with hash 555992681, now seen corresponding path program 1 times [2022-12-13 02:05:38,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:38,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219405782] [2022-12-13 02:05:38,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:38,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:38,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:38,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219405782] [2022-12-13 02:05:38,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219405782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:38,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:38,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486791313] [2022-12-13 02:05:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:38,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:38,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:38,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:38,240 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:38,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:38,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:38,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:38,292 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:38,292 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:38,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:38,293 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:38,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:38,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:38,294 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:38,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:38,294 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:38,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:38,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:38,295 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:38,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:38,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:38,297 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:38,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:38,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:38,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:38,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:05:38,432 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:38,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:38,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:38,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2225 [2022-12-13 02:05:38,432 INFO L420 AbstractCegarLoop]: === Iteration 2227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:38,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 613250983, now seen corresponding path program 1 times [2022-12-13 02:05:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:38,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934865148] [2022-12-13 02:05:38,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:38,504 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 02:05:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:38,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934865148] [2022-12-13 02:05:38,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934865148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:38,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:38,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702663849] [2022-12-13 02:05:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:38,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:38,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:38,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:38,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:38,565 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:38,565 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:38,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:38,566 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:38,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:38,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:38,566 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:38,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:38,567 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:38,567 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:38,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:38,567 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:38,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:38,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,570 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:38,570 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:38,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:38,570 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:38,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:38,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:38,706 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:38,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:38,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:38,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2226 [2022-12-13 02:05:38,706 INFO L420 AbstractCegarLoop]: === Iteration 2228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 670509285, now seen corresponding path program 1 times [2022-12-13 02:05:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:38,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019844413] [2022-12-13 02:05:38,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:38,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 02:05:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:38,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019844413] [2022-12-13 02:05:38,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019844413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:38,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:38,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441763598] [2022-12-13 02:05:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:38,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:38,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:38,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:38,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:38,774 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:38,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:38,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:38,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:38,825 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:38,825 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:38,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:38,825 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:38,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:38,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:38,826 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:38,826 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:38,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:38,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:38,826 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,827 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:38,827 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:38,827 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:38,827 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,827 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:38,827 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:38,827 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:38,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,830 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:38,830 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:38,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:38,830 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:38,830 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:38,948 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:38,948 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:38,949 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:38,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:38,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:38,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:38,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2227 [2022-12-13 02:05:38,949 INFO L420 AbstractCegarLoop]: === Iteration 2229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash 727767587, now seen corresponding path program 1 times [2022-12-13 02:05:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:38,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802530290] [2022-12-13 02:05:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:39,006 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 02:05:39,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:39,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802530290] [2022-12-13 02:05:39,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802530290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:39,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:39,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:39,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469629380] [2022-12-13 02:05:39,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:39,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:39,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:39,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:39,007 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:39,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:39,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:39,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:39,050 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:39,051 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:39,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:39,051 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:39,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:39,052 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:39,052 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:39,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:39,052 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:39,053 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:39,053 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:39,053 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:39,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:39,053 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,055 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:39,056 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:39,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:39,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:39,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:39,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:39,174 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:39,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:39,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:39,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2228 [2022-12-13 02:05:39,175 INFO L420 AbstractCegarLoop]: === Iteration 2230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:39,175 INFO L85 PathProgramCache]: Analyzing trace with hash 785025889, now seen corresponding path program 1 times [2022-12-13 02:05:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:39,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058895738] [2022-12-13 02:05:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:39,231 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 02:05:39,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:39,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058895738] [2022-12-13 02:05:39,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058895738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:39,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:39,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216873553] [2022-12-13 02:05:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:39,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:39,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:39,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:39,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:39,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:39,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:39,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:39,282 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:39,283 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:39,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:39,283 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:39,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:39,284 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:39,284 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:39,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:39,284 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,284 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:39,285 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:39,285 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:39,285 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,285 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:39,285 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:39,285 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,288 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:39,288 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:39,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:39,288 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,288 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:39,406 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:39,407 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:39,407 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:39,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:39,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:39,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2229 [2022-12-13 02:05:39,408 INFO L420 AbstractCegarLoop]: === Iteration 2231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:39,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 842284191, now seen corresponding path program 1 times [2022-12-13 02:05:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:39,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239296546] [2022-12-13 02:05:39,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:39,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:39,464 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 02:05:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:39,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239296546] [2022-12-13 02:05:39,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239296546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:39,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:39,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204293050] [2022-12-13 02:05:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:39,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:39,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:39,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:39,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:39,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:39,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:39,517 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:39,517 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:39,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:39,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:39,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:39,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:39,518 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:39,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:39,519 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,519 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:39,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:39,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:39,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:39,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:39,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,522 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:39,522 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:39,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:39,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:39,644 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:39,645 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:39,645 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:39,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2230 [2022-12-13 02:05:39,646 INFO L420 AbstractCegarLoop]: === Iteration 2232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:39,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:39,646 INFO L85 PathProgramCache]: Analyzing trace with hash 899542493, now seen corresponding path program 1 times [2022-12-13 02:05:39,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:39,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484588450] [2022-12-13 02:05:39,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:39,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:39,726 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 02:05:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:39,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484588450] [2022-12-13 02:05:39,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484588450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:39,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:39,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457046060] [2022-12-13 02:05:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:39,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:39,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:39,727 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:39,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:39,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:39,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:39,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:39,788 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:39,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:39,789 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:39,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:39,790 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:39,790 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:39,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:39,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:39,790 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,791 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:39,791 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:39,791 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:39,791 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:39,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:39,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:39,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,794 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:39,794 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:39,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:39,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:39,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:39,916 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:39,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:39,917 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:39,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:39,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:39,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2231 [2022-12-13 02:05:39,918 INFO L420 AbstractCegarLoop]: === Iteration 2233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash 956800795, now seen corresponding path program 1 times [2022-12-13 02:05:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:39,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685048799] [2022-12-13 02:05:39,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:39,977 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 02:05:39,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:39,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685048799] [2022-12-13 02:05:39,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685048799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:39,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:39,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:39,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53468207] [2022-12-13 02:05:39,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:39,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:39,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:39,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:39,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:39,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:39,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:40,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:40,030 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:40,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:40,030 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:40,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:40,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:40,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:40,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:40,031 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:40,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:40,032 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:40,032 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:40,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:40,032 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,032 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:40,032 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:40,032 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,035 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:40,035 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:40,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:40,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:40,161 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:40,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:05:40,162 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:40,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:40,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:40,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2232 [2022-12-13 02:05:40,162 INFO L420 AbstractCegarLoop]: === Iteration 2234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:40,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1014059097, now seen corresponding path program 1 times [2022-12-13 02:05:40,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:40,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551423754] [2022-12-13 02:05:40,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:40,218 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 02:05:40,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:40,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551423754] [2022-12-13 02:05:40,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551423754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:40,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:40,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:40,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041421647] [2022-12-13 02:05:40,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:40,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:40,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:40,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:40,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:40,219 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:40,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:40,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:40,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:40,263 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:40,263 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:40,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:40,263 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:40,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:40,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:40,264 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:40,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:40,264 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,264 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:40,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:40,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:40,265 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,265 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:40,265 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:40,265 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,267 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:40,267 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:40,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:40,268 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,268 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:40,382 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:40,383 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:40,383 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:40,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:40,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:40,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2233 [2022-12-13 02:05:40,383 INFO L420 AbstractCegarLoop]: === Iteration 2235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:40,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1071317399, now seen corresponding path program 1 times [2022-12-13 02:05:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:40,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774028973] [2022-12-13 02:05:40,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:40,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:40,442 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 02:05:40,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:40,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774028973] [2022-12-13 02:05:40,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774028973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:40,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:40,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:40,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051116177] [2022-12-13 02:05:40,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:40,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:40,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:40,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:40,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:40,443 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:40,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:40,443 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:40,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:40,486 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:40,486 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:40,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:40,487 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:40,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:40,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:40,487 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:40,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:40,488 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,488 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:40,488 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:40,488 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:40,488 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:40,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:40,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,491 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:40,491 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:40,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:40,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:40,617 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:40,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:05:40,618 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:40,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:40,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:40,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2234 [2022-12-13 02:05:40,619 INFO L420 AbstractCegarLoop]: === Iteration 2236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:40,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1128575701, now seen corresponding path program 1 times [2022-12-13 02:05:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:40,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190371020] [2022-12-13 02:05:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:40,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:40,682 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 02:05:40,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:40,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190371020] [2022-12-13 02:05:40,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190371020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:40,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:40,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:40,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426613368] [2022-12-13 02:05:40,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:40,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:40,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:40,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:40,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:40,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:40,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:40,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:40,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:40,734 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:40,734 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:40,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:40,735 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:40,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:40,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:40,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:40,735 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:40,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:40,736 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:40,736 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:40,736 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:40,736 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,736 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:40,736 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:40,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,739 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:40,739 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:40,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:40,739 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,739 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:40,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:40,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:40,862 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:40,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:40,863 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:40,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2235 [2022-12-13 02:05:40,863 INFO L420 AbstractCegarLoop]: === Iteration 2237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:40,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1185834003, now seen corresponding path program 1 times [2022-12-13 02:05:40,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:40,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929168397] [2022-12-13 02:05:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:40,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929168397] [2022-12-13 02:05:40,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929168397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:40,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:40,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365888431] [2022-12-13 02:05:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:40,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:40,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:40,922 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:40,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:40,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:40,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:40,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:40,973 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:40,973 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:40,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:40,974 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:40,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:40,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:40,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:40,974 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:40,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:40,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:40,975 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:40,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:40,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:40,975 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,975 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:40,975 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:40,975 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:40,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,978 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:40,978 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:40,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:40,978 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:40,978 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:41,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:41,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:05:41,107 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:41,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:41,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:41,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2236 [2022-12-13 02:05:41,107 INFO L420 AbstractCegarLoop]: === Iteration 2238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:41,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1243092305, now seen corresponding path program 1 times [2022-12-13 02:05:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:41,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181050088] [2022-12-13 02:05:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:41,179 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 02:05:41,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:41,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181050088] [2022-12-13 02:05:41,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181050088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:41,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:41,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997577692] [2022-12-13 02:05:41,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:41,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:41,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:41,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:41,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:41,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:41,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:41,224 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:41,224 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:41,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:41,225 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:41,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:41,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:41,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:41,225 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:41,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:41,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:41,226 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:41,226 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:41,226 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:41,227 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:41,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:41,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:41,229 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:41,229 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:41,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:41,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:41,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:41,350 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:41,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:41,352 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:41,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:41,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:41,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2237 [2022-12-13 02:05:41,352 INFO L420 AbstractCegarLoop]: === Iteration 2239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:41,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1300350607, now seen corresponding path program 1 times [2022-12-13 02:05:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:41,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477050180] [2022-12-13 02:05:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:41,426 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 02:05:41,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:41,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477050180] [2022-12-13 02:05:41,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477050180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:41,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:41,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814531040] [2022-12-13 02:05:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:41,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:41,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:41,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:41,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:41,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:41,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:41,481 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:41,481 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:41,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:41,482 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:41,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:41,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:41,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:41,482 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:41,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:41,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:41,483 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,483 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:41,483 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:41,483 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:41,483 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,484 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:41,484 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:41,484 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:41,486 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:41,486 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:41,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:41,487 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:41,487 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:41,621 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:41,622 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:41,622 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:41,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,622 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:41,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:41,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2238 [2022-12-13 02:05:41,622 INFO L420 AbstractCegarLoop]: === Iteration 2240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:41,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:41,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1357608909, now seen corresponding path program 1 times [2022-12-13 02:05:41,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:41,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904517463] [2022-12-13 02:05:41,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:41,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:41,696 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 02:05:41,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:41,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904517463] [2022-12-13 02:05:41,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904517463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:41,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:41,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525465831] [2022-12-13 02:05:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:41,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:41,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:41,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:41,697 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:41,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:41,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:41,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:41,751 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:41,751 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:41,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:41,752 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:41,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:41,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:41,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:41,752 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:41,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:41,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:41,753 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:41,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:41,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:41,753 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:41,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:41,754 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:41,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:41,756 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:41,756 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:41,757 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:41,757 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:41,890 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:41,891 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:41,891 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:41,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,891 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:41,891 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:41,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2239 [2022-12-13 02:05:41,891 INFO L420 AbstractCegarLoop]: === Iteration 2241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1414867211, now seen corresponding path program 1 times [2022-12-13 02:05:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:41,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5432506] [2022-12-13 02:05:41,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:41,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:41,958 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 02:05:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:41,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5432506] [2022-12-13 02:05:41,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5432506] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:41,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282153400] [2022-12-13 02:05:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:41,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:41,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:41,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:41,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:41,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:41,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:41,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:42,015 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:42,015 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:42,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:42,016 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:42,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:42,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:42,017 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:42,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:42,017 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:42,018 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:42,018 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:42,018 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,018 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:42,018 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:42,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,021 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:42,021 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:42,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:42,158 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:42,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:05:42,159 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:42,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:42,159 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:42,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2240 [2022-12-13 02:05:42,160 INFO L420 AbstractCegarLoop]: === Iteration 2242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:42,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1472125513, now seen corresponding path program 1 times [2022-12-13 02:05:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:42,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300472076] [2022-12-13 02:05:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:42,226 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 02:05:42,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:42,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300472076] [2022-12-13 02:05:42,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300472076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:42,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:42,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:42,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217200660] [2022-12-13 02:05:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:42,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:42,227 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:42,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:42,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:42,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:42,281 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:42,281 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:42,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:42,282 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:42,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:42,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:42,282 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:42,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:42,283 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:42,283 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:42,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:42,284 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:42,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:42,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,286 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:42,287 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:42,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:42,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:42,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:42,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:05:42,427 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:42,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:42,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:42,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2241 [2022-12-13 02:05:42,428 INFO L420 AbstractCegarLoop]: === Iteration 2243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:42,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:42,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1529383815, now seen corresponding path program 1 times [2022-12-13 02:05:42,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:42,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134015029] [2022-12-13 02:05:42,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:42,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:42,504 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 02:05:42,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:42,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134015029] [2022-12-13 02:05:42,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134015029] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:42,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:42,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:42,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774295545] [2022-12-13 02:05:42,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:42,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:42,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:42,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:42,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:42,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:42,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:42,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:42,557 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:42,557 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:42,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:42,558 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:42,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:42,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:42,558 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:42,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:42,559 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:42,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:42,560 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:42,560 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,560 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:42,560 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:42,560 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,563 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:42,563 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:42,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:42,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:42,695 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:42,696 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:05:42,696 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:42,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:42,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:42,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2242 [2022-12-13 02:05:42,697 INFO L420 AbstractCegarLoop]: === Iteration 2244 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:42,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1586642117, now seen corresponding path program 1 times [2022-12-13 02:05:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:42,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320638120] [2022-12-13 02:05:42,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:42,779 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 02:05:42,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:42,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320638120] [2022-12-13 02:05:42,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320638120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:42,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:42,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242926324] [2022-12-13 02:05:42,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:42,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:42,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:42,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:42,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:42,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:42,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:42,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:42,837 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:42,837 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:42,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:42,838 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:42,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:42,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:42,839 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:42,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:42,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:42,839 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,839 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:42,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:42,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:42,840 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:42,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:42,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:42,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,842 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:42,843 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:42,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:42,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:42,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:42,977 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:42,978 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:42,978 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:42,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:42,978 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:42,978 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:42,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2243 [2022-12-13 02:05:42,978 INFO L420 AbstractCegarLoop]: === Iteration 2245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:42,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1643900419, now seen corresponding path program 1 times [2022-12-13 02:05:42,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:42,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513843507] [2022-12-13 02:05:42,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:42,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:43,049 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 02:05:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:43,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513843507] [2022-12-13 02:05:43,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513843507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:43,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:43,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:43,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317016056] [2022-12-13 02:05:43,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:43,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:43,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:43,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:43,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:43,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:43,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:43,104 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:43,104 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:43,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:43,104 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:43,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:43,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:43,105 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:43,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:43,106 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,106 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:43,106 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:43,106 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:43,106 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,106 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:43,106 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:43,106 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,109 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:43,109 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:43,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:43,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:43,246 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:43,248 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:43,248 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:43,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:43,248 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:43,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2244 [2022-12-13 02:05:43,248 INFO L420 AbstractCegarLoop]: === Iteration 2246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1701158721, now seen corresponding path program 1 times [2022-12-13 02:05:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:43,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154300887] [2022-12-13 02:05:43,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:43,306 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 02:05:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:43,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154300887] [2022-12-13 02:05:43,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154300887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:43,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:43,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823289160] [2022-12-13 02:05:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:43,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:43,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:43,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:43,307 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:43,307 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,307 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:43,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:43,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:43,350 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:43,350 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:43,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:43,351 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:43,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:43,351 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:43,351 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:43,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:43,352 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,352 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:43,352 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:43,352 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:43,352 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:43,353 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:43,353 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,355 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:43,355 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:43,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:43,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:43,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:43,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:43,473 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:43,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:43,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2245 [2022-12-13 02:05:43,474 INFO L420 AbstractCegarLoop]: === Iteration 2247 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1758417023, now seen corresponding path program 1 times [2022-12-13 02:05:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:43,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884559220] [2022-12-13 02:05:43,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:43,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:43,531 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 02:05:43,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:43,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884559220] [2022-12-13 02:05:43,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884559220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:43,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:43,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843906674] [2022-12-13 02:05:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:43,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:43,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:43,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:43,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:43,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:43,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:43,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:43,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:43,581 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:43,581 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:43,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:43,582 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:43,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:43,582 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:43,582 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:43,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:43,583 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,583 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:43,583 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:43,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:43,583 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,584 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:43,584 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:43,584 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,586 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:43,586 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:43,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:43,587 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,587 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:43,706 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:43,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:43,707 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:43,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,707 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:43,707 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:43,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2246 [2022-12-13 02:05:43,707 INFO L420 AbstractCegarLoop]: === Iteration 2248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1815675325, now seen corresponding path program 1 times [2022-12-13 02:05:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:43,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588084126] [2022-12-13 02:05:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:43,765 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 02:05:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:43,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588084126] [2022-12-13 02:05:43,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588084126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:43,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:43,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424968249] [2022-12-13 02:05:43,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:43,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:43,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:43,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:43,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:43,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:43,810 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:43,810 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:43,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:43,810 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:43,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:43,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:43,811 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:43,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:43,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:43,812 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:43,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:43,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:43,812 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:43,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:43,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:43,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,815 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:43,815 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:43,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:43,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:43,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:43,934 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:43,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:43,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:43,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:43,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2247 [2022-12-13 02:05:43,935 INFO L420 AbstractCegarLoop]: === Iteration 2249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:43,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1872933627, now seen corresponding path program 1 times [2022-12-13 02:05:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:43,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860173994] [2022-12-13 02:05:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:43,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:43,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860173994] [2022-12-13 02:05:43,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860173994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:43,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:43,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237147235] [2022-12-13 02:05:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:43,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:43,995 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:43,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:43,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:43,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:43,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:44,046 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:44,046 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:44,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:44,047 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:44,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:44,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:44,047 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:44,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:44,048 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:44,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:44,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:44,048 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,049 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:44,049 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:44,049 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,051 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:44,051 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:44,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:44,052 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,052 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:44,170 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:44,171 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:44,171 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:44,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,171 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:44,171 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:44,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2248 [2022-12-13 02:05:44,171 INFO L420 AbstractCegarLoop]: === Iteration 2250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:44,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1930191929, now seen corresponding path program 1 times [2022-12-13 02:05:44,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:44,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738568614] [2022-12-13 02:05:44,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:44,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:44,230 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 02:05:44,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:44,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738568614] [2022-12-13 02:05:44,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738568614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:44,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:44,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:44,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235635349] [2022-12-13 02:05:44,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:44,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:44,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:44,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:44,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:44,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:44,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:44,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:44,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:44,293 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:44,293 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:44,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:44,294 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:44,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:44,294 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:44,294 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:44,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:44,295 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,295 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:44,295 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:44,295 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:44,295 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:44,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:44,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,298 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:44,298 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:44,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:44,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:44,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:44,419 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:44,419 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:44,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,419 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:44,419 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:44,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2249 [2022-12-13 02:05:44,419 INFO L420 AbstractCegarLoop]: === Iteration 2251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1987450231, now seen corresponding path program 1 times [2022-12-13 02:05:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:44,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991950479] [2022-12-13 02:05:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:44,476 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 02:05:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:44,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991950479] [2022-12-13 02:05:44,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991950479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:44,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:44,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759471665] [2022-12-13 02:05:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:44,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:44,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:44,477 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:44,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:44,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:44,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:44,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:44,521 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:44,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:44,521 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:44,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:44,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:44,522 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:44,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:44,523 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:44,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:44,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:44,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,523 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:44,523 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:44,523 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,526 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:44,526 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:44,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:44,526 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,526 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:44,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:44,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:05:44,653 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:44,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:44,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:44,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2250 [2022-12-13 02:05:44,653 INFO L420 AbstractCegarLoop]: === Iteration 2252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2044708533, now seen corresponding path program 1 times [2022-12-13 02:05:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:44,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734198759] [2022-12-13 02:05:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:44,726 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 02:05:44,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:44,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734198759] [2022-12-13 02:05:44,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734198759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:44,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:44,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:44,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632072721] [2022-12-13 02:05:44,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:44,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:44,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:44,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:44,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:44,728 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:44,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:44,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:44,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:44,772 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:44,772 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:44,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:44,772 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:44,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:44,773 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:44,773 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:44,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:44,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:44,774 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:44,774 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:44,774 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:44,774 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,774 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:44,774 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:44,774 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,777 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:44,777 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:44,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:44,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:44,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:44,899 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:44,900 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:05:44,900 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:44,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,900 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:44,900 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:44,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2251 [2022-12-13 02:05:44,900 INFO L420 AbstractCegarLoop]: === Iteration 2253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:44,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2101966835, now seen corresponding path program 1 times [2022-12-13 02:05:44,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:44,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632371647] [2022-12-13 02:05:44,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:44,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:44,956 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 02:05:44,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:44,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632371647] [2022-12-13 02:05:44,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632371647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:44,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:44,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328390880] [2022-12-13 02:05:44,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:44,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:44,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:44,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:44,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:44,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:44,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:44,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:45,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:45,031 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:45,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:45,031 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:45,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:45,032 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:45,032 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:45,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:45,033 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:45,033 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:45,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:45,033 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:45,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:45,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,036 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:45,036 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:45,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:45,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:45,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:45,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:45,156 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:45,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:45,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:45,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2252 [2022-12-13 02:05:45,156 INFO L420 AbstractCegarLoop]: === Iteration 2254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:45,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:45,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2135742159, now seen corresponding path program 1 times [2022-12-13 02:05:45,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:45,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325229061] [2022-12-13 02:05:45,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:45,213 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 02:05:45,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:45,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325229061] [2022-12-13 02:05:45,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325229061] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:45,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:45,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:45,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584126561] [2022-12-13 02:05:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:45,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:45,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:45,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:45,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:45,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:45,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:45,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:45,258 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:45,258 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:45,258 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:45,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:45,259 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:45,259 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:45,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:45,260 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,260 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:45,260 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:45,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:45,260 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,260 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:45,260 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:45,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,263 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:45,263 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:45,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:45,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,263 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:45,384 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:45,385 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:05:45,385 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:45,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,385 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:45,385 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:45,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2253 [2022-12-13 02:05:45,385 INFO L420 AbstractCegarLoop]: === Iteration 2255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:45,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2078483857, now seen corresponding path program 1 times [2022-12-13 02:05:45,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:45,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970008733] [2022-12-13 02:05:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:45,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:45,444 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 02:05:45,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:45,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970008733] [2022-12-13 02:05:45,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970008733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:45,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:45,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742826153] [2022-12-13 02:05:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:45,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:45,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:45,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:45,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:45,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:45,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:45,492 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:45,493 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:45,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:45,493 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:45,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:45,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:45,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:45,494 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:45,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:45,495 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,495 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:45,495 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:45,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:45,495 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,495 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:45,495 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:45,495 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,498 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:45,498 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:45,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:45,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:45,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:45,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:05:45,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:45,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:45,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:45,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2254 [2022-12-13 02:05:45,639 INFO L420 AbstractCegarLoop]: === Iteration 2256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:45,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2021225555, now seen corresponding path program 1 times [2022-12-13 02:05:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:45,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522550212] [2022-12-13 02:05:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:45,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:45,713 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 02:05:45,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:45,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522550212] [2022-12-13 02:05:45,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522550212] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:45,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:45,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:45,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729908103] [2022-12-13 02:05:45,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:45,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:45,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:45,714 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:45,714 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:45,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:45,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:45,765 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:45,766 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:45,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:45,766 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:45,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:45,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:45,767 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:45,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:45,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:45,768 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:45,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:45,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:45,768 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:45,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:45,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:45,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,782 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:45,782 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:45,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:45,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:45,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:45,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:45,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 02:05:45,919 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:45,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:45,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:45,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2255 [2022-12-13 02:05:45,919 INFO L420 AbstractCegarLoop]: === Iteration 2257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1963967253, now seen corresponding path program 1 times [2022-12-13 02:05:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743376770] [2022-12-13 02:05:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:45,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 02:05:45,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:45,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743376770] [2022-12-13 02:05:45,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743376770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:45,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:45,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186542036] [2022-12-13 02:05:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:45,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:45,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:45,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:45,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:45,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:46,050 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:46,050 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:46,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:46,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:46,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:46,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:46,051 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:46,051 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:46,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:46,052 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:46,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:46,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:46,052 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:46,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:46,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,055 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:46,055 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:46,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:46,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,056 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:46,189 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:46,191 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:46,191 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:46,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,191 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:46,191 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:46,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2256 [2022-12-13 02:05:46,191 INFO L420 AbstractCegarLoop]: === Iteration 2258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:46,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1906708951, now seen corresponding path program 1 times [2022-12-13 02:05:46,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:46,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878701056] [2022-12-13 02:05:46,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:46,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:46,258 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 02:05:46,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:46,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878701056] [2022-12-13 02:05:46,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878701056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:46,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:46,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:46,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915708812] [2022-12-13 02:05:46,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:46,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:46,259 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:46,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:46,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:46,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:46,315 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:46,316 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:46,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:46,316 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:46,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:46,317 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:46,317 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:46,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:46,318 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,318 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:46,318 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:46,318 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:46,318 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,318 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:46,318 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:46,319 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,322 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:46,322 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:46,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:46,322 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:46,456 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:46,458 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:46,458 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:46,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:46,458 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:46,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2257 [2022-12-13 02:05:46,458 INFO L420 AbstractCegarLoop]: === Iteration 2259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:46,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1849450649, now seen corresponding path program 1 times [2022-12-13 02:05:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:46,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282227610] [2022-12-13 02:05:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:46,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:46,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 02:05:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:46,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282227610] [2022-12-13 02:05:46,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282227610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:46,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:46,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653480188] [2022-12-13 02:05:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:46,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:46,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:46,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:46,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:46,535 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:46,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:46,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:46,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:46,591 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:46,591 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:46,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:46,592 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:46,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:46,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:46,593 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:46,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:46,593 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:46,594 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:46,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:46,594 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:46,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:46,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,597 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:46,597 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:46,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:46,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:46,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:46,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:46,736 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:46,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:46,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:46,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2258 [2022-12-13 02:05:46,737 INFO L420 AbstractCegarLoop]: === Iteration 2260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:46,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1792192347, now seen corresponding path program 1 times [2022-12-13 02:05:46,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:46,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171972778] [2022-12-13 02:05:46,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:46,800 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 02:05:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171972778] [2022-12-13 02:05:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171972778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:46,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:46,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:46,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137610120] [2022-12-13 02:05:46,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:46,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:46,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:46,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:46,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:46,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:46,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:46,854 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:46,854 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:46,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:46,855 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:46,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:46,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:46,856 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:46,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:46,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:46,856 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,856 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:46,857 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:46,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:46,857 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:46,857 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:46,857 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:46,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,859 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:46,860 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:46,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:46,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:46,860 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:46,994 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:46,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:46,995 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:46,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:46,996 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:46,996 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:46,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2259 [2022-12-13 02:05:46,996 INFO L420 AbstractCegarLoop]: === Iteration 2261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:46,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1734934045, now seen corresponding path program 1 times [2022-12-13 02:05:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:46,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908081261] [2022-12-13 02:05:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:47,066 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 02:05:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:47,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908081261] [2022-12-13 02:05:47,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908081261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:47,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:47,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:47,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66191896] [2022-12-13 02:05:47,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:47,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:47,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:47,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:47,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:47,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:47,127 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:47,127 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:47,128 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:47,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:47,128 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:47,128 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:47,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:47,129 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:47,129 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:47,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:47,129 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,129 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:47,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:47,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,132 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:47,132 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:47,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:47,132 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,132 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:47,267 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:47,268 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:47,268 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:47,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,268 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:47,268 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:47,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2260 [2022-12-13 02:05:47,268 INFO L420 AbstractCegarLoop]: === Iteration 2262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:47,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1677675743, now seen corresponding path program 1 times [2022-12-13 02:05:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:47,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53518970] [2022-12-13 02:05:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:47,347 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 02:05:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:47,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53518970] [2022-12-13 02:05:47,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53518970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:47,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:47,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116405672] [2022-12-13 02:05:47,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:47,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:47,348 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:47,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:47,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:47,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:47,399 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:47,399 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:47,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:47,399 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:47,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:47,400 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:47,400 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:47,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:47,401 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,401 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:47,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:47,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:47,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:47,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:47,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,404 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:47,404 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:47,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:47,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:47,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:47,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-13 02:05:47,559 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:47,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,559 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:47,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:47,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2261 [2022-12-13 02:05:47,559 INFO L420 AbstractCegarLoop]: === Iteration 2263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:47,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1620417441, now seen corresponding path program 1 times [2022-12-13 02:05:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:47,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927435066] [2022-12-13 02:05:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:47,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:47,624 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 02:05:47,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:47,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927435066] [2022-12-13 02:05:47,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927435066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:47,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:47,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273280488] [2022-12-13 02:05:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:47,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:47,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:47,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:47,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:47,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:47,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:47,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:47,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:47,692 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:47,692 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:47,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:47,693 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:47,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:47,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:47,694 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:47,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:47,695 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:47,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:47,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:47,695 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:47,695 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:47,695 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,699 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:47,699 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:47,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:47,700 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,700 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:47,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:47,837 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:47,837 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:47,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:47,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2262 [2022-12-13 02:05:47,837 INFO L420 AbstractCegarLoop]: === Iteration 2264 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1563159139, now seen corresponding path program 1 times [2022-12-13 02:05:47,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:47,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39042735] [2022-12-13 02:05:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:47,913 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 02:05:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:47,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39042735] [2022-12-13 02:05:47,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39042735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:47,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:47,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:47,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535879321] [2022-12-13 02:05:47,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:47,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:47,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:47,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:47,915 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:47,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:47,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:47,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:47,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:47,964 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:47,964 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:47,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:47,965 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:47,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:47,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:47,965 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:47,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:47,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:47,966 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:47,966 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:47,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:47,966 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:47,967 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:47,967 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:47,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,969 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:47,969 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:47,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:47,970 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:47,970 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:48,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:48,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:05:48,111 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:48,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:48,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:48,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2263 [2022-12-13 02:05:48,111 INFO L420 AbstractCegarLoop]: === Iteration 2265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:48,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:48,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1505900837, now seen corresponding path program 1 times [2022-12-13 02:05:48,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:48,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729365164] [2022-12-13 02:05:48,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:48,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:48,170 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 02:05:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:48,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729365164] [2022-12-13 02:05:48,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729365164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:48,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:48,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172388002] [2022-12-13 02:05:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:48,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:48,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:48,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:48,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:48,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:48,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:48,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:48,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:48,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:48,222 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:48,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:48,223 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:48,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:48,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:48,223 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:48,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:48,224 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:48,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:48,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:48,225 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:48,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:48,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,227 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:48,227 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:48,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:48,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:48,343 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:48,344 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:48,345 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:48,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:48,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:48,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2264 [2022-12-13 02:05:48,345 INFO L420 AbstractCegarLoop]: === Iteration 2266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:48,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1448642535, now seen corresponding path program 1 times [2022-12-13 02:05:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:48,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347293610] [2022-12-13 02:05:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:48,400 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 02:05:48,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:48,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347293610] [2022-12-13 02:05:48,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347293610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:48,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:48,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244408042] [2022-12-13 02:05:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:48,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:48,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:48,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:48,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:48,444 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:48,444 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:48,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:48,445 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:48,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:48,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:48,445 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:48,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:48,446 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,446 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:48,446 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:48,446 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:48,446 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:48,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:48,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,449 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:48,449 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:48,449 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,449 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:48,567 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:48,568 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:48,568 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:48,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:48,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:48,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2265 [2022-12-13 02:05:48,568 INFO L420 AbstractCegarLoop]: === Iteration 2267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:48,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:48,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1391384233, now seen corresponding path program 1 times [2022-12-13 02:05:48,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:48,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786179407] [2022-12-13 02:05:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:48,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:48,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:48,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786179407] [2022-12-13 02:05:48,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786179407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:48,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:48,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437267670] [2022-12-13 02:05:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:48,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:48,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:48,626 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:48,626 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,626 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:48,626 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:48,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:48,668 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:48,668 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:48,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:48,669 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:48,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:48,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:48,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:48,669 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:48,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:48,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:48,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:48,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:48,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,671 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:48,671 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:48,671 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,673 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:48,673 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:48,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:48,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,674 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:48,789 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:48,790 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:05:48,790 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:48,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,790 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:48,790 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:48,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2266 [2022-12-13 02:05:48,790 INFO L420 AbstractCegarLoop]: === Iteration 2268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:48,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1334125931, now seen corresponding path program 1 times [2022-12-13 02:05:48,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:48,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701534095] [2022-12-13 02:05:48,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:48,856 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 02:05:48,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701534095] [2022-12-13 02:05:48,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701534095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:48,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:48,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:48,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502812136] [2022-12-13 02:05:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:48,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:48,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:48,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:48,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:48,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:48,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:48,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:48,909 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:48,909 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:48,910 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:48,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:48,910 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:48,910 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:48,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:48,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:48,911 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,911 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:48,911 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:48,911 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:48,911 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,911 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:48,911 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:48,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:48,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,914 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:48,914 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:48,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:48,914 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:48,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:49,033 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:49,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:49,034 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:49,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:49,034 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:49,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2267 [2022-12-13 02:05:49,034 INFO L420 AbstractCegarLoop]: === Iteration 2269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1276867629, now seen corresponding path program 1 times [2022-12-13 02:05:49,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:49,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296070265] [2022-12-13 02:05:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:49,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:49,102 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 02:05:49,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:49,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296070265] [2022-12-13 02:05:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296070265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:49,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84342013] [2022-12-13 02:05:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:49,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:49,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:49,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:49,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:49,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:49,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:49,153 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:49,153 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:49,154 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:49,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:49,154 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:49,154 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:49,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:49,155 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,155 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:49,155 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:49,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:49,156 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:49,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:49,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,158 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:49,158 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:49,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:49,159 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,159 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:49,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:49,278 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:49,278 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:49,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,278 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:49,278 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:49,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2268 [2022-12-13 02:05:49,279 INFO L420 AbstractCegarLoop]: === Iteration 2270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1219609327, now seen corresponding path program 1 times [2022-12-13 02:05:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628176797] [2022-12-13 02:05:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:49,338 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 02:05:49,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:49,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628176797] [2022-12-13 02:05:49,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628176797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:49,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:49,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:49,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674761253] [2022-12-13 02:05:49,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:49,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:49,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:49,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:49,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:49,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:49,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:49,389 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:49,389 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:49,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:49,390 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:49,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:49,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:49,390 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:49,390 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:49,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:49,391 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,391 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:49,391 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:49,391 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:49,391 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,391 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:49,391 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:49,392 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,394 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:49,394 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:49,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:49,394 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,395 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:49,513 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:49,514 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:49,514 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:49,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:49,514 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2269 [2022-12-13 02:05:49,514 INFO L420 AbstractCegarLoop]: === Iteration 2271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:49,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1162351025, now seen corresponding path program 1 times [2022-12-13 02:05:49,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:49,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604400928] [2022-12-13 02:05:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:49,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:49,573 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 02:05:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:49,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604400928] [2022-12-13 02:05:49,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604400928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:49,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:49,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873128858] [2022-12-13 02:05:49,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:49,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:49,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:49,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:49,574 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:49,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:49,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:49,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:49,617 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:49,617 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:49,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:49,618 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:49,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:49,618 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:49,619 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:49,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:49,619 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,619 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:49,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:49,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:49,620 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:49,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:49,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,623 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:49,623 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:49,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:49,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,623 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:49,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:49,742 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:49,742 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:49,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:49,742 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:49,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2270 [2022-12-13 02:05:49,742 INFO L420 AbstractCegarLoop]: === Iteration 2272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:49,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1105092723, now seen corresponding path program 1 times [2022-12-13 02:05:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:49,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432624094] [2022-12-13 02:05:49,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:49,799 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 02:05:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:49,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432624094] [2022-12-13 02:05:49,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432624094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:49,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:49,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:49,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773269782] [2022-12-13 02:05:49,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:49,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:49,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:49,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:49,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:49,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:49,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:49,843 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:49,843 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:49,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:49,844 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:49,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:49,844 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:49,844 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:49,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:49,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:49,845 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,845 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:49,845 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:49,845 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:49,845 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,846 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:49,846 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:49,846 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:49,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,848 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:49,848 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:49,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:49,849 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:49,849 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:49,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:49,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:05:49,973 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:49,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:49,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:49,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:49,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2271 [2022-12-13 02:05:49,973 INFO L420 AbstractCegarLoop]: === Iteration 2273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:49,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1047834421, now seen corresponding path program 1 times [2022-12-13 02:05:49,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:49,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313840024] [2022-12-13 02:05:49,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:49,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:50,033 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 02:05:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:50,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313840024] [2022-12-13 02:05:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313840024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:50,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:50,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914363668] [2022-12-13 02:05:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:50,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:50,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:50,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:50,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:50,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:50,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:50,080 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:50,080 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:50,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:50,081 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:50,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:50,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:50,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:50,081 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:50,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:50,082 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,082 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:50,082 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:50,082 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:50,082 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,083 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:50,083 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:50,083 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,085 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:50,085 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:50,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:50,086 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,086 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:50,205 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:50,206 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:50,206 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:50,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,206 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:50,206 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:50,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2272 [2022-12-13 02:05:50,206 INFO L420 AbstractCegarLoop]: === Iteration 2274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:50,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:50,206 INFO L85 PathProgramCache]: Analyzing trace with hash -990576119, now seen corresponding path program 1 times [2022-12-13 02:05:50,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:50,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318882831] [2022-12-13 02:05:50,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:50,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:50,264 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 02:05:50,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:50,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318882831] [2022-12-13 02:05:50,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318882831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:50,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:50,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047356675] [2022-12-13 02:05:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:50,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:50,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:50,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:50,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:50,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:50,308 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:50,309 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:50,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:50,309 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:50,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:50,310 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:50,310 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:50,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:50,311 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,311 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:50,311 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:50,311 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:50,311 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,311 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:50,311 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:50,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,314 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:50,314 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:50,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:50,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:50,439 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:50,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:05:50,440 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:50,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,440 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:50,440 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:50,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2273 [2022-12-13 02:05:50,440 INFO L420 AbstractCegarLoop]: === Iteration 2275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash -933317817, now seen corresponding path program 1 times [2022-12-13 02:05:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:50,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42333246] [2022-12-13 02:05:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:50,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:50,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42333246] [2022-12-13 02:05:50,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42333246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:50,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:50,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886478543] [2022-12-13 02:05:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:50,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:50,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:50,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:50,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:50,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:50,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:50,563 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:50,563 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:50,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:50,564 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:50,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:50,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:50,564 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:50,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:50,565 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:50,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:50,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:50,565 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,566 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:50,566 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:50,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,568 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:50,568 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:50,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:50,685 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:50,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:50,686 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:50,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:50,687 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:50,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2274 [2022-12-13 02:05:50,687 INFO L420 AbstractCegarLoop]: === Iteration 2276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:50,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -876059515, now seen corresponding path program 1 times [2022-12-13 02:05:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505713916] [2022-12-13 02:05:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:50,743 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 02:05:50,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505713916] [2022-12-13 02:05:50,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505713916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:50,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:50,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923088839] [2022-12-13 02:05:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:50,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:50,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:50,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:50,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:50,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:50,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:50,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:50,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:50,788 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:50,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:50,789 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:50,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:50,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:50,789 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:50,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:50,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:50,790 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:50,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:50,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:50,791 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:50,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:50,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:50,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,793 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:50,793 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:50,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:50,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:50,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:50,922 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:50,923 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:05:50,923 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:50,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:50,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:50,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2275 [2022-12-13 02:05:50,923 INFO L420 AbstractCegarLoop]: === Iteration 2277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -818801213, now seen corresponding path program 1 times [2022-12-13 02:05:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002449023] [2022-12-13 02:05:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:50,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002449023] [2022-12-13 02:05:50,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002449023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:50,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:50,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:50,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419726342] [2022-12-13 02:05:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:50,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:50,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:50,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:50,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:50,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:50,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:50,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:50,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:50,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:51,054 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:51,054 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:51,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:51,055 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:51,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:51,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:51,056 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:51,057 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:51,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:51,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:51,057 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:51,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:51,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:51,061 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:51,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:51,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:51,195 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:51,196 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:51,196 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:51,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:51,196 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:51,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:51,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2276 [2022-12-13 02:05:51,196 INFO L420 AbstractCegarLoop]: === Iteration 2278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -761542911, now seen corresponding path program 1 times [2022-12-13 02:05:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:51,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352132962] [2022-12-13 02:05:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:51,278 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 02:05:51,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:51,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352132962] [2022-12-13 02:05:51,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352132962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:51,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:51,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:51,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879400814] [2022-12-13 02:05:51,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:51,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:51,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:51,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:51,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:51,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:51,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:51,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:51,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:51,340 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:51,340 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:51,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:51,341 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:51,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:51,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:51,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:51,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:51,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:51,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:51,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:51,343 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:51,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:51,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:51,346 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:51,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:51,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:51,481 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:51,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:51,483 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:51,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:51,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:51,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:51,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2277 [2022-12-13 02:05:51,483 INFO L420 AbstractCegarLoop]: === Iteration 2279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:51,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash -704284609, now seen corresponding path program 1 times [2022-12-13 02:05:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:51,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124822024] [2022-12-13 02:05:51,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:51,546 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 02:05:51,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:51,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124822024] [2022-12-13 02:05:51,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124822024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:51,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:51,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:51,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898063169] [2022-12-13 02:05:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:51,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:51,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:51,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:51,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:51,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:51,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:51,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:51,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:51,608 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:51,609 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:51,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:51,609 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:51,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:51,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:51,610 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:51,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:51,611 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,611 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:51,611 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:51,611 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:51,611 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,611 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:51,611 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:51,611 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,614 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:51,614 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:51,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:51,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:51,760 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:51,761 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 150 [2022-12-13 02:05:51,762 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:51,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:51,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:51,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:51,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2278 [2022-12-13 02:05:51,762 INFO L420 AbstractCegarLoop]: === Iteration 2280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:51,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:51,762 INFO L85 PathProgramCache]: Analyzing trace with hash -647026307, now seen corresponding path program 1 times [2022-12-13 02:05:51,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:51,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184047745] [2022-12-13 02:05:51,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:51,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:51,829 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 02:05:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184047745] [2022-12-13 02:05:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184047745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:51,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99042028] [2022-12-13 02:05:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:51,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:51,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:51,830 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:51,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:51,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:51,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:51,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:51,884 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:51,884 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:51,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:51,885 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:51,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:51,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:51,886 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:51,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:51,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:51,887 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:51,887 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:51,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:51,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:51,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:51,887 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:51,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,890 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:51,890 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:51,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:51,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:51,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:52,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:52,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:52,029 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:52,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,029 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:52,029 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:52,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2279 [2022-12-13 02:05:52,030 INFO L420 AbstractCegarLoop]: === Iteration 2281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:52,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash -589768005, now seen corresponding path program 1 times [2022-12-13 02:05:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:52,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081788648] [2022-12-13 02:05:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:52,124 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 02:05:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:52,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081788648] [2022-12-13 02:05:52,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081788648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:52,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:52,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816006568] [2022-12-13 02:05:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:52,125 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:52,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,125 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:52,125 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:52,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:52,188 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:52,188 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:52,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:52,189 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:52,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:52,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:52,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:52,189 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:52,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:52,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:52,190 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:52,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:52,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:52,191 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:52,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:52,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:52,193 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:52,194 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:52,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:52,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:52,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:52,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:52,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:52,333 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:52,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,333 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:52,333 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2280 [2022-12-13 02:05:52,333 INFO L420 AbstractCegarLoop]: === Iteration 2282 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -532509703, now seen corresponding path program 1 times [2022-12-13 02:05:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988777103] [2022-12-13 02:05:52,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:52,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:52,401 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 02:05:52,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:52,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988777103] [2022-12-13 02:05:52,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988777103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:52,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:52,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:52,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490075770] [2022-12-13 02:05:52,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:52,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:52,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:52,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:52,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:52,402 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:52,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:52,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:52,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:52,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:52,469 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:52,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:52,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:52,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:52,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:52,471 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:52,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:52,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:52,471 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:52,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:52,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:52,472 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:52,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:52,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:52,475 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:52,475 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:52,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:52,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:52,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:52,612 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:52,613 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:05:52,614 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:52,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,614 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:52,614 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:52,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2281 [2022-12-13 02:05:52,614 INFO L420 AbstractCegarLoop]: === Iteration 2283 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:52,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash -475251401, now seen corresponding path program 1 times [2022-12-13 02:05:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:52,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864599227] [2022-12-13 02:05:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:52,681 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 02:05:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:52,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864599227] [2022-12-13 02:05:52,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864599227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:52,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:52,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115815084] [2022-12-13 02:05:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:52,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:52,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:52,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:52,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:52,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:52,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:52,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:52,736 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:52,737 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:52,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:52,737 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:52,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:52,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:52,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:52,738 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:52,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:52,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:52,739 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,739 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:52,739 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:52,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:52,739 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:52,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:52,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:52,742 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:52,742 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:52,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:52,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:52,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:52,878 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:52,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:52,879 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:52,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:52,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:52,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2282 [2022-12-13 02:05:52,879 INFO L420 AbstractCegarLoop]: === Iteration 2284 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:52,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash -417993099, now seen corresponding path program 1 times [2022-12-13 02:05:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:52,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279706023] [2022-12-13 02:05:52,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:52,944 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 02:05:52,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:52,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279706023] [2022-12-13 02:05:52,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279706023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:52,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:52,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405078775] [2022-12-13 02:05:52,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:52,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:52,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:52,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:52,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:52,945 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:52,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:52,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:52,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:52,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:53,011 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:53,011 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:53,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:53,012 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:53,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:53,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:53,013 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:53,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:53,014 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:53,014 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:53,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:53,014 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,014 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:53,014 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:53,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,018 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:53,018 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:53,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:53,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,018 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:53,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:53,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:53,156 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:53,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:53,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:53,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2283 [2022-12-13 02:05:53,156 INFO L420 AbstractCegarLoop]: === Iteration 2285 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:53,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:53,157 INFO L85 PathProgramCache]: Analyzing trace with hash -360734797, now seen corresponding path program 1 times [2022-12-13 02:05:53,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:53,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986909578] [2022-12-13 02:05:53,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:53,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:53,220 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 02:05:53,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:53,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986909578] [2022-12-13 02:05:53,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986909578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:53,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:53,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821179791] [2022-12-13 02:05:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:53,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:53,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:53,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:53,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:53,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:53,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:53,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:53,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:53,283 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:53,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:53,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:53,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:53,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:53,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:53,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:53,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:53,285 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:53,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:53,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:53,286 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:53,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:53,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,289 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:53,289 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:53,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:53,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:53,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:53,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:53,425 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:53,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:53,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:53,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2284 [2022-12-13 02:05:53,425 INFO L420 AbstractCegarLoop]: === Iteration 2286 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -303476495, now seen corresponding path program 1 times [2022-12-13 02:05:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:53,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497695231] [2022-12-13 02:05:53,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:53,497 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 02:05:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497695231] [2022-12-13 02:05:53,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497695231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:53,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:53,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129388520] [2022-12-13 02:05:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:53,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:53,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:53,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:53,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:53,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:53,550 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:53,551 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:53,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:53,551 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:53,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:53,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:53,552 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:53,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:53,553 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:53,553 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:53,553 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:53,553 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,553 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:53,553 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:53,553 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,556 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:53,556 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:53,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:53,556 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,556 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:53,691 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:53,692 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:05:53,692 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:53,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,692 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:53,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:53,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2285 [2022-12-13 02:05:53,692 INFO L420 AbstractCegarLoop]: === Iteration 2287 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:53,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:53,693 INFO L85 PathProgramCache]: Analyzing trace with hash -246218193, now seen corresponding path program 1 times [2022-12-13 02:05:53,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:53,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781283064] [2022-12-13 02:05:53,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:53,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:53,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781283064] [2022-12-13 02:05:53,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781283064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:53,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:53,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986053193] [2022-12-13 02:05:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:53,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:53,771 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:53,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:53,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:53,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:53,824 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:53,824 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:53,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:53,824 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:53,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:53,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:53,825 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:53,825 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:53,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:53,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:53,826 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:53,826 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:53,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:53,826 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,826 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:53,826 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:53,826 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:53,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,829 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:53,829 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:53,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:53,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:53,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:53,965 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:53,966 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:53,966 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:53,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:53,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:53,966 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:53,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2286 [2022-12-13 02:05:53,966 INFO L420 AbstractCegarLoop]: === Iteration 2288 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:53,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:53,966 INFO L85 PathProgramCache]: Analyzing trace with hash -188959891, now seen corresponding path program 1 times [2022-12-13 02:05:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:53,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868210388] [2022-12-13 02:05:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:54,038 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 02:05:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:54,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868210388] [2022-12-13 02:05:54,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868210388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:54,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:54,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331868409] [2022-12-13 02:05:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:54,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:54,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:54,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:54,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:54,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:54,102 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:54,102 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:54,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:54,103 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:54,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:54,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:54,104 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:54,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:54,104 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,104 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:54,105 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:54,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:54,105 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:54,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:54,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,107 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:54,108 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:54,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:54,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:54,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:54,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:05:54,243 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:54,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,243 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:54,243 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:54,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2287 [2022-12-13 02:05:54,243 INFO L420 AbstractCegarLoop]: === Iteration 2289 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:54,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -131701589, now seen corresponding path program 1 times [2022-12-13 02:05:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:54,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011966805] [2022-12-13 02:05:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:54,308 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 02:05:54,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:54,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011966805] [2022-12-13 02:05:54,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011966805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:54,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:54,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:54,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135294808] [2022-12-13 02:05:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:54,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:54,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:54,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:54,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:54,309 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:54,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:54,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:54,370 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:54,370 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:54,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:54,371 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:54,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:54,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:54,371 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:54,371 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:54,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:54,372 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,372 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:54,372 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:54,372 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:54,372 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,372 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:54,373 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:54,373 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,375 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:54,375 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:54,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:54,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,376 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:54,510 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:54,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:54,512 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:54,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:54,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:54,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2288 [2022-12-13 02:05:54,512 INFO L420 AbstractCegarLoop]: === Iteration 2290 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -74443287, now seen corresponding path program 1 times [2022-12-13 02:05:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:54,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983693540] [2022-12-13 02:05:54,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:54,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983693540] [2022-12-13 02:05:54,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983693540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:54,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:54,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:54,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685063753] [2022-12-13 02:05:54,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:54,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:54,575 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:54,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:54,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:54,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:54,628 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:54,628 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:54,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:54,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:54,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:54,629 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:54,629 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:54,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:54,631 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:54,631 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:54,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:54,631 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:54,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:54,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,635 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:54,635 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:54,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:54,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:54,771 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:54,773 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:05:54,773 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:54,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:54,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:54,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2289 [2022-12-13 02:05:54,773 INFO L420 AbstractCegarLoop]: === Iteration 2291 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:54,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:54,773 INFO L85 PathProgramCache]: Analyzing trace with hash -17184985, now seen corresponding path program 1 times [2022-12-13 02:05:54,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:54,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909260471] [2022-12-13 02:05:54,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:54,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:54,832 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 02:05:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:54,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909260471] [2022-12-13 02:05:54,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909260471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:54,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:54,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:54,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834261629] [2022-12-13 02:05:54,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:54,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:54,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:54,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:54,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:54,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:54,876 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:54,876 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:54,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:54,876 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:54,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:54,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:54,877 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:54,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:54,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:54,878 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,878 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:54,878 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:54,878 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:54,878 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,878 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:54,878 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:54,878 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:54,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,881 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:54,881 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:54,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:54,881 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:54,881 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:55,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:55,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:55,001 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:55,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:55,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:55,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2290 [2022-12-13 02:05:55,001 INFO L420 AbstractCegarLoop]: === Iteration 2292 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:55,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 40073317, now seen corresponding path program 1 times [2022-12-13 02:05:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:55,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938135275] [2022-12-13 02:05:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:55,066 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 02:05:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:55,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938135275] [2022-12-13 02:05:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938135275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:55,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:55,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:55,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476976466] [2022-12-13 02:05:55,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:55,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:55,067 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:55,067 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,067 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:55,067 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:55,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:55,120 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:55,120 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:55,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:55,121 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:55,121 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:55,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:55,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:55,121 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:55,121 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:55,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:55,122 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,122 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:55,122 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:55,123 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:55,123 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,123 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:55,123 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:55,123 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,125 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:55,126 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:55,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:55,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:55,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:05:55,251 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:55,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:55,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:55,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2291 [2022-12-13 02:05:55,252 INFO L420 AbstractCegarLoop]: === Iteration 2293 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash 97331619, now seen corresponding path program 1 times [2022-12-13 02:05:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:55,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504843105] [2022-12-13 02:05:55,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:55,311 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 02:05:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:55,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504843105] [2022-12-13 02:05:55,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504843105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:55,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:55,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36790728] [2022-12-13 02:05:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:55,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:55,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:55,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:55,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:55,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:55,368 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:55,368 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:55,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:55,369 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:55,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:55,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:55,370 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:55,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:55,370 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:55,371 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:55,371 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:55,371 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:55,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:55,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,374 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:55,374 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:55,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:55,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:55,492 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:55,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:55,493 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:55,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:55,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:55,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2292 [2022-12-13 02:05:55,493 INFO L420 AbstractCegarLoop]: === Iteration 2294 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:55,493 INFO L85 PathProgramCache]: Analyzing trace with hash 154589921, now seen corresponding path program 1 times [2022-12-13 02:05:55,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:55,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878869877] [2022-12-13 02:05:55,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:55,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:55,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 02:05:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:55,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878869877] [2022-12-13 02:05:55,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878869877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:55,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:55,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:55,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672189707] [2022-12-13 02:05:55,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:55,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:55,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:55,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:55,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:55,599 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:55,599 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:55,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:55,600 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:55,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:55,600 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:55,600 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:55,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:55,601 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,601 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:55,601 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:55,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:55,602 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,602 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:55,602 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:55,602 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,604 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:55,604 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:55,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:55,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:55,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:55,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:55,722 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:55,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:55,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:55,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2293 [2022-12-13 02:05:55,723 INFO L420 AbstractCegarLoop]: === Iteration 2295 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:55,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 211848223, now seen corresponding path program 1 times [2022-12-13 02:05:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:55,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499634784] [2022-12-13 02:05:55,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:55,779 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 02:05:55,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:55,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499634784] [2022-12-13 02:05:55,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499634784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:55,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:55,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429183677] [2022-12-13 02:05:55,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:55,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:55,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:55,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:55,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:55,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:55,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:55,829 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:55,829 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:55,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:55,830 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:55,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:55,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:55,830 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:55,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:55,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:55,831 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:55,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:55,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:55,831 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:55,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:55,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,834 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:55,834 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:55,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:55,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:55,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:55,953 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:55,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:55,954 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:55,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:55,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:55,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:55,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2294 [2022-12-13 02:05:55,954 INFO L420 AbstractCegarLoop]: === Iteration 2296 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 269106525, now seen corresponding path program 1 times [2022-12-13 02:05:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:55,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17007589] [2022-12-13 02:05:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:56,013 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 02:05:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17007589] [2022-12-13 02:05:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17007589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:56,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:56,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164866311] [2022-12-13 02:05:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:56,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:56,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:56,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:56,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:56,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:56,057 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:56,057 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:56,058 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:56,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:56,058 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:56,058 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:56,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:56,059 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:56,059 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:56,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:56,059 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,060 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:56,060 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:56,060 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,062 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:56,062 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:56,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:56,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:56,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:56,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:56,182 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:56,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:56,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:56,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2295 [2022-12-13 02:05:56,182 INFO L420 AbstractCegarLoop]: === Iteration 2297 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:56,182 INFO L85 PathProgramCache]: Analyzing trace with hash 326364827, now seen corresponding path program 1 times [2022-12-13 02:05:56,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:56,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437036583] [2022-12-13 02:05:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:56,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 02:05:56,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:56,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437036583] [2022-12-13 02:05:56,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437036583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:56,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100639869] [2022-12-13 02:05:56,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:56,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:56,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:56,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:56,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:56,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:56,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:56,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:56,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:56,285 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:56,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:56,285 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:56,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:56,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:56,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:56,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:56,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:56,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:56,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:56,287 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:56,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:56,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,290 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:56,290 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:56,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:56,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:56,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:56,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:56,408 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:56,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,408 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:56,408 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:56,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2296 [2022-12-13 02:05:56,409 INFO L420 AbstractCegarLoop]: === Iteration 2298 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:56,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:56,409 INFO L85 PathProgramCache]: Analyzing trace with hash 383623129, now seen corresponding path program 1 times [2022-12-13 02:05:56,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:56,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974859881] [2022-12-13 02:05:56,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:56,465 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 02:05:56,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:56,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974859881] [2022-12-13 02:05:56,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974859881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:56,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:56,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:56,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515767793] [2022-12-13 02:05:56,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:56,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:56,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:56,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:56,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:56,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:56,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:56,516 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:56,516 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:56,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:56,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:56,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:56,517 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:56,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:56,518 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:56,518 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:56,518 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:56,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:56,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:56,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,521 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:56,521 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:56,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:56,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:56,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:56,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:05:56,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:56,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:56,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:56,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2297 [2022-12-13 02:05:56,639 INFO L420 AbstractCegarLoop]: === Iteration 2299 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash 440881431, now seen corresponding path program 1 times [2022-12-13 02:05:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:56,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405047877] [2022-12-13 02:05:56,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:56,706 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 02:05:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:56,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405047877] [2022-12-13 02:05:56,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405047877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:56,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:56,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:56,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934663255] [2022-12-13 02:05:56,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:56,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:56,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:56,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:56,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:56,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:56,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:56,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:56,760 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:56,760 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:56,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:56,761 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:56,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:56,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:56,762 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:56,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:56,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:56,763 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,763 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:56,763 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:56,763 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:56,763 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,763 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:56,764 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:56,764 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:56,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,781 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:56,782 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:56,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:56,782 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:56,782 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:56,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:56,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159 [2022-12-13 02:05:56,922 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:56,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:56,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:56,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2298 [2022-12-13 02:05:56,923 INFO L420 AbstractCegarLoop]: === Iteration 2300 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash 498139733, now seen corresponding path program 1 times [2022-12-13 02:05:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:56,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877327605] [2022-12-13 02:05:56,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877327605] [2022-12-13 02:05:56,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877327605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:56,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:56,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921637155] [2022-12-13 02:05:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:56,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:56,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:56,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:56,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:56,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:56,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:56,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:56,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:57,054 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:57,054 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:57,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:57,055 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:57,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:57,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:57,056 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:57,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:57,057 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:57,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:57,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:57,058 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:57,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:57,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,062 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:57,062 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:57,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:57,062 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,062 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:57,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:57,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:05:57,201 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:57,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:57,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:57,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2299 [2022-12-13 02:05:57,201 INFO L420 AbstractCegarLoop]: === Iteration 2301 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:57,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash 555398035, now seen corresponding path program 1 times [2022-12-13 02:05:57,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:57,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955094157] [2022-12-13 02:05:57,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:57,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:57,268 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 02:05:57,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:57,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955094157] [2022-12-13 02:05:57,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955094157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:57,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:57,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240940203] [2022-12-13 02:05:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:57,269 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:57,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:57,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:57,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:57,313 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:57,314 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:57,314 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:57,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:57,314 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:57,315 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:57,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:57,315 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:57,315 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:57,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:57,316 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,316 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:57,316 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:57,316 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,318 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:57,318 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:57,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:57,319 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,319 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:57,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:57,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:57,435 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:57,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:57,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:57,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2300 [2022-12-13 02:05:57,435 INFO L420 AbstractCegarLoop]: === Iteration 2302 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 612656337, now seen corresponding path program 1 times [2022-12-13 02:05:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:57,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145077101] [2022-12-13 02:05:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:57,493 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 02:05:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145077101] [2022-12-13 02:05:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145077101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764497554] [2022-12-13 02:05:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:57,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:57,494 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:57,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:57,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:57,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:57,544 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:57,544 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:57,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:57,545 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:57,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:57,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:57,545 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:57,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:57,546 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:57,546 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:57,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:57,546 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,547 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:57,547 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:57,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,549 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:57,549 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:57,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:57,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:57,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:57,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:05:57,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:57,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:57,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:57,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2301 [2022-12-13 02:05:57,675 INFO L420 AbstractCegarLoop]: === Iteration 2303 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:57,675 INFO L85 PathProgramCache]: Analyzing trace with hash 669914639, now seen corresponding path program 1 times [2022-12-13 02:05:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:57,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930131524] [2022-12-13 02:05:57,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:57,733 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 02:05:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:57,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930131524] [2022-12-13 02:05:57,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930131524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:57,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:57,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926326174] [2022-12-13 02:05:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:57,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:57,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:57,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:57,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:57,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:57,784 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:57,784 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:57,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:57,785 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:57,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:57,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:57,786 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:57,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:57,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:57,786 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,786 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:57,787 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:57,787 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:57,787 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,787 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:57,787 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:57,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:57,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,789 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:57,790 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:57,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:57,790 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:57,790 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:57,909 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:57,910 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:05:57,910 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:57,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,910 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:57,910 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2302 [2022-12-13 02:05:57,911 INFO L420 AbstractCegarLoop]: === Iteration 2304 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:57,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash 727172941, now seen corresponding path program 1 times [2022-12-13 02:05:57,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:57,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236669051] [2022-12-13 02:05:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:57,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:57,969 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 02:05:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:57,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236669051] [2022-12-13 02:05:57,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236669051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:57,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:57,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754531949] [2022-12-13 02:05:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:57,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:57,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:57,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:57,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:57,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:57,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:57,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:57,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:58,023 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:58,024 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:58,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:58,024 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:58,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:58,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:58,025 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:58,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:58,025 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:58,026 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:58,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:58,026 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:58,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:58,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,029 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:58,029 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:58,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:58,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:58,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:58,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:05:58,151 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:58,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,151 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:58,151 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:58,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2303 [2022-12-13 02:05:58,152 INFO L420 AbstractCegarLoop]: === Iteration 2305 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash 784431243, now seen corresponding path program 1 times [2022-12-13 02:05:58,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:58,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609749084] [2022-12-13 02:05:58,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:58,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:58,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:58,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609749084] [2022-12-13 02:05:58,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609749084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:58,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:58,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492915010] [2022-12-13 02:05:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:58,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:58,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:58,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:58,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:58,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:58,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:58,261 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:58,261 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:58,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:58,262 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:58,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:58,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:58,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:58,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:58,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:58,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:58,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:58,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:58,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:58,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,267 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:58,267 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:58,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:58,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:58,397 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:58,398 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:05:58,398 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:58,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:58,398 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:58,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2304 [2022-12-13 02:05:58,398 INFO L420 AbstractCegarLoop]: === Iteration 2306 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:58,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:58,399 INFO L85 PathProgramCache]: Analyzing trace with hash 841689545, now seen corresponding path program 1 times [2022-12-13 02:05:58,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:58,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777738350] [2022-12-13 02:05:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:58,457 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 02:05:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:58,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777738350] [2022-12-13 02:05:58,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777738350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:58,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:58,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:58,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913546927] [2022-12-13 02:05:58,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:58,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:58,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:58,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:58,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:58,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:58,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:58,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:58,508 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:58,508 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:58,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:58,509 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:58,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:58,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:58,509 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:58,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:58,510 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,510 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:58,510 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:58,511 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:58,511 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,511 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:58,511 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:58,511 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,513 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:58,513 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:58,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:58,514 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,514 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:58,632 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:58,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:05:58,633 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:58,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,633 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:58,633 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:58,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2305 [2022-12-13 02:05:58,633 INFO L420 AbstractCegarLoop]: === Iteration 2307 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash 898947847, now seen corresponding path program 1 times [2022-12-13 02:05:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:58,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66249481] [2022-12-13 02:05:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:58,691 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 02:05:58,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:58,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66249481] [2022-12-13 02:05:58,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66249481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:58,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:58,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491983604] [2022-12-13 02:05:58,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:58,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:58,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:58,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:58,692 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:58,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:58,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:58,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:58,741 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:58,741 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:58,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:58,742 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:58,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:58,742 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:58,742 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:58,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:58,743 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,743 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:58,743 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:58,743 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:58,743 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,743 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:58,743 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:58,744 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,746 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:58,746 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:58,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:58,746 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,746 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:58,876 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:58,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:05:58,877 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:58,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,877 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:58,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:58,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2306 [2022-12-13 02:05:58,877 INFO L420 AbstractCegarLoop]: === Iteration 2308 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:58,878 INFO L85 PathProgramCache]: Analyzing trace with hash 956206149, now seen corresponding path program 1 times [2022-12-13 02:05:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:58,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466907499] [2022-12-13 02:05:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:58,939 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 02:05:58,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:58,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466907499] [2022-12-13 02:05:58,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466907499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:58,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:58,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933909915] [2022-12-13 02:05:58,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:58,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:58,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:58,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:58,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:58,940 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:58,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:58,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:58,940 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:58,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:58,984 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:58,984 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:58,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:58,985 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:58,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:58,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:58,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:58,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:58,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:58,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:58,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:58,987 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:58,987 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:58,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:58,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:58,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,989 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:58,989 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:58,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:58,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:58,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:59,110 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:59,111 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:05:59,111 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:59,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,111 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:59,111 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:59,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2307 [2022-12-13 02:05:59,111 INFO L420 AbstractCegarLoop]: === Iteration 2309 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:59,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1013464451, now seen corresponding path program 1 times [2022-12-13 02:05:59,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:59,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148277634] [2022-12-13 02:05:59,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:59,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:59,178 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 02:05:59,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148277634] [2022-12-13 02:05:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148277634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:59,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:59,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:59,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345986219] [2022-12-13 02:05:59,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:59,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:59,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:59,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:59,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:59,179 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:59,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:59,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:59,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:59,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:59,222 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:59,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:59,222 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:59,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:59,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:59,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:59,223 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:59,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:59,224 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:59,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:59,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:59,224 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:59,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:59,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,227 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:59,227 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:59,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:59,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:59,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:59,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:05:59,342 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:59,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:59,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:59,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2308 [2022-12-13 02:05:59,343 INFO L420 AbstractCegarLoop]: === Iteration 2310 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1070722753, now seen corresponding path program 1 times [2022-12-13 02:05:59,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:59,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106359071] [2022-12-13 02:05:59,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:59,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:59,400 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 02:05:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106359071] [2022-12-13 02:05:59,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106359071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:59,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:59,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384509222] [2022-12-13 02:05:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:59,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:59,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:59,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:59,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:59,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:59,443 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:59,443 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:59,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:59,443 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:59,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:59,444 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:59,444 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:59,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:59,445 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,445 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:59,445 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:59,445 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:59,445 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,445 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:59,445 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:59,445 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,448 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:59,448 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:05:59,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:59,448 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,448 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:59,563 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:59,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:05:59,564 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:59,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:59,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:59,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2309 [2022-12-13 02:05:59,564 INFO L420 AbstractCegarLoop]: === Iteration 2311 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1127981055, now seen corresponding path program 1 times [2022-12-13 02:05:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:59,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885491368] [2022-12-13 02:05:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:59,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:05:59,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:59,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885491368] [2022-12-13 02:05:59,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885491368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:59,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:59,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:59,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009643376] [2022-12-13 02:05:59,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:59,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:59,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:59,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:59,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:59,671 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:59,671 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:05:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:59,671 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:59,672 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:59,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:59,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:59,672 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:59,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:59,673 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,673 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:59,673 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:59,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:59,673 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:59,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:59,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,676 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:59,676 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:59,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:59,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:05:59,812 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:05:59,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:05:59,813 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:05:59,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:05:59,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:05:59,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2310 [2022-12-13 02:05:59,814 INFO L420 AbstractCegarLoop]: === Iteration 2312 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:05:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:05:59,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1185239357, now seen corresponding path program 1 times [2022-12-13 02:05:59,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:05:59,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940551390] [2022-12-13 02:05:59,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:05:59,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:05:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:05:59,895 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 02:05:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:05:59,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940551390] [2022-12-13 02:05:59,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940551390] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:05:59,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:05:59,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:05:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867567677] [2022-12-13 02:05:59,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:05:59,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:05:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:05:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:05:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:05:59,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:05:59,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:05:59,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:05:59,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:05:59,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:05:59,959 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:05:59,959 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:05:59,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:05:59,959 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:05:59,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:05:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:05:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:05:59,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:05:59,960 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:05:59,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:05:59,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:05:59,961 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:05:59,961 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:05:59,961 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:05:59,961 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:05:59,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:05:59,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:05:59,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,964 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:05:59,964 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:05:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:05:59,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:05:59,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:00,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:00,098 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:06:00,098 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:00,098 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:00,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2311 [2022-12-13 02:06:00,099 INFO L420 AbstractCegarLoop]: === Iteration 2313 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1242497659, now seen corresponding path program 1 times [2022-12-13 02:06:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:00,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871378934] [2022-12-13 02:06:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:00,164 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 02:06:00,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:00,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871378934] [2022-12-13 02:06:00,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871378934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:00,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:00,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:00,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411425467] [2022-12-13 02:06:00,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:00,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:00,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:00,165 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:00,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:00,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:00,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:00,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:00,222 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:00,223 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:00,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:00,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:00,223 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:00,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:00,224 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:00,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:00,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:00,224 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:00,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:00,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,227 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:00,227 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:00,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:00,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:00,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:00,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:00,346 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:00,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:00,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:00,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2312 [2022-12-13 02:06:00,347 INFO L420 AbstractCegarLoop]: === Iteration 2314 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:00,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1299755961, now seen corresponding path program 1 times [2022-12-13 02:06:00,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:00,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246856342] [2022-12-13 02:06:00,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:00,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:00,404 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 02:06:00,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:00,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246856342] [2022-12-13 02:06:00,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246856342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:00,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:00,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:00,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48466098] [2022-12-13 02:06:00,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:00,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:00,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:00,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:00,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:00,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:00,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:00,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:00,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:00,455 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:00,455 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:00,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:00,455 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:00,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:00,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:00,456 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:00,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:00,457 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:00,457 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:00,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:00,457 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:00,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:00,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,460 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:00,460 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:00,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:00,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:00,577 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:00,578 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:00,578 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:00,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,578 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:00,578 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:00,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2313 [2022-12-13 02:06:00,578 INFO L420 AbstractCegarLoop]: === Iteration 2315 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:00,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:00,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1357014263, now seen corresponding path program 1 times [2022-12-13 02:06:00,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:00,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664559423] [2022-12-13 02:06:00,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:00,636 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 02:06:00,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:00,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664559423] [2022-12-13 02:06:00,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664559423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:00,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:00,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055614172] [2022-12-13 02:06:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:00,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:00,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:00,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:00,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:00,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:00,699 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:00,699 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:00,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:00,700 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:00,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:00,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:00,700 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:00,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:00,701 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,702 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:00,702 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:00,702 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:00,702 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,702 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:00,702 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:00,702 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:00,706 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:00,706 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:00,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:00,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:06:00,846 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:00,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:00,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:00,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2314 [2022-12-13 02:06:00,846 INFO L420 AbstractCegarLoop]: === Iteration 2316 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:00,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1414272565, now seen corresponding path program 1 times [2022-12-13 02:06:00,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:00,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155989443] [2022-12-13 02:06:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:00,917 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 02:06:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155989443] [2022-12-13 02:06:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155989443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:00,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:00,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764795706] [2022-12-13 02:06:00,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:00,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:00,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:00,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:00,918 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:00,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:00,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:00,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:00,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:00,974 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:00,974 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:00,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:00,975 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:00,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:00,976 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:00,976 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:00,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:00,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:00,977 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,977 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:00,977 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:00,977 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:00,977 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:00,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:00,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:00,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,981 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:00,981 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:00,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:00,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:00,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:01,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:01,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:06:01,113 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:01,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:01,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2315 [2022-12-13 02:06:01,113 INFO L420 AbstractCegarLoop]: === Iteration 2317 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1471530867, now seen corresponding path program 1 times [2022-12-13 02:06:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:01,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280656440] [2022-12-13 02:06:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:01,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:01,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280656440] [2022-12-13 02:06:01,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280656440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:01,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:01,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:01,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534078601] [2022-12-13 02:06:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:01,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:01,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:01,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:01,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:01,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:01,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:01,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:01,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:01,232 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:01,232 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:01,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:01,233 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:01,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:01,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:01,233 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:01,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:01,234 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:01,234 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:01,234 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:01,234 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:01,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:01,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,237 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:01,237 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:01,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:01,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:01,355 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:01,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:01,356 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:01,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:01,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:01,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2316 [2022-12-13 02:06:01,357 INFO L420 AbstractCegarLoop]: === Iteration 2318 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:01,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1528789169, now seen corresponding path program 1 times [2022-12-13 02:06:01,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:01,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800961995] [2022-12-13 02:06:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:01,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:01,425 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 02:06:01,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800961995] [2022-12-13 02:06:01,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800961995] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:01,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:01,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:01,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744931066] [2022-12-13 02:06:01,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:01,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:01,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:01,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:01,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:01,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:01,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:01,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:01,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:01,469 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:01,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:01,469 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:01,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:01,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:01,470 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:01,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:01,470 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:01,471 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:01,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:01,471 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,471 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:01,471 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:01,471 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,474 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:01,474 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:01,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:01,474 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,474 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:01,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:01,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:01,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:01,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2317 [2022-12-13 02:06:01,593 INFO L420 AbstractCegarLoop]: === Iteration 2319 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:01,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1586047471, now seen corresponding path program 1 times [2022-12-13 02:06:01,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:01,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301689161] [2022-12-13 02:06:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:01,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:01,654 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 02:06:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301689161] [2022-12-13 02:06:01,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301689161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:01,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:01,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733739547] [2022-12-13 02:06:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:01,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:01,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:01,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:01,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:01,718 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:01,718 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:01,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:01,719 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:01,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:01,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:01,720 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:01,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:01,720 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:01,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:01,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:01,721 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:01,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:01,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,724 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:01,724 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:01,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:01,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:01,855 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:01,856 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:06:01,856 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:01,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,856 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:01,857 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:01,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2318 [2022-12-13 02:06:01,857 INFO L420 AbstractCegarLoop]: === Iteration 2320 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1643305773, now seen corresponding path program 1 times [2022-12-13 02:06:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:01,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605885129] [2022-12-13 02:06:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:01,920 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 02:06:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:01,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605885129] [2022-12-13 02:06:01,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605885129] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:01,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:01,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547244921] [2022-12-13 02:06:01,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:01,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:01,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:01,921 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:01,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:01,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:01,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:01,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:01,973 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:01,973 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:01,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:01,974 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:01,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:01,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:01,974 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:01,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:01,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:01,975 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,975 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:01,975 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:01,975 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:01,975 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,976 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:01,976 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:01,976 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:01,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,978 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:01,978 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:01,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:01,979 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:01,979 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:02,107 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:02,108 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:06:02,108 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:02,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,108 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:02,108 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:02,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2319 [2022-12-13 02:06:02,108 INFO L420 AbstractCegarLoop]: === Iteration 2321 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1700564075, now seen corresponding path program 1 times [2022-12-13 02:06:02,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:02,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497916327] [2022-12-13 02:06:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:02,174 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 02:06:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:02,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497916327] [2022-12-13 02:06:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497916327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:02,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:02,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:02,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27939518] [2022-12-13 02:06:02,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:02,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:02,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:02,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:02,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:02,227 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:02,228 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:02,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:02,228 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:02,228 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:02,229 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:02,229 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:02,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:02,229 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,230 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:02,230 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:02,230 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:02,230 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,230 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:02,230 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:02,230 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,233 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:02,233 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:02,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:02,233 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,233 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:02,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:02,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:02,353 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:02,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:02,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2320 [2022-12-13 02:06:02,353 INFO L420 AbstractCegarLoop]: === Iteration 2322 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:02,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1757822377, now seen corresponding path program 1 times [2022-12-13 02:06:02,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:02,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435355873] [2022-12-13 02:06:02,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:02,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:02,410 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 02:06:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:02,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435355873] [2022-12-13 02:06:02,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435355873] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:02,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:02,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516070107] [2022-12-13 02:06:02,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:02,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:02,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:02,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:02,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:02,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:02,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:02,455 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:02,455 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:02,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:02,456 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:02,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:02,456 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:02,456 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:02,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:02,457 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:02,457 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:02,457 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:02,457 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:02,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:02,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,460 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:02,460 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:02,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:02,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:02,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:02,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:06:02,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:02,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:02,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2321 [2022-12-13 02:06:02,587 INFO L420 AbstractCegarLoop]: === Iteration 2323 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:02,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1815080679, now seen corresponding path program 1 times [2022-12-13 02:06:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:02,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763006738] [2022-12-13 02:06:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:02,650 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 02:06:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:02,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763006738] [2022-12-13 02:06:02,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763006738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:02,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:02,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483852304] [2022-12-13 02:06:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:02,651 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:02,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:02,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:02,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:02,698 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:02,699 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:02,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:02,699 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:02,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:02,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:02,700 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:02,700 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:02,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:02,701 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,701 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:02,701 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:02,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:02,701 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,701 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:02,701 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:02,701 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,704 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:02,704 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:02,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:02,704 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,704 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:02,826 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:02,827 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:06:02,827 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:02,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,827 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:02,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:02,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2322 [2022-12-13 02:06:02,827 INFO L420 AbstractCegarLoop]: === Iteration 2324 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1872338981, now seen corresponding path program 1 times [2022-12-13 02:06:02,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:02,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207510822] [2022-12-13 02:06:02,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:02,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:02,906 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 02:06:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:02,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207510822] [2022-12-13 02:06:02,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207510822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:02,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:02,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145516196] [2022-12-13 02:06:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:02,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:02,907 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:02,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:02,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:02,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:02,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:02,958 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:02,958 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:02,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:02,959 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:02,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:02,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:02,959 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:02,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:02,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:02,960 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:02,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:02,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:02,960 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:02,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:02,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:02,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,963 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:02,963 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:02,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:02,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:02,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:03,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:03,078 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:06:03,078 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:03,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,078 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:03,078 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:03,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2323 [2022-12-13 02:06:03,079 INFO L420 AbstractCegarLoop]: === Iteration 2325 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1929597283, now seen corresponding path program 1 times [2022-12-13 02:06:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:03,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154669122] [2022-12-13 02:06:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:03,134 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 02:06:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:03,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154669122] [2022-12-13 02:06:03,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154669122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:03,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:03,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:03,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294444248] [2022-12-13 02:06:03,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:03,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:03,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:03,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:03,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:03,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:03,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:03,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:03,177 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:03,177 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:03,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:03,177 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:03,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:03,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:03,178 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:03,178 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:03,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:03,179 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,179 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:03,179 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:03,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:03,179 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,179 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:03,179 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:03,179 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,182 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:03,182 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:03,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:03,182 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,182 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:03,301 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:03,302 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:03,302 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:03,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:03,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:03,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2324 [2022-12-13 02:06:03,303 INFO L420 AbstractCegarLoop]: === Iteration 2326 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:03,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1986855585, now seen corresponding path program 1 times [2022-12-13 02:06:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:03,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372294996] [2022-12-13 02:06:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:03,361 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 02:06:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372294996] [2022-12-13 02:06:03,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372294996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:03,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:03,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444314596] [2022-12-13 02:06:03,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:03,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:03,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:03,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:03,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:03,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:03,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:03,406 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:03,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:03,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:03,407 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:03,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:03,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:03,407 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:03,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:03,408 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:03,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:03,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:03,408 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:03,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:03,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,411 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:03,411 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:03,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:03,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:03,528 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:03,529 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:03,529 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:03,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:03,530 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:03,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2325 [2022-12-13 02:06:03,530 INFO L420 AbstractCegarLoop]: === Iteration 2327 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2044113887, now seen corresponding path program 1 times [2022-12-13 02:06:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:03,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511128769] [2022-12-13 02:06:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:03,585 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 02:06:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:03,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511128769] [2022-12-13 02:06:03,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511128769] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:03,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:03,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372159752] [2022-12-13 02:06:03,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:03,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:03,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:03,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:03,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:03,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:03,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:03,629 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:03,629 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:03,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:03,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:03,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:03,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:03,630 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:03,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:03,631 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:03,631 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:03,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:03,631 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:03,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:03,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,634 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:03,634 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:03,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:03,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:03,752 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:03,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:03,753 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:03,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,753 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:03,753 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:03,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2326 [2022-12-13 02:06:03,753 INFO L420 AbstractCegarLoop]: === Iteration 2328 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:03,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:03,754 INFO L85 PathProgramCache]: Analyzing trace with hash 2101372189, now seen corresponding path program 1 times [2022-12-13 02:06:03,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:03,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636649713] [2022-12-13 02:06:03,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:03,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:03,816 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 02:06:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636649713] [2022-12-13 02:06:03,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636649713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:03,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:03,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542942437] [2022-12-13 02:06:03,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:03,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:03,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:03,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:03,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:03,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:03,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:03,861 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:03,861 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:03,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:03,862 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:03,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:03,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:03,862 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:03,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:03,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:03,863 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,863 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:03,863 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:03,863 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:03,863 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,863 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:03,863 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:03,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:03,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,866 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:03,866 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:03,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:03,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:03,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:03,989 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:03,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:03,990 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:03,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:03,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:03,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:03,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2327 [2022-12-13 02:06:03,990 INFO L420 AbstractCegarLoop]: === Iteration 2329 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:03,990 INFO L85 PathProgramCache]: Analyzing trace with hash -2136336805, now seen corresponding path program 1 times [2022-12-13 02:06:03,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:03,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357345014] [2022-12-13 02:06:03,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:03,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:04,048 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 02:06:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:04,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357345014] [2022-12-13 02:06:04,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357345014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:04,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:04,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:04,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727240907] [2022-12-13 02:06:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:04,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:04,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:04,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:04,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:04,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:04,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:04,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:04,092 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:04,092 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:04,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:04,093 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:04,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:04,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:04,093 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:04,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:04,094 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:04,094 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:04,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:04,094 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:04,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:04,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:04,097 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:04,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:04,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:04,220 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:04,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:04,221 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:04,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:04,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:04,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2328 [2022-12-13 02:06:04,221 INFO L420 AbstractCegarLoop]: === Iteration 2330 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:04,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:04,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2079078503, now seen corresponding path program 1 times [2022-12-13 02:06:04,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:04,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932616823] [2022-12-13 02:06:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:04,294 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 02:06:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:04,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932616823] [2022-12-13 02:06:04,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932616823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:04,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:04,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:04,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463028984] [2022-12-13 02:06:04,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:04,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:04,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:04,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:04,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:04,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:04,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:04,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:04,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:04,347 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:04,347 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:04,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:04,348 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:04,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:04,348 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:04,348 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:04,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:04,349 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:04,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:04,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:04,350 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:04,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:04,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,353 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:04,354 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:04,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:04,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:04,490 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:04,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:04,491 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:04,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:04,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:04,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2329 [2022-12-13 02:06:04,492 INFO L420 AbstractCegarLoop]: === Iteration 2331 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:04,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2021820201, now seen corresponding path program 1 times [2022-12-13 02:06:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:04,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610858314] [2022-12-13 02:06:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:04,562 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 02:06:04,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:04,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610858314] [2022-12-13 02:06:04,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610858314] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:04,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:04,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:04,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715359740] [2022-12-13 02:06:04,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:04,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:04,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:04,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:04,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:04,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:04,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:04,618 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:04,618 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:04,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:04,619 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:04,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:04,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:04,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:04,619 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:04,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:04,620 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,620 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:04,620 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:04,620 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:04,620 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,620 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:04,620 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:04,620 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,623 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:04,623 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:04,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:04,623 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,624 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:04,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:04,760 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:04,760 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:04,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,760 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:04,760 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:04,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2330 [2022-12-13 02:06:04,760 INFO L420 AbstractCegarLoop]: === Iteration 2332 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:04,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1964561899, now seen corresponding path program 1 times [2022-12-13 02:06:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:04,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52068041] [2022-12-13 02:06:04,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:04,819 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 02:06:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:04,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52068041] [2022-12-13 02:06:04,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52068041] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:04,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:04,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103770538] [2022-12-13 02:06:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:04,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:04,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:04,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:04,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:04,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:04,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:04,869 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:04,869 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:04,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:04,870 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:04,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:04,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:04,870 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:04,871 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:04,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:04,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:04,871 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:04,871 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:04,872 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:04,872 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,872 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:04,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:04,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:04,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,874 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:04,875 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:04,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:04,875 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:04,875 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:04,993 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:04,994 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:04,994 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:04,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:04,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:04,994 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:04,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2331 [2022-12-13 02:06:04,994 INFO L420 AbstractCegarLoop]: === Iteration 2333 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:04,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1907303597, now seen corresponding path program 1 times [2022-12-13 02:06:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:04,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520983950] [2022-12-13 02:06:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:04,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:05,055 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 02:06:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520983950] [2022-12-13 02:06:05,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520983950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:05,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:05,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:05,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186510561] [2022-12-13 02:06:05,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:05,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:05,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:05,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:05,056 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:05,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:05,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:05,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:05,106 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:05,106 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:05,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:05,107 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:05,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:05,107 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:05,107 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:05,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:05,108 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,108 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:05,108 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:05,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:05,108 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:05,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:05,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,111 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:05,111 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:05,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:05,111 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,111 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:05,230 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:05,231 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:05,231 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:05,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,231 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:05,231 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:05,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2332 [2022-12-13 02:06:05,231 INFO L420 AbstractCegarLoop]: === Iteration 2334 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:05,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1850045295, now seen corresponding path program 1 times [2022-12-13 02:06:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:05,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232002151] [2022-12-13 02:06:05,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:05,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232002151] [2022-12-13 02:06:05,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232002151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:05,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:05,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614722768] [2022-12-13 02:06:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:05,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:05,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:05,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:05,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:05,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:05,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:05,341 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:05,341 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:05,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:05,342 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:05,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:05,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:05,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:05,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:05,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:05,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:05,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:05,343 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:05,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:05,344 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:05,346 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:05,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:05,347 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,347 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:05,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:05,467 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:05,467 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:05,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:05,467 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:05,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2333 [2022-12-13 02:06:05,468 INFO L420 AbstractCegarLoop]: === Iteration 2335 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1792786993, now seen corresponding path program 1 times [2022-12-13 02:06:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:05,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105609576] [2022-12-13 02:06:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:05,525 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 02:06:05,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:05,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105609576] [2022-12-13 02:06:05,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105609576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:05,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:05,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:05,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403393347] [2022-12-13 02:06:05,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:05,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:05,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:05,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:05,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:05,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:05,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:05,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:05,578 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:05,578 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:05,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:05,578 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:05,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:05,579 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:05,579 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:05,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:05,580 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,580 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:05,580 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:05,580 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:05,580 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,580 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:05,580 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:05,580 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,583 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:05,583 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:05,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:05,583 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,583 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:05,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:05,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:05,703 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:05,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:05,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:05,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2334 [2022-12-13 02:06:05,704 INFO L420 AbstractCegarLoop]: === Iteration 2336 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:05,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:05,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1735528691, now seen corresponding path program 1 times [2022-12-13 02:06:05,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:05,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741265780] [2022-12-13 02:06:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:05,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:05,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741265780] [2022-12-13 02:06:05,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741265780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:05,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:05,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081873410] [2022-12-13 02:06:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:05,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:05,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:05,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:05,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:05,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:05,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:05,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:05,822 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:05,822 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:05,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:05,823 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:05,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:05,824 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:05,824 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:05,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:05,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:05,824 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,825 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:05,825 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:05,825 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:05,825 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,825 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:05,825 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:05,825 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:05,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,828 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:05,828 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:05,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:05,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:05,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:05,946 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:05,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:05,947 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:05,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:05,948 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:05,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:05,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2335 [2022-12-13 02:06:05,948 INFO L420 AbstractCegarLoop]: === Iteration 2337 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:05,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:05,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1678270389, now seen corresponding path program 1 times [2022-12-13 02:06:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:05,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588893779] [2022-12-13 02:06:05,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:05,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:06,008 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 02:06:06,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:06,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588893779] [2022-12-13 02:06:06,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588893779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:06,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:06,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113686589] [2022-12-13 02:06:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:06,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:06,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:06,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:06,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:06,009 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:06,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:06,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:06,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:06,053 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:06,053 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:06,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:06,053 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:06,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:06,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:06,054 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:06,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:06,055 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,055 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:06,055 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:06,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:06,055 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:06,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:06,055 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,058 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:06,058 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:06,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:06,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:06,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:06,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:06,178 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:06,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:06,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2336 [2022-12-13 02:06:06,179 INFO L420 AbstractCegarLoop]: === Iteration 2338 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1621012087, now seen corresponding path program 1 times [2022-12-13 02:06:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:06,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68326575] [2022-12-13 02:06:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:06,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 02:06:06,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:06,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68326575] [2022-12-13 02:06:06,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68326575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:06,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:06,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2384722] [2022-12-13 02:06:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:06,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:06,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:06,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:06,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:06,298 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:06,298 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:06,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:06,299 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:06,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:06,299 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:06,299 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:06,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:06,300 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:06,300 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:06,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:06,300 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:06,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:06,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,303 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:06,303 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:06,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:06,432 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:06,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:06:06,433 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:06,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:06,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:06,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2337 [2022-12-13 02:06:06,433 INFO L420 AbstractCegarLoop]: === Iteration 2339 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:06,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:06,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1563753785, now seen corresponding path program 1 times [2022-12-13 02:06:06,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:06,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086186185] [2022-12-13 02:06:06,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:06,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:06,495 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 02:06:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:06,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086186185] [2022-12-13 02:06:06,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086186185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:06,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178554719] [2022-12-13 02:06:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:06,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:06,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:06,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:06,496 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:06,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:06,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:06,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:06,541 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:06,541 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:06,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:06,541 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:06,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:06,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:06,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:06,542 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:06,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:06,543 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,543 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:06,543 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:06,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:06,543 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:06,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:06,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,546 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:06,546 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:06,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:06,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:06,667 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:06,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:06,668 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:06,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,668 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:06,668 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:06,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2338 [2022-12-13 02:06:06,668 INFO L420 AbstractCegarLoop]: === Iteration 2340 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1506495483, now seen corresponding path program 1 times [2022-12-13 02:06:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:06,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989933311] [2022-12-13 02:06:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:06,737 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 02:06:06,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:06,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989933311] [2022-12-13 02:06:06,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989933311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:06,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:06,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:06,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391745842] [2022-12-13 02:06:06,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:06,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:06,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:06,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:06,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:06,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:06,791 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:06,791 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:06,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:06,791 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:06,791 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:06,792 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:06,792 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:06,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:06,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:06,793 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,793 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:06,793 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:06,793 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:06,793 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,793 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:06,793 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:06,793 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:06,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,796 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:06,796 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:06,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:06,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:06,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:06,915 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:06,916 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:06,916 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:06,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,916 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:06,916 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:06,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2339 [2022-12-13 02:06:06,917 INFO L420 AbstractCegarLoop]: === Iteration 2341 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1449237181, now seen corresponding path program 1 times [2022-12-13 02:06:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:06,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619093627] [2022-12-13 02:06:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:06,975 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 02:06:06,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619093627] [2022-12-13 02:06:06,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619093627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:06,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:06,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:06,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800363110] [2022-12-13 02:06:06,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:06,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:06,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:06,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:06,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:06,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:06,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:06,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:07,020 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:07,020 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:07,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:07,021 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:07,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:07,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:07,021 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:07,021 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:07,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:07,022 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,022 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:07,022 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:07,022 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:07,023 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,023 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:07,023 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:07,023 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,025 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:07,025 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:07,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:07,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:07,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:07,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:07,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:07,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:07,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:07,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2340 [2022-12-13 02:06:07,150 INFO L420 AbstractCegarLoop]: === Iteration 2342 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1391978879, now seen corresponding path program 1 times [2022-12-13 02:06:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:07,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055845443] [2022-12-13 02:06:07,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:07,231 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 02:06:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:07,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055845443] [2022-12-13 02:06:07,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055845443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:07,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:07,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:07,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300730753] [2022-12-13 02:06:07,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:07,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:07,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:07,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:07,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:07,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:07,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:07,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:07,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:07,285 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:07,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:07,286 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:07,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:07,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:07,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:07,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:07,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:07,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:07,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:07,288 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:07,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:07,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,290 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:07,290 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:07,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:07,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:07,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:07,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:07,410 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:07,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:07,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:07,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2341 [2022-12-13 02:06:07,410 INFO L420 AbstractCegarLoop]: === Iteration 2343 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:07,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:07,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1334720577, now seen corresponding path program 1 times [2022-12-13 02:06:07,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:07,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338921139] [2022-12-13 02:06:07,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:07,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:07,470 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 02:06:07,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:07,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338921139] [2022-12-13 02:06:07,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338921139] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:07,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:07,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603729893] [2022-12-13 02:06:07,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:07,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:07,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:07,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:07,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:07,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:07,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:07,515 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:07,515 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:07,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:07,515 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:07,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:07,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:07,516 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:07,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:07,517 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,517 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:07,517 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:07,517 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:07,517 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,517 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:07,517 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:07,517 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,520 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:07,520 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:07,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:07,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:07,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:07,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:07,640 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:07,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:07,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:07,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2342 [2022-12-13 02:06:07,640 INFO L420 AbstractCegarLoop]: === Iteration 2344 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1277462275, now seen corresponding path program 1 times [2022-12-13 02:06:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:07,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561379675] [2022-12-13 02:06:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:07,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:07,698 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 02:06:07,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:07,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561379675] [2022-12-13 02:06:07,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561379675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:07,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:07,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215111] [2022-12-13 02:06:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:07,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:07,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:07,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:07,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:07,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:07,750 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:07,751 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:07,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:07,751 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:07,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:07,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:07,752 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:07,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:07,752 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:07,753 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:07,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:07,753 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:07,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:07,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,756 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:07,756 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:07,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:07,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:07,874 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:07,875 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:07,875 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:07,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:07,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:07,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2343 [2022-12-13 02:06:07,875 INFO L420 AbstractCegarLoop]: === Iteration 2345 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:07,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:07,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1220203973, now seen corresponding path program 1 times [2022-12-13 02:06:07,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:07,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873631890] [2022-12-13 02:06:07,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:07,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:07,931 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 02:06:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873631890] [2022-12-13 02:06:07,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873631890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:07,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:07,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172185827] [2022-12-13 02:06:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:07,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:07,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:07,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:07,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:07,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:07,976 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:07,976 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:07,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:07,976 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:07,976 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:07,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:07,977 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:07,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:07,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:07,978 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:07,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:07,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:07,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:07,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:07,978 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:07,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,981 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:07,981 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:07,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:07,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:07,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:08,101 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:08,102 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:08,102 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:08,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,102 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:08,102 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:08,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2344 [2022-12-13 02:06:08,102 INFO L420 AbstractCegarLoop]: === Iteration 2346 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1162945671, now seen corresponding path program 1 times [2022-12-13 02:06:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:08,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279887166] [2022-12-13 02:06:08,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:08,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279887166] [2022-12-13 02:06:08,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279887166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:08,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:08,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737379152] [2022-12-13 02:06:08,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:08,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:08,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:08,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:08,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:08,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:08,203 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:08,203 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:08,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:08,203 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:08,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:08,204 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:08,204 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:08,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:08,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:08,205 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:08,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:08,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:08,205 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:08,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:08,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:08,208 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:08,208 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:08,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:08,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:08,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:08,325 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:08,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:08,327 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:08,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:08,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:08,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2345 [2022-12-13 02:06:08,327 INFO L420 AbstractCegarLoop]: === Iteration 2347 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1105687369, now seen corresponding path program 1 times [2022-12-13 02:06:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:08,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327904744] [2022-12-13 02:06:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:08,386 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 02:06:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:08,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327904744] [2022-12-13 02:06:08,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327904744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:08,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:08,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580855708] [2022-12-13 02:06:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:08,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:08,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:08,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:08,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:08,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:08,430 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:08,430 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:08,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:08,431 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:08,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:08,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:08,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:08,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:08,432 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:08,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:08,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:08,432 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:08,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:08,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:08,433 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:08,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:08,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:08,435 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:08,436 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:08,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:08,436 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:08,436 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:08,565 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:08,567 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:06:08,567 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:08,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,567 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:08,567 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:08,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2346 [2022-12-13 02:06:08,567 INFO L420 AbstractCegarLoop]: === Iteration 2348 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:08,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1048429067, now seen corresponding path program 1 times [2022-12-13 02:06:08,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:08,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322081606] [2022-12-13 02:06:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:08,659 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 02:06:08,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:08,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322081606] [2022-12-13 02:06:08,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322081606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:08,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:08,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:08,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531137989] [2022-12-13 02:06:08,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:08,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:08,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:08,661 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:08,661 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:08,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:08,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:08,722 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:08,722 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:08,723 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:08,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:08,723 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:08,723 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:08,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:08,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:08,725 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,725 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:08,725 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:08,725 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:08,725 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,725 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:08,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:08,725 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:08,729 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:08,729 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:08,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:08,729 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:08,729 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:08,866 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:08,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:06:08,868 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:08,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:08,868 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:08,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2347 [2022-12-13 02:06:08,868 INFO L420 AbstractCegarLoop]: === Iteration 2349 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -991170765, now seen corresponding path program 1 times [2022-12-13 02:06:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:08,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822104989] [2022-12-13 02:06:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:08,940 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 02:06:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:08,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822104989] [2022-12-13 02:06:08,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822104989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:08,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:08,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:08,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796033888] [2022-12-13 02:06:08,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:08,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:08,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:08,941 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:08,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:08,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:08,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:08,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:09,000 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:09,000 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:09,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 517 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:09,000 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:09,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:09,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:09,001 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:09,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:09,002 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,002 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:09,002 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:09,002 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:09,002 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:09,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:09,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,005 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:09,005 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:09,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:09,005 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,005 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:09,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:09,124 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:09,124 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:09,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,124 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:09,124 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:09,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2348 [2022-12-13 02:06:09,124 INFO L420 AbstractCegarLoop]: === Iteration 2350 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash -933912463, now seen corresponding path program 1 times [2022-12-13 02:06:09,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:09,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289233068] [2022-12-13 02:06:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:09,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:09,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289233068] [2022-12-13 02:06:09,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289233068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:09,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:09,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:09,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459416250] [2022-12-13 02:06:09,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:09,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:09,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:09,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:09,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:09,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:09,232 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:09,232 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:09,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:09,233 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:09,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:09,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:09,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:09,233 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:09,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:09,234 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,234 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:09,234 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:09,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:09,235 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,235 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:09,235 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:09,235 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,237 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:09,237 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:09,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:09,238 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,238 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:09,355 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:09,356 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:09,356 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:09,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,356 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:09,356 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:09,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2349 [2022-12-13 02:06:09,357 INFO L420 AbstractCegarLoop]: === Iteration 2351 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash -876654161, now seen corresponding path program 1 times [2022-12-13 02:06:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:09,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991608154] [2022-12-13 02:06:09,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:09,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:09,416 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 02:06:09,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:09,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991608154] [2022-12-13 02:06:09,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991608154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:09,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:09,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569014761] [2022-12-13 02:06:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:09,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:09,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:09,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:09,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:09,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:09,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:09,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:09,462 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:09,462 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:09,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:09,463 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:09,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:09,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:09,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:09,463 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:09,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:09,464 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:09,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:09,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:09,464 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:09,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:09,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:09,467 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:09,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:09,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:09,585 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:09,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:09,586 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:09,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:09,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:09,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2350 [2022-12-13 02:06:09,586 INFO L420 AbstractCegarLoop]: === Iteration 2352 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash -819395859, now seen corresponding path program 1 times [2022-12-13 02:06:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:09,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413754550] [2022-12-13 02:06:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:09,641 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 02:06:09,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:09,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413754550] [2022-12-13 02:06:09,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413754550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:09,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:09,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:09,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414543312] [2022-12-13 02:06:09,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:09,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:09,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:09,642 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:09,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:09,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:09,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:09,685 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:09,685 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:09,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:09,685 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:09,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:09,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:09,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:09,686 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:09,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:09,687 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:09,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:09,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:09,687 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:09,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:09,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,690 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:09,690 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:09,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:09,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:09,804 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:09,805 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:06:09,805 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:09,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:09,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:09,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2351 [2022-12-13 02:06:09,805 INFO L420 AbstractCegarLoop]: === Iteration 2353 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash -762137557, now seen corresponding path program 1 times [2022-12-13 02:06:09,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:09,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828825850] [2022-12-13 02:06:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:09,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:09,864 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 02:06:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:09,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828825850] [2022-12-13 02:06:09,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828825850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:09,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:09,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:09,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957846333] [2022-12-13 02:06:09,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:09,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:09,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:09,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:09,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:09,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:09,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:09,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:09,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:09,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:09,916 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:09,917 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:09,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:09,917 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:09,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:09,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:09,918 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:09,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:09,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:09,919 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:09,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:09,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:09,919 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:09,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:09,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:09,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:09,922 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:09,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:09,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:09,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:10,046 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:10,047 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:06:10,047 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:10,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,047 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:10,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:10,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2352 [2022-12-13 02:06:10,048 INFO L420 AbstractCegarLoop]: === Iteration 2354 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:10,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:10,048 INFO L85 PathProgramCache]: Analyzing trace with hash -704879255, now seen corresponding path program 1 times [2022-12-13 02:06:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:10,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785872474] [2022-12-13 02:06:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:10,106 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 02:06:10,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:10,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785872474] [2022-12-13 02:06:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785872474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:10,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:10,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002729813] [2022-12-13 02:06:10,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:10,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:10,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:10,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:10,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:10,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:10,171 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:10,171 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:10,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:10,171 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:10,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:10,172 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:10,172 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:10,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:10,173 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,173 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:10,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:10,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:10,173 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:10,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:10,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,176 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:10,176 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:10,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:10,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:10,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:10,294 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:10,294 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:10,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,294 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:10,294 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:10,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2353 [2022-12-13 02:06:10,294 INFO L420 AbstractCegarLoop]: === Iteration 2355 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash -647620953, now seen corresponding path program 1 times [2022-12-13 02:06:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:10,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835595206] [2022-12-13 02:06:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:10,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:10,354 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 02:06:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:10,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835595206] [2022-12-13 02:06:10,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835595206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:10,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:10,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558949784] [2022-12-13 02:06:10,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:10,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:10,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:10,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:10,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:10,355 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:10,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:10,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:10,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:10,398 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:10,398 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:10,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:10,399 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:10,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:10,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:10,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:10,399 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:10,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:10,400 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:10,400 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:10,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:10,400 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,400 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:10,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:10,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,403 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:10,403 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:10,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:10,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:10,521 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:10,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:10,522 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:10,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:10,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:10,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2354 [2022-12-13 02:06:10,523 INFO L420 AbstractCegarLoop]: === Iteration 2356 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash -590362651, now seen corresponding path program 1 times [2022-12-13 02:06:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:10,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490983842] [2022-12-13 02:06:10,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:10,589 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 02:06:10,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:10,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490983842] [2022-12-13 02:06:10,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490983842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:10,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:10,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889405470] [2022-12-13 02:06:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:10,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:10,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:10,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:10,590 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:10,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:10,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:10,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:10,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:10,635 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:10,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:10,635 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:10,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:10,636 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:10,636 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:10,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:10,636 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,637 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:10,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:10,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:10,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:10,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:10,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,640 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:10,640 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:10,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:10,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:10,769 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:10,771 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:06:10,771 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:10,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,771 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:10,771 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:10,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2355 [2022-12-13 02:06:10,772 INFO L420 AbstractCegarLoop]: === Iteration 2357 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash -533104349, now seen corresponding path program 1 times [2022-12-13 02:06:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:10,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392279848] [2022-12-13 02:06:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:10,840 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 02:06:10,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:10,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392279848] [2022-12-13 02:06:10,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392279848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:10,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:10,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:10,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946227258] [2022-12-13 02:06:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:10,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:10,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:10,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:10,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:10,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:10,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:10,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:10,886 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:10,886 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:10,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:10,886 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:10,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:10,887 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:10,887 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:10,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:10,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:10,888 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,888 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:10,888 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:10,888 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:10,888 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,888 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:10,888 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:10,888 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:10,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,891 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:10,891 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:10,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:10,891 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:10,891 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:11,017 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:11,018 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:06:11,018 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:11,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:11,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:11,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2356 [2022-12-13 02:06:11,018 INFO L420 AbstractCegarLoop]: === Iteration 2358 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:11,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash -475846047, now seen corresponding path program 1 times [2022-12-13 02:06:11,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:11,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139133647] [2022-12-13 02:06:11,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:11,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:11,078 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 02:06:11,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:11,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139133647] [2022-12-13 02:06:11,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139133647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:11,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:11,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907223183] [2022-12-13 02:06:11,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:11,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:11,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:11,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:11,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:11,079 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:11,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:11,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:11,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:11,128 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:11,129 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:11,129 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:11,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:11,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:11,130 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:11,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:11,131 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,131 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:11,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:11,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:11,131 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:11,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:11,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,134 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:11,134 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:11,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:11,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:11,255 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:11,256 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:11,257 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:11,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:11,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:11,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2357 [2022-12-13 02:06:11,257 INFO L420 AbstractCegarLoop]: === Iteration 2359 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:11,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:11,257 INFO L85 PathProgramCache]: Analyzing trace with hash -418587745, now seen corresponding path program 1 times [2022-12-13 02:06:11,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:11,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412171879] [2022-12-13 02:06:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:11,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:11,314 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 02:06:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412171879] [2022-12-13 02:06:11,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412171879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:11,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:11,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810716923] [2022-12-13 02:06:11,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:11,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:11,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:11,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:11,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:11,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:11,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:11,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:11,361 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:11,361 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:11,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:11,362 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:11,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:11,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:11,362 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:11,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:11,363 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:11,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:11,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:11,363 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:11,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:11,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,366 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:11,366 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:11,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:11,366 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,366 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:11,482 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:11,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:11,483 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:11,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:11,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:11,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2358 [2022-12-13 02:06:11,483 INFO L420 AbstractCegarLoop]: === Iteration 2360 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:11,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash -361329443, now seen corresponding path program 1 times [2022-12-13 02:06:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:11,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202467755] [2022-12-13 02:06:11,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:11,540 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 02:06:11,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:11,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202467755] [2022-12-13 02:06:11,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202467755] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:11,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:11,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976689906] [2022-12-13 02:06:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:11,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:11,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:11,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:11,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:11,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:11,583 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:11,584 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:11,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:11,584 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:11,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:11,585 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:11,585 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:11,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:11,585 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,585 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:11,586 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:11,586 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:11,586 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,586 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:11,586 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:11,586 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,600 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:11,600 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:11,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:11,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:11,736 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:11,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-13 02:06:11,737 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:11,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:11,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:11,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2359 [2022-12-13 02:06:11,737 INFO L420 AbstractCegarLoop]: === Iteration 2361 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash -304071141, now seen corresponding path program 1 times [2022-12-13 02:06:11,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:11,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472390705] [2022-12-13 02:06:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:11,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:11,807 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 02:06:11,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:11,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472390705] [2022-12-13 02:06:11,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472390705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:11,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:11,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:11,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673865468] [2022-12-13 02:06:11,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:11,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:11,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:11,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:11,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:11,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:11,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:11,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:11,867 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:11,868 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:11,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:11,868 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:11,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:11,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:11,869 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:11,869 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:11,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:11,870 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,870 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:11,870 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:11,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:11,870 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,870 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:11,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:11,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:11,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,873 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:11,873 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:11,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:11,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:11,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:12,004 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:12,005 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:06:12,005 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:12,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,006 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:12,006 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:12,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2360 [2022-12-13 02:06:12,006 INFO L420 AbstractCegarLoop]: === Iteration 2362 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:12,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:12,006 INFO L85 PathProgramCache]: Analyzing trace with hash -246812839, now seen corresponding path program 1 times [2022-12-13 02:06:12,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:12,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385392439] [2022-12-13 02:06:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:12,067 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 02:06:12,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:12,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385392439] [2022-12-13 02:06:12,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385392439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:12,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:12,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:12,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401202071] [2022-12-13 02:06:12,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:12,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:12,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:12,068 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:12,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:12,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:12,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:12,130 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:12,131 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:12,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:12,131 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:12,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:12,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:12,132 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:12,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:12,133 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:12,134 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:12,134 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:12,134 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,134 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:12,134 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:12,134 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,138 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:12,138 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:12,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:12,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:12,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:12,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:06:12,279 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:12,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:12,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:12,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2361 [2022-12-13 02:06:12,279 INFO L420 AbstractCegarLoop]: === Iteration 2363 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:12,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:12,279 INFO L85 PathProgramCache]: Analyzing trace with hash -189554537, now seen corresponding path program 1 times [2022-12-13 02:06:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:12,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87577763] [2022-12-13 02:06:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:12,345 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 02:06:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:12,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87577763] [2022-12-13 02:06:12,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87577763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:12,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:12,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334907560] [2022-12-13 02:06:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:12,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:12,346 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:12,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:12,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:12,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:12,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:12,401 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:12,402 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:12,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:12,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:12,402 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:12,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:12,403 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:12,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:12,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:12,403 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:12,404 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:12,404 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,406 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:12,406 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:12,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:12,407 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:12,542 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:12,544 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:12,544 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:12,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,544 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:12,544 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:12,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2362 [2022-12-13 02:06:12,544 INFO L420 AbstractCegarLoop]: === Iteration 2364 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -132296235, now seen corresponding path program 1 times [2022-12-13 02:06:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:12,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255725198] [2022-12-13 02:06:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:12,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:12,619 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 02:06:12,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:12,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255725198] [2022-12-13 02:06:12,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255725198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:12,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:12,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:12,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438920625] [2022-12-13 02:06:12,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:12,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:12,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:12,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:12,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:12,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:12,620 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:12,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:12,682 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:12,682 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:12,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:12,683 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:12,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:12,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:12,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:12,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:12,684 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:12,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:12,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:12,684 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:12,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:12,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,687 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:12,688 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:12,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:12,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:12,823 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:12,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:12,824 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:12,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:12,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:12,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2363 [2022-12-13 02:06:12,824 INFO L420 AbstractCegarLoop]: === Iteration 2365 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:12,825 INFO L85 PathProgramCache]: Analyzing trace with hash -75037933, now seen corresponding path program 1 times [2022-12-13 02:06:12,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:12,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107149038] [2022-12-13 02:06:12,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:12,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:12,911 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 02:06:12,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:12,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107149038] [2022-12-13 02:06:12,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107149038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:12,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:12,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:12,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294697944] [2022-12-13 02:06:12,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:12,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:12,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:12,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:12,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:12,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:12,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:12,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:12,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:12,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:12,982 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:12,982 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:12,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:12,983 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:12,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:12,983 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:12,983 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:12,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:12,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:12,984 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:12,984 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:12,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:12,985 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:12,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:12,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:12,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,988 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:12,988 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:12,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:12,988 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:12,988 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:13,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:13,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:13,126 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:13,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:13,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:13,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2364 [2022-12-13 02:06:13,126 INFO L420 AbstractCegarLoop]: === Iteration 2366 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:13,126 INFO L85 PathProgramCache]: Analyzing trace with hash -17779631, now seen corresponding path program 1 times [2022-12-13 02:06:13,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:13,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917727090] [2022-12-13 02:06:13,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:13,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:13,196 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 02:06:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:13,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917727090] [2022-12-13 02:06:13,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917727090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:13,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:13,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796623596] [2022-12-13 02:06:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:13,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:13,198 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:13,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:13,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:13,260 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:13,260 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:13,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:13,260 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:13,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:13,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:13,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:13,261 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:13,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:13,262 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:13,262 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:13,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:13,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:13,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:13,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:13,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:13,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:13,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:13,414 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:13,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 02:06:13,415 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:13,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:13,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:13,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2365 [2022-12-13 02:06:13,415 INFO L420 AbstractCegarLoop]: === Iteration 2367 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:13,415 INFO L85 PathProgramCache]: Analyzing trace with hash 39478671, now seen corresponding path program 1 times [2022-12-13 02:06:13,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:13,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636286981] [2022-12-13 02:06:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:13,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 02:06:13,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:13,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636286981] [2022-12-13 02:06:13,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636286981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:13,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:13,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520106147] [2022-12-13 02:06:13,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:13,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:13,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:13,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:13,482 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:13,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:13,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:13,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:13,536 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:13,536 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:13,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:13,536 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:13,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:13,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:13,537 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:13,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:13,538 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:13,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:13,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:13,538 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,538 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:13,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:13,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,541 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:13,541 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:13,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:13,541 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:13,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:13,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:13,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:13,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:13,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:13,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2366 [2022-12-13 02:06:13,661 INFO L420 AbstractCegarLoop]: === Iteration 2368 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:13,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 96736973, now seen corresponding path program 1 times [2022-12-13 02:06:13,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:13,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684432079] [2022-12-13 02:06:13,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:13,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:13,720 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 02:06:13,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:13,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684432079] [2022-12-13 02:06:13,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684432079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:13,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:13,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120323919] [2022-12-13 02:06:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:13,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:13,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:13,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:13,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:13,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:13,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:13,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:13,765 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:13,765 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:13,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:13,766 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:13,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:13,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:13,766 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:13,766 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:13,767 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:13,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:13,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:13,768 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:13,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:13,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,770 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:13,771 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:13,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:13,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:13,889 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:13,890 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:13,890 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:13,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,890 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:13,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:13,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2367 [2022-12-13 02:06:13,890 INFO L420 AbstractCegarLoop]: === Iteration 2369 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash 153995275, now seen corresponding path program 1 times [2022-12-13 02:06:13,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:13,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369259892] [2022-12-13 02:06:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:13,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:13,949 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 02:06:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369259892] [2022-12-13 02:06:13,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369259892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:13,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:13,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647442076] [2022-12-13 02:06:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:13,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:13,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:13,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:13,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:13,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:13,994 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:13,994 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:13,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:13,995 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:13,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:13,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:13,995 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:13,995 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:13,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:13,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:13,996 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,996 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:13,996 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:13,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:13,997 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:13,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:13,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:13,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:13,999 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:14,000 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:14,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:14,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:14,118 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:14,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:14,120 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:14,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:14,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:14,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2368 [2022-12-13 02:06:14,120 INFO L420 AbstractCegarLoop]: === Iteration 2370 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:14,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:14,120 INFO L85 PathProgramCache]: Analyzing trace with hash 211253577, now seen corresponding path program 1 times [2022-12-13 02:06:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:14,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050433738] [2022-12-13 02:06:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:14,179 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 02:06:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050433738] [2022-12-13 02:06:14,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050433738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:14,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:14,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800037255] [2022-12-13 02:06:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:14,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:14,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:14,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:14,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:14,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:14,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:14,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:14,224 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:14,224 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:14,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:14,225 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:14,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:14,225 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:14,226 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:14,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:14,226 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,226 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:14,227 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:14,227 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:14,227 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,227 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:14,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:14,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,230 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:14,230 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:14,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:14,230 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,230 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:14,349 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:14,350 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:14,350 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:14,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:14,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2369 [2022-12-13 02:06:14,351 INFO L420 AbstractCegarLoop]: === Iteration 2371 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash 268511879, now seen corresponding path program 1 times [2022-12-13 02:06:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:14,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224732853] [2022-12-13 02:06:14,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:14,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:14,410 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 02:06:14,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:14,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224732853] [2022-12-13 02:06:14,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224732853] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:14,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:14,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:14,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529981310] [2022-12-13 02:06:14,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:14,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:14,411 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:14,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:14,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:14,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:14,462 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:14,462 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:14,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:14,462 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:14,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:14,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:14,463 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:14,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:14,464 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,464 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:14,464 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:14,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:14,464 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,464 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:14,464 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:14,464 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,467 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:14,467 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:14,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:14,467 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,467 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:14,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:14,586 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:14,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:14,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:14,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:14,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2370 [2022-12-13 02:06:14,587 INFO L420 AbstractCegarLoop]: === Iteration 2372 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:14,587 INFO L85 PathProgramCache]: Analyzing trace with hash 325770181, now seen corresponding path program 1 times [2022-12-13 02:06:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:14,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211638018] [2022-12-13 02:06:14,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:14,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:14,646 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 02:06:14,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211638018] [2022-12-13 02:06:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211638018] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:14,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:14,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145670580] [2022-12-13 02:06:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:14,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:14,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:14,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:14,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:14,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:14,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:14,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:14,698 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:14,698 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:14,698 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:14,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:14,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:14,699 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:14,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:14,700 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:14,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:14,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:14,700 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:14,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:14,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:14,703 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:14,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:14,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:14,833 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:14,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:06:14,834 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:14,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:14,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:14,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2371 [2022-12-13 02:06:14,834 INFO L420 AbstractCegarLoop]: === Iteration 2373 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:14,834 INFO L85 PathProgramCache]: Analyzing trace with hash 383028483, now seen corresponding path program 1 times [2022-12-13 02:06:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:14,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682787077] [2022-12-13 02:06:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:14,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:14,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 02:06:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682787077] [2022-12-13 02:06:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682787077] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:14,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:14,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368677730] [2022-12-13 02:06:14,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:14,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:14,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:14,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:14,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:14,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:14,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:14,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:14,935 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:14,935 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:14,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:14,936 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:14,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:14,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:14,936 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:14,936 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:14,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:14,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:14,937 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,937 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:14,937 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:14,937 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:14,937 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,938 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:14,938 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:14,938 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:14,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,940 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:14,940 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:14,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:14,941 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:14,941 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:15,066 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:15,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:06:15,067 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:15,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,067 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:15,067 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:15,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2372 [2022-12-13 02:06:15,068 INFO L420 AbstractCegarLoop]: === Iteration 2374 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 440286785, now seen corresponding path program 1 times [2022-12-13 02:06:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:15,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795924044] [2022-12-13 02:06:15,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:15,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:15,133 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 02:06:15,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:15,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795924044] [2022-12-13 02:06:15,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795924044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:15,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:15,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936232614] [2022-12-13 02:06:15,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:15,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:15,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:15,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:15,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:15,134 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:15,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:15,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:15,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:15,179 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:15,179 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:15,180 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:15,180 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:15,180 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:15,180 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:15,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:15,181 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,181 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:15,181 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:15,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:15,181 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,182 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:15,182 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:15,182 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,184 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:15,184 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:15,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:15,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:15,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:15,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:06:15,309 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:15,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:15,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:15,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2373 [2022-12-13 02:06:15,309 INFO L420 AbstractCegarLoop]: === Iteration 2375 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 497545087, now seen corresponding path program 1 times [2022-12-13 02:06:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:15,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623054795] [2022-12-13 02:06:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:15,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:15,366 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 02:06:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:15,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623054795] [2022-12-13 02:06:15,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623054795] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:15,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:15,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816954622] [2022-12-13 02:06:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:15,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:15,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:15,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:15,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:15,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:15,410 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:15,411 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:15,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:15,411 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:15,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:15,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:15,412 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:15,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:15,412 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:15,412 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:15,413 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:15,413 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,413 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:15,413 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:15,413 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,415 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:15,415 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:15,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:15,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:15,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:15,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:15,533 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:15,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,534 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:15,534 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:15,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2374 [2022-12-13 02:06:15,534 INFO L420 AbstractCegarLoop]: === Iteration 2376 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash 554803389, now seen corresponding path program 1 times [2022-12-13 02:06:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:15,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199002934] [2022-12-13 02:06:15,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:15,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:15,590 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 02:06:15,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:15,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199002934] [2022-12-13 02:06:15,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199002934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:15,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:15,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274476949] [2022-12-13 02:06:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:15,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:15,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:15,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:15,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:15,641 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:15,641 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:15,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 514 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:15,641 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:15,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:15,642 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:15,642 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:15,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:15,643 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,643 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:15,643 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:15,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:15,643 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:15,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:15,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,646 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:15,646 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:15,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:15,646 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,646 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:15,762 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:15,763 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:15,763 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:15,764 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:15,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2375 [2022-12-13 02:06:15,764 INFO L420 AbstractCegarLoop]: === Iteration 2377 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 612061691, now seen corresponding path program 1 times [2022-12-13 02:06:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:15,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400995911] [2022-12-13 02:06:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:15,819 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 02:06:15,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400995911] [2022-12-13 02:06:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400995911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:15,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763690354] [2022-12-13 02:06:15,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:15,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:15,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:15,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:15,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:15,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:15,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:15,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:15,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:15,863 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:15,863 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:15,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:15,864 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:15,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:15,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:15,864 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:15,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:15,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:15,865 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:15,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:15,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:15,866 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:15,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:15,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:15,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,868 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:15,868 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:15,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:15,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:15,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:15,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:15,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:15,987 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:15,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:15,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:15,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:15,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2376 [2022-12-13 02:06:15,987 INFO L420 AbstractCegarLoop]: === Iteration 2378 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:15,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 669319993, now seen corresponding path program 1 times [2022-12-13 02:06:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:15,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739942277] [2022-12-13 02:06:15,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:16,053 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 02:06:16,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:16,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739942277] [2022-12-13 02:06:16,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739942277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:16,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:16,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:16,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406029839] [2022-12-13 02:06:16,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:16,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:16,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:16,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:16,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:16,054 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:16,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:16,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:16,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:16,098 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:16,098 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:16,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:16,099 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:16,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:16,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:16,099 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:16,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:16,100 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:16,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:16,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:16,100 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:16,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:16,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,103 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:16,103 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:16,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:16,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:16,224 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:16,225 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:16,225 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:16,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,225 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:16,225 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:16,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2377 [2022-12-13 02:06:16,226 INFO L420 AbstractCegarLoop]: === Iteration 2379 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 726578295, now seen corresponding path program 1 times [2022-12-13 02:06:16,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:16,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821331820] [2022-12-13 02:06:16,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:16,295 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 02:06:16,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:16,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821331820] [2022-12-13 02:06:16,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821331820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:16,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:16,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:16,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173745899] [2022-12-13 02:06:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:16,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:16,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:16,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:16,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:16,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:16,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:16,340 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:16,340 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:16,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:16,340 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:16,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:16,341 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:16,341 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:16,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:16,342 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,342 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:16,342 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:16,342 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:16,342 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:16,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:16,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,345 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:16,345 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:16,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:16,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:16,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:16,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:16,463 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:16,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:16,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:16,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2378 [2022-12-13 02:06:16,464 INFO L420 AbstractCegarLoop]: === Iteration 2380 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 783836597, now seen corresponding path program 1 times [2022-12-13 02:06:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:16,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24072834] [2022-12-13 02:06:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:16,529 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 02:06:16,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:16,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24072834] [2022-12-13 02:06:16,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24072834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:16,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:16,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143854951] [2022-12-13 02:06:16,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:16,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:16,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:16,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:16,530 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:16,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:16,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:16,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:16,582 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:16,583 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:16,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:16,583 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:16,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:16,584 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:16,584 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:16,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:16,584 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,584 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:16,585 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:16,585 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:16,585 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,585 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:16,585 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:16,585 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,588 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:16,588 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:16,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:16,588 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,588 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:16,706 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:16,708 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:16,708 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:16,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:16,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:16,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2379 [2022-12-13 02:06:16,708 INFO L420 AbstractCegarLoop]: === Iteration 2381 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:16,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash 841094899, now seen corresponding path program 1 times [2022-12-13 02:06:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:16,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801202897] [2022-12-13 02:06:16,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:16,782 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 02:06:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:16,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801202897] [2022-12-13 02:06:16,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801202897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:16,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:16,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232678450] [2022-12-13 02:06:16,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:16,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:16,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:16,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:16,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:16,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:16,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:16,847 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:16,847 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:16,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:16,847 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:16,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:16,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:16,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:16,848 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:16,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:16,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:16,849 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:16,849 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:16,849 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:16,849 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,849 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:16,849 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:16,849 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:16,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,852 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:16,852 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:16,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:16,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:16,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:16,984 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:16,986 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:06:16,986 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:16,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:16,986 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:16,986 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:16,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2380 [2022-12-13 02:06:16,986 INFO L420 AbstractCegarLoop]: === Iteration 2382 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:16,986 INFO L85 PathProgramCache]: Analyzing trace with hash 898353201, now seen corresponding path program 1 times [2022-12-13 02:06:16,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:16,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218206806] [2022-12-13 02:06:16,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:17,050 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 02:06:17,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:17,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218206806] [2022-12-13 02:06:17,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218206806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:17,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:17,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029736250] [2022-12-13 02:06:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:17,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:17,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:17,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:17,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:17,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:17,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:17,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:17,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:17,105 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:17,105 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:17,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:17,106 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:17,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:17,106 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:17,106 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:17,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:17,107 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,107 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:17,108 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:17,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:17,108 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:17,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:17,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,112 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:17,112 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:17,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:17,112 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,112 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:17,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:17,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:06:17,238 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:17,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:17,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:17,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2381 [2022-12-13 02:06:17,238 INFO L420 AbstractCegarLoop]: === Iteration 2383 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:17,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash 955611503, now seen corresponding path program 1 times [2022-12-13 02:06:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:17,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140136021] [2022-12-13 02:06:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:17,295 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 02:06:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:17,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140136021] [2022-12-13 02:06:17,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140136021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:17,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:17,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928845855] [2022-12-13 02:06:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:17,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:17,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:17,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:17,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:17,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:17,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:17,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:17,339 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:17,339 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:17,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:17,340 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:17,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:17,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:17,340 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:17,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:17,341 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:17,341 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:17,341 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:17,342 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:17,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:17,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,344 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:17,344 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:17,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:17,345 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,345 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:17,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:17,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:17,468 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:17,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:17,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:17,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2382 [2022-12-13 02:06:17,468 INFO L420 AbstractCegarLoop]: === Iteration 2384 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1012869805, now seen corresponding path program 1 times [2022-12-13 02:06:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:17,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269171616] [2022-12-13 02:06:17,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:17,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:17,536 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 02:06:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269171616] [2022-12-13 02:06:17,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269171616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:17,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:17,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:17,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793842714] [2022-12-13 02:06:17,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:17,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:17,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:17,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:17,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:17,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:17,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:17,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:17,591 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:17,592 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:17,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:17,592 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:17,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:17,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:17,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:17,593 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:17,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:17,594 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,594 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:17,594 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:17,594 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:17,594 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:17,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:17,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,597 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:17,597 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:17,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:17,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:17,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:17,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:17,736 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:17,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:17,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:17,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2383 [2022-12-13 02:06:17,736 INFO L420 AbstractCegarLoop]: === Iteration 2385 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:17,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1070128107, now seen corresponding path program 1 times [2022-12-13 02:06:17,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:17,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105415350] [2022-12-13 02:06:17,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:17,816 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 02:06:17,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:17,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105415350] [2022-12-13 02:06:17,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105415350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:17,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:17,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:17,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913590101] [2022-12-13 02:06:17,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:17,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:17,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:17,818 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:17,818 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:17,818 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:17,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:17,879 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:17,879 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:17,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:17,880 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:17,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:17,880 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:17,880 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:17,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:17,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:17,881 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,881 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:17,882 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:17,882 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:17,882 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,882 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:17,882 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:17,882 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:17,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,884 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:17,885 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:17,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:17,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:17,885 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:18,021 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:18,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:18,022 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:18,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:18,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:18,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2384 [2022-12-13 02:06:18,023 INFO L420 AbstractCegarLoop]: === Iteration 2386 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1127386409, now seen corresponding path program 1 times [2022-12-13 02:06:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:18,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488542652] [2022-12-13 02:06:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:18,086 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 02:06:18,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:18,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488542652] [2022-12-13 02:06:18,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488542652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:18,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:18,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:18,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60920186] [2022-12-13 02:06:18,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:18,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:18,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:18,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:18,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:18,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:18,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:18,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:18,141 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:18,142 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:18,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:18,142 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:18,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:18,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:18,143 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:18,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:18,144 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:18,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:18,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:18,144 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:18,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:18,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,147 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:18,147 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:18,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:18,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:18,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:18,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:18,285 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:18,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:18,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:18,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2385 [2022-12-13 02:06:18,285 INFO L420 AbstractCegarLoop]: === Iteration 2387 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:18,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1184644711, now seen corresponding path program 1 times [2022-12-13 02:06:18,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:18,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386784256] [2022-12-13 02:06:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:18,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:18,352 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 02:06:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:18,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386784256] [2022-12-13 02:06:18,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386784256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:18,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:18,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:18,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381478142] [2022-12-13 02:06:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:18,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:18,353 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:18,353 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:18,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:18,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:18,406 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:18,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:18,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:18,407 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:18,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:18,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:18,408 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:18,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:18,409 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,409 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:18,409 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:18,409 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:18,409 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,409 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:18,409 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:18,409 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,412 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:18,412 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:18,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:18,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:18,549 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:18,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:18,550 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:18,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:18,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2386 [2022-12-13 02:06:18,550 INFO L420 AbstractCegarLoop]: === Iteration 2388 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:18,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1241903013, now seen corresponding path program 1 times [2022-12-13 02:06:18,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:18,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610918389] [2022-12-13 02:06:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:18,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:18,624 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 02:06:18,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:18,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610918389] [2022-12-13 02:06:18,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610918389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:18,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:18,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583132006] [2022-12-13 02:06:18,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:18,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:18,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:18,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:18,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:18,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:18,687 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:18,687 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:18,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:18,687 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:18,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:18,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:18,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:18,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:18,688 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:18,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:18,689 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:18,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:18,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:18,690 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:18,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:18,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,694 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:18,694 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:18,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:18,695 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,695 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:18,830 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:18,832 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:18,832 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:18,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,832 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:18,832 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:18,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2387 [2022-12-13 02:06:18,832 INFO L420 AbstractCegarLoop]: === Iteration 2389 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1299161315, now seen corresponding path program 1 times [2022-12-13 02:06:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103994637] [2022-12-13 02:06:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:18,896 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 02:06:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:18,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103994637] [2022-12-13 02:06:18,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103994637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:18,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:18,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600277312] [2022-12-13 02:06:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:18,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:18,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:18,897 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:18,897 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:18,897 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:18,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:18,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:18,944 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:18,944 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:18,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:18,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:18,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:18,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:18,945 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:18,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:18,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:18,946 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:18,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:18,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:18,946 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:18,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:18,946 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:18,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,949 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:18,949 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:18,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:18,949 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:18,949 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:19,072 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:19,073 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:19,073 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:19,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,073 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:19,073 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:19,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2388 [2022-12-13 02:06:19,074 INFO L420 AbstractCegarLoop]: === Iteration 2390 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:19,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1356419617, now seen corresponding path program 1 times [2022-12-13 02:06:19,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:19,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245352968] [2022-12-13 02:06:19,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:19,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:19,138 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 02:06:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:19,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245352968] [2022-12-13 02:06:19,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245352968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:19,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:19,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:19,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816882281] [2022-12-13 02:06:19,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:19,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:19,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:19,139 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:19,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:19,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:19,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:19,190 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:19,191 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:19,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:19,191 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:19,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:19,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:19,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:19,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:19,192 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:19,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:19,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:19,193 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:19,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:19,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,196 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:19,196 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:19,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:19,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:19,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:19,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:19,321 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:19,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:19,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2389 [2022-12-13 02:06:19,321 INFO L420 AbstractCegarLoop]: === Iteration 2391 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:19,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:19,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1413677919, now seen corresponding path program 1 times [2022-12-13 02:06:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:19,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923042277] [2022-12-13 02:06:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:19,396 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 02:06:19,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:19,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923042277] [2022-12-13 02:06:19,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923042277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:19,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:19,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226807402] [2022-12-13 02:06:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:19,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:19,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:19,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:19,397 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:19,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:19,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:19,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:19,447 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:19,447 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:19,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:19,447 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:19,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:19,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:19,448 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:19,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:19,449 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:19,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:19,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:19,449 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:19,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:19,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:19,452 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:19,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:19,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,452 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:19,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:19,571 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:19,571 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:19,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,571 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:19,571 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2390 [2022-12-13 02:06:19,571 INFO L420 AbstractCegarLoop]: === Iteration 2392 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1470936221, now seen corresponding path program 1 times [2022-12-13 02:06:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:19,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708491900] [2022-12-13 02:06:19,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:19,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:19,630 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 02:06:19,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:19,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708491900] [2022-12-13 02:06:19,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708491900] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:19,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:19,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628919720] [2022-12-13 02:06:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:19,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:19,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:19,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:19,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:19,631 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:19,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:19,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:19,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:19,674 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:19,674 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:19,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:19,675 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:19,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:19,675 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:19,675 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:19,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:19,676 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,676 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:19,676 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:19,676 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:19,676 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,676 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:19,677 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:19,677 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,679 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:19,679 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:19,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:19,680 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,680 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:19,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:19,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:19,801 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:19,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:19,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:19,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2391 [2022-12-13 02:06:19,801 INFO L420 AbstractCegarLoop]: === Iteration 2393 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1528194523, now seen corresponding path program 1 times [2022-12-13 02:06:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:19,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283821642] [2022-12-13 02:06:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:19,860 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 02:06:19,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:19,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283821642] [2022-12-13 02:06:19,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283821642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:19,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:19,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:19,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041928312] [2022-12-13 02:06:19,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:19,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:19,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:19,861 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:19,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:19,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:19,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:19,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:19,904 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:19,905 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:19,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:19,905 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:19,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:19,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:19,906 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:19,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:19,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:19,907 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:19,907 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:19,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:19,907 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:19,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:19,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,910 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:19,910 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:19,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:19,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:19,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:20,028 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:20,029 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:20,030 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:20,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,030 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:20,030 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:20,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2392 [2022-12-13 02:06:20,030 INFO L420 AbstractCegarLoop]: === Iteration 2394 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:20,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1585452825, now seen corresponding path program 1 times [2022-12-13 02:06:20,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:20,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250470218] [2022-12-13 02:06:20,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:20,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:20,088 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 02:06:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250470218] [2022-12-13 02:06:20,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250470218] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:20,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:20,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:20,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521792320] [2022-12-13 02:06:20,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:20,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:20,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:20,089 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:20,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:20,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:20,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:20,133 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:20,133 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:20,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:20,134 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:20,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:20,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:20,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:20,134 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:20,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:20,135 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,135 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:20,135 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:20,135 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:20,135 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,136 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:20,136 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:20,136 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,138 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:20,138 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:20,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:20,139 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,139 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:20,259 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:20,260 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:20,260 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:20,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,260 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:20,260 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:20,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2393 [2022-12-13 02:06:20,260 INFO L420 AbstractCegarLoop]: === Iteration 2395 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1642711127, now seen corresponding path program 1 times [2022-12-13 02:06:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:20,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638967353] [2022-12-13 02:06:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:20,321 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 02:06:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:20,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638967353] [2022-12-13 02:06:20,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638967353] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:20,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:20,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:20,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688495942] [2022-12-13 02:06:20,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:20,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:20,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:20,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:20,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:20,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:20,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:20,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:20,374 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:20,375 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:20,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:20,375 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:20,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:20,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:20,376 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:20,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:20,377 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,377 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:20,377 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:20,377 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:20,377 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,377 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:20,377 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:20,377 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,380 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:20,380 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:20,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:20,380 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,380 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:20,499 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:20,500 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:20,500 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:20,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,500 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:20,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:20,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2394 [2022-12-13 02:06:20,501 INFO L420 AbstractCegarLoop]: === Iteration 2396 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1699969429, now seen corresponding path program 1 times [2022-12-13 02:06:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:20,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855829887] [2022-12-13 02:06:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:20,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:20,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:20,559 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 02:06:20,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:20,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855829887] [2022-12-13 02:06:20,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855829887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:20,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:20,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:20,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108208803] [2022-12-13 02:06:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:20,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:20,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:20,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:20,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:20,560 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:20,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:20,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:20,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:20,610 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:20,610 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:20,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:20,611 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:20,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:20,611 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:20,611 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:20,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:20,612 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:20,612 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:20,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:20,612 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,612 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:20,612 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:20,612 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,615 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:20,615 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:20,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:20,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:20,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:20,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:20,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:20,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:20,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2395 [2022-12-13 02:06:20,735 INFO L420 AbstractCegarLoop]: === Iteration 2397 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:20,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:20,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1757227731, now seen corresponding path program 1 times [2022-12-13 02:06:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:20,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248883153] [2022-12-13 02:06:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:20,821 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 02:06:20,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:20,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248883153] [2022-12-13 02:06:20,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248883153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:20,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:20,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:20,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996356496] [2022-12-13 02:06:20,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:20,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:20,823 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:20,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:20,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:20,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:20,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:20,889 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:20,889 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:20,889 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:20,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:20,890 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:20,890 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:20,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:20,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:20,891 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,891 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:20,891 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:20,891 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:20,891 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,891 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:20,891 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:20,892 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:20,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,894 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:20,894 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:20,895 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:20,895 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:21,060 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:21,061 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 02:06:21,061 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:21,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:21,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2396 [2022-12-13 02:06:21,061 INFO L420 AbstractCegarLoop]: === Iteration 2398 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:21,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:21,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1814486033, now seen corresponding path program 1 times [2022-12-13 02:06:21,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:21,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090223693] [2022-12-13 02:06:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:21,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:21,131 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 02:06:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:21,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090223693] [2022-12-13 02:06:21,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090223693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:21,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:21,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960700854] [2022-12-13 02:06:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:21,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:21,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:21,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:21,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:21,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:21,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:21,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:21,184 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:21,184 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:21,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:21,185 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:21,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:21,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:21,186 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:21,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:21,186 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:21,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:21,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:21,187 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,187 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:21,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:21,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,190 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:21,190 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:21,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:21,190 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:21,319 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:21,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:06:21,320 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:21,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,320 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:21,320 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:21,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2397 [2022-12-13 02:06:21,321 INFO L420 AbstractCegarLoop]: === Iteration 2399 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:21,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1871744335, now seen corresponding path program 1 times [2022-12-13 02:06:21,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:21,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976332991] [2022-12-13 02:06:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:21,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:21,378 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 02:06:21,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:21,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976332991] [2022-12-13 02:06:21,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976332991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:21,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:21,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146423344] [2022-12-13 02:06:21,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:21,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:21,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:21,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:21,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:21,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:21,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:21,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:21,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:21,425 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:21,425 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:21,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:21,426 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:21,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:21,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:21,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:21,426 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:21,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:21,427 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,427 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:21,427 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:21,427 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:21,428 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,428 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:21,428 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:21,428 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,430 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:21,430 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:21,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:21,431 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:21,548 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:21,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:21,549 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:21,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:21,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:21,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2398 [2022-12-13 02:06:21,550 INFO L420 AbstractCegarLoop]: === Iteration 2400 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:21,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1929002637, now seen corresponding path program 1 times [2022-12-13 02:06:21,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:21,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18750928] [2022-12-13 02:06:21,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:21,608 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 02:06:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:21,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18750928] [2022-12-13 02:06:21,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18750928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:21,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:21,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881471643] [2022-12-13 02:06:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:21,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:21,609 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:21,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:21,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:21,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:21,658 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:21,658 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:21,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:21,659 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:21,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:21,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:21,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:21,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:21,660 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,660 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:21,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:21,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:21,660 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:21,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:21,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,663 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:21,663 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:21,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:21,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:21,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:21,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:21,782 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:21,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:21,783 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:21,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2399 [2022-12-13 02:06:21,783 INFO L420 AbstractCegarLoop]: === Iteration 2401 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:21,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1986260939, now seen corresponding path program 1 times [2022-12-13 02:06:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:21,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725142435] [2022-12-13 02:06:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:21,841 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 02:06:21,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:21,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725142435] [2022-12-13 02:06:21,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725142435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:21,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:21,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:21,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517729974] [2022-12-13 02:06:21,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:21,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:21,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:21,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:21,842 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:21,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:21,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:21,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:21,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:21,885 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:21,885 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:21,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:21,886 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:21,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:21,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:21,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:21,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:21,886 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:21,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:21,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:21,887 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:21,887 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:21,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:21,887 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,887 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:21,887 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:21,888 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:21,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,890 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:21,890 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:21,890 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:21,890 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:22,011 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:22,012 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:22,012 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:22,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,012 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:22,012 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:22,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2400 [2022-12-13 02:06:22,012 INFO L420 AbstractCegarLoop]: === Iteration 2402 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:22,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:22,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2043519241, now seen corresponding path program 1 times [2022-12-13 02:06:22,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:22,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165167547] [2022-12-13 02:06:22,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:22,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:22,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:22,070 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 02:06:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:22,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165167547] [2022-12-13 02:06:22,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165167547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:22,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:22,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:22,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109973909] [2022-12-13 02:06:22,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:22,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:22,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:22,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:22,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:22,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:22,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:22,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:22,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:22,114 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:22,114 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:22,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:22,115 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:22,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:22,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:22,115 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:22,115 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:22,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:22,116 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,116 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:22,116 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:22,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:22,117 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:22,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:22,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,119 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:22,119 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:22,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:22,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:22,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:22,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:22,237 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:22,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:22,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:22,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2401 [2022-12-13 02:06:22,237 INFO L420 AbstractCegarLoop]: === Iteration 2403 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:22,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2100777543, now seen corresponding path program 1 times [2022-12-13 02:06:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:22,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815986793] [2022-12-13 02:06:22,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:22,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:22,320 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 02:06:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:22,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815986793] [2022-12-13 02:06:22,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815986793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:22,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:22,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262907074] [2022-12-13 02:06:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:22,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:22,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:22,321 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:22,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:22,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:22,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:22,364 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:22,364 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:22,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:22,364 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:22,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:22,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:22,365 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:22,365 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:22,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:22,366 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:22,366 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:22,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:22,366 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,366 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:22,366 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:22,366 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,369 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:22,369 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:22,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:22,369 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:22,486 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:22,487 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:22,487 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:22,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,487 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:22,487 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:22,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2402 [2022-12-13 02:06:22,487 INFO L420 AbstractCegarLoop]: === Iteration 2404 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:22,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2136931451, now seen corresponding path program 1 times [2022-12-13 02:06:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:22,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601156970] [2022-12-13 02:06:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:22,546 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 02:06:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:22,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601156970] [2022-12-13 02:06:22,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601156970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:22,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:22,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:22,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716324675] [2022-12-13 02:06:22,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:22,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:22,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:22,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:22,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:22,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:22,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:22,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:22,597 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:22,597 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:22,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:22,598 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:22,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:22,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:22,598 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:22,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:22,599 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:22,600 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:22,600 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:22,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:22,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:22,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:22,603 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:22,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:22,603 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,603 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:22,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:22,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:22,723 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:22,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:22,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:22,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2403 [2022-12-13 02:06:22,723 INFO L420 AbstractCegarLoop]: === Iteration 2405 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2079673149, now seen corresponding path program 1 times [2022-12-13 02:06:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:22,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925338624] [2022-12-13 02:06:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:22,781 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 02:06:22,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:22,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925338624] [2022-12-13 02:06:22,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925338624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:22,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:22,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:22,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484521767] [2022-12-13 02:06:22,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:22,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:22,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:22,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:22,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:22,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:22,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:22,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:22,834 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:22,834 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:22,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:22,834 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:22,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:22,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:22,835 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:22,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:22,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:22,836 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:22,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:22,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:22,836 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:22,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:22,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:22,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,839 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:22,839 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:22,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:22,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:22,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:22,958 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:22,959 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:22,959 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:22,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:22,959 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:22,959 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:22,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2404 [2022-12-13 02:06:22,959 INFO L420 AbstractCegarLoop]: === Iteration 2406 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:22,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2022414847, now seen corresponding path program 1 times [2022-12-13 02:06:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:22,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244902040] [2022-12-13 02:06:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:22,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:23,018 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 02:06:23,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:23,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244902040] [2022-12-13 02:06:23,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244902040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:23,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:23,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:23,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757498712] [2022-12-13 02:06:23,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:23,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:23,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:23,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:23,019 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:23,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:23,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:23,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:23,069 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:23,070 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:23,070 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:23,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:23,071 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:23,071 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:23,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:23,071 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,071 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:23,072 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:23,072 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:23,072 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:23,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:23,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,075 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:23,075 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:23,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:23,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,075 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:23,195 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:23,197 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:23,197 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:23,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,197 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:23,197 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:23,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2405 [2022-12-13 02:06:23,198 INFO L420 AbstractCegarLoop]: === Iteration 2407 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1965156545, now seen corresponding path program 1 times [2022-12-13 02:06:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:23,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732129264] [2022-12-13 02:06:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:23,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:23,275 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 02:06:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732129264] [2022-12-13 02:06:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732129264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:23,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:23,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209144675] [2022-12-13 02:06:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:23,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:23,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:23,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:23,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:23,322 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:23,322 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:23,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:23,323 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:23,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:23,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:23,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:23,324 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:23,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:23,324 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,324 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:23,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:23,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:23,325 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,325 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:23,325 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:23,325 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,328 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:23,328 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:23,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:23,328 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,328 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:23,448 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:23,449 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:23,449 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:23,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:23,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:23,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2406 [2022-12-13 02:06:23,449 INFO L420 AbstractCegarLoop]: === Iteration 2408 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1907898243, now seen corresponding path program 1 times [2022-12-13 02:06:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:23,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333627679] [2022-12-13 02:06:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:23,510 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 02:06:23,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:23,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333627679] [2022-12-13 02:06:23,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333627679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:23,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:23,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321798865] [2022-12-13 02:06:23,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:23,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:23,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:23,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:23,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:23,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:23,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:23,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:23,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:23,558 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:23,559 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:23,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:23,559 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:23,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:23,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:23,560 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:23,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:23,560 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,560 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:23,561 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:23,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:23,561 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:23,561 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:23,561 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,564 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:23,564 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:23,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:23,564 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,564 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:23,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:23,681 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:23,681 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:23,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:23,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:23,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2407 [2022-12-13 02:06:23,682 INFO L420 AbstractCegarLoop]: === Iteration 2409 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1850639941, now seen corresponding path program 1 times [2022-12-13 02:06:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:23,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553360383] [2022-12-13 02:06:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:23,757 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 02:06:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:23,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553360383] [2022-12-13 02:06:23,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553360383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:23,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:23,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810557554] [2022-12-13 02:06:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:23,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:23,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:23,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:23,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:23,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:23,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:23,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:23,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:23,808 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:23,809 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:23,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:23,809 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:23,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:23,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:23,810 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:23,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:23,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:23,811 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:23,811 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:23,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:23,811 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:23,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:23,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:23,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,814 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:23,814 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:23,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:23,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:23,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:23,931 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:23,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:23,932 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:23,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:23,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:23,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2408 [2022-12-13 02:06:23,933 INFO L420 AbstractCegarLoop]: === Iteration 2410 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1793381639, now seen corresponding path program 1 times [2022-12-13 02:06:23,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:23,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549544356] [2022-12-13 02:06:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:23,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:23,989 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 02:06:23,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549544356] [2022-12-13 02:06:23,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549544356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:23,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:23,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:23,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315641803] [2022-12-13 02:06:23,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:23,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:23,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:23,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:23,990 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:23,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:23,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:23,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:23,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:24,041 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:24,041 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:24,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:24,042 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:24,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:24,042 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:24,042 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:24,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:24,043 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,043 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:24,043 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:24,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:24,044 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:24,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:24,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,046 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:24,047 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:24,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:24,180 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:24,181 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:06:24,181 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:24,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:24,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:24,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2409 [2022-12-13 02:06:24,182 INFO L420 AbstractCegarLoop]: === Iteration 2411 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1736123337, now seen corresponding path program 1 times [2022-12-13 02:06:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:24,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409318863] [2022-12-13 02:06:24,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:24,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:24,247 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 02:06:24,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:24,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409318863] [2022-12-13 02:06:24,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409318863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:24,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:24,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:24,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034216911] [2022-12-13 02:06:24,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:24,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:24,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:24,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:24,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:24,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:24,301 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:24,301 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:24,302 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:24,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:24,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:24,303 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:24,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:24,303 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:24,304 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:24,304 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:24,304 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:24,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:24,304 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,307 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:24,307 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:24,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:24,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:24,440 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:24,441 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:06:24,441 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:24,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:24,441 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:24,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2410 [2022-12-13 02:06:24,442 INFO L420 AbstractCegarLoop]: === Iteration 2412 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:24,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1678865035, now seen corresponding path program 1 times [2022-12-13 02:06:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:24,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784914096] [2022-12-13 02:06:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:24,508 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 02:06:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:24,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784914096] [2022-12-13 02:06:24,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784914096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:24,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:24,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196774924] [2022-12-13 02:06:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:24,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:24,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:24,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:24,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:24,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:24,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:24,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:24,562 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:24,563 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:24,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:24,563 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:24,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:24,564 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:24,564 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:24,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:24,565 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:24,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:24,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:24,565 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:24,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:24,566 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,568 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:24,568 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:24,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:24,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:24,704 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:24,706 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:24,706 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:24,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:24,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:24,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2411 [2022-12-13 02:06:24,706 INFO L420 AbstractCegarLoop]: === Iteration 2413 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:24,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1621606733, now seen corresponding path program 1 times [2022-12-13 02:06:24,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:24,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056916229] [2022-12-13 02:06:24,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:24,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 02:06:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:24,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056916229] [2022-12-13 02:06:24,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056916229] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:24,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:24,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586934656] [2022-12-13 02:06:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:24,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:24,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:24,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:24,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:24,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:24,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:24,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:24,849 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:24,849 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:24,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:24,850 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:24,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:24,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:24,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:24,851 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:24,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:24,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:24,852 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,852 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:24,852 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:24,852 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:24,852 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,852 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:24,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:24,852 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:24,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,855 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:24,855 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:24,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:24,855 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:24,855 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:24,991 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:24,993 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:24,993 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:24,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:24,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:24,993 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:24,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2412 [2022-12-13 02:06:24,993 INFO L420 AbstractCegarLoop]: === Iteration 2414 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1564348431, now seen corresponding path program 1 times [2022-12-13 02:06:24,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:24,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079331554] [2022-12-13 02:06:24,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:24,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:25,073 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 02:06:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:25,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079331554] [2022-12-13 02:06:25,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079331554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:25,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:25,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237518159] [2022-12-13 02:06:25,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:25,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:25,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:25,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:25,074 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,074 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:25,074 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:25,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:25,128 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:25,128 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:25,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:25,129 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:25,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:25,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:25,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:25,130 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:25,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:25,130 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:25,131 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:25,131 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:25,131 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:25,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:25,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,134 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:25,134 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:25,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:25,134 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,134 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:25,270 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:25,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:25,272 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:25,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:25,272 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:25,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2413 [2022-12-13 02:06:25,272 INFO L420 AbstractCegarLoop]: === Iteration 2415 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:25,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:25,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1507090129, now seen corresponding path program 1 times [2022-12-13 02:06:25,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:25,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709276546] [2022-12-13 02:06:25,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:25,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:25,358 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 02:06:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:25,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709276546] [2022-12-13 02:06:25,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709276546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:25,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:25,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006594961] [2022-12-13 02:06:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:25,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:25,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:25,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:25,360 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:25,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:25,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:25,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:25,412 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:25,412 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:25,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:25,413 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:25,413 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:25,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:25,413 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:25,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:25,414 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,414 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:25,414 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:25,414 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:25,414 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,414 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:25,414 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:25,414 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,418 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:25,418 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:25,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:25,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:25,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:25,555 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:25,555 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:25,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:25,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:25,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2414 [2022-12-13 02:06:25,556 INFO L420 AbstractCegarLoop]: === Iteration 2416 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:25,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1449831827, now seen corresponding path program 1 times [2022-12-13 02:06:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:25,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312841897] [2022-12-13 02:06:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:25,623 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 02:06:25,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:25,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312841897] [2022-12-13 02:06:25,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312841897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:25,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:25,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:25,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49651295] [2022-12-13 02:06:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:25,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:25,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:25,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:25,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:25,624 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:25,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:25,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:25,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:25,685 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:25,686 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:25,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:25,686 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:25,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:25,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:25,687 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:25,687 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:25,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:25,688 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:25,688 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:25,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:25,688 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,689 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:25,689 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:25,689 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,692 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:25,692 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:25,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:25,692 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:25,825 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:25,826 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:25,826 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:25,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:25,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:25,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2415 [2022-12-13 02:06:25,826 INFO L420 AbstractCegarLoop]: === Iteration 2417 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:25,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1392573525, now seen corresponding path program 1 times [2022-12-13 02:06:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:25,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815414038] [2022-12-13 02:06:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:25,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 02:06:25,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:25,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815414038] [2022-12-13 02:06:25,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815414038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:25,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:25,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136086242] [2022-12-13 02:06:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:25,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:25,892 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:25,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:25,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:25,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:25,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:25,940 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:25,941 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:25,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:25,941 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:25,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:25,942 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:25,942 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:25,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:25,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:25,942 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:25,943 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:25,943 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:25,943 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,943 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:25,943 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:25,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:25,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,945 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:25,946 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:25,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 184 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:25,946 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:25,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:26,065 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:26,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:26,066 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:26,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:26,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:26,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2416 [2022-12-13 02:06:26,067 INFO L420 AbstractCegarLoop]: === Iteration 2418 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:26,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1335315223, now seen corresponding path program 1 times [2022-12-13 02:06:26,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:26,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959457013] [2022-12-13 02:06:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:26,126 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 02:06:26,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959457013] [2022-12-13 02:06:26,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959457013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:26,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:26,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107232821] [2022-12-13 02:06:26,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:26,127 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:26,127 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,127 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:26,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:26,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:26,178 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:26,178 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:26,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:26,179 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:26,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:26,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:26,179 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:26,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:26,180 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:26,180 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:26,181 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:26,181 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:26,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:26,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,184 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:26,184 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:26,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:26,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:26,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:26,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:26,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:26,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:26,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:26,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2417 [2022-12-13 02:06:26,305 INFO L420 AbstractCegarLoop]: === Iteration 2419 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1278056921, now seen corresponding path program 1 times [2022-12-13 02:06:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:26,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133634715] [2022-12-13 02:06:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:26,362 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 02:06:26,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:26,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133634715] [2022-12-13 02:06:26,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133634715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:26,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:26,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:26,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154985623] [2022-12-13 02:06:26,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:26,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:26,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:26,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:26,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:26,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:26,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:26,406 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:26,406 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:26,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:26,406 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:26,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:26,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:26,407 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:26,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:26,408 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,408 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:26,408 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:26,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:26,408 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,408 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:26,408 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:26,408 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,411 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:26,411 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:26,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:26,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:26,527 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:26,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:26,528 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:26,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:26,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:26,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2418 [2022-12-13 02:06:26,529 INFO L420 AbstractCegarLoop]: === Iteration 2420 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1220798619, now seen corresponding path program 1 times [2022-12-13 02:06:26,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:26,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140001505] [2022-12-13 02:06:26,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:26,585 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 02:06:26,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:26,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140001505] [2022-12-13 02:06:26,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140001505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:26,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:26,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600335655] [2022-12-13 02:06:26,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:26,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:26,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:26,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:26,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:26,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:26,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:26,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:26,629 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:26,629 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:26,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:26,629 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:26,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:26,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:26,630 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:26,630 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:26,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:26,630 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,631 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:26,631 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:26,631 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:26,631 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:26,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:26,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,634 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:26,634 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:26,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:26,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:26,751 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:26,752 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:26,752 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:26,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,752 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:26,752 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:26,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2419 [2022-12-13 02:06:26,752 INFO L420 AbstractCegarLoop]: === Iteration 2421 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:26,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1163540317, now seen corresponding path program 1 times [2022-12-13 02:06:26,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:26,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963475672] [2022-12-13 02:06:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:26,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:26,809 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 02:06:26,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:26,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963475672] [2022-12-13 02:06:26,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963475672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:26,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:26,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586527775] [2022-12-13 02:06:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:26,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:26,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:26,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:26,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:26,810 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:26,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:26,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:26,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:26,864 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:26,864 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:26,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:26,864 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:26,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:26,865 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:26,865 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:26,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:26,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:26,866 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,866 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:26,866 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:26,866 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:26,866 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,866 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:26,866 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:26,866 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:26,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,869 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:26,869 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:26,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:26,869 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:26,869 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:26,987 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:26,988 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:26,988 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:26,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:26,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:26,989 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:26,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2420 [2022-12-13 02:06:26,989 INFO L420 AbstractCegarLoop]: === Iteration 2422 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:26,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1106282015, now seen corresponding path program 1 times [2022-12-13 02:06:26,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:26,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601802052] [2022-12-13 02:06:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:26,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:27,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 02:06:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:27,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601802052] [2022-12-13 02:06:27,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601802052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:27,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:27,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131546725] [2022-12-13 02:06:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:27,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:27,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:27,048 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:27,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:27,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:27,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:27,098 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:27,098 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:27,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:27,098 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:27,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:27,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:27,099 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:27,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:27,100 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:27,100 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:27,100 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:27,100 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,100 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:27,100 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:27,100 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,103 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:27,103 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:27,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:27,103 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:27,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:27,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:27,222 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:27,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:27,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:27,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2421 [2022-12-13 02:06:27,222 INFO L420 AbstractCegarLoop]: === Iteration 2423 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:27,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1049023713, now seen corresponding path program 1 times [2022-12-13 02:06:27,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:27,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611809236] [2022-12-13 02:06:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:27,282 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 02:06:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:27,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611809236] [2022-12-13 02:06:27,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611809236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:27,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:27,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155886733] [2022-12-13 02:06:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:27,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:27,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:27,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:27,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:27,327 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:27,328 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:27,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:27,328 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:27,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:27,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:27,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:27,329 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:27,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:27,329 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:27,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:27,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:27,330 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:27,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:27,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,332 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:27,333 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:27,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:27,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:27,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:27,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:27,452 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,452 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:27,452 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:27,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2422 [2022-12-13 02:06:27,452 INFO L420 AbstractCegarLoop]: === Iteration 2424 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:27,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:27,452 INFO L85 PathProgramCache]: Analyzing trace with hash -991765411, now seen corresponding path program 1 times [2022-12-13 02:06:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:27,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258025015] [2022-12-13 02:06:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:27,508 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 02:06:27,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:27,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258025015] [2022-12-13 02:06:27,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258025015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:27,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:27,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471793573] [2022-12-13 02:06:27,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:27,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:27,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:27,509 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:27,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:27,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:27,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:27,551 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:27,552 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:27,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:27,552 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:27,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:27,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:27,553 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:27,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:27,553 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,553 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:27,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:27,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:27,554 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:27,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:27,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,556 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:27,557 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:27,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:27,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:27,676 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:27,678 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:27,678 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:27,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:27,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2423 [2022-12-13 02:06:27,678 INFO L420 AbstractCegarLoop]: === Iteration 2425 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash -934507109, now seen corresponding path program 1 times [2022-12-13 02:06:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:27,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217261962] [2022-12-13 02:06:27,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:27,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:27,742 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 02:06:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:27,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217261962] [2022-12-13 02:06:27,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217261962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:27,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:27,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897456715] [2022-12-13 02:06:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:27,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:27,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:27,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:27,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:27,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:27,743 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,743 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:27,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:27,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:27,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:27,788 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:27,788 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:27,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:27,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:27,789 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:27,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:27,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:27,790 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:27,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:27,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:27,790 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:27,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:27,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:27,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,793 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:27,793 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:27,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:27,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:27,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:27,913 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:27,914 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:27,914 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:27,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,914 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:27,914 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:27,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2424 [2022-12-13 02:06:27,914 INFO L420 AbstractCegarLoop]: === Iteration 2426 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -877248807, now seen corresponding path program 1 times [2022-12-13 02:06:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:27,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949157304] [2022-12-13 02:06:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:27,984 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 02:06:27,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:27,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949157304] [2022-12-13 02:06:27,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949157304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:27,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:27,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727694344] [2022-12-13 02:06:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:27,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:27,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:27,985 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:27,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:27,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:27,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:27,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:28,038 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:28,038 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:28,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:28,039 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:28,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:28,039 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:28,039 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:28,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:28,040 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,040 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:28,040 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:28,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:28,040 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:28,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:28,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,043 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:28,043 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:28,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:28,044 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,044 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:28,168 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:28,169 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:06:28,169 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:28,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,169 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:28,169 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:28,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2425 [2022-12-13 02:06:28,170 INFO L420 AbstractCegarLoop]: === Iteration 2427 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:28,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -819990505, now seen corresponding path program 1 times [2022-12-13 02:06:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756869689] [2022-12-13 02:06:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:28,229 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 02:06:28,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:28,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756869689] [2022-12-13 02:06:28,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756869689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:28,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:28,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141254480] [2022-12-13 02:06:28,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:28,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:28,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:28,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:28,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:28,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:28,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:28,290 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:28,291 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:28,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:28,291 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:28,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:28,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:28,292 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:28,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:28,292 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:28,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:28,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:28,293 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:28,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:28,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,296 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:28,296 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:28,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:28,296 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,296 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:28,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:28,413 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:28,413 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:28,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,413 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:28,413 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:28,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2426 [2022-12-13 02:06:28,414 INFO L420 AbstractCegarLoop]: === Iteration 2428 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:28,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:28,414 INFO L85 PathProgramCache]: Analyzing trace with hash -762732203, now seen corresponding path program 1 times [2022-12-13 02:06:28,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:28,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604351930] [2022-12-13 02:06:28,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:28,471 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 02:06:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:28,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604351930] [2022-12-13 02:06:28,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604351930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:28,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:28,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024581958] [2022-12-13 02:06:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:28,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:28,472 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:28,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:28,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:28,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:28,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:28,528 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:28,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:28,529 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:28,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:28,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:28,530 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:28,530 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:28,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:28,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:28,531 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:28,531 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:28,531 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,531 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:28,531 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:28,531 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,534 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:28,534 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:28,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:28,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:28,670 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:28,671 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:28,671 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:28,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:28,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:28,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2427 [2022-12-13 02:06:28,671 INFO L420 AbstractCegarLoop]: === Iteration 2429 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:28,672 INFO L85 PathProgramCache]: Analyzing trace with hash -705473901, now seen corresponding path program 1 times [2022-12-13 02:06:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:28,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399133161] [2022-12-13 02:06:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:28,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399133161] [2022-12-13 02:06:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399133161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:28,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:28,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058071187] [2022-12-13 02:06:28,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:28,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:28,752 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:28,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:28,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:28,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:28,814 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:28,814 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:28,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:28,815 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:28,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:28,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:28,815 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:28,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:28,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:28,816 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:28,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:28,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:28,817 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:28,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:28,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:28,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,821 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:28,821 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:28,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:28,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:28,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:28,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:28,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:28,957 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:28,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:28,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:28,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2428 [2022-12-13 02:06:28,958 INFO L420 AbstractCegarLoop]: === Iteration 2430 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -648215599, now seen corresponding path program 1 times [2022-12-13 02:06:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:28,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076617544] [2022-12-13 02:06:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:29,032 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 02:06:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:29,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076617544] [2022-12-13 02:06:29,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076617544] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:29,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:29,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252894969] [2022-12-13 02:06:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:29,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:29,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:29,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:29,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:29,098 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:29,098 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:29,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:29,099 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:29,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:29,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:29,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:29,100 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:29,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:29,100 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:29,101 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:29,101 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:29,101 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,101 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:29,101 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:29,101 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,104 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:29,104 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:29,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:29,104 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,104 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:29,242 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:29,243 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:29,243 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:29,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:29,244 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:29,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2429 [2022-12-13 02:06:29,244 INFO L420 AbstractCegarLoop]: === Iteration 2431 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:29,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:29,244 INFO L85 PathProgramCache]: Analyzing trace with hash -590957297, now seen corresponding path program 1 times [2022-12-13 02:06:29,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:29,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043769044] [2022-12-13 02:06:29,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:29,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:29,312 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 02:06:29,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:29,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043769044] [2022-12-13 02:06:29,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043769044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:29,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:29,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:29,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967578445] [2022-12-13 02:06:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:29,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:29,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:29,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:29,313 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:29,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:29,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:29,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:29,368 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:29,368 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:29,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:29,369 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:29,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:29,369 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:29,369 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:29,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:29,370 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,370 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:29,370 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:29,370 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:29,371 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,371 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:29,371 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:29,371 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,373 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:29,374 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:29,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:29,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:29,509 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:29,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:29,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:29,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:29,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:29,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2430 [2022-12-13 02:06:29,511 INFO L420 AbstractCegarLoop]: === Iteration 2432 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash -533698995, now seen corresponding path program 1 times [2022-12-13 02:06:29,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:29,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233771980] [2022-12-13 02:06:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:29,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:29,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 02:06:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:29,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233771980] [2022-12-13 02:06:29,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233771980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:29,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391885840] [2022-12-13 02:06:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:29,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:29,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:29,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:29,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:29,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:29,642 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:29,642 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:29,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:29,643 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:29,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:29,644 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:29,644 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:29,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:29,645 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,645 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:29,645 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:29,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:29,645 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:29,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:29,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,648 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:29,648 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:29,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:29,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:29,785 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:29,787 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:29,788 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:29,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:29,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:29,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2431 [2022-12-13 02:06:29,788 INFO L420 AbstractCegarLoop]: === Iteration 2433 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -476440693, now seen corresponding path program 1 times [2022-12-13 02:06:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93176259] [2022-12-13 02:06:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:29,864 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 02:06:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:29,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93176259] [2022-12-13 02:06:29,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93176259] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:29,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:29,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479111482] [2022-12-13 02:06:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:29,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:29,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:29,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:29,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:29,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:29,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:29,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:29,937 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:29,937 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:29,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:29,938 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:29,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:29,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:29,938 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:29,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:29,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:29,939 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,939 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:29,940 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:29,940 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:29,940 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,940 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:29,940 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:29,940 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:29,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,943 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:29,944 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:29,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:29,944 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:29,944 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:30,077 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:30,079 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:30,079 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:30,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,080 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:30,080 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:30,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2432 [2022-12-13 02:06:30,080 INFO L420 AbstractCegarLoop]: === Iteration 2434 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:30,080 INFO L85 PathProgramCache]: Analyzing trace with hash -419182391, now seen corresponding path program 1 times [2022-12-13 02:06:30,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:30,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737441987] [2022-12-13 02:06:30,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:30,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737441987] [2022-12-13 02:06:30,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737441987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:30,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:30,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775019273] [2022-12-13 02:06:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:30,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:30,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:30,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:30,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:30,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:30,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:30,222 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:30,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:30,223 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:30,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:30,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:30,223 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:30,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:30,224 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:30,225 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:30,225 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:30,225 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,225 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:30,225 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:30,225 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,228 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:30,228 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:30,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:30,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:30,347 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:30,348 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:30,348 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:30,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,348 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:30,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:30,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2433 [2022-12-13 02:06:30,348 INFO L420 AbstractCegarLoop]: === Iteration 2435 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash -361924089, now seen corresponding path program 1 times [2022-12-13 02:06:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:30,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835626901] [2022-12-13 02:06:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:30,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:30,407 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 02:06:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835626901] [2022-12-13 02:06:30,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835626901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:30,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:30,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495361053] [2022-12-13 02:06:30,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:30,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:30,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:30,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:30,408 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:30,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:30,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:30,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:30,457 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:30,458 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:30,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:30,458 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:30,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:30,459 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:30,459 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:30,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:30,460 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,460 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:30,460 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:30,460 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:30,460 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:30,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:30,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,463 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:30,463 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:30,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,463 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:30,580 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:30,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:30,581 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:30,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:30,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:30,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2434 [2022-12-13 02:06:30,582 INFO L420 AbstractCegarLoop]: === Iteration 2436 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash -304665787, now seen corresponding path program 1 times [2022-12-13 02:06:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:30,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553464595] [2022-12-13 02:06:30,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:30,638 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 02:06:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:30,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553464595] [2022-12-13 02:06:30,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553464595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:30,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:30,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811133455] [2022-12-13 02:06:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:30,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:30,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:30,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:30,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:30,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:30,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:30,682 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:30,682 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:30,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:30,683 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:30,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:30,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:30,683 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:30,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:30,684 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,684 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:30,684 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:30,684 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:30,684 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,685 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:30,685 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:30,685 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,687 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:30,687 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:30,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:30,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,688 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:30,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:30,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:30,806 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:30,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:30,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:30,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2435 [2022-12-13 02:06:30,806 INFO L420 AbstractCegarLoop]: === Iteration 2437 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -247407485, now seen corresponding path program 1 times [2022-12-13 02:06:30,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:30,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445488723] [2022-12-13 02:06:30,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:30,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:30,865 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 02:06:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:30,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445488723] [2022-12-13 02:06:30,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445488723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:30,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:30,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:30,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739124383] [2022-12-13 02:06:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:30,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:30,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:30,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:30,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:30,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:30,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:30,917 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:30,917 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:30,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:30,917 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:30,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:30,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:30,918 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:30,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:30,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:30,919 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:30,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:30,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:30,919 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:30,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:30,919 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:30,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:30,922 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:30,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:30,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:30,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:31,040 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:31,041 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:31,041 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:31,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,041 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:31,041 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:31,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2436 [2022-12-13 02:06:31,041 INFO L420 AbstractCegarLoop]: === Iteration 2438 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash -190149183, now seen corresponding path program 1 times [2022-12-13 02:06:31,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:31,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073962368] [2022-12-13 02:06:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:31,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:31,100 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 02:06:31,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:31,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073962368] [2022-12-13 02:06:31,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073962368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:31,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:31,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542449512] [2022-12-13 02:06:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:31,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:31,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:31,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:31,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:31,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:31,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:31,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:31,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:31,143 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:31,143 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:31,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:31,144 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:31,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:31,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:31,144 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:31,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:31,145 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,145 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:31,145 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:31,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:31,145 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,145 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:31,146 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:31,146 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,148 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:31,148 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:31,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:31,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:31,265 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:31,266 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:31,266 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:31,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,267 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:31,267 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:31,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2437 [2022-12-13 02:06:31,267 INFO L420 AbstractCegarLoop]: === Iteration 2439 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:31,267 INFO L85 PathProgramCache]: Analyzing trace with hash -132890881, now seen corresponding path program 1 times [2022-12-13 02:06:31,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:31,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924328269] [2022-12-13 02:06:31,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:31,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:31,324 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 02:06:31,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:31,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924328269] [2022-12-13 02:06:31,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924328269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:31,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:31,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:31,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364401207] [2022-12-13 02:06:31,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:31,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:31,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:31,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:31,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:31,382 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:31,382 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:31,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:31,382 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:31,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:31,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:31,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:31,383 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:31,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:31,384 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,384 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:31,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:31,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:31,384 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:31,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:31,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,387 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:31,387 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:31,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:31,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:31,507 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:31,508 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:31,508 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:31,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:31,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:31,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2438 [2022-12-13 02:06:31,508 INFO L420 AbstractCegarLoop]: === Iteration 2440 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -75632579, now seen corresponding path program 1 times [2022-12-13 02:06:31,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:31,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108788871] [2022-12-13 02:06:31,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:31,567 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 02:06:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:31,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108788871] [2022-12-13 02:06:31,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108788871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:31,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:31,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77794972] [2022-12-13 02:06:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:31,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:31,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:31,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:31,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:31,568 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:31,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:31,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:31,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:31,611 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:31,611 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:31,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 487 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:31,612 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:31,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:31,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:31,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:31,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:31,612 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:31,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:31,613 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:31,613 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:31,613 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:31,613 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:31,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:31,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,616 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:31,616 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:31,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:31,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:31,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:31,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:31,736 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:31,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:31,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:31,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2439 [2022-12-13 02:06:31,736 INFO L420 AbstractCegarLoop]: === Iteration 2441 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:31,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -18374277, now seen corresponding path program 1 times [2022-12-13 02:06:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:31,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811568277] [2022-12-13 02:06:31,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:31,793 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 02:06:31,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:31,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811568277] [2022-12-13 02:06:31,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811568277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:31,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:31,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138819558] [2022-12-13 02:06:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:31,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:31,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:31,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:31,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:31,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:31,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:31,837 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:31,838 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:31,838 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:31,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:31,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:31,839 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:31,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:31,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:31,839 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:31,840 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:31,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:31,840 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:31,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:31,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:31,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,843 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:31,843 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:31,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:31,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:31,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:31,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:31,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:06:31,971 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:31,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:31,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:31,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:31,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2440 [2022-12-13 02:06:31,971 INFO L420 AbstractCegarLoop]: === Iteration 2442 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 38884025, now seen corresponding path program 1 times [2022-12-13 02:06:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:31,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116530452] [2022-12-13 02:06:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:31,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:32,032 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 02:06:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116530452] [2022-12-13 02:06:32,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116530452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:32,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:32,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552952889] [2022-12-13 02:06:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:32,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:32,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:32,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:32,033 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:32,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:32,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:32,086 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:32,086 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:32,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:32,087 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:32,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:32,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:32,087 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:32,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:32,088 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,088 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:32,088 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:32,088 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:32,088 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,088 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:32,088 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:32,088 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,091 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:32,091 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:32,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:32,091 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,092 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:32,212 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:32,213 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:32,213 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:32,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,214 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:32,214 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:32,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2441 [2022-12-13 02:06:32,214 INFO L420 AbstractCegarLoop]: === Iteration 2443 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 96142327, now seen corresponding path program 1 times [2022-12-13 02:06:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:32,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002925207] [2022-12-13 02:06:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:32,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:32,273 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 02:06:32,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:32,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002925207] [2022-12-13 02:06:32,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002925207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:32,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:32,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994508995] [2022-12-13 02:06:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:32,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:32,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:32,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:32,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:32,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:32,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:32,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:32,325 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:32,325 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:32,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:32,325 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:32,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:32,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:32,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:32,326 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:32,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:32,327 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,327 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:32,327 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:32,327 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:32,327 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,327 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:32,328 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:32,328 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,330 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:32,330 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:32,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:32,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:32,447 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:32,448 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:32,448 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:32,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,449 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:32,449 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:32,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2442 [2022-12-13 02:06:32,449 INFO L420 AbstractCegarLoop]: === Iteration 2444 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:32,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 153400629, now seen corresponding path program 1 times [2022-12-13 02:06:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:32,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486590884] [2022-12-13 02:06:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:32,507 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 02:06:32,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:32,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486590884] [2022-12-13 02:06:32,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486590884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:32,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:32,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:32,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884721729] [2022-12-13 02:06:32,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:32,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:32,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:32,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:32,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:32,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:32,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:32,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:32,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:32,552 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:32,552 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:32,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:32,553 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:32,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:32,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:32,553 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:32,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:32,554 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:32,554 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:32,554 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:32,554 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:32,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:32,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,557 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:32,557 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:32,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:32,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:32,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:32,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:32,676 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:32,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:32,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:32,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2443 [2022-12-13 02:06:32,677 INFO L420 AbstractCegarLoop]: === Iteration 2445 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:32,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash 210658931, now seen corresponding path program 1 times [2022-12-13 02:06:32,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:32,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386909792] [2022-12-13 02:06:32,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:32,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:32,735 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 02:06:32,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:32,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386909792] [2022-12-13 02:06:32,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386909792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:32,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:32,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012764683] [2022-12-13 02:06:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:32,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:32,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:32,736 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:32,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:32,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:32,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:32,787 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:32,787 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:32,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:32,788 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:32,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:32,788 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:32,788 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:32,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:32,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:32,789 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,789 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:32,789 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:32,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:32,790 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:32,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:32,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:32,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,804 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:32,804 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:32,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:32,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:32,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:32,923 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:32,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:06:32,924 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:32,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:32,924 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:32,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2444 [2022-12-13 02:06:32,925 INFO L420 AbstractCegarLoop]: === Iteration 2446 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:32,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 267917233, now seen corresponding path program 1 times [2022-12-13 02:06:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:32,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457797312] [2022-12-13 02:06:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:32,981 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 02:06:32,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:32,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457797312] [2022-12-13 02:06:32,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457797312] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:32,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:32,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:32,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305486630] [2022-12-13 02:06:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:32,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:32,982 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:32,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:32,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:32,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:32,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:33,025 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:33,026 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:33,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:33,026 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:33,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:33,027 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:33,027 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:33,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:33,027 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,028 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:33,028 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:33,028 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:33,028 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:33,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:33,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,031 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:33,031 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:33,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:33,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:33,149 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:33,150 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:33,150 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:33,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:33,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:33,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2445 [2022-12-13 02:06:33,151 INFO L420 AbstractCegarLoop]: === Iteration 2447 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:33,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:33,151 INFO L85 PathProgramCache]: Analyzing trace with hash 325175535, now seen corresponding path program 1 times [2022-12-13 02:06:33,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:33,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749588831] [2022-12-13 02:06:33,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:33,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:33,224 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 02:06:33,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:33,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749588831] [2022-12-13 02:06:33,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749588831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:33,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:33,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:33,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046962869] [2022-12-13 02:06:33,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:33,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:33,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:33,225 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:33,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:33,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:33,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:33,288 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:33,288 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:33,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:33,289 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:33,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:33,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:33,289 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:33,289 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:33,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:33,290 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,290 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:33,290 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:33,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:33,290 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,291 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:33,291 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:33,291 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,293 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:33,293 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:33,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:33,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,294 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:33,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:33,433 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:06:33,433 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:33,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,433 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:33,433 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:33,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2446 [2022-12-13 02:06:33,434 INFO L420 AbstractCegarLoop]: === Iteration 2448 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 382433837, now seen corresponding path program 1 times [2022-12-13 02:06:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:33,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525273545] [2022-12-13 02:06:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:33,507 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 02:06:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:33,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525273545] [2022-12-13 02:06:33,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525273545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:33,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:33,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:33,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534905532] [2022-12-13 02:06:33,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:33,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:33,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:33,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:33,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:33,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:33,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:33,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:33,561 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:33,561 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:33,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:33,562 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:33,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:33,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:33,563 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:33,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:33,564 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,564 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:33,564 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:33,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:33,564 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,564 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:33,564 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:33,564 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,567 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:33,567 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:33,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:33,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:33,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:33,703 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:33,703 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:33,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:33,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2447 [2022-12-13 02:06:33,703 INFO L420 AbstractCegarLoop]: === Iteration 2449 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 439692139, now seen corresponding path program 1 times [2022-12-13 02:06:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:33,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197970484] [2022-12-13 02:06:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:33,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:33,783 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 02:06:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:33,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197970484] [2022-12-13 02:06:33,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197970484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:33,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:33,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:33,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312006055] [2022-12-13 02:06:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:33,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:33,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:33,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:33,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:33,784 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:33,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:33,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:33,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:33,845 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:33,846 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:33,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:33,846 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:33,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:33,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:33,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:33,847 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:33,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:33,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:33,848 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:33,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:33,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:33,848 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:33,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:33,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:33,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,851 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:33,851 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:33,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:33,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:33,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:33,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:33,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:33,989 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:33,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:33,989 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:33,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:33,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2448 [2022-12-13 02:06:33,990 INFO L420 AbstractCegarLoop]: === Iteration 2450 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash 496950441, now seen corresponding path program 1 times [2022-12-13 02:06:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:33,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895256556] [2022-12-13 02:06:33,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:33,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:34,052 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 02:06:34,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:34,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895256556] [2022-12-13 02:06:34,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895256556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:34,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:34,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525687260] [2022-12-13 02:06:34,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:34,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:34,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:34,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:34,053 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:34,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:34,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:34,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:34,117 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:34,118 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:34,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:34,118 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:34,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:34,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:34,119 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:34,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:34,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:34,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:34,121 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:34,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:34,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,125 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:34,125 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:34,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:34,125 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,125 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:34,262 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:34,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:06:34,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:34,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:34,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:34,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2449 [2022-12-13 02:06:34,266 INFO L420 AbstractCegarLoop]: === Iteration 2451 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:34,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:34,266 INFO L85 PathProgramCache]: Analyzing trace with hash 554208743, now seen corresponding path program 1 times [2022-12-13 02:06:34,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:34,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932172294] [2022-12-13 02:06:34,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:34,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:34,336 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 02:06:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:34,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932172294] [2022-12-13 02:06:34,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932172294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:34,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:34,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054449540] [2022-12-13 02:06:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:34,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:34,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:34,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:34,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:34,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:34,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:34,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:34,398 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:34,398 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:34,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:34,399 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:34,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:34,399 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:34,399 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:34,400 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:34,401 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:34,401 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:34,401 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:34,401 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:34,401 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,404 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:34,404 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:34,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:34,404 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,404 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:34,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:34,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 160 [2022-12-13 02:06:34,561 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:34,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:34,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2450 [2022-12-13 02:06:34,561 INFO L420 AbstractCegarLoop]: === Iteration 2452 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:34,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash 611467045, now seen corresponding path program 1 times [2022-12-13 02:06:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:34,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917895280] [2022-12-13 02:06:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:34,631 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 02:06:34,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:34,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917895280] [2022-12-13 02:06:34,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917895280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:34,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:34,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:34,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339793516] [2022-12-13 02:06:34,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:34,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:34,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:34,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:34,632 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:34,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:34,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:34,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:34,695 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:34,695 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:34,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:34,696 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:34,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:34,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:34,697 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:34,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:34,697 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,697 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:34,698 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:34,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:34,698 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:34,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:34,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,701 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:34,701 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:34,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:34,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:34,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:34,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:34,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:34,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:34,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:34,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2451 [2022-12-13 02:06:34,839 INFO L420 AbstractCegarLoop]: === Iteration 2453 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:34,839 INFO L85 PathProgramCache]: Analyzing trace with hash 668725347, now seen corresponding path program 1 times [2022-12-13 02:06:34,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:34,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518182916] [2022-12-13 02:06:34,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:34,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:34,904 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 02:06:34,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:34,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518182916] [2022-12-13 02:06:34,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518182916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:34,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:34,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:34,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174320506] [2022-12-13 02:06:34,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:34,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:34,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:34,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:34,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:34,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:34,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:34,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:34,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:34,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:34,968 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:34,968 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:34,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:34,969 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:34,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:34,969 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:34,970 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:34,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:34,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:34,970 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:34,971 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:34,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:34,971 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:34,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:34,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:34,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,974 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:34,974 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:34,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:34,974 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:34,974 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:35,111 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:35,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:35,112 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:35,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:35,112 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:35,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2452 [2022-12-13 02:06:35,113 INFO L420 AbstractCegarLoop]: === Iteration 2454 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:35,113 INFO L85 PathProgramCache]: Analyzing trace with hash 725983649, now seen corresponding path program 1 times [2022-12-13 02:06:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:35,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972218974] [2022-12-13 02:06:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:35,194 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 02:06:35,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:35,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972218974] [2022-12-13 02:06:35,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972218974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:35,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:35,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558034882] [2022-12-13 02:06:35,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:35,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:35,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:35,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:35,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:35,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:35,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:35,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:35,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:35,259 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:35,260 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:35,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:35,260 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:35,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:35,261 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:35,261 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:35,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:35,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:35,262 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,262 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:35,262 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:35,262 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:35,262 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,262 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:35,262 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:35,262 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:35,265 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:35,265 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:35,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:35,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:35,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:35,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:35,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:35,404 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:35,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:35,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:35,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2453 [2022-12-13 02:06:35,405 INFO L420 AbstractCegarLoop]: === Iteration 2455 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:35,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash 783241951, now seen corresponding path program 1 times [2022-12-13 02:06:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:35,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661595695] [2022-12-13 02:06:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:35,471 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 02:06:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:35,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661595695] [2022-12-13 02:06:35,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661595695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:35,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:35,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:35,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137048140] [2022-12-13 02:06:35,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:35,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:35,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:35,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:35,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:35,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:35,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:35,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:35,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:35,532 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:35,533 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:35,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:35,533 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:35,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:35,534 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:35,534 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:35,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:35,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:35,535 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,535 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:35,535 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:35,535 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:35,535 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,535 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:35,535 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:35,535 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:35,538 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:35,538 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:35,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:35,538 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:35,538 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:35,673 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:35,675 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:35,675 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:35,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:35,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:35,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2454 [2022-12-13 02:06:35,675 INFO L420 AbstractCegarLoop]: === Iteration 2456 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 840500253, now seen corresponding path program 1 times [2022-12-13 02:06:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:35,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344654192] [2022-12-13 02:06:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:35,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:35,741 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 02:06:35,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:35,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344654192] [2022-12-13 02:06:35,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344654192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:35,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:35,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:35,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108361195] [2022-12-13 02:06:35,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:35,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:35,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:35,742 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:35,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:35,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:35,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:35,796 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:35,797 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:35,797 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:35,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:35,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:35,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:35,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:35,798 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:35,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:35,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:35,799 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:35,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:35,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:35,799 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:35,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:35,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:35,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:35,802 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:35,802 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:35,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:35,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:35,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:35,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:35,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:35,941 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:35,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:35,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:35,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:35,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2455 [2022-12-13 02:06:35,941 INFO L420 AbstractCegarLoop]: === Iteration 2457 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:35,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash 897758555, now seen corresponding path program 1 times [2022-12-13 02:06:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:35,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434112987] [2022-12-13 02:06:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:36,005 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 02:06:36,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:36,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434112987] [2022-12-13 02:06:36,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434112987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:36,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:36,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672490523] [2022-12-13 02:06:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:36,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:36,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:36,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:36,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:36,006 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:36,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:36,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:36,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:36,071 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:36,071 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:36,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:36,072 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:36,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:36,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:36,073 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:36,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:36,074 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,074 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:36,074 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:36,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:36,074 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:36,074 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:36,074 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,077 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:36,077 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:36,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:36,077 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,077 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:36,248 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:36,249 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 02:06:36,249 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:36,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:36,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:36,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2456 [2022-12-13 02:06:36,249 INFO L420 AbstractCegarLoop]: === Iteration 2458 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:36,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 955016857, now seen corresponding path program 1 times [2022-12-13 02:06:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:36,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196205839] [2022-12-13 02:06:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:36,325 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 02:06:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:36,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196205839] [2022-12-13 02:06:36,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196205839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:36,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:36,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575411481] [2022-12-13 02:06:36,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:36,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:36,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:36,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:36,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:36,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:36,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:36,387 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:36,387 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:36,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:36,388 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:36,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:36,389 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:36,389 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:36,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:36,389 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,390 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:36,390 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:36,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:36,390 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:36,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:36,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,393 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:36,393 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:36,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:36,393 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,393 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:36,519 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:36,520 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:06:36,520 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:36,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,520 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:36,520 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:36,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2457 [2022-12-13 02:06:36,520 INFO L420 AbstractCegarLoop]: === Iteration 2459 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:36,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1012275159, now seen corresponding path program 1 times [2022-12-13 02:06:36,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:36,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571253687] [2022-12-13 02:06:36,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:36,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:36,577 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 02:06:36,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:36,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571253687] [2022-12-13 02:06:36,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571253687] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:36,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:36,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:36,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496682021] [2022-12-13 02:06:36,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:36,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:36,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:36,578 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:36,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:36,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:36,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:36,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:36,634 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:36,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:36,635 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:36,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:36,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:36,636 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:36,636 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:36,636 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:36,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:36,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:36,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:36,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,639 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:36,639 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:36,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:36,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:36,758 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:36,759 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:36,759 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:36,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,759 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:36,759 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:36,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2458 [2022-12-13 02:06:36,759 INFO L420 AbstractCegarLoop]: === Iteration 2460 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:36,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1069533461, now seen corresponding path program 1 times [2022-12-13 02:06:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:36,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779896274] [2022-12-13 02:06:36,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:36,816 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 02:06:36,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:36,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779896274] [2022-12-13 02:06:36,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779896274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:36,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846089323] [2022-12-13 02:06:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:36,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:36,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:36,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:36,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:36,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:36,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:36,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:36,898 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:36,898 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:36,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:36,899 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:36,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:36,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:36,899 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:36,899 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:36,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:36,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:36,900 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,900 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:36,900 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:36,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:36,900 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,900 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:36,901 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:36,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:36,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,903 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:36,903 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:36,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:36,904 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:36,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:37,016 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:37,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-13 02:06:37,018 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:37,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:37,018 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:37,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2459 [2022-12-13 02:06:37,018 INFO L420 AbstractCegarLoop]: === Iteration 2461 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:37,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1126791763, now seen corresponding path program 1 times [2022-12-13 02:06:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:37,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321116214] [2022-12-13 02:06:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:37,090 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 02:06:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:37,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321116214] [2022-12-13 02:06:37,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321116214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:37,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:37,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440795126] [2022-12-13 02:06:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:37,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:37,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:37,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:37,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:37,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:37,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:37,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:37,147 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:37,147 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:37,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:37,148 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:37,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:37,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:37,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:37,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:37,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:37,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:37,149 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,149 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:37,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:37,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:37,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:37,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:37,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:37,152 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:37,153 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:37,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:37,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:37,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:37,287 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:37,288 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:37,288 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:37,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:37,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2460 [2022-12-13 02:06:37,288 INFO L420 AbstractCegarLoop]: === Iteration 2462 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1184050065, now seen corresponding path program 1 times [2022-12-13 02:06:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:37,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159275164] [2022-12-13 02:06:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:37,386 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 02:06:37,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159275164] [2022-12-13 02:06:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159275164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:37,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:37,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:37,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010901956] [2022-12-13 02:06:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:37,387 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:37,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:37,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:37,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:37,447 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:37,447 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:37,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:37,447 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:37,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:37,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:37,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:37,448 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:37,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:37,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:37,449 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:37,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:37,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:37,449 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,449 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:37,449 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:37,449 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:37,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:37,452 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:37,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:37,452 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:37,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:37,586 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:37,587 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:37,587 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:37,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,587 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:37,587 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:37,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2461 [2022-12-13 02:06:37,587 INFO L420 AbstractCegarLoop]: === Iteration 2463 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1241308367, now seen corresponding path program 1 times [2022-12-13 02:06:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:37,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652629786] [2022-12-13 02:06:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:37,662 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 02:06:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:37,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652629786] [2022-12-13 02:06:37,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652629786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:37,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:37,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070573834] [2022-12-13 02:06:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:37,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:37,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:37,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:37,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:37,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:37,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:37,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:37,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:37,725 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:37,726 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:37,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:37,726 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:37,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:37,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:37,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:37,727 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:37,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:37,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:37,728 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,728 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:37,728 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:37,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:37,728 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:37,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:37,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:37,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:37,731 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:37,731 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:37,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:37,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:37,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:37,895 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:37,897 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 02:06:37,897 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:37,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,897 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:37,897 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:37,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2462 [2022-12-13 02:06:37,897 INFO L420 AbstractCegarLoop]: === Iteration 2464 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1298566669, now seen corresponding path program 1 times [2022-12-13 02:06:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106321583] [2022-12-13 02:06:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:37,969 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 02:06:37,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106321583] [2022-12-13 02:06:37,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106321583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:37,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:37,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:37,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158862392] [2022-12-13 02:06:37,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:37,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:37,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:37,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:37,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:37,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:37,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:37,970 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:37,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:38,023 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:38,023 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:38,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:38,024 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:38,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:38,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:38,025 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:38,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:38,025 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,025 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:38,026 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:38,026 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:38,026 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,026 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:38,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:38,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,029 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:38,029 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:38,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:38,029 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,029 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:38,163 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:38,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:38,164 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:38,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,164 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:38,164 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:38,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2463 [2022-12-13 02:06:38,164 INFO L420 AbstractCegarLoop]: === Iteration 2465 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:38,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1355824971, now seen corresponding path program 1 times [2022-12-13 02:06:38,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:38,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997369004] [2022-12-13 02:06:38,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:38,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:38,229 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 02:06:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997369004] [2022-12-13 02:06:38,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997369004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:38,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043353206] [2022-12-13 02:06:38,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:38,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:38,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:38,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:38,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:38,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:38,283 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:38,283 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:38,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:38,284 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:38,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:38,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:38,285 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:38,285 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:38,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:38,285 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,286 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:38,286 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:38,286 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:38,286 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,286 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:38,286 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:38,286 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,289 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:38,289 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:38,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:38,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:38,429 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:38,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:06:38,431 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:38,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:38,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:38,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2464 [2022-12-13 02:06:38,431 INFO L420 AbstractCegarLoop]: === Iteration 2466 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:38,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1413083273, now seen corresponding path program 1 times [2022-12-13 02:06:38,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:38,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111749122] [2022-12-13 02:06:38,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:38,504 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 02:06:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:38,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111749122] [2022-12-13 02:06:38,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111749122] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:38,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:38,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:38,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243573313] [2022-12-13 02:06:38,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:38,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:38,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:38,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:38,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:38,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:38,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:38,559 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:38,560 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:38,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:38,560 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:38,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:38,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:38,561 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:38,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:38,562 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:38,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:38,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:38,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,563 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:38,563 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:38,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,566 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:38,566 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:38,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:38,567 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,567 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:38,703 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:38,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:38,705 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:38,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:38,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2465 [2022-12-13 02:06:38,705 INFO L420 AbstractCegarLoop]: === Iteration 2467 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1470341575, now seen corresponding path program 1 times [2022-12-13 02:06:38,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:38,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427533323] [2022-12-13 02:06:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:38,779 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 02:06:38,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:38,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427533323] [2022-12-13 02:06:38,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427533323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:38,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:38,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:38,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479469901] [2022-12-13 02:06:38,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:38,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:38,780 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:38,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:38,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:38,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:38,829 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:38,829 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:38,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:38,829 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:38,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:38,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:38,830 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:38,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:38,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:38,831 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,831 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:38,831 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:38,831 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:38,831 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,831 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:38,831 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:38,831 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:38,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,834 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:38,834 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:38,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:38,834 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:38,834 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:38,951 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:38,952 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:38,952 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:38,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:38,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:38,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:38,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2466 [2022-12-13 02:06:38,953 INFO L420 AbstractCegarLoop]: === Iteration 2468 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:38,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1527599877, now seen corresponding path program 1 times [2022-12-13 02:06:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:38,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281188089] [2022-12-13 02:06:38,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:38,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:39,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 02:06:39,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:39,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281188089] [2022-12-13 02:06:39,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281188089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:39,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:39,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:39,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313391924] [2022-12-13 02:06:39,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:39,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:39,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:39,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:39,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:39,010 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:39,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:39,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:39,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:39,060 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:39,060 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:39,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:39,060 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:39,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:39,061 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:39,061 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:39,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:39,062 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,062 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:39,062 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:39,062 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:39,062 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,062 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:39,062 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:39,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,065 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:39,065 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:39,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:39,065 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,065 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:39,183 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:39,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:39,184 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:39,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,184 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:39,184 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:39,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2467 [2022-12-13 02:06:39,184 INFO L420 AbstractCegarLoop]: === Iteration 2469 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1584858179, now seen corresponding path program 1 times [2022-12-13 02:06:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:39,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495687069] [2022-12-13 02:06:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:39,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:39,243 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 02:06:39,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:39,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495687069] [2022-12-13 02:06:39,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495687069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:39,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:39,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:39,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312504710] [2022-12-13 02:06:39,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:39,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:39,244 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:39,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:39,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:39,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:39,286 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:39,287 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:39,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:39,287 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:39,287 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:39,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:39,288 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:39,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:39,288 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:39,289 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:39,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:39,289 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,289 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:39,289 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:39,289 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,292 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:39,292 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:39,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:39,292 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,292 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:39,422 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:39,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:06:39,423 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:39,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:39,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:39,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2468 [2022-12-13 02:06:39,423 INFO L420 AbstractCegarLoop]: === Iteration 2470 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:39,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1642116481, now seen corresponding path program 1 times [2022-12-13 02:06:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:39,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136899227] [2022-12-13 02:06:39,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:39,480 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 02:06:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:39,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136899227] [2022-12-13 02:06:39,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136899227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:39,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:39,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309730055] [2022-12-13 02:06:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:39,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:39,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:39,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:39,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:39,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:39,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:39,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:39,532 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:39,532 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:39,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:39,532 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:39,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:39,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:39,533 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:39,533 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:39,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:39,534 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,534 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:39,534 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:39,534 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:39,534 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,534 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:39,534 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:39,534 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,537 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:39,537 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:39,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:39,537 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,537 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:39,654 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:39,655 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:39,655 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:39,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,656 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:39,656 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:39,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2469 [2022-12-13 02:06:39,656 INFO L420 AbstractCegarLoop]: === Iteration 2471 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1699374783, now seen corresponding path program 1 times [2022-12-13 02:06:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:39,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540512944] [2022-12-13 02:06:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:39,721 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 02:06:39,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:39,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540512944] [2022-12-13 02:06:39,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540512944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:39,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:39,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:39,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316504987] [2022-12-13 02:06:39,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:39,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:39,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:39,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:39,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:39,722 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:39,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:39,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:39,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:39,766 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:39,766 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:39,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:39,767 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:39,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:39,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:39,767 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:39,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:39,768 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:39,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:39,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:39,768 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:39,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:39,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,771 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:39,771 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:39,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:39,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,772 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:39,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:39,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:39,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:39,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:39,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2470 [2022-12-13 02:06:39,889 INFO L420 AbstractCegarLoop]: === Iteration 2472 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:39,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1756633085, now seen corresponding path program 1 times [2022-12-13 02:06:39,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:39,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304004579] [2022-12-13 02:06:39,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:39,946 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 02:06:39,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:39,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304004579] [2022-12-13 02:06:39,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304004579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:39,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:39,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648205841] [2022-12-13 02:06:39,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:39,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:39,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:39,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:39,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:39,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:39,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:39,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:39,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:39,990 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:39,990 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:39,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:39,991 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:39,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:39,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:39,991 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:39,991 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:39,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:39,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:39,992 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:39,992 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:39,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:39,992 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,992 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:39,992 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:39,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:39,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,995 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:39,995 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:39,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:39,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:39,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:40,113 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:40,114 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:40,114 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:40,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,114 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:40,114 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:40,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2471 [2022-12-13 02:06:40,114 INFO L420 AbstractCegarLoop]: === Iteration 2473 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:40,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:40,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1813891387, now seen corresponding path program 1 times [2022-12-13 02:06:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:40,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038554939] [2022-12-13 02:06:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:40,171 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 02:06:40,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:40,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038554939] [2022-12-13 02:06:40,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038554939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:40,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:40,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604142875] [2022-12-13 02:06:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:40,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:40,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:40,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:40,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:40,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:40,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:40,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:40,222 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:40,222 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:40,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:40,223 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:40,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:40,223 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:40,223 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:40,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:40,224 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,224 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:40,224 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:40,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:40,224 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,224 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:40,224 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:40,224 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,227 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:40,227 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:40,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:40,227 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,227 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:40,345 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:40,347 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:40,347 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:40,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:40,347 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:40,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2472 [2022-12-13 02:06:40,347 INFO L420 AbstractCegarLoop]: === Iteration 2474 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1871149689, now seen corresponding path program 1 times [2022-12-13 02:06:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:40,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424216725] [2022-12-13 02:06:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:40,413 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 02:06:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:40,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424216725] [2022-12-13 02:06:40,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424216725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:40,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:40,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050894040] [2022-12-13 02:06:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:40,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:40,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:40,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:40,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:40,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:40,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:40,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:40,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:40,469 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:40,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:40,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:40,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:40,470 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:40,470 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:40,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:40,471 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,471 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:40,471 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:40,471 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:40,471 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:40,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:40,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,474 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:40,474 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:40,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:40,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:40,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:40,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:06:40,597 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:40,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:40,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:40,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2473 [2022-12-13 02:06:40,598 INFO L420 AbstractCegarLoop]: === Iteration 2475 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:40,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1928407991, now seen corresponding path program 1 times [2022-12-13 02:06:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:40,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653318782] [2022-12-13 02:06:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:40,663 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 02:06:40,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:40,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653318782] [2022-12-13 02:06:40,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653318782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:40,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:40,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256675029] [2022-12-13 02:06:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:40,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:40,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:40,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:40,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:40,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:40,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:40,721 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:40,721 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:40,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:40,722 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:40,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:40,722 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:40,722 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:40,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:40,723 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,723 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:40,723 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:40,723 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:40,723 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,724 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:40,724 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:40,724 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,726 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:40,726 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:40,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:40,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:40,853 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:40,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:06:40,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:40,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:40,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:40,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2474 [2022-12-13 02:06:40,854 INFO L420 AbstractCegarLoop]: === Iteration 2476 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:40,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:40,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1985666293, now seen corresponding path program 1 times [2022-12-13 02:06:40,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:40,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505975250] [2022-12-13 02:06:40,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:40,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:40,912 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 02:06:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:40,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505975250] [2022-12-13 02:06:40,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505975250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:40,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:40,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852524408] [2022-12-13 02:06:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:40,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:40,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:40,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:40,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:40,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:40,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:40,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:40,964 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:40,964 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:40,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:40,965 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:40,965 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:40,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:40,965 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:40,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:40,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:40,966 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,966 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:40,966 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:40,966 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:40,966 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,966 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:40,966 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:40,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,969 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:40,969 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:40,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:40,969 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:40,969 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:41,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:41,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:41,087 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:41,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2475 [2022-12-13 02:06:41,087 INFO L420 AbstractCegarLoop]: === Iteration 2477 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:41,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2042924595, now seen corresponding path program 1 times [2022-12-13 02:06:41,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:41,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737605177] [2022-12-13 02:06:41,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:41,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:41,142 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 02:06:41,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:41,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737605177] [2022-12-13 02:06:41,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737605177] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:41,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:41,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:41,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520701946] [2022-12-13 02:06:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:41,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:41,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:41,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:41,143 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:41,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:41,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:41,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:41,188 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:41,188 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:41,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:41,189 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:41,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:41,189 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:41,189 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:41,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:41,190 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:41,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:41,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:41,191 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:41,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:41,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,193 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:41,193 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:41,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:41,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:41,327 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:41,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:41,329 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:41,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,329 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:41,329 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:41,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2476 [2022-12-13 02:06:41,329 INFO L420 AbstractCegarLoop]: === Iteration 2478 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2100182897, now seen corresponding path program 1 times [2022-12-13 02:06:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:41,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705123954] [2022-12-13 02:06:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:41,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:41,393 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 02:06:41,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:41,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705123954] [2022-12-13 02:06:41,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705123954] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:41,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:41,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:41,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762576857] [2022-12-13 02:06:41,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:41,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:41,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:41,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:41,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:41,395 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:41,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:41,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:41,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:41,455 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:41,455 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:41,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:41,456 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:41,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:41,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:41,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:41,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:41,457 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:41,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:41,457 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:41,458 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:41,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:41,458 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,458 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:41,458 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:41,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,461 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:41,461 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:41,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:41,461 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,461 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:41,592 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:41,593 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:06:41,593 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:41,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:41,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:41,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2477 [2022-12-13 02:06:41,593 INFO L420 AbstractCegarLoop]: === Iteration 2479 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2137526097, now seen corresponding path program 1 times [2022-12-13 02:06:41,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:41,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780354414] [2022-12-13 02:06:41,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:41,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:41,652 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 02:06:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:41,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780354414] [2022-12-13 02:06:41,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780354414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:41,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:41,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:41,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802887270] [2022-12-13 02:06:41,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:41,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:41,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:41,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:41,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:41,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:41,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:41,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:41,706 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:41,706 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:41,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:41,707 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:41,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:41,708 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:41,708 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:41,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:41,709 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,709 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:41,709 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:41,709 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:41,709 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:41,709 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:41,709 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,712 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:41,712 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:41,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:41,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:41,847 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:41,849 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:41,849 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:41,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,849 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:41,849 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:41,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2478 [2022-12-13 02:06:41,849 INFO L420 AbstractCegarLoop]: === Iteration 2480 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:41,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2080267795, now seen corresponding path program 1 times [2022-12-13 02:06:41,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:41,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35776753] [2022-12-13 02:06:41,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:41,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:41,917 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 02:06:41,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:41,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35776753] [2022-12-13 02:06:41,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35776753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:41,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:41,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784210291] [2022-12-13 02:06:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:41,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:41,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:41,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:41,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:41,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:41,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:41,982 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:41,983 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:41,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:41,983 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:41,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:41,984 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:41,984 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:41,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:41,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:41,985 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,985 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:41,985 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:41,985 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:41,985 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:41,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:41,985 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:41,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,988 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:41,988 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:41,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:41,989 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:41,989 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:42,125 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:42,127 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:42,127 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:42,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,127 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:42,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:42,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2479 [2022-12-13 02:06:42,127 INFO L420 AbstractCegarLoop]: === Iteration 2481 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:42,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2023009493, now seen corresponding path program 1 times [2022-12-13 02:06:42,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:42,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887387213] [2022-12-13 02:06:42,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:42,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:42,203 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 02:06:42,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:42,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887387213] [2022-12-13 02:06:42,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887387213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:42,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:42,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727463374] [2022-12-13 02:06:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:42,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:42,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:42,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:42,205 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:42,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:42,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:42,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:42,270 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:42,270 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:42,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:42,271 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:42,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:42,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:42,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:42,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:42,272 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:42,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:42,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:42,272 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:42,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:42,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:42,273 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:42,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:42,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:42,276 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:42,276 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:42,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:42,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:42,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:42,412 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:42,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:42,414 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:42,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:42,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:42,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2480 [2022-12-13 02:06:42,415 INFO L420 AbstractCegarLoop]: === Iteration 2482 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:42,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1965751191, now seen corresponding path program 1 times [2022-12-13 02:06:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:42,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203548948] [2022-12-13 02:06:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:42,506 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 02:06:42,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:42,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203548948] [2022-12-13 02:06:42,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203548948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:42,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:42,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610078069] [2022-12-13 02:06:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:42,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:42,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:42,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:42,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:42,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:42,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:42,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:42,557 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:42,557 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:42,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:42,557 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:42,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:42,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:42,558 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:42,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:42,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:42,559 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,559 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:42,559 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:42,559 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:42,559 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,559 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:42,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:42,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:42,562 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:42,562 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:42,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:42,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:42,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:42,688 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:42,689 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:06:42,689 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:42,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,690 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:42,690 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:42,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2481 [2022-12-13 02:06:42,690 INFO L420 AbstractCegarLoop]: === Iteration 2483 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1908492889, now seen corresponding path program 1 times [2022-12-13 02:06:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:42,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480014579] [2022-12-13 02:06:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:42,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:42,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480014579] [2022-12-13 02:06:42,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480014579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:42,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:42,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717184352] [2022-12-13 02:06:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:42,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:42,751 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:42,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:42,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:42,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:42,814 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:42,815 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:42,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:42,815 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:42,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:42,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:42,816 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:42,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:42,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:42,818 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,818 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:42,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:42,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:42,818 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:42,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:42,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:42,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:42,822 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:42,822 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:42,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:42,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:42,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:42,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:42,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:42,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:42,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:42,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:42,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:42,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2482 [2022-12-13 02:06:42,942 INFO L420 AbstractCegarLoop]: === Iteration 2484 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:42,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1851234587, now seen corresponding path program 1 times [2022-12-13 02:06:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:42,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919670280] [2022-12-13 02:06:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:43,003 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 02:06:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:43,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919670280] [2022-12-13 02:06:43,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919670280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:43,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:43,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383485896] [2022-12-13 02:06:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:43,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:43,004 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:43,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:43,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:43,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:43,048 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:43,048 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:43,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:43,048 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:43,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:43,049 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:43,049 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:43,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:43,050 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,050 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:43,050 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:43,050 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:43,050 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,050 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:43,050 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:43,050 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,053 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:43,053 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:43,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:43,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:43,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:43,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:43,172 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:43,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:43,172 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:43,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2483 [2022-12-13 02:06:43,172 INFO L420 AbstractCegarLoop]: === Iteration 2485 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:43,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1793976285, now seen corresponding path program 1 times [2022-12-13 02:06:43,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:43,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054843754] [2022-12-13 02:06:43,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:43,231 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 02:06:43,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:43,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054843754] [2022-12-13 02:06:43,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054843754] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:43,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:43,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33921919] [2022-12-13 02:06:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:43,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:43,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:43,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:43,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:43,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:43,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:43,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:43,281 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:43,281 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:43,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:43,282 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:43,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:43,282 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:43,282 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:43,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:43,283 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,283 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:43,283 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:43,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:43,283 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,284 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:43,284 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:43,284 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,286 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:43,286 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:43,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:43,287 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,287 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:43,403 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:43,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:43,404 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:43,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:43,404 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:43,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2484 [2022-12-13 02:06:43,404 INFO L420 AbstractCegarLoop]: === Iteration 2486 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1736717983, now seen corresponding path program 1 times [2022-12-13 02:06:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:43,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373025929] [2022-12-13 02:06:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:43,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:43,470 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 02:06:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:43,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373025929] [2022-12-13 02:06:43,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373025929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:43,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:43,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:43,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249972966] [2022-12-13 02:06:43,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:43,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:43,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:43,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:43,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:43,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:43,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:43,523 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:43,523 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:43,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 513 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:43,524 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:43,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:43,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:43,524 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:43,524 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:43,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:43,525 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,525 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:43,525 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:43,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:43,525 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:43,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:43,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,528 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:43,528 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:43,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:43,529 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,529 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:43,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:43,647 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:43,647 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:43,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:43,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:43,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2485 [2022-12-13 02:06:43,647 INFO L420 AbstractCegarLoop]: === Iteration 2487 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1679459681, now seen corresponding path program 1 times [2022-12-13 02:06:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:43,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938424039] [2022-12-13 02:06:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:43,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:43,704 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 02:06:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:43,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938424039] [2022-12-13 02:06:43,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938424039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:43,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:43,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:43,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174345155] [2022-12-13 02:06:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:43,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:43,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:43,705 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:43,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:43,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:43,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:43,748 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:43,748 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:43,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:43,749 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:43,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:43,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:43,749 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:43,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:43,750 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:43,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:43,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:43,751 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,751 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:43,751 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:43,751 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,753 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:43,753 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:43,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:43,754 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,754 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:43,871 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:43,872 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:43,872 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:43,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,872 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:43,872 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:43,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2486 [2022-12-13 02:06:43,872 INFO L420 AbstractCegarLoop]: === Iteration 2488 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1622201379, now seen corresponding path program 1 times [2022-12-13 02:06:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458629118] [2022-12-13 02:06:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:43,937 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 02:06:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:43,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458629118] [2022-12-13 02:06:43,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458629118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:43,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:43,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:43,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329302458] [2022-12-13 02:06:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:43,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:43,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:43,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:43,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:43,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:43,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:43,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:43,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:43,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:43,989 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:43,989 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:43,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:43,989 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:43,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:43,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:43,990 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:43,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:43,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:43,991 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,991 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:43,991 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:43,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:43,991 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:43,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:43,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:43,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,994 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:43,994 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:43,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:43,994 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:43,994 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:44,112 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:44,113 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:44,113 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:44,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,113 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:44,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:44,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2487 [2022-12-13 02:06:44,113 INFO L420 AbstractCegarLoop]: === Iteration 2489 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:44,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:44,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1564943077, now seen corresponding path program 1 times [2022-12-13 02:06:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:44,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655801044] [2022-12-13 02:06:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:44,170 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 02:06:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:44,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655801044] [2022-12-13 02:06:44,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655801044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:44,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:44,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401465080] [2022-12-13 02:06:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:44,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:44,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:44,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:44,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:44,171 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:44,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:44,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:44,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:44,221 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:44,221 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:44,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:44,222 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:44,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:44,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:44,222 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:44,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:44,223 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:44,223 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:44,223 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:44,223 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,223 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:44,223 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:44,223 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,226 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:44,226 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:44,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:44,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:44,342 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:44,343 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:44,343 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:44,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,343 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:44,343 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:44,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2488 [2022-12-13 02:06:44,343 INFO L420 AbstractCegarLoop]: === Iteration 2490 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1507684775, now seen corresponding path program 1 times [2022-12-13 02:06:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:44,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263439987] [2022-12-13 02:06:44,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:44,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:44,406 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 02:06:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:44,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263439987] [2022-12-13 02:06:44,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263439987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:44,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:44,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515633572] [2022-12-13 02:06:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:44,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:44,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:44,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:44,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:44,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:44,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:44,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:44,450 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:44,450 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:44,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:44,450 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:44,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:44,451 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:44,451 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:44,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:44,452 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,452 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:44,452 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:44,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:44,452 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:44,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:44,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,455 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:44,455 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:44,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:44,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:44,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:44,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:44,576 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:44,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:44,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:44,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2489 [2022-12-13 02:06:44,576 INFO L420 AbstractCegarLoop]: === Iteration 2491 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1450426473, now seen corresponding path program 1 times [2022-12-13 02:06:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:44,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638824497] [2022-12-13 02:06:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:44,633 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 02:06:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:44,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638824497] [2022-12-13 02:06:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638824497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:44,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:44,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557915364] [2022-12-13 02:06:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:44,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:44,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:44,634 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:44,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,634 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:44,634 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:44,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:44,676 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:44,676 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:44,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:44,677 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:44,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:44,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:44,677 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:44,677 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:44,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:44,678 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,678 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:44,678 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:44,678 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:44,678 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,678 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:44,678 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:44,679 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,681 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:44,681 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:44,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:44,681 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,681 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:44,800 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:44,801 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:44,801 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:44,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:44,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:44,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2490 [2022-12-13 02:06:44,801 INFO L420 AbstractCegarLoop]: === Iteration 2492 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1393168171, now seen corresponding path program 1 times [2022-12-13 02:06:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:44,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082607694] [2022-12-13 02:06:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:44,866 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 02:06:44,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:44,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082607694] [2022-12-13 02:06:44,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082607694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:44,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:44,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:44,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253545895] [2022-12-13 02:06:44,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:44,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:44,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:44,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:44,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:44,867 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:44,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:44,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:44,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:44,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:44,918 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:44,918 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:44,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:44,918 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:44,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:44,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:44,919 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:44,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:44,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:44,920 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:44,920 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:44,920 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:44,920 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:44,920 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:44,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:44,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,923 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:44,923 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:44,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:44,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:44,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:45,038 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:45,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:06:45,039 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:45,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:45,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:45,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2491 [2022-12-13 02:06:45,039 INFO L420 AbstractCegarLoop]: === Iteration 2493 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:45,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1335909869, now seen corresponding path program 1 times [2022-12-13 02:06:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:45,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41071249] [2022-12-13 02:06:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:45,098 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 02:06:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:45,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41071249] [2022-12-13 02:06:45,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41071249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:45,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:45,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:45,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097270328] [2022-12-13 02:06:45,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:45,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:45,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:45,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:45,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:45,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:45,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:45,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:45,142 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:45,142 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:45,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:45,142 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:45,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:45,143 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:45,143 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:45,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:45,144 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,144 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:45,144 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:45,144 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:45,144 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,144 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:45,144 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:45,144 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,147 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:45,147 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:45,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:45,147 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,147 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:45,271 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:45,272 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:06:45,272 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:45,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:45,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:45,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2492 [2022-12-13 02:06:45,273 INFO L420 AbstractCegarLoop]: === Iteration 2494 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1278651567, now seen corresponding path program 1 times [2022-12-13 02:06:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999242031] [2022-12-13 02:06:45,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:45,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:45,356 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 02:06:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:45,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999242031] [2022-12-13 02:06:45,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999242031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:45,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:45,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:45,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454019252] [2022-12-13 02:06:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:45,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:45,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:45,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:45,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:45,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:45,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:45,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:45,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:45,408 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:45,408 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:45,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:45,409 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:45,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:45,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:45,409 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:45,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:45,410 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,410 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:45,410 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:45,410 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:45,410 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:45,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:45,411 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,413 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:45,413 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:45,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:45,413 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,414 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:45,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:45,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:06:45,545 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:45,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:45,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:45,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2493 [2022-12-13 02:06:45,546 INFO L420 AbstractCegarLoop]: === Iteration 2495 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:45,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:45,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1221393265, now seen corresponding path program 1 times [2022-12-13 02:06:45,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:45,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587102138] [2022-12-13 02:06:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:45,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:45,612 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 02:06:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:45,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587102138] [2022-12-13 02:06:45,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587102138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:45,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:45,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154395991] [2022-12-13 02:06:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:45,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:45,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:45,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:45,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:45,614 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:45,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:45,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:45,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:45,666 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:45,666 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:45,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:45,666 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:45,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:45,667 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:45,667 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:45,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:45,668 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:45,668 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:45,668 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:45,668 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:45,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:45,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,671 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:45,671 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:45,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:45,671 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,671 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:45,807 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:45,808 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:45,809 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:45,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:45,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:45,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2494 [2022-12-13 02:06:45,809 INFO L420 AbstractCegarLoop]: === Iteration 2496 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:45,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1164134963, now seen corresponding path program 1 times [2022-12-13 02:06:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:45,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034079227] [2022-12-13 02:06:45,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:45,875 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 02:06:45,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:45,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034079227] [2022-12-13 02:06:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034079227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:45,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:45,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342879644] [2022-12-13 02:06:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:45,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:45,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:45,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:45,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:45,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:45,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:45,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:45,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:45,929 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:45,929 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:45,930 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:45,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:45,930 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:45,930 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:45,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:45,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:45,931 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:45,931 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:45,932 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:45,932 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,932 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:45,932 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:45,932 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:45,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,934 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:45,934 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:45,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:45,935 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:45,935 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:46,069 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:46,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:46,071 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:46,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:46,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:46,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2495 [2022-12-13 02:06:46,071 INFO L420 AbstractCegarLoop]: === Iteration 2497 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:46,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1106876661, now seen corresponding path program 1 times [2022-12-13 02:06:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:46,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306256071] [2022-12-13 02:06:46,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:46,147 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 02:06:46,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:46,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306256071] [2022-12-13 02:06:46,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306256071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:46,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:46,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417971380] [2022-12-13 02:06:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:46,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:46,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:46,148 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:46,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:46,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:46,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:46,210 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:46,211 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:46,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:46,211 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:46,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:46,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:46,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:46,212 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:46,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:46,213 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:46,213 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:46,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:46,213 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:46,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:46,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,216 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:46,216 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:46,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:46,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:46,350 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:46,351 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:46,351 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:46,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,351 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:46,351 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:46,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2496 [2022-12-13 02:06:46,351 INFO L420 AbstractCegarLoop]: === Iteration 2498 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:46,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1049618359, now seen corresponding path program 1 times [2022-12-13 02:06:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:46,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959321785] [2022-12-13 02:06:46,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:46,424 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 02:06:46,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:46,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959321785] [2022-12-13 02:06:46,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959321785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:46,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:46,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:46,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245946338] [2022-12-13 02:06:46,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:46,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:46,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:46,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:46,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:46,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:46,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:46,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:46,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:46,484 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:46,484 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:46,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:46,485 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:46,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:46,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:46,486 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:46,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:46,487 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:46,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:46,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:46,487 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:46,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:46,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,491 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:46,491 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:46,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:46,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,492 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:46,622 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:46,623 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:06:46,623 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:46,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,623 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:46,623 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2497 [2022-12-13 02:06:46,623 INFO L420 AbstractCegarLoop]: === Iteration 2499 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:46,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:46,623 INFO L85 PathProgramCache]: Analyzing trace with hash -992360057, now seen corresponding path program 1 times [2022-12-13 02:06:46,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:46,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268556199] [2022-12-13 02:06:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:46,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:46,696 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 02:06:46,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:46,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268556199] [2022-12-13 02:06:46,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268556199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:46,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:46,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:46,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955924628] [2022-12-13 02:06:46,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:46,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:46,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:46,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:46,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:46,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:46,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:46,758 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:46,759 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:46,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:46,759 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:46,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:46,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:46,760 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:46,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:46,761 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:46,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:46,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:46,761 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:46,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:46,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,764 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:46,764 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:46,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:46,764 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,764 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:46,880 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:46,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:46,881 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:46,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:46,882 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:46,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2498 [2022-12-13 02:06:46,882 INFO L420 AbstractCegarLoop]: === Iteration 2500 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash -935101755, now seen corresponding path program 1 times [2022-12-13 02:06:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:46,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456886552] [2022-12-13 02:06:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:46,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:46,949 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 02:06:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:46,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456886552] [2022-12-13 02:06:46,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456886552] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:46,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:46,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:46,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745585694] [2022-12-13 02:06:46,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:46,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:46,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:46,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:46,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:46,950 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:46,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:46,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:46,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:46,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:46,993 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:46,993 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:46,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:46,993 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:46,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:46,994 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:46,994 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:46,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:46,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:46,995 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,995 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:46,995 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:46,995 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:46,995 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:46,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:46,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:46,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,998 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:46,998 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:46,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:46,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:46,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:47,114 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:47,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:47,115 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:47,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,115 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:47,115 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:47,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2499 [2022-12-13 02:06:47,115 INFO L420 AbstractCegarLoop]: === Iteration 2501 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:47,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:47,116 INFO L85 PathProgramCache]: Analyzing trace with hash -877843453, now seen corresponding path program 1 times [2022-12-13 02:06:47,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:47,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898383367] [2022-12-13 02:06:47,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:47,174 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 02:06:47,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:47,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898383367] [2022-12-13 02:06:47,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898383367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:47,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:47,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350072071] [2022-12-13 02:06:47,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:47,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:47,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:47,175 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:47,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:47,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:47,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:47,218 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:47,218 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:47,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:47,219 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:47,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:47,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:47,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:47,219 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:47,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:47,220 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:47,220 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:47,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:47,220 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:47,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:47,221 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,223 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:47,223 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:47,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:47,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,223 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:47,338 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:47,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:47,340 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:47,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:47,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:47,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2500 [2022-12-13 02:06:47,340 INFO L420 AbstractCegarLoop]: === Iteration 2502 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -820585151, now seen corresponding path program 1 times [2022-12-13 02:06:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:47,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964935256] [2022-12-13 02:06:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:47,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:47,396 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 02:06:47,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:47,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964935256] [2022-12-13 02:06:47,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964935256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:47,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:47,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634760501] [2022-12-13 02:06:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:47,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:47,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:47,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:47,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:47,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:47,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:47,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:47,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:47,439 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:47,439 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:47,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:47,439 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:47,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:47,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:47,440 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:47,440 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:47,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:47,441 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:47,441 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:47,441 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:47,441 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,441 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:47,441 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:47,441 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,444 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:47,444 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:47,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:47,444 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,444 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:47,560 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:47,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:47,561 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:47,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:47,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2501 [2022-12-13 02:06:47,561 INFO L420 AbstractCegarLoop]: === Iteration 2503 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:47,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash -763326849, now seen corresponding path program 1 times [2022-12-13 02:06:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:47,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331082128] [2022-12-13 02:06:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:47,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:47,618 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 02:06:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:47,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331082128] [2022-12-13 02:06:47,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331082128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:47,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:47,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448731062] [2022-12-13 02:06:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:47,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:47,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:47,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:47,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:47,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:47,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:47,662 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:47,662 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:47,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:47,663 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:47,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:47,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:47,663 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:47,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:47,664 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,664 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:47,664 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:47,664 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:47,664 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:47,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:47,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,667 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:47,667 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:47,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:47,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:47,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:47,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:47,789 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:47,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:47,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:47,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2502 [2022-12-13 02:06:47,789 INFO L420 AbstractCegarLoop]: === Iteration 2504 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:47,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash -706068547, now seen corresponding path program 1 times [2022-12-13 02:06:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:47,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295200840] [2022-12-13 02:06:47,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:47,847 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 02:06:47,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:47,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295200840] [2022-12-13 02:06:47,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295200840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:47,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:47,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346912411] [2022-12-13 02:06:47,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:47,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:47,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:47,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:47,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:47,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:47,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:47,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:47,891 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:47,891 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:47,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:47,892 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:47,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:47,892 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:47,892 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:47,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:47,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:47,893 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,893 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:47,893 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:47,893 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:47,893 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,893 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:47,893 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:47,893 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:47,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,896 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:47,896 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:47,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:47,896 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:47,896 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:48,012 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:48,013 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:48,013 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:48,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,013 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:48,013 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:48,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2503 [2022-12-13 02:06:48,014 INFO L420 AbstractCegarLoop]: === Iteration 2505 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:48,014 INFO L85 PathProgramCache]: Analyzing trace with hash -648810245, now seen corresponding path program 1 times [2022-12-13 02:06:48,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:48,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787420392] [2022-12-13 02:06:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:48,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:48,071 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 02:06:48,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:48,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787420392] [2022-12-13 02:06:48,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787420392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:48,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:48,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:48,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859083580] [2022-12-13 02:06:48,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:48,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:48,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:48,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:48,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:48,115 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:48,115 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:48,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:48,115 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:48,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:48,116 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:48,116 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:48,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:48,117 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:48,117 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:48,117 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:48,117 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,117 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:48,117 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:48,117 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,120 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:48,120 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:48,120 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,120 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:48,236 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:48,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:48,238 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:48,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:48,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:48,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2504 [2022-12-13 02:06:48,238 INFO L420 AbstractCegarLoop]: === Iteration 2506 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -591551943, now seen corresponding path program 1 times [2022-12-13 02:06:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:48,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649951897] [2022-12-13 02:06:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:48,309 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 02:06:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:48,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649951897] [2022-12-13 02:06:48,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649951897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:48,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:48,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:48,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507928815] [2022-12-13 02:06:48,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:48,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:48,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:48,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:48,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:48,310 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:48,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:48,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:48,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:48,358 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:48,359 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:48,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:48,359 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:48,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:48,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:48,360 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:48,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:48,361 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,361 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:48,361 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:48,361 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:48,361 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,361 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:48,361 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:48,361 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,364 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:48,364 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:48,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:48,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:48,491 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:48,492 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:06:48,492 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:48,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:48,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:48,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2505 [2022-12-13 02:06:48,492 INFO L420 AbstractCegarLoop]: === Iteration 2507 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -534293641, now seen corresponding path program 1 times [2022-12-13 02:06:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:48,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229911800] [2022-12-13 02:06:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:48,551 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 02:06:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:48,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229911800] [2022-12-13 02:06:48,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229911800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:48,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:48,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757255481] [2022-12-13 02:06:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:48,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:48,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:48,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:48,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:48,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:48,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:48,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:48,606 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:48,606 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:48,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:48,606 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:48,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:48,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:48,607 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:48,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:48,608 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,608 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:48,608 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:48,608 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:48,608 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,608 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:48,608 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:48,608 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,611 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:48,611 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:48,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:48,611 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:48,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:48,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:48,735 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:48,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:48,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:48,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2506 [2022-12-13 02:06:48,735 INFO L420 AbstractCegarLoop]: === Iteration 2508 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:48,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:48,735 INFO L85 PathProgramCache]: Analyzing trace with hash -477035339, now seen corresponding path program 1 times [2022-12-13 02:06:48,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:48,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082671143] [2022-12-13 02:06:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:48,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:48,793 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 02:06:48,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:48,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082671143] [2022-12-13 02:06:48,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082671143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:48,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:48,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:48,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980772145] [2022-12-13 02:06:48,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:48,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:48,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:48,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:48,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:48,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:48,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:48,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:48,844 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:48,844 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:48,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:48,845 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:48,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:48,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:48,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:48,846 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:48,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:48,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:48,846 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:48,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:48,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:48,847 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:48,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:48,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:48,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,850 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:48,850 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:48,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:48,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:48,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:48,966 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:48,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:48,968 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:48,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:48,968 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:48,968 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:48,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2507 [2022-12-13 02:06:48,968 INFO L420 AbstractCegarLoop]: === Iteration 2509 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash -419777037, now seen corresponding path program 1 times [2022-12-13 02:06:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:48,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920974455] [2022-12-13 02:06:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:49,025 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 02:06:49,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:49,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920974455] [2022-12-13 02:06:49,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920974455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:49,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:49,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:49,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695053454] [2022-12-13 02:06:49,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:49,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:49,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:49,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:49,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:49,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:49,076 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:49,076 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:49,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:49,077 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:49,077 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:49,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:49,077 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:49,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:49,078 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,078 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:49,078 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:49,078 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:49,078 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,079 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:49,079 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:49,079 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,081 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:49,081 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:49,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:49,082 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,082 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:49,199 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:49,200 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:49,200 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:49,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:49,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:49,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2508 [2022-12-13 02:06:49,201 INFO L420 AbstractCegarLoop]: === Iteration 2510 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:49,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -362518735, now seen corresponding path program 1 times [2022-12-13 02:06:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:49,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378368669] [2022-12-13 02:06:49,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:49,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:49,273 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 02:06:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:49,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378368669] [2022-12-13 02:06:49,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378368669] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:49,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:49,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935941585] [2022-12-13 02:06:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:49,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:49,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:49,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:49,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:49,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:49,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:49,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:49,336 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:49,336 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:49,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:49,337 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:49,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:49,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:49,338 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:49,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:49,339 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:49,339 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:49,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:49,339 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:49,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:49,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,342 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:49,342 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:49,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:49,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:49,475 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:49,476 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:06:49,476 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:49,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:49,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:49,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2509 [2022-12-13 02:06:49,477 INFO L420 AbstractCegarLoop]: === Iteration 2511 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:49,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash -305260433, now seen corresponding path program 1 times [2022-12-13 02:06:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:49,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352091356] [2022-12-13 02:06:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:49,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 02:06:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352091356] [2022-12-13 02:06:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352091356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:49,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:49,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:49,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058780475] [2022-12-13 02:06:49,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:49,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:49,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:49,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:49,549 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:49,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:49,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:49,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:49,607 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:49,607 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:49,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:49,607 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:49,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:49,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:49,608 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:49,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:49,609 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:49,609 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:49,609 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:49,609 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,609 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:49,609 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:49,609 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,612 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:49,612 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:49,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:49,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:49,732 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:49,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:06:49,734 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:49,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,734 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:49,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:49,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2510 [2022-12-13 02:06:49,734 INFO L420 AbstractCegarLoop]: === Iteration 2512 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -248002131, now seen corresponding path program 1 times [2022-12-13 02:06:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:49,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676803380] [2022-12-13 02:06:49,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:49,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:49,806 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 02:06:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:49,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676803380] [2022-12-13 02:06:49,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676803380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:49,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:49,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423494082] [2022-12-13 02:06:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:49,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:49,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:49,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:49,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:49,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:49,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:49,852 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:49,852 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:49,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:49,852 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:49,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:49,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:49,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:49,853 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:49,853 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:49,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:49,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:49,854 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,854 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:49,854 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:49,854 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:49,854 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,854 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:49,854 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:49,854 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:49,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,857 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:49,857 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:49,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:49,857 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:49,857 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:49,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:49,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:49,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:49,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:49,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:49,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:49,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2511 [2022-12-13 02:06:49,977 INFO L420 AbstractCegarLoop]: === Iteration 2513 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash -190743829, now seen corresponding path program 1 times [2022-12-13 02:06:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:49,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292005724] [2022-12-13 02:06:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:49,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:50,038 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 02:06:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:50,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292005724] [2022-12-13 02:06:50,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292005724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:50,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:50,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041128836] [2022-12-13 02:06:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:50,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:50,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:50,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:50,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:50,090 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:50,090 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:50,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:50,091 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:50,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:50,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:50,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:50,091 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:50,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:50,092 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,092 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:50,092 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:50,092 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:50,092 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:50,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:50,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,095 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:50,095 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:50,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:50,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,096 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:50,215 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:50,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:06:50,218 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:50,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:50,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:50,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2512 [2022-12-13 02:06:50,218 INFO L420 AbstractCegarLoop]: === Iteration 2514 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -133485527, now seen corresponding path program 1 times [2022-12-13 02:06:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:50,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085089436] [2022-12-13 02:06:50,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:50,282 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 02:06:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:50,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085089436] [2022-12-13 02:06:50,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085089436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:50,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:50,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:50,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696568922] [2022-12-13 02:06:50,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:50,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:50,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:50,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:50,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:50,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:50,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:50,326 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:50,326 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:50,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:50,327 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:50,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:50,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:50,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:50,328 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:50,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:50,328 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:50,329 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:50,329 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:50,329 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,329 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:50,329 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:50,329 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,332 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:50,332 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:50,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:50,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:50,458 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:50,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:06:50,460 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:50,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,460 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:50,460 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:50,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2513 [2022-12-13 02:06:50,460 INFO L420 AbstractCegarLoop]: === Iteration 2515 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -76227225, now seen corresponding path program 1 times [2022-12-13 02:06:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:50,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905223037] [2022-12-13 02:06:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:50,536 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 02:06:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:50,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905223037] [2022-12-13 02:06:50,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905223037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:50,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:50,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:50,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368844303] [2022-12-13 02:06:50,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:50,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:50,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:50,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:50,537 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:50,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:50,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:50,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:50,596 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:50,596 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:50,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:50,597 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:50,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:50,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:50,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:50,598 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:50,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:50,599 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:50,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:50,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:50,600 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,600 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:50,600 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:50,600 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,603 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:50,604 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:50,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:50,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:50,735 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:50,736 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:06:50,736 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:50,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,736 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:50,736 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:50,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2514 [2022-12-13 02:06:50,737 INFO L420 AbstractCegarLoop]: === Iteration 2516 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:50,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:50,737 INFO L85 PathProgramCache]: Analyzing trace with hash -18968923, now seen corresponding path program 1 times [2022-12-13 02:06:50,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:50,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910909624] [2022-12-13 02:06:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:50,809 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 02:06:50,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:50,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910909624] [2022-12-13 02:06:50,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910909624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:50,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:50,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25162510] [2022-12-13 02:06:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:50,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:50,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:50,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:50,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:50,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:50,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:50,904 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:50,904 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:50,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:50,905 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:50,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:50,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:50,906 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:50,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:50,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:50,907 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,907 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:50,907 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:50,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:50,907 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,907 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:50,907 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:50,907 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:50,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,910 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:50,910 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:50,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:50,910 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:50,910 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:51,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:51,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 157 [2022-12-13 02:06:51,064 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:51,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:51,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:51,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2515 [2022-12-13 02:06:51,065 INFO L420 AbstractCegarLoop]: === Iteration 2517 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 38289379, now seen corresponding path program 1 times [2022-12-13 02:06:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:51,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105226731] [2022-12-13 02:06:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:51,133 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 02:06:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:51,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105226731] [2022-12-13 02:06:51,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105226731] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:51,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:51,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240759894] [2022-12-13 02:06:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:51,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:51,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:51,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:51,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:51,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:51,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:51,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:51,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:51,188 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:51,188 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:51,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:51,189 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:51,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:51,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:51,204 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:51,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:51,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:51,205 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,205 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:51,205 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:51,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:51,205 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:51,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:51,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:51,210 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:51,210 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:51,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:51,210 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:51,210 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:51,348 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:51,349 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:06:51,349 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:51,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:51,350 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:51,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2516 [2022-12-13 02:06:51,350 INFO L420 AbstractCegarLoop]: === Iteration 2518 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash 95547681, now seen corresponding path program 1 times [2022-12-13 02:06:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:51,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683267738] [2022-12-13 02:06:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:51,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:51,424 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 02:06:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:51,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683267738] [2022-12-13 02:06:51,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683267738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:51,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:51,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591874715] [2022-12-13 02:06:51,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:51,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:51,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:51,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:51,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:51,479 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:51,479 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:51,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:51,480 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:51,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:51,480 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:51,480 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:51,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:51,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:51,481 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,481 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:51,481 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:51,481 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:51,481 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,481 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:51,481 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:51,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:51,484 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:51,484 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:51,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:51,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:51,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:51,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:51,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:51,620 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:51,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:51,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2517 [2022-12-13 02:06:51,621 INFO L420 AbstractCegarLoop]: === Iteration 2519 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 152805983, now seen corresponding path program 1 times [2022-12-13 02:06:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:51,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592395480] [2022-12-13 02:06:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:51,686 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 02:06:51,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592395480] [2022-12-13 02:06:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592395480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:51,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:51,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245437481] [2022-12-13 02:06:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:51,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:51,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:51,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:51,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:51,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:51,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:51,750 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:51,750 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:51,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:51,751 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:51,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:51,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:51,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:51,751 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:51,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:51,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:51,752 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,752 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:51,752 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:51,752 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:51,753 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,753 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:51,753 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:51,753 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:51,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:51,755 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:51,755 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:51,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:51,756 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:51,756 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:51,891 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:51,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:51,892 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:51,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:51,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:51,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2518 [2022-12-13 02:06:51,893 INFO L420 AbstractCegarLoop]: === Iteration 2520 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:51,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 210064285, now seen corresponding path program 1 times [2022-12-13 02:06:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:51,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872419667] [2022-12-13 02:06:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:51,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:51,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 02:06:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:51,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872419667] [2022-12-13 02:06:51,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872419667] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:51,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:51,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183170674] [2022-12-13 02:06:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:51,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:51,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:51,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:51,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:51,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:51,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:51,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:51,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:51,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:52,048 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:52,048 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:52,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:52,049 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:52,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:52,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:52,050 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:52,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:52,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:52,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:52,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:52,051 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:52,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:52,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,054 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:52,054 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:52,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:52,054 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,054 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:52,191 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:52,192 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:52,192 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:52,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:52,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:52,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2519 [2022-12-13 02:06:52,192 INFO L420 AbstractCegarLoop]: === Iteration 2521 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash 267322587, now seen corresponding path program 1 times [2022-12-13 02:06:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:52,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943845713] [2022-12-13 02:06:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:52,259 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 02:06:52,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:52,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943845713] [2022-12-13 02:06:52,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943845713] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:52,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:52,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298300861] [2022-12-13 02:06:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:52,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:52,260 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:52,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:52,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:52,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:52,320 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:52,321 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:52,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:52,321 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:52,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:52,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:52,322 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:52,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:52,323 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:52,323 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:52,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:52,323 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:52,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:52,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,326 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:52,326 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:52,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:52,327 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,327 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:52,462 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:52,463 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:52,463 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:52,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,463 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:52,463 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:52,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2520 [2022-12-13 02:06:52,463 INFO L420 AbstractCegarLoop]: === Iteration 2522 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:52,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:52,463 INFO L85 PathProgramCache]: Analyzing trace with hash 324580889, now seen corresponding path program 1 times [2022-12-13 02:06:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:52,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639599443] [2022-12-13 02:06:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:52,539 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 02:06:52,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:52,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639599443] [2022-12-13 02:06:52,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639599443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:52,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:52,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270877] [2022-12-13 02:06:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:52,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:52,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:52,540 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:52,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:52,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:52,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:52,588 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:52,588 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:52,588 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:52,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:52,589 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:52,589 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:52,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:52,590 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,590 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:52,590 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:52,590 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:52,590 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,590 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:52,590 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:52,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,593 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:52,593 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:52,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:52,593 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,594 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:52,715 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:52,716 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:06:52,716 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:52,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,716 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:52,716 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:52,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2521 [2022-12-13 02:06:52,716 INFO L420 AbstractCegarLoop]: === Iteration 2523 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:52,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:52,716 INFO L85 PathProgramCache]: Analyzing trace with hash 381839191, now seen corresponding path program 1 times [2022-12-13 02:06:52,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:52,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053298412] [2022-12-13 02:06:52,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:52,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:52,774 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 02:06:52,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:52,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053298412] [2022-12-13 02:06:52,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053298412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:52,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:52,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76233116] [2022-12-13 02:06:52,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:52,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:52,775 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:52,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:52,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:52,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:52,819 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:52,819 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:52,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:52,820 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:52,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:52,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:52,820 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:52,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:52,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:52,821 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,821 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:52,821 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:52,821 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:52,821 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,821 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:52,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:52,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:52,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,824 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:52,824 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:52,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:52,824 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:52,824 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:52,941 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:52,942 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:52,942 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:52,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:52,942 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:52,942 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:52,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2522 [2022-12-13 02:06:52,942 INFO L420 AbstractCegarLoop]: === Iteration 2524 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:52,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:52,942 INFO L85 PathProgramCache]: Analyzing trace with hash 439097493, now seen corresponding path program 1 times [2022-12-13 02:06:52,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:52,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633562368] [2022-12-13 02:06:52,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:52,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:53,011 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 02:06:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:53,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633562368] [2022-12-13 02:06:53,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633562368] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:53,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:53,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:53,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797825613] [2022-12-13 02:06:53,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:53,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:53,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:53,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:53,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:53,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:53,054 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:53,055 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:53,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:53,055 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:53,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:53,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:53,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:53,056 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:53,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:53,056 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,056 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:53,057 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:53,057 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:53,057 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,057 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:53,057 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:53,057 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,060 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:53,060 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:53,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:53,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:53,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:53,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:53,178 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:53,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,178 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:53,178 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:53,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2523 [2022-12-13 02:06:53,178 INFO L420 AbstractCegarLoop]: === Iteration 2525 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 496355795, now seen corresponding path program 1 times [2022-12-13 02:06:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:53,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640234421] [2022-12-13 02:06:53,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:53,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 02:06:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640234421] [2022-12-13 02:06:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640234421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:53,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:53,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897352262] [2022-12-13 02:06:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:53,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:53,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:53,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:53,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:53,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:53,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:53,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:53,292 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:53,292 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:53,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:53,293 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:53,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:53,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:53,293 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:53,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:53,294 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,294 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:53,294 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:53,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:53,294 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:53,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:53,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,297 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:53,297 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:53,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:53,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:53,414 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:53,415 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:53,415 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:53,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,415 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:53,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:53,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2524 [2022-12-13 02:06:53,415 INFO L420 AbstractCegarLoop]: === Iteration 2526 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:53,415 INFO L85 PathProgramCache]: Analyzing trace with hash 553614097, now seen corresponding path program 1 times [2022-12-13 02:06:53,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:53,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632294099] [2022-12-13 02:06:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:53,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:53,470 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 02:06:53,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:53,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632294099] [2022-12-13 02:06:53,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632294099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:53,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:53,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673644366] [2022-12-13 02:06:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:53,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:53,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:53,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:53,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:53,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:53,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:53,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:53,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:53,516 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:53,517 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:53,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:53,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:53,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:53,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:53,518 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:53,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:53,519 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,519 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:53,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:53,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:53,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:53,520 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:53,520 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,523 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:53,523 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:53,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:53,523 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,523 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:53,639 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:53,640 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:53,640 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:53,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,640 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:53,640 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:53,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2525 [2022-12-13 02:06:53,640 INFO L420 AbstractCegarLoop]: === Iteration 2527 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash 610872399, now seen corresponding path program 1 times [2022-12-13 02:06:53,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:53,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083146185] [2022-12-13 02:06:53,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:53,697 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 02:06:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:53,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083146185] [2022-12-13 02:06:53,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083146185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:53,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:53,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:53,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001367808] [2022-12-13 02:06:53,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:53,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:53,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:53,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:53,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:53,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:53,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:53,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:53,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:53,748 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:53,748 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:53,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:53,748 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:53,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:53,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:53,749 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:53,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:53,750 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:53,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:53,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:53,750 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:53,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:53,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,753 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:53,753 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:53,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:53,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:53,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:53,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:53,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:06:53,870 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:53,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:53,870 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:53,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2526 [2022-12-13 02:06:53,870 INFO L420 AbstractCegarLoop]: === Iteration 2528 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:53,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 668130701, now seen corresponding path program 1 times [2022-12-13 02:06:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:53,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619721157] [2022-12-13 02:06:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:53,932 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 02:06:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619721157] [2022-12-13 02:06:53,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619721157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:53,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:53,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950799927] [2022-12-13 02:06:53,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:53,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:53,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:53,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:53,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:53,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:53,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:53,996 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:53,997 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:53,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:53,997 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:53,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:53,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:53,998 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:53,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:53,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:53,999 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:53,999 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:53,999 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:54,000 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:54,000 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,000 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:54,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:54,000 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,004 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:54,004 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:54,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:54,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:54,137 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:54,138 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:54,138 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:54,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,138 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:54,138 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:54,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2527 [2022-12-13 02:06:54,139 INFO L420 AbstractCegarLoop]: === Iteration 2529 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:54,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:54,139 INFO L85 PathProgramCache]: Analyzing trace with hash 725389003, now seen corresponding path program 1 times [2022-12-13 02:06:54,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:54,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789541479] [2022-12-13 02:06:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:54,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:54,213 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 02:06:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:54,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789541479] [2022-12-13 02:06:54,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789541479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:54,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:54,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904744884] [2022-12-13 02:06:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:54,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:54,214 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:54,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:54,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:54,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:54,267 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:54,267 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:54,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:54,268 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:54,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:54,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:54,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:54,269 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:54,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:54,270 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:54,270 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:54,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:54,270 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:54,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:54,271 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,274 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:54,274 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:54,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:54,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,274 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:54,408 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:54,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:54,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:54,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:54,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:54,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2528 [2022-12-13 02:06:54,409 INFO L420 AbstractCegarLoop]: === Iteration 2530 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 782647305, now seen corresponding path program 1 times [2022-12-13 02:06:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:54,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347129945] [2022-12-13 02:06:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:54,480 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 02:06:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:54,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347129945] [2022-12-13 02:06:54,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347129945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:54,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:54,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:54,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573288841] [2022-12-13 02:06:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:54,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:54,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:54,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:54,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:54,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:54,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:54,530 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:54,530 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:54,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:54,531 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:54,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:54,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:54,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:54,531 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:54,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:54,532 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,532 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:54,532 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:54,532 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:54,532 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,533 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:54,533 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:54,533 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,535 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:54,535 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:54,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:54,536 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,536 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:54,652 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:54,653 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:54,653 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:54,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,653 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:54,653 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:54,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2529 [2022-12-13 02:06:54,653 INFO L420 AbstractCegarLoop]: === Iteration 2531 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:54,654 INFO L85 PathProgramCache]: Analyzing trace with hash 839905607, now seen corresponding path program 1 times [2022-12-13 02:06:54,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:54,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394183940] [2022-12-13 02:06:54,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:54,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:54,711 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 02:06:54,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:54,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394183940] [2022-12-13 02:06:54,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394183940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:54,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:54,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:54,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511071261] [2022-12-13 02:06:54,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:54,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:54,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:54,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:54,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:54,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:54,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:54,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:54,763 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:54,763 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:54,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:54,763 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:54,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:54,764 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:54,764 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:54,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:54,765 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,765 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:54,765 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:54,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:54,765 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:54,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:54,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,768 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:54,768 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:54,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:54,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:54,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:54,884 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:54,886 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:54,886 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:54,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,886 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:54,886 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:54,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2530 [2022-12-13 02:06:54,886 INFO L420 AbstractCegarLoop]: === Iteration 2532 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 897163909, now seen corresponding path program 1 times [2022-12-13 02:06:54,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:54,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135058963] [2022-12-13 02:06:54,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:54,945 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 02:06:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:54,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135058963] [2022-12-13 02:06:54,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135058963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:54,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:54,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626277497] [2022-12-13 02:06:54,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:54,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:54,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:54,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:54,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:54,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:54,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:54,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:54,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:54,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:54,995 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:54,995 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:54,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:54,995 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:54,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:54,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:54,996 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:54,996 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:54,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:54,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:54,997 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,997 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:54,997 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:54,997 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:54,997 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:54,997 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:54,997 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:54,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,000 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:55,000 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:55,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:55,000 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,000 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:55,118 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:55,119 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:55,119 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:55,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,119 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:55,119 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:55,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2531 [2022-12-13 02:06:55,119 INFO L420 AbstractCegarLoop]: === Iteration 2533 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:55,119 INFO L85 PathProgramCache]: Analyzing trace with hash 954422211, now seen corresponding path program 1 times [2022-12-13 02:06:55,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:55,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760916040] [2022-12-13 02:06:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:55,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:55,188 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 02:06:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:55,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760916040] [2022-12-13 02:06:55,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760916040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:55,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:55,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041097188] [2022-12-13 02:06:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:55,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:55,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:55,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:55,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:55,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:55,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:55,242 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:55,242 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:55,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:55,242 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:55,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:55,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:55,243 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:55,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:55,244 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,244 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:55,244 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:55,244 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:55,244 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:55,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:55,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,247 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:55,247 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:55,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:55,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:55,366 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:55,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:06:55,367 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:55,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:55,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:55,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2532 [2022-12-13 02:06:55,367 INFO L420 AbstractCegarLoop]: === Iteration 2534 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:55,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1011680513, now seen corresponding path program 1 times [2022-12-13 02:06:55,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:55,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041549280] [2022-12-13 02:06:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:55,424 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 02:06:55,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:55,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041549280] [2022-12-13 02:06:55,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041549280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:55,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:55,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240130784] [2022-12-13 02:06:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:55,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:55,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:55,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:55,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:55,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:55,476 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:55,476 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:55,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:55,477 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:55,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:55,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:55,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:55,478 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:55,478 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:55,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:55,478 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,478 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:55,479 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:55,479 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:55,479 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,479 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:55,479 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:55,479 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,481 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:55,482 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:55,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:55,482 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,482 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:55,599 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:55,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:06:55,600 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:55,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,601 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:55,601 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:55,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2533 [2022-12-13 02:06:55,601 INFO L420 AbstractCegarLoop]: === Iteration 2535 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1068938815, now seen corresponding path program 1 times [2022-12-13 02:06:55,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:55,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694182432] [2022-12-13 02:06:55,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:55,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:55,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:55,659 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 02:06:55,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694182432] [2022-12-13 02:06:55,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694182432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:55,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:55,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271860063] [2022-12-13 02:06:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:55,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:55,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:55,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:55,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:55,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:55,703 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:55,703 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:55,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:55,704 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:55,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:55,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:55,705 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:55,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:55,705 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,705 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:55,706 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:55,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:55,706 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,706 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:55,706 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:55,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,708 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:55,709 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:55,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:55,709 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,709 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:55,827 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:55,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:55,828 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:55,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:55,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2534 [2022-12-13 02:06:55,828 INFO L420 AbstractCegarLoop]: === Iteration 2536 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1126197117, now seen corresponding path program 1 times [2022-12-13 02:06:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:55,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399866714] [2022-12-13 02:06:55,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:55,894 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 02:06:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:55,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399866714] [2022-12-13 02:06:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399866714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:55,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992988484] [2022-12-13 02:06:55,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:55,895 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:55,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:55,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:55,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:55,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:55,948 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:55,948 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:55,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:55,949 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:55,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:55,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:55,949 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:55,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:55,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:55,950 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,950 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:55,950 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:55,950 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:55,950 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:55,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:55,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:55,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,953 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:55,953 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:55,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:55,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:55,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:56,074 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:56,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:06:56,075 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:56,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:56,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:56,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2535 [2022-12-13 02:06:56,075 INFO L420 AbstractCegarLoop]: === Iteration 2537 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1183455419, now seen corresponding path program 1 times [2022-12-13 02:06:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:56,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724816671] [2022-12-13 02:06:56,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:56,135 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 02:06:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:56,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724816671] [2022-12-13 02:06:56,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724816671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:56,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:56,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531681991] [2022-12-13 02:06:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:56,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:56,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:56,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:56,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:56,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:56,185 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:56,185 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:56,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:56,186 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:56,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:56,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:56,187 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:56,188 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:56,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:56,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:56,188 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:56,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:56,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,191 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:56,191 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:56,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:56,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:56,313 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:56,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:06:56,314 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:56,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:56,314 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:56,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2536 [2022-12-13 02:06:56,314 INFO L420 AbstractCegarLoop]: === Iteration 2538 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:56,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:56,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1240713721, now seen corresponding path program 1 times [2022-12-13 02:06:56,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:56,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75329527] [2022-12-13 02:06:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:56,382 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 02:06:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:56,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75329527] [2022-12-13 02:06:56,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75329527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:56,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:56,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140515296] [2022-12-13 02:06:56,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:56,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:56,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:56,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:56,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:56,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:56,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:56,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:56,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:56,430 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:56,430 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:56,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:56,431 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:56,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:56,431 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:56,432 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:56,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:56,433 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:56,433 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:56,433 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:56,433 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:56,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:56,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,437 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:56,437 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:56,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:56,438 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,438 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:56,559 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:56,560 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:06:56,560 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:56,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:56,560 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:56,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2537 [2022-12-13 02:06:56,560 INFO L420 AbstractCegarLoop]: === Iteration 2539 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:56,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1297972023, now seen corresponding path program 1 times [2022-12-13 02:06:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:56,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704491471] [2022-12-13 02:06:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:56,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704491471] [2022-12-13 02:06:56,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704491471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:56,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:56,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236950890] [2022-12-13 02:06:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:56,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:56,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:56,621 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:56,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:56,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:56,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:56,664 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:56,665 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:56,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:56,665 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:56,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:56,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:56,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:56,666 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:56,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:56,666 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,667 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:56,667 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:56,667 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:56,667 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:56,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:56,667 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,670 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:56,670 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:56,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:56,670 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,670 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:56,863 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:56,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 197 [2022-12-13 02:06:56,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:56,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:56,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:56,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2538 [2022-12-13 02:06:56,865 INFO L420 AbstractCegarLoop]: === Iteration 2540 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:56,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1355230325, now seen corresponding path program 1 times [2022-12-13 02:06:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:56,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270171639] [2022-12-13 02:06:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:06:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270171639] [2022-12-13 02:06:56,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270171639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:56,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:56,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756431601] [2022-12-13 02:06:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:56,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:56,924 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:56,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:56,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:56,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:56,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:56,976 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:56,976 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:56,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:56,977 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:56,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:56,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:56,977 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:56,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:56,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:56,978 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:56,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:56,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:56,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,978 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:56,978 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:56,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:56,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,981 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:56,981 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:56,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:56,981 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:56,981 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:57,115 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:57,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:57,117 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:57,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,117 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:57,117 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:57,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2539 [2022-12-13 02:06:57,117 INFO L420 AbstractCegarLoop]: === Iteration 2541 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1412488627, now seen corresponding path program 1 times [2022-12-13 02:06:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:57,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708421060] [2022-12-13 02:06:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:57,184 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 02:06:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:57,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708421060] [2022-12-13 02:06:57,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708421060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:57,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:57,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879420570] [2022-12-13 02:06:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:57,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:57,185 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:57,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:57,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:57,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:57,237 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:57,237 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:57,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:57,237 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:57,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:57,238 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:57,238 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:57,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:57,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:57,239 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,239 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:57,239 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:57,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:57,239 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:57,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:57,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:57,243 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:57,243 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:57,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:57,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:57,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:57,407 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:57,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-13 02:06:57,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:57,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:57,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:57,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2540 [2022-12-13 02:06:57,410 INFO L420 AbstractCegarLoop]: === Iteration 2542 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:57,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1469746929, now seen corresponding path program 1 times [2022-12-13 02:06:57,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:57,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355284877] [2022-12-13 02:06:57,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:57,508 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 02:06:57,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:57,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355284877] [2022-12-13 02:06:57,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355284877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:57,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:57,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:57,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583720146] [2022-12-13 02:06:57,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:57,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:57,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:57,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:57,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:57,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:57,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:57,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:57,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:57,565 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:57,565 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:57,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:57,565 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:57,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:57,566 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:57,566 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:57,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:57,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:57,567 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:57,568 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:57,568 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:57,568 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:57,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:57,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:57,572 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:57,572 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:57,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:57,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:57,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:57,709 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:57,710 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:06:57,710 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:57,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,711 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:57,711 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:57,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2541 [2022-12-13 02:06:57,711 INFO L420 AbstractCegarLoop]: === Iteration 2543 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1527005231, now seen corresponding path program 1 times [2022-12-13 02:06:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:57,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915983691] [2022-12-13 02:06:57,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:57,776 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 02:06:57,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:57,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915983691] [2022-12-13 02:06:57,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915983691] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:57,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:57,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:57,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135492150] [2022-12-13 02:06:57,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:57,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:57,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:57,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:57,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:57,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:57,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:57,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:57,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:57,833 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:57,833 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:57,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:57,834 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:57,834 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:57,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:57,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:57,835 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:57,835 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:57,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:57,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:57,836 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,836 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:57,836 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:57,836 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:57,836 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:57,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:57,836 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:57,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:57,839 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:57,839 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:57,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:57,839 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:57,839 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:57,975 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:57,976 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:06:57,976 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:57,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:57,976 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:57,976 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:57,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2542 [2022-12-13 02:06:57,976 INFO L420 AbstractCegarLoop]: === Iteration 2544 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1584263533, now seen corresponding path program 1 times [2022-12-13 02:06:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:57,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094171168] [2022-12-13 02:06:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:58,051 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 02:06:58,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:58,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094171168] [2022-12-13 02:06:58,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094171168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:58,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:58,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:58,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483324868] [2022-12-13 02:06:58,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:58,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:58,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:58,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:58,052 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:58,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:58,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:58,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:58,107 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:58,108 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:58,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:58,108 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:58,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:58,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:58,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:58,109 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:58,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:58,110 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,110 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:58,110 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:58,110 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:58,110 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,110 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:58,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:58,110 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,113 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:58,113 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:58,113 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,114 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:58,250 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:58,251 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:06:58,251 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:58,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,252 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:58,252 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:58,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2543 [2022-12-13 02:06:58,252 INFO L420 AbstractCegarLoop]: === Iteration 2545 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:58,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1641521835, now seen corresponding path program 1 times [2022-12-13 02:06:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:58,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789159643] [2022-12-13 02:06:58,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:58,336 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 02:06:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:58,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789159643] [2022-12-13 02:06:58,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789159643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:58,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:58,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021124531] [2022-12-13 02:06:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:58,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:58,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:58,337 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:58,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:58,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:58,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:58,391 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:58,391 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:58,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:58,392 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:58,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:58,392 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:58,392 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:58,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:58,394 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:58,394 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:58,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:58,394 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:58,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:58,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,398 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:58,398 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:58,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:58,398 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,398 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:58,532 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:58,533 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:58,533 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:58,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,533 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:58,533 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:58,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2544 [2022-12-13 02:06:58,534 INFO L420 AbstractCegarLoop]: === Iteration 2546 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1698780137, now seen corresponding path program 1 times [2022-12-13 02:06:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:58,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825854836] [2022-12-13 02:06:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:58,607 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 02:06:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825854836] [2022-12-13 02:06:58,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825854836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:58,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:58,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539727344] [2022-12-13 02:06:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:58,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:58,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:58,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:58,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:58,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:58,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:58,658 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:58,659 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:58,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:58,659 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:58,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:58,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:58,660 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:58,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:58,661 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:58,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:58,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:58,661 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:58,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:58,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,664 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:58,664 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:58,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:58,664 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,664 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:58,797 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:58,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:06:58,799 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:58,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:58,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:58,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2545 [2022-12-13 02:06:58,799 INFO L420 AbstractCegarLoop]: === Iteration 2547 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:58,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:58,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1756038439, now seen corresponding path program 1 times [2022-12-13 02:06:58,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:58,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413346090] [2022-12-13 02:06:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:58,865 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 02:06:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:58,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413346090] [2022-12-13 02:06:58,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413346090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:58,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:58,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232872178] [2022-12-13 02:06:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:58,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:58,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:58,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:58,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:58,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:58,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:58,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:58,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:58,918 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:58,918 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:58,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:58,919 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:58,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:58,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:58,919 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:58,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:58,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:58,920 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:58,920 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:58,920 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:58,920 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,920 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:58,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:58,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:58,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,923 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:58,923 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:58,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:58,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:58,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:59,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:59,059 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:59,059 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:59,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:59,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2546 [2022-12-13 02:06:59,059 INFO L420 AbstractCegarLoop]: === Iteration 2548 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1813296741, now seen corresponding path program 1 times [2022-12-13 02:06:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869812703] [2022-12-13 02:06:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:59,150 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 02:06:59,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:59,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869812703] [2022-12-13 02:06:59,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869812703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:59,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:59,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:59,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999646069] [2022-12-13 02:06:59,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:59,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:59,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:59,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:59,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:59,151 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:59,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:59,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:59,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:59,212 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:59,213 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:06:59,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:59,213 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:59,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:59,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:59,214 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:59,214 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:59,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:59,215 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,215 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:59,215 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:59,215 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:59,215 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:59,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:59,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,218 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:59,218 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:59,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:59,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:59,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:59,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:06:59,354 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:59,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,354 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:59,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:59,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2547 [2022-12-13 02:06:59,354 INFO L420 AbstractCegarLoop]: === Iteration 2549 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1870555043, now seen corresponding path program 1 times [2022-12-13 02:06:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:59,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858351443] [2022-12-13 02:06:59,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:59,426 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 02:06:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:59,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858351443] [2022-12-13 02:06:59,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858351443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:59,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:59,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244060989] [2022-12-13 02:06:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:59,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:59,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:59,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:59,428 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:59,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:59,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:59,479 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:59,480 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:59,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:59,480 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:59,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:59,481 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:59,481 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:59,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:59,482 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,482 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:59,482 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:59,482 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:59,482 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,482 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:59,482 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:59,482 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,485 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:59,485 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:59,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:59,485 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,485 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:59,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:59,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:06:59,617 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:59,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,617 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:59,617 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:59,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2548 [2022-12-13 02:06:59,618 INFO L420 AbstractCegarLoop]: === Iteration 2550 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1927813345, now seen corresponding path program 1 times [2022-12-13 02:06:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:59,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555172322] [2022-12-13 02:06:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:59,683 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 02:06:59,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:59,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555172322] [2022-12-13 02:06:59,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555172322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:59,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:59,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:59,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722366477] [2022-12-13 02:06:59,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:59,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:59,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:59,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:59,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:59,684 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:59,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:59,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:59,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:59,736 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:59,736 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:59,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:59,737 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:59,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:59,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:59,737 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:59,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:59,738 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,738 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:59,738 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:59,739 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:59,739 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,739 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:59,739 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:59,739 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,741 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:59,742 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:06:59,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:59,742 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,742 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:06:59,860 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:06:59,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:06:59,861 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:06:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:06:59,861 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:06:59,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2549 [2022-12-13 02:06:59,862 INFO L420 AbstractCegarLoop]: === Iteration 2551 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:06:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:06:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1985071647, now seen corresponding path program 1 times [2022-12-13 02:06:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:06:59,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803247199] [2022-12-13 02:06:59,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:06:59,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:06:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:06:59,930 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 02:06:59,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:06:59,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803247199] [2022-12-13 02:06:59,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803247199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:06:59,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:06:59,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:06:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784224220] [2022-12-13 02:06:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:06:59,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:06:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:06:59,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:06:59,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:06:59,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:06:59,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:06:59,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:06:59,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:06:59,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:06:59,992 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:06:59,992 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:06:59,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:06:59,993 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:06:59,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:06:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:06:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:06:59,993 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:06:59,993 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:06:59,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:06:59,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:06:59,994 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,994 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:06:59,994 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:06:59,994 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:06:59,994 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,995 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:06:59,995 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:06:59,995 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:06:59,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,997 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:06:59,997 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:06:59,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:06:59,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:06:59,998 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:00,133 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:00,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:00,135 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:00,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:00,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:00,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2550 [2022-12-13 02:07:00,135 INFO L420 AbstractCegarLoop]: === Iteration 2552 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2042329949, now seen corresponding path program 1 times [2022-12-13 02:07:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:00,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284582055] [2022-12-13 02:07:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:00,208 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 02:07:00,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:00,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284582055] [2022-12-13 02:07:00,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284582055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:00,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:00,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:00,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087883416] [2022-12-13 02:07:00,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:00,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:00,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:00,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:00,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:00,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:00,271 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:00,271 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:00,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:00,272 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:00,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:00,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:00,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:00,272 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:00,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:00,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:00,273 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:00,273 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:00,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:00,273 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,274 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:00,274 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:00,274 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:00,276 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:00,276 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:00,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:00,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:00,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:00,411 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:00,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:00,412 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:00,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:00,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:00,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2551 [2022-12-13 02:07:00,412 INFO L420 AbstractCegarLoop]: === Iteration 2553 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2099588251, now seen corresponding path program 1 times [2022-12-13 02:07:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:00,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990533307] [2022-12-13 02:07:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:00,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:00,482 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 02:07:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:00,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990533307] [2022-12-13 02:07:00,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990533307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:00,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:00,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482254819] [2022-12-13 02:07:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:00,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:00,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:00,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:00,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:00,535 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:00,535 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:00,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:00,536 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:00,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:00,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:00,536 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:00,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:00,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:00,537 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:00,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:00,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:00,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:00,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:00,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:00,540 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:00,540 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:00,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:00,541 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:00,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:00,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:00,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:00,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:00,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:00,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2552 [2022-12-13 02:07:00,661 INFO L420 AbstractCegarLoop]: === Iteration 2554 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2138120743, now seen corresponding path program 1 times [2022-12-13 02:07:00,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592346920] [2022-12-13 02:07:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:00,732 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 02:07:00,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:00,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592346920] [2022-12-13 02:07:00,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592346920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:00,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:00,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:00,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091935279] [2022-12-13 02:07:00,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:00,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:00,733 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:00,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:00,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:00,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:00,783 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:00,783 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:00,784 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:00,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:00,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:00,784 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:00,784 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:00,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:00,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:00,785 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:00,785 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:00,785 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:00,785 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,785 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:00,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:00,786 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:00,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:00,788 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:00,788 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:00,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:00,789 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:00,789 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:00,906 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:00,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:00,907 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,907 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:00,907 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:00,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2553 [2022-12-13 02:07:00,908 INFO L420 AbstractCegarLoop]: === Iteration 2555 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:00,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:00,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2080862441, now seen corresponding path program 1 times [2022-12-13 02:07:00,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:00,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154248430] [2022-12-13 02:07:00,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:00,967 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 02:07:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:00,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154248430] [2022-12-13 02:07:00,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154248430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:00,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:00,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770048716] [2022-12-13 02:07:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:00,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:00,968 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:00,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:00,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:00,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:00,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:01,017 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:01,018 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:01,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:01,018 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:01,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:01,019 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:01,019 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:01,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:01,019 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:01,020 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:01,020 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:01,020 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,020 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:01,020 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:01,020 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,022 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:01,023 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:01,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:01,023 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,023 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:01,138 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:01,139 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:01,139 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:01,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,139 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:01,139 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:01,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2554 [2022-12-13 02:07:01,139 INFO L420 AbstractCegarLoop]: === Iteration 2556 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:01,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2023604139, now seen corresponding path program 1 times [2022-12-13 02:07:01,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:01,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766687673] [2022-12-13 02:07:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:01,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:01,198 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 02:07:01,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:01,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766687673] [2022-12-13 02:07:01,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766687673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:01,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:01,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717129778] [2022-12-13 02:07:01,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:01,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:01,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:01,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:01,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:01,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:01,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:01,249 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:01,249 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:01,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:01,249 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:01,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:01,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:01,250 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:01,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:01,251 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:01,251 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:01,251 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:01,251 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,251 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:01,251 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:01,251 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,254 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:01,254 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:01,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:01,254 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,254 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:01,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:01,372 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:01,372 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:01,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,372 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:01,372 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:01,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2555 [2022-12-13 02:07:01,372 INFO L420 AbstractCegarLoop]: === Iteration 2557 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:01,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1966345837, now seen corresponding path program 1 times [2022-12-13 02:07:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729856984] [2022-12-13 02:07:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:01,432 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 02:07:01,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:01,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729856984] [2022-12-13 02:07:01,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729856984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:01,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:01,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010358061] [2022-12-13 02:07:01,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:01,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:01,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:01,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:01,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:01,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:01,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:01,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:01,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:01,483 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:01,483 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:01,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:01,484 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:01,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:01,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:01,484 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:01,484 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:01,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:01,485 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,485 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:01,485 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:01,485 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:01,485 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,485 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:01,485 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:01,486 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,488 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:01,488 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:01,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:01,488 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:01,605 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:01,606 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:01,606 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:01,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:01,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2556 [2022-12-13 02:07:01,606 INFO L420 AbstractCegarLoop]: === Iteration 2558 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:01,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1909087535, now seen corresponding path program 1 times [2022-12-13 02:07:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:01,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552158950] [2022-12-13 02:07:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:01,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:01,666 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 02:07:01,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:01,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552158950] [2022-12-13 02:07:01,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552158950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:01,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:01,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649794013] [2022-12-13 02:07:01,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:01,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:01,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:01,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:01,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:01,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:01,717 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:01,717 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:01,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:01,718 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:01,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:01,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:01,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:01,718 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:01,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:01,719 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:01,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:01,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:01,720 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,720 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:01,720 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:01,720 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,722 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:01,722 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:01,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:01,723 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,723 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:01,842 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:01,843 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:01,843 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:01,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:01,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:01,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2557 [2022-12-13 02:07:01,843 INFO L420 AbstractCegarLoop]: === Iteration 2559 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:01,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1851829233, now seen corresponding path program 1 times [2022-12-13 02:07:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:01,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624749819] [2022-12-13 02:07:01,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:01,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:01,901 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 02:07:01,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:01,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624749819] [2022-12-13 02:07:01,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624749819] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:01,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:01,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:01,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143603623] [2022-12-13 02:07:01,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:01,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:01,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:01,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:01,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:01,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:01,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:01,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:01,945 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:01,945 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:01,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:01,945 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:01,946 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:01,946 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:01,946 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:01,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:01,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:01,947 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,947 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:01,947 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:01,947 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:01,947 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,947 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:01,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:01,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:01,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,950 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:01,950 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:01,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:01,950 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:01,950 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:02,092 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:02,093 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:07:02,093 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:02,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,093 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:02,093 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:02,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2558 [2022-12-13 02:07:02,093 INFO L420 AbstractCegarLoop]: === Iteration 2560 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1794570931, now seen corresponding path program 1 times [2022-12-13 02:07:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:02,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702614225] [2022-12-13 02:07:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:02,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:02,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702614225] [2022-12-13 02:07:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702614225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:02,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:02,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:02,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71762891] [2022-12-13 02:07:02,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:02,160 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:02,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:02,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:02,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:02,204 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:02,204 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:02,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:02,204 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:02,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:02,205 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:02,205 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:02,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:02,206 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,206 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:02,206 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:02,206 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:02,206 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,206 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:02,206 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:02,206 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,209 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:02,209 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:02,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:02,209 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,209 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:02,348 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:02,349 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:02,349 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:02,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,349 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:02,349 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:02,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2559 [2022-12-13 02:07:02,350 INFO L420 AbstractCegarLoop]: === Iteration 2561 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1737312629, now seen corresponding path program 1 times [2022-12-13 02:07:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:02,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052298383] [2022-12-13 02:07:02,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:02,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:02,423 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 02:07:02,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:02,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052298383] [2022-12-13 02:07:02,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052298383] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:02,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:02,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:02,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481159756] [2022-12-13 02:07:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:02,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:02,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:02,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:02,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:02,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:02,472 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:02,472 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:02,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:02,472 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:02,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:02,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:02,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:02,473 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:02,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:02,474 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:02,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:02,474 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:02,474 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,474 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:02,474 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:02,474 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,477 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:02,477 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:02,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:02,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:02,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:02,609 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:07:02,609 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:02,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:02,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:02,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2560 [2022-12-13 02:07:02,610 INFO L420 AbstractCegarLoop]: === Iteration 2562 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1680054327, now seen corresponding path program 1 times [2022-12-13 02:07:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:02,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724806428] [2022-12-13 02:07:02,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:02,674 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 02:07:02,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:02,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724806428] [2022-12-13 02:07:02,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724806428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:02,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:02,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:02,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012728408] [2022-12-13 02:07:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:02,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:02,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:02,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:02,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:02,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:02,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:02,729 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:02,729 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:02,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:02,730 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:02,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:02,730 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:02,730 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:02,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:02,732 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,732 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:02,732 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:02,732 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:02,732 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,732 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:02,732 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:02,732 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,736 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:02,736 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:02,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:02,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:02,865 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:02,866 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:02,866 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:02,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,867 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:02,867 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:02,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2561 [2022-12-13 02:07:02,867 INFO L420 AbstractCegarLoop]: === Iteration 2563 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:02,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1622796025, now seen corresponding path program 1 times [2022-12-13 02:07:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:02,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270355859] [2022-12-13 02:07:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:02,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:02,934 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 02:07:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:02,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270355859] [2022-12-13 02:07:02,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270355859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:02,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:02,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647981896] [2022-12-13 02:07:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:02,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:02,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:02,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:02,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:02,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:02,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:02,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:02,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:02,978 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:02,978 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:02,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:02,979 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:02,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:02,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:02,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:02,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:02,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:02,980 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:02,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:02,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:02,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:02,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:02,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:02,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,983 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:02,983 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:02,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:02,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:02,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:03,104 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:03,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:03,105 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:03,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:03,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:03,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2562 [2022-12-13 02:07:03,105 INFO L420 AbstractCegarLoop]: === Iteration 2564 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1565537723, now seen corresponding path program 1 times [2022-12-13 02:07:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218690680] [2022-12-13 02:07:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:03,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:03,165 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 02:07:03,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:03,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218690680] [2022-12-13 02:07:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218690680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:03,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:03,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:03,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596821006] [2022-12-13 02:07:03,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:03,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:03,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:03,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:03,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:03,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:03,209 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:03,209 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:03,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:03,209 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:03,209 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:03,210 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:03,210 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:03,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:03,211 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,211 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:03,211 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:03,211 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:03,211 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,211 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:03,211 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:03,211 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,214 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:03,214 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:03,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:03,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:03,331 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:03,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:03,332 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:03,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:03,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:03,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2563 [2022-12-13 02:07:03,332 INFO L420 AbstractCegarLoop]: === Iteration 2565 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:03,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:03,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1508279421, now seen corresponding path program 1 times [2022-12-13 02:07:03,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:03,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698104793] [2022-12-13 02:07:03,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:03,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:03,390 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 02:07:03,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:03,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698104793] [2022-12-13 02:07:03,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698104793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:03,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:03,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:03,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463539855] [2022-12-13 02:07:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:03,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:03,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:03,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:03,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:03,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:03,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:03,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:03,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:03,441 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:03,441 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:03,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:03,441 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:03,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:03,442 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:03,442 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:03,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:03,443 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,443 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:03,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:03,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:03,443 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:03,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:03,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,446 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:03,446 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:03,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:03,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:03,575 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:03,576 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:07:03,576 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:03,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,576 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:03,576 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:03,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2564 [2022-12-13 02:07:03,576 INFO L420 AbstractCegarLoop]: === Iteration 2566 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:03,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1451021119, now seen corresponding path program 1 times [2022-12-13 02:07:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:03,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074007302] [2022-12-13 02:07:03,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:03,636 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 02:07:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:03,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074007302] [2022-12-13 02:07:03,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074007302] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:03,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:03,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889526500] [2022-12-13 02:07:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:03,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:03,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:03,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:03,637 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:03,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:03,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:03,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:03,688 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:03,688 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:03,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:03,688 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:03,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:03,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:03,689 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:03,689 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:03,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:03,690 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,690 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:03,690 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:03,690 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:03,690 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:03,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:03,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,693 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:03,693 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:03,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:03,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:03,815 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:03,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:03,817 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:03,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:03,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:03,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2565 [2022-12-13 02:07:03,817 INFO L420 AbstractCegarLoop]: === Iteration 2567 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1393762817, now seen corresponding path program 1 times [2022-12-13 02:07:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:03,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916039462] [2022-12-13 02:07:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:03,881 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 02:07:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:03,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916039462] [2022-12-13 02:07:03,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916039462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:03,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:03,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940044595] [2022-12-13 02:07:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:03,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:03,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:03,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:03,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:03,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:03,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:03,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:03,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:03,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:03,934 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:03,934 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:03,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:03,934 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:03,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:03,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:03,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:03,935 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:03,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:03,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:03,936 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,936 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:03,936 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:03,936 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:03,936 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,936 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:03,936 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:03,936 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:03,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,939 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:03,939 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:03,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:03,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:03,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:04,082 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:04,083 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 02:07:04,083 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:04,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,083 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:04,083 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:04,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2566 [2022-12-13 02:07:04,083 INFO L420 AbstractCegarLoop]: === Iteration 2568 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:04,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1336504515, now seen corresponding path program 1 times [2022-12-13 02:07:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:04,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511293396] [2022-12-13 02:07:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:04,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511293396] [2022-12-13 02:07:04,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511293396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:04,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:04,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:04,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108730148] [2022-12-13 02:07:04,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:04,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:04,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:04,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:04,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:04,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:04,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:04,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:04,205 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:04,206 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:04,206 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:04,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:04,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:04,207 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:04,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:04,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:04,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:04,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:04,208 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:04,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:04,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:04,211 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:04,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:04,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:04,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:04,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:07:04,338 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:04,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,338 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:04,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:04,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2567 [2022-12-13 02:07:04,339 INFO L420 AbstractCegarLoop]: === Iteration 2569 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:04,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:04,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1279246213, now seen corresponding path program 1 times [2022-12-13 02:07:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:04,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569853310] [2022-12-13 02:07:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:04,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:04,406 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 02:07:04,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:04,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569853310] [2022-12-13 02:07:04,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569853310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:04,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:04,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189318725] [2022-12-13 02:07:04,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:04,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:04,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:04,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:04,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:04,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:04,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:04,460 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:04,461 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:04,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:04,461 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:04,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:04,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:04,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:04,462 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:04,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:04,462 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,462 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:04,463 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:04,463 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:04,463 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,463 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:04,463 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:04,463 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,465 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:04,466 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:04,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:04,466 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,466 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:04,584 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:04,585 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:04,585 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:04,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,586 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:04,586 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2568 [2022-12-13 02:07:04,586 INFO L420 AbstractCegarLoop]: === Iteration 2570 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1221987911, now seen corresponding path program 1 times [2022-12-13 02:07:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:04,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663614450] [2022-12-13 02:07:04,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:04,643 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 02:07:04,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:04,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663614450] [2022-12-13 02:07:04,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663614450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:04,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:04,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:04,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472993021] [2022-12-13 02:07:04,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:04,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:04,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:04,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:04,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:04,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:04,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:04,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:04,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:04,687 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:04,687 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:04,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:04,688 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:04,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:04,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:04,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:04,688 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:04,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:04,689 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,689 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:04,689 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:04,689 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:04,689 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,690 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:04,690 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:04,690 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,692 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:04,692 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:04,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:04,693 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,693 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:04,809 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:04,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:04,810 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:04,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:04,810 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:04,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2569 [2022-12-13 02:07:04,810 INFO L420 AbstractCegarLoop]: === Iteration 2571 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1164729609, now seen corresponding path program 1 times [2022-12-13 02:07:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:04,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774967614] [2022-12-13 02:07:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:04,867 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 02:07:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:04,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774967614] [2022-12-13 02:07:04,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774967614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:04,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:04,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130025545] [2022-12-13 02:07:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:04,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:04,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:04,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:04,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:04,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:04,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:04,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:04,910 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:04,910 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:04,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:04,911 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:04,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:04,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:04,911 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:04,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:04,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:04,912 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:04,912 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:04,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:04,912 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,912 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:04,912 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:04,912 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:04,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,915 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:04,915 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:04,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:04,915 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:04,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:05,045 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:05,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:05,046 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:05,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:05,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:05,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2570 [2022-12-13 02:07:05,046 INFO L420 AbstractCegarLoop]: === Iteration 2572 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1107471307, now seen corresponding path program 1 times [2022-12-13 02:07:05,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:05,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217264838] [2022-12-13 02:07:05,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:05,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:05,112 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 02:07:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:05,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217264838] [2022-12-13 02:07:05,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217264838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:05,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:05,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059259692] [2022-12-13 02:07:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:05,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:05,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:05,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:05,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:05,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:05,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:05,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:05,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:05,166 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:05,166 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:05,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:05,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:05,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:05,167 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:05,167 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:05,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:05,168 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,168 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:05,168 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:05,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:05,168 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,168 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:05,168 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:05,168 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,171 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:05,171 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:05,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:05,171 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,171 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:05,286 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:05,287 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:05,287 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:05,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,288 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:05,288 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:05,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2571 [2022-12-13 02:07:05,288 INFO L420 AbstractCegarLoop]: === Iteration 2573 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:05,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1050213005, now seen corresponding path program 1 times [2022-12-13 02:07:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:05,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556595304] [2022-12-13 02:07:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:05,348 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 02:07:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:05,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556595304] [2022-12-13 02:07:05,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556595304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:05,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:05,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:05,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007561565] [2022-12-13 02:07:05,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:05,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:05,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:05,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:05,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:05,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:05,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:05,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:05,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:05,392 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:05,392 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:05,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:05,392 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:05,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:05,393 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:05,393 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:05,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:05,393 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:05,394 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:05,394 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:05,394 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,394 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:05,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:05,394 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,397 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:05,397 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:05,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:05,397 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,397 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:05,515 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:05,516 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:05,517 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:05,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:05,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:05,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2572 [2022-12-13 02:07:05,517 INFO L420 AbstractCegarLoop]: === Iteration 2574 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:05,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -992954703, now seen corresponding path program 1 times [2022-12-13 02:07:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:05,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029539146] [2022-12-13 02:07:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:05,579 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 02:07:05,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:05,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029539146] [2022-12-13 02:07:05,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029539146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:05,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:05,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164816511] [2022-12-13 02:07:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:05,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:05,580 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:05,580 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,580 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:05,580 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:05,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:05,623 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:05,624 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:05,624 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:05,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:05,625 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:05,625 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:05,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:05,625 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,625 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:05,626 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:05,626 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:05,626 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:05,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:05,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,628 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:05,628 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:05,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:05,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,629 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:05,760 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:05,762 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:07:05,762 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:05,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,762 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:05,762 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:05,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2573 [2022-12-13 02:07:05,762 INFO L420 AbstractCegarLoop]: === Iteration 2575 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash -935696401, now seen corresponding path program 1 times [2022-12-13 02:07:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314611489] [2022-12-13 02:07:05,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:05,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:05,838 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 02:07:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:05,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314611489] [2022-12-13 02:07:05,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314611489] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:05,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:05,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:05,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935644748] [2022-12-13 02:07:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:05,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:05,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:05,840 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:05,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:05,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:05,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:05,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:05,910 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:05,910 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:05,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:05,911 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:05,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:05,911 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:05,911 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:05,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:05,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:05,912 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,912 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:05,912 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:05,912 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:05,912 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,913 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:05,913 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:05,913 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:05,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,915 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:05,915 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:05,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:05,916 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:05,916 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:06,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:06,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 148 [2022-12-13 02:07:06,060 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:06,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:06,061 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:06,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2574 [2022-12-13 02:07:06,061 INFO L420 AbstractCegarLoop]: === Iteration 2576 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash -878438099, now seen corresponding path program 1 times [2022-12-13 02:07:06,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:06,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775533540] [2022-12-13 02:07:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:06,139 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 02:07:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:06,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775533540] [2022-12-13 02:07:06,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775533540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:06,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:06,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937797343] [2022-12-13 02:07:06,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:06,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:06,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:06,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:06,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:06,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:06,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:06,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:06,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:06,187 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:06,187 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:06,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:06,188 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:06,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:06,188 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:06,188 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:06,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:06,189 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,189 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:06,190 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:06,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:06,190 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,190 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:06,190 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:06,190 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,193 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:06,194 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:06,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:06,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:06,328 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:06,329 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:06,329 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:06,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:06,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:06,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2575 [2022-12-13 02:07:06,330 INFO L420 AbstractCegarLoop]: === Iteration 2577 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash -821179797, now seen corresponding path program 1 times [2022-12-13 02:07:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:06,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941117996] [2022-12-13 02:07:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:06,399 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 02:07:06,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:06,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941117996] [2022-12-13 02:07:06,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941117996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:06,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:06,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:06,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651119911] [2022-12-13 02:07:06,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:06,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:06,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:06,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:06,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:06,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:06,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:06,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:06,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:06,474 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:06,474 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:06,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:06,475 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:06,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:06,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:06,476 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:06,476 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:06,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:06,477 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,477 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:06,477 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:06,477 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:06,477 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,478 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:06,478 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:06,478 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,480 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:06,480 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:06,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:06,481 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,481 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:06,597 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:06,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:06,598 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:06,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:06,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:06,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2576 [2022-12-13 02:07:06,598 INFO L420 AbstractCegarLoop]: === Iteration 2578 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:06,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash -763921495, now seen corresponding path program 1 times [2022-12-13 02:07:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:06,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304692811] [2022-12-13 02:07:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:06,654 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 02:07:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:06,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304692811] [2022-12-13 02:07:06,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304692811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:06,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:06,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527341151] [2022-12-13 02:07:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:06,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:06,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:06,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:06,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:06,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:06,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:06,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:06,698 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:06,698 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:06,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:06,699 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:06,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:06,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:06,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:06,699 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:06,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:06,700 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,700 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:06,700 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:06,700 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:06,700 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,700 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:06,700 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:06,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,703 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:06,703 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:06,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:06,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:06,818 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:06,819 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:06,819 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:06,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,819 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:06,819 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:06,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2577 [2022-12-13 02:07:06,820 INFO L420 AbstractCegarLoop]: === Iteration 2579 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:06,820 INFO L85 PathProgramCache]: Analyzing trace with hash -706663193, now seen corresponding path program 1 times [2022-12-13 02:07:06,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:06,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121221861] [2022-12-13 02:07:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:06,878 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 02:07:06,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:06,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121221861] [2022-12-13 02:07:06,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121221861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:06,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:06,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:06,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657776597] [2022-12-13 02:07:06,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:06,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:06,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:06,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:06,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:06,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:06,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:06,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:06,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:06,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:06,922 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:06,922 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:06,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:06,923 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:06,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:06,923 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:06,923 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:06,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:06,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:06,924 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,924 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:06,924 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:06,925 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:06,925 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,925 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:06,925 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:06,925 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:06,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,928 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:06,928 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:06,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:06,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:06,928 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:07,044 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:07,046 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:07,046 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:07,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,046 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:07,046 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:07,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2578 [2022-12-13 02:07:07,046 INFO L420 AbstractCegarLoop]: === Iteration 2580 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -649404891, now seen corresponding path program 1 times [2022-12-13 02:07:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:07,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084151811] [2022-12-13 02:07:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:07,102 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 02:07:07,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:07,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084151811] [2022-12-13 02:07:07,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084151811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:07,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:07,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:07,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347139141] [2022-12-13 02:07:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:07,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:07,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:07,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:07,103 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:07,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:07,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:07,148 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:07,148 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:07,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:07,148 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:07,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:07,149 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:07,149 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:07,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:07,150 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,150 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:07,150 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:07,150 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:07,150 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,150 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:07,150 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:07,150 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,153 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:07,153 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:07,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:07,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:07,272 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:07,273 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:07,273 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:07,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,273 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:07,273 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:07,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2579 [2022-12-13 02:07:07,273 INFO L420 AbstractCegarLoop]: === Iteration 2581 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:07,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:07,273 INFO L85 PathProgramCache]: Analyzing trace with hash -592146589, now seen corresponding path program 1 times [2022-12-13 02:07:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:07,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735824481] [2022-12-13 02:07:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:07,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:07,332 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 02:07:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:07,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735824481] [2022-12-13 02:07:07,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735824481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:07,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:07,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639285593] [2022-12-13 02:07:07,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:07,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:07,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:07,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:07,333 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:07,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:07,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:07,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:07,383 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:07,383 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:07,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:07,384 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:07,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:07,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:07,384 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:07,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:07,385 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,385 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:07,385 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:07,385 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:07,385 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,385 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:07,385 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:07,386 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,388 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:07,388 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:07,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:07,388 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,388 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:07,510 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:07,511 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:07,511 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:07,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,511 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:07,511 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:07,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2580 [2022-12-13 02:07:07,511 INFO L420 AbstractCegarLoop]: === Iteration 2582 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:07,511 INFO L85 PathProgramCache]: Analyzing trace with hash -534888287, now seen corresponding path program 1 times [2022-12-13 02:07:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:07,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995644093] [2022-12-13 02:07:07,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:07,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:07,572 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 02:07:07,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:07,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995644093] [2022-12-13 02:07:07,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995644093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:07,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:07,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067337507] [2022-12-13 02:07:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:07,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:07,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:07,573 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:07,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:07,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:07,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:07,616 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:07,616 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:07,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:07,617 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:07,617 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:07,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:07,617 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:07,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:07,618 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:07,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:07,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:07,618 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:07,619 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:07,619 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,621 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:07,621 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:07,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:07,622 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,622 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:07,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:07,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:07,741 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:07,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:07,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2581 [2022-12-13 02:07:07,742 INFO L420 AbstractCegarLoop]: === Iteration 2583 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:07,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:07,742 INFO L85 PathProgramCache]: Analyzing trace with hash -477629985, now seen corresponding path program 1 times [2022-12-13 02:07:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:07,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222233649] [2022-12-13 02:07:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:07,813 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 02:07:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:07,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222233649] [2022-12-13 02:07:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222233649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:07,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393859248] [2022-12-13 02:07:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:07,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:07,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:07,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:07,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:07,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:07,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:07,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:07,864 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:07,865 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:07,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:07,865 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:07,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:07,866 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:07,866 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:07,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:07,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:07,867 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,867 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:07,867 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:07,867 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:07,867 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:07,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:07,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:07,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,870 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:07,870 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:07,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:07,870 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:07,870 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:07,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:07,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:07,990 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:07,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:07,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:07,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:07,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2582 [2022-12-13 02:07:07,990 INFO L420 AbstractCegarLoop]: === Iteration 2584 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash -420371683, now seen corresponding path program 1 times [2022-12-13 02:07:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:07,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381866459] [2022-12-13 02:07:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:08,049 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 02:07:08,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:08,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381866459] [2022-12-13 02:07:08,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381866459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:08,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:08,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:08,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118443117] [2022-12-13 02:07:08,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:08,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:08,050 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:08,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:08,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:08,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:08,100 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:08,100 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:08,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:08,101 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:08,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:08,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:08,101 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:08,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:08,102 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:08,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:08,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:08,102 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:08,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:08,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,105 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:08,105 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:08,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:08,106 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,106 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:08,225 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:08,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:08,226 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:08,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:08,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:08,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2583 [2022-12-13 02:07:08,227 INFO L420 AbstractCegarLoop]: === Iteration 2585 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -363113381, now seen corresponding path program 1 times [2022-12-13 02:07:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:08,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296912199] [2022-12-13 02:07:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:08,283 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 02:07:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:08,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296912199] [2022-12-13 02:07:08,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296912199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:08,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:08,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973532] [2022-12-13 02:07:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:08,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:08,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:08,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:08,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:08,284 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:08,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:08,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:08,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:08,327 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:08,328 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:08,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:08,328 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:08,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:08,328 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:08,329 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:08,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:08,329 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,329 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:08,330 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:08,330 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:08,330 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,330 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:08,330 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:08,330 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,332 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:08,332 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:08,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:08,333 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,333 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:08,450 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:08,451 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:08,451 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:08,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,451 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:08,451 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:08,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2584 [2022-12-13 02:07:08,451 INFO L420 AbstractCegarLoop]: === Iteration 2586 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:08,451 INFO L85 PathProgramCache]: Analyzing trace with hash -305855079, now seen corresponding path program 1 times [2022-12-13 02:07:08,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:08,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006914103] [2022-12-13 02:07:08,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:08,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:08,520 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 02:07:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:08,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006914103] [2022-12-13 02:07:08,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006914103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:08,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:08,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:08,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364051528] [2022-12-13 02:07:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:08,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:08,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:08,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:08,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:08,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:08,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:08,571 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:08,571 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:08,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:08,572 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:08,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:08,572 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:08,572 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:08,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:08,573 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:08,573 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:08,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:08,573 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,573 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:08,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:08,574 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,576 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:08,576 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:08,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:08,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:08,697 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:08,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:08,698 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:08,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:08,698 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:08,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2585 [2022-12-13 02:07:08,698 INFO L420 AbstractCegarLoop]: === Iteration 2587 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:08,698 INFO L85 PathProgramCache]: Analyzing trace with hash -248596777, now seen corresponding path program 1 times [2022-12-13 02:07:08,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:08,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546626344] [2022-12-13 02:07:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:08,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:08,758 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 02:07:08,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:08,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546626344] [2022-12-13 02:07:08,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546626344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:08,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:08,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:08,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275021193] [2022-12-13 02:07:08,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:08,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:08,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:08,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:08,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:08,759 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:08,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:08,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:08,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:08,815 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:08,815 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:08,816 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:08,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:08,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:08,816 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:08,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:08,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:08,817 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:08,818 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:08,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:08,818 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:08,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:08,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:08,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,821 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:08,821 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:08,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:08,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:08,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:08,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:08,940 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:08,940 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:08,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,940 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:08,940 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:08,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2586 [2022-12-13 02:07:08,940 INFO L420 AbstractCegarLoop]: === Iteration 2588 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash -191338475, now seen corresponding path program 1 times [2022-12-13 02:07:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:08,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794109437] [2022-12-13 02:07:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:08,998 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 02:07:08,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:08,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794109437] [2022-12-13 02:07:08,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794109437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:08,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:08,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289933175] [2022-12-13 02:07:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:08,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:08,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:08,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:08,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:08,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:08,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:08,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:08,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:08,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:09,041 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:09,042 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:09,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:09,042 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:09,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:09,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:09,043 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:09,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:09,043 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,043 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:09,044 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:09,044 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:09,044 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,044 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:09,044 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:09,044 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,046 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:09,047 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:09,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:09,047 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,047 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:09,163 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:09,164 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:09,165 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:09,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,165 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:09,165 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:09,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2587 [2022-12-13 02:07:09,165 INFO L420 AbstractCegarLoop]: === Iteration 2589 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash -134080173, now seen corresponding path program 1 times [2022-12-13 02:07:09,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:09,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222160536] [2022-12-13 02:07:09,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:09,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:09,236 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 02:07:09,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:09,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222160536] [2022-12-13 02:07:09,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222160536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:09,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:09,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:09,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420798539] [2022-12-13 02:07:09,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:09,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:09,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:09,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:09,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:09,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:09,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:09,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:09,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:09,279 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:09,279 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:09,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:09,280 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:09,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:09,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:09,280 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:09,280 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:09,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:09,281 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,281 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:09,281 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:09,281 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:09,281 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,282 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:09,282 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:09,282 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,284 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:09,284 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:09,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:09,285 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,285 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:09,418 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:09,420 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:09,420 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:09,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,420 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:09,420 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:09,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2588 [2022-12-13 02:07:09,420 INFO L420 AbstractCegarLoop]: === Iteration 2590 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:09,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:09,421 INFO L85 PathProgramCache]: Analyzing trace with hash -76821871, now seen corresponding path program 1 times [2022-12-13 02:07:09,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:09,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943888136] [2022-12-13 02:07:09,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:09,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:09,502 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 02:07:09,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:09,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943888136] [2022-12-13 02:07:09,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943888136] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:09,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:09,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180270849] [2022-12-13 02:07:09,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:09,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:09,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:09,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:09,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:09,503 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:09,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:09,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:09,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:09,562 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:09,562 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:09,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:09,563 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:09,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:09,563 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:09,563 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:09,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:09,564 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,565 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:09,565 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:09,565 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:09,565 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,565 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:09,565 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:09,565 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,569 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:09,569 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:09,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:09,569 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,569 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:09,702 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:09,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:09,704 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:09,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,704 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:09,704 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:09,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2589 [2022-12-13 02:07:09,704 INFO L420 AbstractCegarLoop]: === Iteration 2591 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -19563569, now seen corresponding path program 1 times [2022-12-13 02:07:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:09,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899611914] [2022-12-13 02:07:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:09,771 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 02:07:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:09,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899611914] [2022-12-13 02:07:09,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899611914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:09,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:09,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912770361] [2022-12-13 02:07:09,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:09,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:09,772 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:09,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:09,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:09,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:09,827 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:09,827 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:09,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:09,828 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:09,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:09,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:09,829 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:09,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:09,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:09,830 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:09,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:09,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:09,830 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:09,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:09,830 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:09,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,833 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:09,833 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:09,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:09,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:09,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:09,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:09,971 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:09,971 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:09,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:09,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:09,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:09,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2590 [2022-12-13 02:07:09,971 INFO L420 AbstractCegarLoop]: === Iteration 2592 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:09,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:09,972 INFO L85 PathProgramCache]: Analyzing trace with hash 37694733, now seen corresponding path program 1 times [2022-12-13 02:07:09,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:09,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235867744] [2022-12-13 02:07:09,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:09,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:10,037 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 02:07:10,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:10,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235867744] [2022-12-13 02:07:10,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235867744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:10,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:10,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945269583] [2022-12-13 02:07:10,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:10,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:10,039 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:10,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:10,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:10,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:10,092 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:10,092 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:10,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:10,093 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:10,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:10,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:10,094 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:10,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:10,094 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:10,095 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:10,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:10,095 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,095 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:10,095 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:10,095 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,098 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:10,098 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:10,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:10,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:10,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:10,235 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:10,235 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:10,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,235 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:10,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:10,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2591 [2022-12-13 02:07:10,236 INFO L420 AbstractCegarLoop]: === Iteration 2593 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash 94953035, now seen corresponding path program 1 times [2022-12-13 02:07:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:10,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726631794] [2022-12-13 02:07:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:10,310 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 02:07:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:10,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726631794] [2022-12-13 02:07:10,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726631794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:10,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:10,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557601204] [2022-12-13 02:07:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:10,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:10,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:10,311 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:10,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:10,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:10,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:10,364 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:10,365 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:10,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:10,365 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:10,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:10,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:10,366 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:10,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:10,367 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:10,367 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:10,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:10,367 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:10,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:10,367 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,370 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:10,370 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:10,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:10,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:10,505 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:10,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:10,507 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:10,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,508 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:10,508 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:10,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2592 [2022-12-13 02:07:10,508 INFO L420 AbstractCegarLoop]: === Iteration 2594 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:10,508 INFO L85 PathProgramCache]: Analyzing trace with hash 152211337, now seen corresponding path program 1 times [2022-12-13 02:07:10,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:10,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971924606] [2022-12-13 02:07:10,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:10,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:10,580 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 02:07:10,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:10,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971924606] [2022-12-13 02:07:10,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971924606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:10,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:10,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:10,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838073489] [2022-12-13 02:07:10,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:10,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:10,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:10,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:10,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:10,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:10,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:10,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:10,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:10,636 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:10,636 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:10,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:10,637 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:10,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:10,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:10,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:10,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:10,638 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:10,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:10,639 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,639 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:10,640 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:10,640 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:10,640 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,640 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:10,640 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:10,640 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,644 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:10,644 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:10,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:10,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:10,779 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:10,780 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:10,781 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:10,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,781 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:10,781 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:10,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2593 [2022-12-13 02:07:10,781 INFO L420 AbstractCegarLoop]: === Iteration 2595 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 209469639, now seen corresponding path program 1 times [2022-12-13 02:07:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599437969] [2022-12-13 02:07:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:10,859 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 02:07:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:10,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599437969] [2022-12-13 02:07:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599437969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049549549] [2022-12-13 02:07:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:10,860 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:10,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:10,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:10,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:10,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:10,919 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:10,920 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:10,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:10,920 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:10,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:10,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:10,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:10,921 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:10,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:10,922 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,922 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:10,922 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:10,922 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:10,922 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,923 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:10,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:10,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:10,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,926 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:10,926 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:10,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:10,927 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:10,927 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:11,061 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:11,062 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:11,062 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:11,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,062 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:11,062 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:11,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2594 [2022-12-13 02:07:11,063 INFO L420 AbstractCegarLoop]: === Iteration 2596 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:11,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:11,063 INFO L85 PathProgramCache]: Analyzing trace with hash 266727941, now seen corresponding path program 1 times [2022-12-13 02:07:11,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:11,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170153225] [2022-12-13 02:07:11,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:11,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:11,134 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 02:07:11,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170153225] [2022-12-13 02:07:11,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170153225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:11,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:11,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:11,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358940670] [2022-12-13 02:07:11,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:11,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:11,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:11,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:11,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:11,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:11,197 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:11,198 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:11,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:11,198 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:11,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:11,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:11,199 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:11,199 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:11,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:11,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:11,200 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,200 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:11,200 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:11,200 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:11,200 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,200 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:11,200 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:11,200 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:11,203 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:11,203 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:11,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:11,203 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:11,203 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:11,337 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:11,339 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:11,339 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:11,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:11,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:11,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2595 [2022-12-13 02:07:11,339 INFO L420 AbstractCegarLoop]: === Iteration 2597 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:11,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 323986243, now seen corresponding path program 1 times [2022-12-13 02:07:11,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616196555] [2022-12-13 02:07:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:11,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:11,415 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 02:07:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616196555] [2022-12-13 02:07:11,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616196555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:11,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:11,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:11,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318283899] [2022-12-13 02:07:11,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:11,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:11,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:11,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:11,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:11,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:11,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:11,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:11,477 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:11,478 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:11,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:11,478 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:11,478 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:11,479 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:11,479 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:11,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:11,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:11,480 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,480 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:11,480 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:11,480 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:11,480 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,480 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:11,480 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:11,480 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:11,483 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:11,483 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:11,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:11,483 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:11,483 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:11,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:11,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:11,618 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:11,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:11,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:11,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2596 [2022-12-13 02:07:11,618 INFO L420 AbstractCegarLoop]: === Iteration 2598 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:11,618 INFO L85 PathProgramCache]: Analyzing trace with hash 381244545, now seen corresponding path program 1 times [2022-12-13 02:07:11,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:11,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591634366] [2022-12-13 02:07:11,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:11,688 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 02:07:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591634366] [2022-12-13 02:07:11,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591634366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:11,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:11,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:11,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809370879] [2022-12-13 02:07:11,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:11,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:11,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:11,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:11,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:11,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:11,748 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:11,748 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:11,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:11,749 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:11,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:11,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:11,749 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:11,749 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:11,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:11,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:11,750 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,750 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:11,750 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:11,750 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:11,750 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,750 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:11,750 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:11,750 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:11,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:11,753 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:11,753 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:11,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:11,753 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:11,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:11,887 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:11,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:11,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:11,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:11,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:11,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2597 [2022-12-13 02:07:11,889 INFO L420 AbstractCegarLoop]: === Iteration 2599 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:11,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 438502847, now seen corresponding path program 1 times [2022-12-13 02:07:11,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:11,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255824548] [2022-12-13 02:07:11,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:11,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:11,956 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 02:07:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:11,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255824548] [2022-12-13 02:07:11,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255824548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:11,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:11,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228333429] [2022-12-13 02:07:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:11,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:11,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:11,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:11,957 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:11,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:11,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:11,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:11,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:12,009 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:12,009 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:12,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:12,010 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:12,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:12,010 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:12,010 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:12,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:12,011 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,011 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:12,011 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:12,011 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:12,012 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:12,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:12,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,014 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:12,014 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:12,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:12,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:12,147 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:12,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:07:12,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:12,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,149 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:12,149 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2598 [2022-12-13 02:07:12,149 INFO L420 AbstractCegarLoop]: === Iteration 2600 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash 495761149, now seen corresponding path program 1 times [2022-12-13 02:07:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:12,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246946455] [2022-12-13 02:07:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:12,216 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 02:07:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:12,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246946455] [2022-12-13 02:07:12,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246946455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:12,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:12,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486790981] [2022-12-13 02:07:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:12,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:12,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:12,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:12,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:12,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:12,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:12,270 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:12,270 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:12,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:12,271 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:12,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:12,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:12,271 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:12,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:12,272 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,272 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:12,272 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:12,272 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:12,272 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,273 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:12,273 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:12,273 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,275 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:12,275 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:12,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:12,276 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,276 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:12,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:12,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-13 02:07:12,425 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:12,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:12,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:12,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2599 [2022-12-13 02:07:12,425 INFO L420 AbstractCegarLoop]: === Iteration 2601 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:12,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 553019451, now seen corresponding path program 1 times [2022-12-13 02:07:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:12,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677847386] [2022-12-13 02:07:12,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:12,489 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 02:07:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:12,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677847386] [2022-12-13 02:07:12,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677847386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:12,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:12,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:12,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044559174] [2022-12-13 02:07:12,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:12,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:12,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:12,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:12,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:12,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:12,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:12,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:12,552 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:12,552 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:12,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:12,553 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:12,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:12,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:12,553 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:12,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:12,554 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,554 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:12,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:12,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:12,555 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:12,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:12,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,558 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:12,558 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:12,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:12,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:12,693 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:12,694 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:12,694 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:12,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,695 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:12,695 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:12,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2600 [2022-12-13 02:07:12,695 INFO L420 AbstractCegarLoop]: === Iteration 2602 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:12,695 INFO L85 PathProgramCache]: Analyzing trace with hash 610277753, now seen corresponding path program 1 times [2022-12-13 02:07:12,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:12,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296387480] [2022-12-13 02:07:12,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:12,765 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 02:07:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296387480] [2022-12-13 02:07:12,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296387480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:12,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:12,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:12,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482256964] [2022-12-13 02:07:12,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:12,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:12,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:12,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:12,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:12,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:12,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:12,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:12,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:12,827 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:12,828 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:12,828 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:12,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:12,829 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:12,829 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:12,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:12,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:12,830 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,830 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:12,830 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:12,830 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:12,830 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:12,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:12,830 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:12,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,833 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:12,833 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:12,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:12,833 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:12,833 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:12,967 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:12,968 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:07:12,969 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:12,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:12,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:12,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:12,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2601 [2022-12-13 02:07:12,969 INFO L420 AbstractCegarLoop]: === Iteration 2603 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:12,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:12,969 INFO L85 PathProgramCache]: Analyzing trace with hash 667536055, now seen corresponding path program 1 times [2022-12-13 02:07:12,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:12,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178986775] [2022-12-13 02:07:12,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:13,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178986775] [2022-12-13 02:07:13,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178986775] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:13,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:13,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:13,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196686257] [2022-12-13 02:07:13,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:13,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:13,040 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:13,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:13,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:13,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:13,091 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:13,091 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:13,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:13,091 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:13,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:13,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:13,092 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:13,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:13,093 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:13,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:13,093 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:13,093 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,093 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:13,093 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:13,093 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,096 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:13,096 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:13,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:13,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,096 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:13,217 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:13,218 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:13,218 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:13,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,218 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:13,218 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:13,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2602 [2022-12-13 02:07:13,219 INFO L420 AbstractCegarLoop]: === Iteration 2604 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 724794357, now seen corresponding path program 1 times [2022-12-13 02:07:13,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:13,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432329481] [2022-12-13 02:07:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:13,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:13,277 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 02:07:13,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:13,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432329481] [2022-12-13 02:07:13,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432329481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:13,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:13,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289090688] [2022-12-13 02:07:13,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:13,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:13,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:13,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:13,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:13,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:13,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:13,323 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:13,323 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:13,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:13,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:13,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:13,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:13,324 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:13,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:13,325 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,325 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:13,325 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:13,325 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:13,325 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:13,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:13,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,328 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:13,329 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:13,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:13,449 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:13,450 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:13,450 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:13,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,450 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:13,450 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:13,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2603 [2022-12-13 02:07:13,451 INFO L420 AbstractCegarLoop]: === Iteration 2605 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:13,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash 782052659, now seen corresponding path program 1 times [2022-12-13 02:07:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:13,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141373908] [2022-12-13 02:07:13,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:13,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:13,509 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 02:07:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:13,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141373908] [2022-12-13 02:07:13,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141373908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:13,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:13,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:13,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355941064] [2022-12-13 02:07:13,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:13,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:13,510 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:13,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:13,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:13,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:13,552 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:13,553 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:13,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:13,553 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:13,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:13,554 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:13,554 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:13,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:13,554 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,555 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:13,555 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:13,555 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:13,555 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,555 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:13,555 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:13,555 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,558 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:13,558 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:13,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:13,558 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,558 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:13,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:13,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:13,676 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:13,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:13,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2604 [2022-12-13 02:07:13,677 INFO L420 AbstractCegarLoop]: === Iteration 2606 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:13,677 INFO L85 PathProgramCache]: Analyzing trace with hash 839310961, now seen corresponding path program 1 times [2022-12-13 02:07:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:13,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455587742] [2022-12-13 02:07:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:13,733 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 02:07:13,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:13,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455587742] [2022-12-13 02:07:13,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455587742] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:13,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:13,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:13,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945822478] [2022-12-13 02:07:13,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:13,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:13,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:13,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:13,734 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:13,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:13,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:13,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:13,786 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:13,786 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:13,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:13,787 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:13,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:13,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:13,787 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:13,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:13,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:13,788 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,788 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:13,788 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:13,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:13,788 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,788 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:13,788 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:13,789 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:13,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,791 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:13,791 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:13,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:13,791 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:13,791 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:13,920 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:13,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:13,922 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:13,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,922 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:13,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:13,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2605 [2022-12-13 02:07:13,922 INFO L420 AbstractCegarLoop]: === Iteration 2607 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:13,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash 896569263, now seen corresponding path program 1 times [2022-12-13 02:07:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:13,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764494867] [2022-12-13 02:07:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:13,985 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 02:07:13,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:13,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764494867] [2022-12-13 02:07:13,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764494867] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:13,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:13,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127604920] [2022-12-13 02:07:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:13,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:13,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:13,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:13,986 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:13,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:13,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:13,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:13,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:14,037 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:14,037 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:14,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:14,038 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:14,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:14,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:14,038 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:14,039 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,039 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:14,039 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:14,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:14,039 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,040 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:14,040 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:14,040 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,042 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:14,042 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:14,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:14,043 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:14,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:14,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:14,179 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:14,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:14,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:14,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:14,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2606 [2022-12-13 02:07:14,179 INFO L420 AbstractCegarLoop]: === Iteration 2608 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 953827565, now seen corresponding path program 1 times [2022-12-13 02:07:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:14,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674000862] [2022-12-13 02:07:14,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:14,244 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 02:07:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:14,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674000862] [2022-12-13 02:07:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674000862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:14,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038535718] [2022-12-13 02:07:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:14,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:14,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:14,245 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:14,245 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:14,245 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:14,245 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:14,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:14,299 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:14,299 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:14,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:14,300 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:14,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:14,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:14,300 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:14,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:14,301 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,301 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:14,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:14,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:14,301 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:14,302 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:14,302 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,304 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:14,304 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:14,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:14,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:14,441 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:14,443 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:14,443 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:14,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:14,443 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:14,443 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:14,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2607 [2022-12-13 02:07:14,443 INFO L420 AbstractCegarLoop]: === Iteration 2609 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1011085867, now seen corresponding path program 1 times [2022-12-13 02:07:14,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:14,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83717021] [2022-12-13 02:07:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:14,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:14,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:14,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83717021] [2022-12-13 02:07:14,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83717021] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:14,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:14,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185605332] [2022-12-13 02:07:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:14,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:14,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:14,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:14,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:14,512 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:14,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:14,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:14,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:14,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:14,575 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:14,575 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:14,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:14,576 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:14,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:14,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:14,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:14,576 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:14,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:14,577 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:14,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:14,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:14,577 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:14,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:14,578 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,580 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:14,580 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:14,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:14,581 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,581 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:14,725 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:14,726 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-13 02:07:14,726 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:14,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:14,726 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:14,726 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:14,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2608 [2022-12-13 02:07:14,726 INFO L420 AbstractCegarLoop]: === Iteration 2610 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1068344169, now seen corresponding path program 1 times [2022-12-13 02:07:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443314896] [2022-12-13 02:07:14,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:14,801 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 02:07:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:14,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443314896] [2022-12-13 02:07:14,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443314896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:14,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:14,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:14,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806565978] [2022-12-13 02:07:14,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:14,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:14,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:14,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:14,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:14,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:14,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:14,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:14,865 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:14,865 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:14,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:14,866 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:14,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:14,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:14,867 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:14,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:14,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:14,868 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,868 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:14,868 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:14,868 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:14,868 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,868 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:14,868 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:14,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:14,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,871 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:14,871 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:14,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:14,871 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:14,871 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:15,006 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:15,008 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:15,008 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:15,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:15,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:15,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2609 [2022-12-13 02:07:15,008 INFO L420 AbstractCegarLoop]: === Iteration 2611 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:15,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1125602471, now seen corresponding path program 1 times [2022-12-13 02:07:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:15,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800897835] [2022-12-13 02:07:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:15,080 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 02:07:15,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:15,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800897835] [2022-12-13 02:07:15,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800897835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:15,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:15,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:15,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150987519] [2022-12-13 02:07:15,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:15,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:15,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:15,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:15,081 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:15,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:15,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:15,134 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:15,134 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:15,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:15,135 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:15,135 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:15,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:15,136 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:15,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:15,137 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:15,137 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:15,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:15,137 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,137 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:15,137 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:15,137 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,141 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:15,141 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:15,142 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,142 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:15,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:15,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:15,274 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:15,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:15,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:15,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2610 [2022-12-13 02:07:15,274 INFO L420 AbstractCegarLoop]: === Iteration 2612 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:15,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1182860773, now seen corresponding path program 1 times [2022-12-13 02:07:15,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:15,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337568160] [2022-12-13 02:07:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:15,366 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 02:07:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:15,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337568160] [2022-12-13 02:07:15,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337568160] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:15,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:15,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:15,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164434242] [2022-12-13 02:07:15,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:15,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:15,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:15,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:15,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:15,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:15,419 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:15,419 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:15,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:15,420 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:15,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:15,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:15,421 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:15,421 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:15,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:15,422 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,422 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:15,422 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:15,422 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:15,422 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,422 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:15,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:15,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,426 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:15,426 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:15,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:15,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:15,557 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:15,558 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:07:15,558 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:15,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,558 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:15,558 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:15,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2611 [2022-12-13 02:07:15,558 INFO L420 AbstractCegarLoop]: === Iteration 2613 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1240119075, now seen corresponding path program 1 times [2022-12-13 02:07:15,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:15,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955317009] [2022-12-13 02:07:15,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:15,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:15,616 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 02:07:15,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:15,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955317009] [2022-12-13 02:07:15,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955317009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:15,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:15,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617020427] [2022-12-13 02:07:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:15,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:15,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:15,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:15,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:15,617 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:15,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:15,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:15,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:15,666 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:15,667 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:15,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:15,667 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:15,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:15,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:15,668 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:15,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:15,668 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,668 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:15,669 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:15,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:15,669 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,669 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:15,669 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:15,669 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,672 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:15,672 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:15,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:15,672 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,672 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:15,788 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:15,789 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:15,789 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:15,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,789 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:15,789 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:15,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2612 [2022-12-13 02:07:15,790 INFO L420 AbstractCegarLoop]: === Iteration 2614 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1297377377, now seen corresponding path program 1 times [2022-12-13 02:07:15,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:15,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951277556] [2022-12-13 02:07:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:15,848 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 02:07:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:15,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951277556] [2022-12-13 02:07:15,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951277556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:15,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:15,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:15,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490872557] [2022-12-13 02:07:15,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:15,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:15,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:15,849 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:15,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:15,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:15,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:15,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:15,892 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:15,892 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:15,892 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:15,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:15,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:15,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:15,893 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:15,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:15,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:15,893 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:15,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:15,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:15,894 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:15,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:15,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:15,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,897 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:15,897 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:15,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:15,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:15,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:16,015 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:16,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:16,016 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:16,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:16,016 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:16,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2613 [2022-12-13 02:07:16,016 INFO L420 AbstractCegarLoop]: === Iteration 2615 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:16,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1354635679, now seen corresponding path program 1 times [2022-12-13 02:07:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:16,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091036776] [2022-12-13 02:07:16,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:16,074 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 02:07:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:16,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091036776] [2022-12-13 02:07:16,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091036776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:16,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:16,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702988390] [2022-12-13 02:07:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:16,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:16,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:16,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:16,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:16,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:16,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:16,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:16,118 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:16,119 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:16,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:16,119 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:16,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:16,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:16,120 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:16,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:16,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:16,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:16,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:16,121 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:16,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:16,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:16,124 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:16,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:16,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:16,239 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:16,240 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:16,240 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:16,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:16,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:16,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2614 [2022-12-13 02:07:16,241 INFO L420 AbstractCegarLoop]: === Iteration 2616 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:16,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1411893981, now seen corresponding path program 1 times [2022-12-13 02:07:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:16,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425670124] [2022-12-13 02:07:16,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:16,298 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 02:07:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425670124] [2022-12-13 02:07:16,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425670124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:16,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:16,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528996423] [2022-12-13 02:07:16,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:16,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:16,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:16,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:16,299 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:16,299 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:16,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:16,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:16,349 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:16,349 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:16,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:16,350 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:16,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:16,350 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:16,350 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:16,351 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,351 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:16,351 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:16,351 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:16,351 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,352 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:16,352 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:16,352 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,354 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:16,354 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:16,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:16,355 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,355 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:16,472 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:16,473 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:16,473 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:16,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:16,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:16,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2615 [2022-12-13 02:07:16,474 INFO L420 AbstractCegarLoop]: === Iteration 2617 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1469152283, now seen corresponding path program 1 times [2022-12-13 02:07:16,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:16,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631116198] [2022-12-13 02:07:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:16,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:16,531 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 02:07:16,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:16,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631116198] [2022-12-13 02:07:16,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631116198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:16,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:16,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:16,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869187351] [2022-12-13 02:07:16,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:16,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:16,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:16,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:16,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:16,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:16,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:16,575 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:16,575 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:16,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:16,575 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:16,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:16,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:16,576 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:16,576 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:16,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:16,577 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,577 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:16,577 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:16,577 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:16,577 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:16,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:16,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,580 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:16,580 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:16,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:16,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:16,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:16,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:16,697 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:16,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:16,697 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:16,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2616 [2022-12-13 02:07:16,698 INFO L420 AbstractCegarLoop]: === Iteration 2618 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:16,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1526410585, now seen corresponding path program 1 times [2022-12-13 02:07:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:16,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928714149] [2022-12-13 02:07:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:16,767 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 02:07:16,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:16,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928714149] [2022-12-13 02:07:16,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928714149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:16,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:16,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:16,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342514437] [2022-12-13 02:07:16,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:16,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:16,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:16,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:16,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:16,768 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:16,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:16,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:16,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:16,818 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:16,818 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:16,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:16,818 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:16,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:16,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:16,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:16,819 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:16,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:16,819 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,820 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:16,820 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:16,820 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:16,820 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:16,820 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:16,820 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:16,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,823 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:16,823 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:16,823 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:16,823 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:16,942 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:16,943 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:16,943 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:16,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:16,944 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:16,944 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:16,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2617 [2022-12-13 02:07:16,944 INFO L420 AbstractCegarLoop]: === Iteration 2619 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1583668887, now seen corresponding path program 1 times [2022-12-13 02:07:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:16,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219204956] [2022-12-13 02:07:16,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:17,001 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 02:07:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:17,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219204956] [2022-12-13 02:07:17,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219204956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:17,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:17,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:17,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74589989] [2022-12-13 02:07:17,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:17,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:17,002 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:17,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:17,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:17,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:17,045 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:17,045 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:17,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:17,045 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:17,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:17,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:17,046 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:17,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:17,047 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,047 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:17,047 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:17,047 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:17,047 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:17,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:17,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,050 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:17,050 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:17,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:17,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:17,169 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:17,170 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:17,170 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:17,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,170 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:17,170 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:17,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2618 [2022-12-13 02:07:17,170 INFO L420 AbstractCegarLoop]: === Iteration 2620 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1640927189, now seen corresponding path program 1 times [2022-12-13 02:07:17,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:17,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420405602] [2022-12-13 02:07:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:17,229 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 02:07:17,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:17,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420405602] [2022-12-13 02:07:17,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420405602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:17,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:17,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654906971] [2022-12-13 02:07:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:17,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:17,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:17,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:17,230 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:17,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:17,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:17,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:17,284 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:17,284 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:17,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:17,285 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:17,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:17,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:17,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:17,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:17,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:17,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:17,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:17,287 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:17,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:17,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,290 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:17,290 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:17,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:17,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:17,419 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:17,421 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:17,421 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:17,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,421 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:17,421 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:17,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2619 [2022-12-13 02:07:17,421 INFO L420 AbstractCegarLoop]: === Iteration 2621 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:17,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:17,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1698185491, now seen corresponding path program 1 times [2022-12-13 02:07:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:17,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424534339] [2022-12-13 02:07:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:17,480 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 02:07:17,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:17,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424534339] [2022-12-13 02:07:17,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424534339] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:17,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:17,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:17,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517670388] [2022-12-13 02:07:17,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:17,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:17,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:17,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:17,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:17,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:17,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:17,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:17,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:17,534 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:17,535 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:17,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:17,535 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:17,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:17,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:17,536 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:17,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:17,537 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:17,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:17,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:17,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:17,537 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:17,537 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,540 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:17,540 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:17,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:17,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:17,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:17,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:07:17,673 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:17,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,674 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:17,674 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:17,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2620 [2022-12-13 02:07:17,674 INFO L420 AbstractCegarLoop]: === Iteration 2622 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:17,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1755443793, now seen corresponding path program 1 times [2022-12-13 02:07:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:17,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60591086] [2022-12-13 02:07:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:17,743 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 02:07:17,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:17,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60591086] [2022-12-13 02:07:17,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60591086] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:17,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:17,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011527913] [2022-12-13 02:07:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:17,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:17,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:17,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:17,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:17,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:17,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:17,797 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:17,797 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:17,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:17,797 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:17,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:17,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:17,798 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:17,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:17,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:17,799 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,799 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:17,799 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:17,799 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:17,799 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:17,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:17,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:17,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,802 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:17,802 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:17,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:17,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:17,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:17,920 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:17,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:17,921 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:17,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:17,922 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:17,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2621 [2022-12-13 02:07:17,922 INFO L420 AbstractCegarLoop]: === Iteration 2623 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1812702095, now seen corresponding path program 1 times [2022-12-13 02:07:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:17,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763190378] [2022-12-13 02:07:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:17,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:17,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 02:07:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:17,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763190378] [2022-12-13 02:07:17,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763190378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:17,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:17,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393195655] [2022-12-13 02:07:17,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:17,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:17,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:17,988 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:17,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:17,988 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:17,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:17,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:18,032 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:18,032 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:18,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:18,032 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:18,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:18,033 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:18,033 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:18,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:18,034 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,034 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:18,034 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:18,034 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:18,034 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,034 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:18,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:18,034 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,037 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:18,037 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:18,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:18,037 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,037 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:18,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:18,178 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:07:18,179 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:18,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:18,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:18,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2622 [2022-12-13 02:07:18,179 INFO L420 AbstractCegarLoop]: === Iteration 2624 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:18,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1869960397, now seen corresponding path program 1 times [2022-12-13 02:07:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:18,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353749095] [2022-12-13 02:07:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:18,248 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 02:07:18,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:18,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353749095] [2022-12-13 02:07:18,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353749095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:18,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:18,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:18,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965519398] [2022-12-13 02:07:18,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:18,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:18,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:18,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:18,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:18,249 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:18,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:18,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:18,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:18,310 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:18,310 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:18,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:18,311 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:18,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:18,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:18,312 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:18,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:18,313 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,313 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:18,313 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:18,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:18,313 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:18,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:18,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,316 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:18,316 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:18,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:18,316 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,316 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:18,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:18,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:18,454 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:18,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,454 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:18,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:18,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2623 [2022-12-13 02:07:18,454 INFO L420 AbstractCegarLoop]: === Iteration 2625 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1927218699, now seen corresponding path program 1 times [2022-12-13 02:07:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:18,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299719586] [2022-12-13 02:07:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:18,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:18,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299719586] [2022-12-13 02:07:18,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299719586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:18,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:18,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483673525] [2022-12-13 02:07:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:18,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:18,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:18,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:18,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:18,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:18,574 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:18,574 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:18,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:18,575 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:18,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:18,575 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:18,575 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:18,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:18,576 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,576 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:18,576 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:18,576 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:18,576 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,577 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:18,577 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:18,577 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,579 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:18,579 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:18,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:18,580 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,580 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:18,717 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:18,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:18,719 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:18,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:18,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:18,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2624 [2022-12-13 02:07:18,719 INFO L420 AbstractCegarLoop]: === Iteration 2626 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:18,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:18,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1984477001, now seen corresponding path program 1 times [2022-12-13 02:07:18,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:18,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730772204] [2022-12-13 02:07:18,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:18,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:18,789 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 02:07:18,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:18,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730772204] [2022-12-13 02:07:18,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730772204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:18,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:18,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596231904] [2022-12-13 02:07:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:18,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:18,790 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:18,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:18,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:18,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:18,845 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:18,846 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:18,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:18,846 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:18,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:18,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:18,847 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:18,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:18,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:18,848 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,848 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:18,848 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:18,848 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:18,848 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,848 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:18,848 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:18,848 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:18,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,851 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:18,851 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:18,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:18,851 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:18,851 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:18,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:18,990 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:18,990 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:18,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:18,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:18,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:18,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2625 [2022-12-13 02:07:18,990 INFO L420 AbstractCegarLoop]: === Iteration 2627 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2041735303, now seen corresponding path program 1 times [2022-12-13 02:07:18,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764027388] [2022-12-13 02:07:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:18,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:19,068 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 02:07:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:19,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764027388] [2022-12-13 02:07:19,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764027388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:19,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:19,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564130123] [2022-12-13 02:07:19,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:19,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:19,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:19,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:19,070 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:19,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:19,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:19,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:19,135 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:19,135 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:19,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:19,136 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:19,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:19,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:19,136 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:19,136 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:19,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:19,137 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:19,137 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:19,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:19,137 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:19,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:19,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,140 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:19,141 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:19,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:19,141 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,141 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:19,277 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:19,279 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:19,279 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:19,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,279 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:19,279 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:19,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2626 [2022-12-13 02:07:19,279 INFO L420 AbstractCegarLoop]: === Iteration 2628 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2098993605, now seen corresponding path program 1 times [2022-12-13 02:07:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:19,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946325132] [2022-12-13 02:07:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:19,347 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 02:07:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:19,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946325132] [2022-12-13 02:07:19,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946325132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:19,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:19,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309909793] [2022-12-13 02:07:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:19,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:19,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:19,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:19,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:19,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:19,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:19,404 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:19,404 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:19,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:19,405 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:19,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:19,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:19,405 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:19,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:19,407 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:19,407 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:19,407 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:19,407 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,407 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:19,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:19,407 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,411 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:19,411 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:19,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:19,412 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,412 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:19,547 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:19,550 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:19,550 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:19,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,550 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:19,550 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:19,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2627 [2022-12-13 02:07:19,550 INFO L420 AbstractCegarLoop]: === Iteration 2629 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2138715389, now seen corresponding path program 1 times [2022-12-13 02:07:19,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:19,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480119845] [2022-12-13 02:07:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:19,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:19,642 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 02:07:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:19,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480119845] [2022-12-13 02:07:19,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480119845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:19,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:19,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:19,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975335844] [2022-12-13 02:07:19,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:19,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:19,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:19,644 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,644 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:19,644 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:19,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:19,709 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:19,709 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:19,710 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:19,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:19,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:19,711 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:19,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:19,712 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,712 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:19,712 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:19,712 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:19,712 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:19,713 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:19,713 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,716 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:19,717 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:19,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:19,717 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:19,841 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:19,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:07:19,842 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:19,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:19,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2628 [2022-12-13 02:07:19,842 INFO L420 AbstractCegarLoop]: === Iteration 2630 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:19,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2081457087, now seen corresponding path program 1 times [2022-12-13 02:07:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:19,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960798068] [2022-12-13 02:07:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:19,900 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 02:07:19,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:19,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960798068] [2022-12-13 02:07:19,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960798068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:19,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:19,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142674834] [2022-12-13 02:07:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:19,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:19,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:19,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:19,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:19,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:19,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:19,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:19,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:19,952 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:19,952 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:19,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:19,952 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:19,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:19,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:19,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:19,953 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:19,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:19,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:19,954 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:19,954 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:19,954 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:19,954 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:19,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:19,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:19,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,957 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:19,957 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:19,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:19,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:19,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:20,075 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:20,076 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:20,076 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:20,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,076 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:20,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:20,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2629 [2022-12-13 02:07:20,076 INFO L420 AbstractCegarLoop]: === Iteration 2631 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2024198785, now seen corresponding path program 1 times [2022-12-13 02:07:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:20,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434910805] [2022-12-13 02:07:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:20,136 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 02:07:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:20,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434910805] [2022-12-13 02:07:20,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434910805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:20,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:20,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:20,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417086165] [2022-12-13 02:07:20,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:20,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:20,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:20,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:20,137 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:20,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:20,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:20,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:20,181 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:20,181 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:20,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:20,182 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:20,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:20,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:20,182 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:20,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:20,183 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:20,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:20,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:20,183 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:20,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:20,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,186 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:20,186 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:20,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:20,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:20,304 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:20,305 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:20,305 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:20,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:20,305 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:20,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2630 [2022-12-13 02:07:20,305 INFO L420 AbstractCegarLoop]: === Iteration 2632 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1966940483, now seen corresponding path program 1 times [2022-12-13 02:07:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549352723] [2022-12-13 02:07:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:20,365 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 02:07:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:20,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549352723] [2022-12-13 02:07:20,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549352723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:20,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:20,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310254442] [2022-12-13 02:07:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:20,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:20,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:20,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:20,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:20,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:20,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:20,409 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:20,410 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:20,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:20,410 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:20,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:20,411 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:20,411 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:20,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:20,412 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:20,412 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:20,412 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:20,412 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,412 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:20,412 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:20,412 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,415 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:20,415 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:20,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:20,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:20,536 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:20,538 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:20,538 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:20,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,538 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:20,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:20,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2631 [2022-12-13 02:07:20,538 INFO L420 AbstractCegarLoop]: === Iteration 2633 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:20,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1909682181, now seen corresponding path program 1 times [2022-12-13 02:07:20,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:20,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218997798] [2022-12-13 02:07:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:20,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:20,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218997798] [2022-12-13 02:07:20,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218997798] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:20,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:20,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:20,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585499721] [2022-12-13 02:07:20,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:20,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:20,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:20,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:20,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:20,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:20,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:20,659 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:20,659 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:20,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:20,659 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:20,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:20,660 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:20,660 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:20,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:20,661 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,661 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:20,661 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:20,661 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:20,661 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,661 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:20,661 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:20,661 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,664 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:20,664 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:20,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:20,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:20,787 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:20,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:20,788 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:20,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:20,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:20,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2632 [2022-12-13 02:07:20,788 INFO L420 AbstractCegarLoop]: === Iteration 2634 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:20,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1852423879, now seen corresponding path program 1 times [2022-12-13 02:07:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:20,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8007617] [2022-12-13 02:07:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:20,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:20,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8007617] [2022-12-13 02:07:20,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8007617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:20,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:20,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968097206] [2022-12-13 02:07:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:20,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:20,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:20,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:20,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:20,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:20,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:20,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:20,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:20,899 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:20,900 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:20,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:20,900 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:20,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:20,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:20,900 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:20,901 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:20,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:20,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:20,901 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,901 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:20,901 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:20,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:20,902 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:20,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:20,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:20,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,904 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:20,904 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:20,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:20,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:20,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:21,022 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:21,023 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:21,023 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:21,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,023 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:21,023 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:21,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2633 [2022-12-13 02:07:21,023 INFO L420 AbstractCegarLoop]: === Iteration 2635 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1795165577, now seen corresponding path program 1 times [2022-12-13 02:07:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:21,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156730627] [2022-12-13 02:07:21,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:21,092 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 02:07:21,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:21,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156730627] [2022-12-13 02:07:21,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156730627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:21,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:21,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:21,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078578210] [2022-12-13 02:07:21,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:21,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:21,093 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:21,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:21,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:21,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:21,139 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:21,139 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:21,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:21,139 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:21,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:21,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:21,140 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:21,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:21,141 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,141 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:21,141 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:21,141 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:21,141 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:21,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:21,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,144 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:21,144 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:21,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:21,144 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,144 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:21,263 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:21,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:21,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:21,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,265 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:21,265 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:21,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2634 [2022-12-13 02:07:21,265 INFO L420 AbstractCegarLoop]: === Iteration 2636 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:21,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:21,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1737907275, now seen corresponding path program 1 times [2022-12-13 02:07:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:21,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585499928] [2022-12-13 02:07:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:21,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:21,333 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 02:07:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:21,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585499928] [2022-12-13 02:07:21,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585499928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:21,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:21,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:21,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786457681] [2022-12-13 02:07:21,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:21,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:21,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:21,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:21,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:21,334 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:21,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:21,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:21,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:21,385 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:21,385 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:21,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:21,386 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:21,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:21,386 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:21,386 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:21,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:21,387 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,387 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:21,387 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:21,387 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:21,387 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,387 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:21,388 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:21,388 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,390 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:21,390 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:21,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:21,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:21,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:21,512 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:21,512 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:21,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,512 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:21,512 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:21,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2635 [2022-12-13 02:07:21,512 INFO L420 AbstractCegarLoop]: === Iteration 2637 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1680648973, now seen corresponding path program 1 times [2022-12-13 02:07:21,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:21,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528752714] [2022-12-13 02:07:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:21,570 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 02:07:21,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:21,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528752714] [2022-12-13 02:07:21,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528752714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:21,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:21,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:21,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14949606] [2022-12-13 02:07:21,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:21,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:21,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:21,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:21,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:21,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:21,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:21,621 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:21,621 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:21,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:21,622 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:21,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:21,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:21,622 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:21,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:21,623 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,623 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:21,623 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:21,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:21,623 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:21,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:21,624 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,626 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:21,626 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:21,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:21,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:21,743 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:21,744 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:21,744 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:21,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,744 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:21,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:21,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2636 [2022-12-13 02:07:21,744 INFO L420 AbstractCegarLoop]: === Iteration 2638 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1623390671, now seen corresponding path program 1 times [2022-12-13 02:07:21,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:21,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507433974] [2022-12-13 02:07:21,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:21,801 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 02:07:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507433974] [2022-12-13 02:07:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507433974] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870712595] [2022-12-13 02:07:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:21,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:21,802 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:21,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:21,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:21,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:21,853 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:21,853 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:21,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:21,854 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:21,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:21,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:21,854 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:21,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:21,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:21,855 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,855 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:21,855 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:21,855 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:21,855 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:21,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:21,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:21,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,858 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:21,858 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:21,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:21,858 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:21,858 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:21,976 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:21,977 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:21,977 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:21,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:21,977 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:21,977 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:21,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2637 [2022-12-13 02:07:21,977 INFO L420 AbstractCegarLoop]: === Iteration 2639 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:21,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1566132369, now seen corresponding path program 1 times [2022-12-13 02:07:21,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:21,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769310197] [2022-12-13 02:07:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:22,046 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 02:07:22,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:22,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769310197] [2022-12-13 02:07:22,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769310197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:22,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:22,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:22,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154104567] [2022-12-13 02:07:22,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:22,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:22,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:22,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:22,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:22,047 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:22,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:22,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:22,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:22,099 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:22,099 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:22,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:22,100 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:22,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:22,100 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:22,101 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:22,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:22,101 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,101 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:22,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:22,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:22,102 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:22,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:22,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,104 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:22,104 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:22,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:22,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:22,223 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:22,224 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:22,224 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:22,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,224 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:22,224 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:22,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2638 [2022-12-13 02:07:22,225 INFO L420 AbstractCegarLoop]: === Iteration 2640 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:22,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1508874067, now seen corresponding path program 1 times [2022-12-13 02:07:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:22,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66379824] [2022-12-13 02:07:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:22,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:22,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66379824] [2022-12-13 02:07:22,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66379824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:22,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:22,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224668906] [2022-12-13 02:07:22,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:22,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:22,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:22,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:22,286 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:22,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:22,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:22,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:22,338 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:22,338 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:22,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:22,339 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:22,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:22,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:22,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:22,339 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:22,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:22,340 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:22,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:22,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:22,340 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:22,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:22,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,354 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:22,354 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:22,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:22,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:22,473 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:22,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:22,474 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:22,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:22,475 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:22,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2639 [2022-12-13 02:07:22,475 INFO L420 AbstractCegarLoop]: === Iteration 2641 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1451615765, now seen corresponding path program 1 times [2022-12-13 02:07:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:22,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114670150] [2022-12-13 02:07:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:22,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:22,532 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 02:07:22,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:22,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114670150] [2022-12-13 02:07:22,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114670150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:22,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:22,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:22,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864631759] [2022-12-13 02:07:22,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:22,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:22,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:22,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:22,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:22,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:22,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:22,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:22,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:22,577 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:22,577 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:22,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:22,577 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:22,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:22,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:22,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:22,578 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:22,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:22,579 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:22,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:22,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:22,579 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:22,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:22,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:22,582 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:22,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:22,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:22,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:22,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:22,702 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:22,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:22,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:22,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2640 [2022-12-13 02:07:22,702 INFO L420 AbstractCegarLoop]: === Iteration 2642 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:22,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1394357463, now seen corresponding path program 1 times [2022-12-13 02:07:22,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:22,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219138917] [2022-12-13 02:07:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:22,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:22,761 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 02:07:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:22,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219138917] [2022-12-13 02:07:22,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219138917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:22,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:22,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:22,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916585918] [2022-12-13 02:07:22,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:22,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:22,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:22,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:22,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:22,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:22,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:22,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:22,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:22,806 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:22,806 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:22,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:22,806 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:22,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:22,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:22,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:22,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:22,807 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:22,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:22,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:22,808 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:22,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:22,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:22,808 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:22,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:22,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:22,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,811 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:22,811 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:22,811 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:22,811 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:22,943 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:22,945 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:22,945 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:22,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:22,945 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:22,945 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:22,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2641 [2022-12-13 02:07:22,945 INFO L420 AbstractCegarLoop]: === Iteration 2643 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:22,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:22,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1337099161, now seen corresponding path program 1 times [2022-12-13 02:07:22,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:22,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286239393] [2022-12-13 02:07:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:23,014 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 02:07:23,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:23,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286239393] [2022-12-13 02:07:23,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286239393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:23,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:23,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777545024] [2022-12-13 02:07:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:23,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:23,015 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:23,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:23,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:23,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:23,065 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:23,065 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:23,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:23,066 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:23,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:23,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:23,066 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:23,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:23,067 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:23,067 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:23,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:23,067 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,067 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:23,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:23,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,070 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:23,070 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:23,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:23,196 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:23,199 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 132 [2022-12-13 02:07:23,199 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:23,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,199 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:23,199 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:23,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2642 [2022-12-13 02:07:23,199 INFO L420 AbstractCegarLoop]: === Iteration 2644 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:23,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1279840859, now seen corresponding path program 1 times [2022-12-13 02:07:23,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:23,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121074646] [2022-12-13 02:07:23,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:23,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:23,275 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 02:07:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121074646] [2022-12-13 02:07:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121074646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:23,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:23,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:23,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389608126] [2022-12-13 02:07:23,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:23,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:23,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:23,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:23,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:23,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:23,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:23,323 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:23,323 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:23,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:23,324 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:23,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:23,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:23,324 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:23,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:23,326 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,326 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:23,326 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:23,326 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:23,326 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:23,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:23,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,330 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:23,330 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:23,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:23,330 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:23,467 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:23,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:23,469 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:23,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:23,469 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:23,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2643 [2022-12-13 02:07:23,469 INFO L420 AbstractCegarLoop]: === Iteration 2645 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1222582557, now seen corresponding path program 1 times [2022-12-13 02:07:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96929770] [2022-12-13 02:07:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:23,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:23,543 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 02:07:23,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:23,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96929770] [2022-12-13 02:07:23,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96929770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:23,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:23,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:23,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665673097] [2022-12-13 02:07:23,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:23,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:23,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:23,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:23,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:23,545 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:23,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:23,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:23,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:23,597 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:23,597 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:23,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:23,597 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:23,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:23,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:23,598 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:23,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:23,599 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,599 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:23,599 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:23,599 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:23,599 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,599 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:23,599 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:23,599 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,602 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:23,602 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:23,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:23,602 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,602 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:23,723 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:23,724 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:23,724 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:23,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,724 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:23,724 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:23,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2644 [2022-12-13 02:07:23,724 INFO L420 AbstractCegarLoop]: === Iteration 2646 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1165324255, now seen corresponding path program 1 times [2022-12-13 02:07:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749418597] [2022-12-13 02:07:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:23,796 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 02:07:23,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:23,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749418597] [2022-12-13 02:07:23,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749418597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:23,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:23,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780295621] [2022-12-13 02:07:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:23,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:23,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:23,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:23,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:23,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:23,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:23,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:23,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:23,841 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:23,841 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:23,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:23,841 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:23,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:23,842 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:23,842 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:23,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:23,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:23,843 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,843 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:23,843 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:23,843 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:23,843 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,843 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:23,843 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:23,843 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:23,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,846 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:23,846 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:23,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:23,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:23,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:23,964 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:23,965 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:23,965 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:23,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:23,966 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:23,966 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:23,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2645 [2022-12-13 02:07:23,966 INFO L420 AbstractCegarLoop]: === Iteration 2647 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1108065953, now seen corresponding path program 1 times [2022-12-13 02:07:23,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:23,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432596949] [2022-12-13 02:07:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:23,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:24,024 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 02:07:24,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:24,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432596949] [2022-12-13 02:07:24,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432596949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:24,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:24,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:24,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277550275] [2022-12-13 02:07:24,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:24,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:24,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:24,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:24,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:24,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:24,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:24,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:24,068 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:24,068 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:24,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:24,068 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:24,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:24,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:24,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:24,069 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:24,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:24,070 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:24,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:24,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:24,070 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:24,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:24,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,073 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:24,073 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:24,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:24,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:24,192 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:24,193 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:24,193 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:24,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,193 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:24,193 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:24,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2646 [2022-12-13 02:07:24,193 INFO L420 AbstractCegarLoop]: === Iteration 2648 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:24,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1050807651, now seen corresponding path program 1 times [2022-12-13 02:07:24,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:24,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135764422] [2022-12-13 02:07:24,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:24,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:24,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:24,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135764422] [2022-12-13 02:07:24,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135764422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:24,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:24,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220481392] [2022-12-13 02:07:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:24,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:24,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:24,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:24,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:24,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:24,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:24,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:24,297 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:24,297 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:24,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:24,298 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:24,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:24,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:24,298 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:24,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:24,299 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,299 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:24,299 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:24,299 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:24,299 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,300 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:24,300 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:24,300 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,302 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:24,302 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:24,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:24,303 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,303 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:24,424 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:24,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:24,425 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,425 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:24,425 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:24,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2647 [2022-12-13 02:07:24,425 INFO L420 AbstractCegarLoop]: === Iteration 2649 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -993549349, now seen corresponding path program 1 times [2022-12-13 02:07:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:24,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881750977] [2022-12-13 02:07:24,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:24,483 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 02:07:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:24,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881750977] [2022-12-13 02:07:24,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881750977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:24,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:24,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273786794] [2022-12-13 02:07:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:24,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:24,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:24,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:24,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:24,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:24,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:24,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:24,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:24,528 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:24,528 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:24,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:24,528 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:24,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:24,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:24,529 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:24,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:24,530 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,530 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:24,530 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:24,530 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:24,530 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,530 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:24,530 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:24,530 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,533 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:24,533 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:24,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:24,534 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,534 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:24,669 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:24,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:24,670 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:24,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:24,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:24,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2648 [2022-12-13 02:07:24,671 INFO L420 AbstractCegarLoop]: === Iteration 2650 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:24,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash -936291047, now seen corresponding path program 1 times [2022-12-13 02:07:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:24,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819719199] [2022-12-13 02:07:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:24,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:24,737 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 02:07:24,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819719199] [2022-12-13 02:07:24,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819719199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:24,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:24,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395897013] [2022-12-13 02:07:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:24,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:24,738 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:24,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:24,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:24,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:24,805 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:24,805 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:24,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:24,805 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:24,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:24,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:24,806 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:24,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:24,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:24,807 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:24,808 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:24,808 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:24,808 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,808 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:24,808 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:24,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:24,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,812 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:24,812 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:24,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:24,813 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:24,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:24,950 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:24,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:24,951 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:24,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:24,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:24,951 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:24,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2649 [2022-12-13 02:07:24,952 INFO L420 AbstractCegarLoop]: === Iteration 2651 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:24,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash -879032745, now seen corresponding path program 1 times [2022-12-13 02:07:24,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:24,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890155599] [2022-12-13 02:07:24,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:24,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,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 02:07:25,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890155599] [2022-12-13 02:07:25,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890155599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:25,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843882767] [2022-12-13 02:07:25,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:25,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:25,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:25,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:25,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,096 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:25,097 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:25,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:25,097 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:25,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:25,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:25,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:25,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:25,098 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:25,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:25,099 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,099 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:25,099 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:25,099 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,099 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,099 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,099 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,099 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,102 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:25,102 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:25,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:25,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,102 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:25,237 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:25,239 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:25,239 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:25,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,239 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,239 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2650 [2022-12-13 02:07:25,239 INFO L420 AbstractCegarLoop]: === Iteration 2652 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash -821774443, now seen corresponding path program 1 times [2022-12-13 02:07:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:25,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070567888] [2022-12-13 02:07:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,313 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 02:07:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070567888] [2022-12-13 02:07:25,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070567888] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381095900] [2022-12-13 02:07:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:25,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:25,315 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:25,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:25,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,377 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:25,377 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:25,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:25,378 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:25,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:25,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:25,379 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:25,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:25,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:25,379 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,380 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:25,380 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:25,380 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,380 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,383 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:25,383 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:25,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:25,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:25,506 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:25,507 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:25,507 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:25,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,507 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,507 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2651 [2022-12-13 02:07:25,507 INFO L420 AbstractCegarLoop]: === Iteration 2653 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,507 INFO L85 PathProgramCache]: Analyzing trace with hash -764516141, now seen corresponding path program 1 times [2022-12-13 02:07:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:25,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798755801] [2022-12-13 02:07:25,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,565 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 02:07:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798755801] [2022-12-13 02:07:25,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798755801] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:25,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184917737] [2022-12-13 02:07:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:25,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:25,566 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:25,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:25,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,611 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:25,611 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:25,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:25,612 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:25,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:25,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:25,612 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:25,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:25,613 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:25,613 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:25,613 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,614 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,614 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,614 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,616 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:25,617 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:25,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:25,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:25,740 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:25,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:07:25,741 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:25,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,741 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,741 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2652 [2022-12-13 02:07:25,741 INFO L420 AbstractCegarLoop]: === Iteration 2654 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -707257839, now seen corresponding path program 1 times [2022-12-13 02:07:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:25,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864055890] [2022-12-13 02:07:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:25,800 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 02:07:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:25,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864055890] [2022-12-13 02:07:25,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864055890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:25,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:25,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:25,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686269777] [2022-12-13 02:07:25,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:25,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:25,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:25,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:25,801 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:25,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:25,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:25,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:25,844 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:25,844 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:25,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:25,845 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:25,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:25,845 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:25,845 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:25,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:25,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:25,846 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,846 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:25,846 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:25,846 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:25,846 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:25,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:25,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:25,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,849 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:25,849 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:25,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:25,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:25,972 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:25,973 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:25,973 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:25,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:25,973 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:25,973 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:25,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2653 [2022-12-13 02:07:25,973 INFO L420 AbstractCegarLoop]: === Iteration 2655 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -649999537, now seen corresponding path program 1 times [2022-12-13 02:07:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:25,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075546776] [2022-12-13 02:07:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,031 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 02:07:26,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075546776] [2022-12-13 02:07:26,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075546776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:26,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965477157] [2022-12-13 02:07:26,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:26,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:26,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:26,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,075 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:26,075 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:26,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:26,076 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:26,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:26,076 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:26,076 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:26,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:26,077 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,077 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:26,077 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:26,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,077 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,080 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:26,080 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:26,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:26,081 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,081 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:26,221 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:26,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:07:26,222 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:26,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:26,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:26,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2654 [2022-12-13 02:07:26,222 INFO L420 AbstractCegarLoop]: === Iteration 2656 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -592741235, now seen corresponding path program 1 times [2022-12-13 02:07:26,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:26,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308649796] [2022-12-13 02:07:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,293 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 02:07:26,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308649796] [2022-12-13 02:07:26,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308649796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:26,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563717905] [2022-12-13 02:07:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:26,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:26,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:26,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:26,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,353 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:26,354 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:26,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:26,354 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:26,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:26,355 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:26,355 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:26,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:26,356 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,356 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:26,356 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:26,356 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,356 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,356 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,356 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,356 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,359 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:26,359 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:26,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:26,359 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,359 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:26,491 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:26,493 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:26,493 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:26,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,493 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:26,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:26,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2655 [2022-12-13 02:07:26,494 INFO L420 AbstractCegarLoop]: === Iteration 2657 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:26,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:26,494 INFO L85 PathProgramCache]: Analyzing trace with hash -535482933, now seen corresponding path program 1 times [2022-12-13 02:07:26,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:26,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736074054] [2022-12-13 02:07:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,569 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 02:07:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736074054] [2022-12-13 02:07:26,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736074054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544585390] [2022-12-13 02:07:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:26,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:26,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:26,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,625 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:26,625 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:26,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:26,626 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:26,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:26,626 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:26,626 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:26,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:26,627 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,627 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:26,627 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:26,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,627 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,630 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:26,630 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:26,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:26,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:26,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:26,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 02:07:26,788 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:26,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:26,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:26,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2656 [2022-12-13 02:07:26,788 INFO L420 AbstractCegarLoop]: === Iteration 2658 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:26,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash -478224631, now seen corresponding path program 1 times [2022-12-13 02:07:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:26,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090885568] [2022-12-13 02:07:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:26,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:26,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090885568] [2022-12-13 02:07:26,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090885568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:26,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:26,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348547363] [2022-12-13 02:07:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:26,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:26,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:26,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:26,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:26,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:26,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:26,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:26,918 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:26,919 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:26,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:26,919 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:26,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:26,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:26,920 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:26,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:26,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:26,921 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:26,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:26,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:26,921 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:26,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:26,922 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,924 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:26,924 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:26,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:26,925 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:26,925 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:27,056 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:27,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:27,058 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:27,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:27,058 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:27,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2657 [2022-12-13 02:07:27,058 INFO L420 AbstractCegarLoop]: === Iteration 2659 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:27,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:27,059 INFO L85 PathProgramCache]: Analyzing trace with hash -420966329, now seen corresponding path program 1 times [2022-12-13 02:07:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:27,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248142761] [2022-12-13 02:07:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:27,118 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 02:07:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:27,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248142761] [2022-12-13 02:07:27,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248142761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:27,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:27,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:27,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713526143] [2022-12-13 02:07:27,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:27,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:27,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:27,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:27,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:27,119 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:27,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:27,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:27,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:27,180 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:27,181 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:27,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:27,181 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:27,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:27,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:27,182 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:27,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:27,183 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,183 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:27,183 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:27,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:27,183 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,183 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:27,183 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:27,183 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,186 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:27,186 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:27,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:27,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:27,324 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:27,326 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:27,327 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:27,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,327 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:27,327 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:27,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2658 [2022-12-13 02:07:27,327 INFO L420 AbstractCegarLoop]: === Iteration 2660 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:27,327 INFO L85 PathProgramCache]: Analyzing trace with hash -363708027, now seen corresponding path program 1 times [2022-12-13 02:07:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:27,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542369062] [2022-12-13 02:07:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:27,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:27,405 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 02:07:27,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542369062] [2022-12-13 02:07:27,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542369062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:27,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:27,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872282453] [2022-12-13 02:07:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:27,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:27,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:27,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:27,406 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:27,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:27,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:27,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:27,469 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:27,470 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:27,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:27,470 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:27,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:27,471 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:27,471 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:27,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:27,472 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,472 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:27,472 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:27,472 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:27,472 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,472 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:27,472 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:27,472 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,475 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:27,475 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:27,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:27,475 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,475 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:27,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:27,598 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:27,598 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:27,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,598 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:27,598 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:27,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2659 [2022-12-13 02:07:27,598 INFO L420 AbstractCegarLoop]: === Iteration 2661 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash -306449725, now seen corresponding path program 1 times [2022-12-13 02:07:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:27,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441832764] [2022-12-13 02:07:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:27,671 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 02:07:27,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:27,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441832764] [2022-12-13 02:07:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441832764] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:27,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:27,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139154320] [2022-12-13 02:07:27,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:27,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:27,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:27,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:27,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:27,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:27,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:27,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:27,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:27,717 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:27,717 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:27,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:27,717 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:27,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:27,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:27,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:27,718 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:27,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:27,719 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:27,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:27,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:27,719 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:27,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:27,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,722 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:27,722 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:27,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:27,722 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:27,857 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:27,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:27,859 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:27,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:27,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:27,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2660 [2022-12-13 02:07:27,859 INFO L420 AbstractCegarLoop]: === Iteration 2662 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -249191423, now seen corresponding path program 1 times [2022-12-13 02:07:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:27,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38941101] [2022-12-13 02:07:27,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:27,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:27,918 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 02:07:27,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:27,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38941101] [2022-12-13 02:07:27,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38941101] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:27,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:27,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:27,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653041515] [2022-12-13 02:07:27,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:27,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:27,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:27,919 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:27,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:27,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:27,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:27,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:27,962 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:27,962 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:27,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:27,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:27,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:27,963 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:27,963 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:27,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:27,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:27,964 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:27,964 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:27,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:27,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:27,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:27,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:27,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,967 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:27,967 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:27,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:27,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:27,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:28,086 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:28,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:28,087 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:28,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:28,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:28,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2661 [2022-12-13 02:07:28,088 INFO L420 AbstractCegarLoop]: === Iteration 2663 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:28,088 INFO L85 PathProgramCache]: Analyzing trace with hash -191933121, now seen corresponding path program 1 times [2022-12-13 02:07:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:28,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356351635] [2022-12-13 02:07:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:28,173 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 02:07:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:28,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356351635] [2022-12-13 02:07:28,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356351635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:28,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:28,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084847179] [2022-12-13 02:07:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:28,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:28,174 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:28,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:28,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:28,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:28,218 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:28,218 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:28,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:28,218 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:28,218 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:28,219 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:28,219 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:28,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:28,220 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,220 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:28,220 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:28,220 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:28,220 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,220 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:28,220 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:28,220 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,223 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:28,223 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:28,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:28,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,223 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:28,341 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:28,342 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:28,342 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:28,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:28,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:28,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2662 [2022-12-13 02:07:28,343 INFO L420 AbstractCegarLoop]: === Iteration 2664 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:28,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:28,343 INFO L85 PathProgramCache]: Analyzing trace with hash -134674819, now seen corresponding path program 1 times [2022-12-13 02:07:28,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:28,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116575141] [2022-12-13 02:07:28,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:28,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:28,402 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 02:07:28,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116575141] [2022-12-13 02:07:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116575141] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:28,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:28,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:28,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611345649] [2022-12-13 02:07:28,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:28,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:28,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:28,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:28,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:28,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:28,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:28,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:28,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:28,454 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:28,454 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:28,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:28,455 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:28,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:28,455 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:28,455 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:28,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:28,456 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,456 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:28,456 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:28,456 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:28,456 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,457 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:28,457 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:28,457 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,459 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:28,459 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:28,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:28,460 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,460 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:28,580 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:28,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:28,581 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:28,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:28,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:28,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2663 [2022-12-13 02:07:28,582 INFO L420 AbstractCegarLoop]: === Iteration 2665 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash -77416517, now seen corresponding path program 1 times [2022-12-13 02:07:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:28,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090705746] [2022-12-13 02:07:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:28,640 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 02:07:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:28,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090705746] [2022-12-13 02:07:28,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090705746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:28,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:28,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:28,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580703817] [2022-12-13 02:07:28,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:28,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:28,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:28,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:28,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:28,641 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:28,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:28,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:28,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:28,685 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:28,685 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:28,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:28,686 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:28,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:28,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:28,686 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:28,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:28,687 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:28,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:28,688 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:28,688 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:28,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:28,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,690 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:28,690 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:28,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:28,691 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,691 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:28,812 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:28,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:28,813 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:28,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,813 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:28,813 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:28,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2664 [2022-12-13 02:07:28,813 INFO L420 AbstractCegarLoop]: === Iteration 2666 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash -20158215, now seen corresponding path program 1 times [2022-12-13 02:07:28,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:28,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813429030] [2022-12-13 02:07:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:28,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:28,881 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 02:07:28,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:28,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813429030] [2022-12-13 02:07:28,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813429030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:28,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:28,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:28,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623517141] [2022-12-13 02:07:28,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:28,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:28,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:28,882 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:28,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:28,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:28,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:28,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:28,939 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:28,939 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:28,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:28,940 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:28,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:28,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:28,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:28,940 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:28,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:28,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:28,941 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:28,941 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:28,941 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:28,941 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,941 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:28,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:28,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:28,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,944 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:28,944 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:28,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:28,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:29,070 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:29,071 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:07:29,071 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:29,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,071 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:29,071 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:29,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2665 [2022-12-13 02:07:29,072 INFO L420 AbstractCegarLoop]: === Iteration 2667 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:29,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 37100087, now seen corresponding path program 1 times [2022-12-13 02:07:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:29,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950289337] [2022-12-13 02:07:29,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:29,129 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 02:07:29,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950289337] [2022-12-13 02:07:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950289337] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:29,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:29,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540570386] [2022-12-13 02:07:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:29,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:29,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:29,130 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:29,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:29,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:29,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:29,185 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:29,185 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:29,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:29,186 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:29,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:29,186 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:29,186 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:29,187 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,187 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:29,187 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:29,187 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:29,187 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,188 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:29,188 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:29,188 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,190 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:29,191 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:29,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:29,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,191 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:29,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:29,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:29,311 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:29,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,311 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:29,311 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:29,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2666 [2022-12-13 02:07:29,312 INFO L420 AbstractCegarLoop]: === Iteration 2668 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:29,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash 94358389, now seen corresponding path program 1 times [2022-12-13 02:07:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:29,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603718487] [2022-12-13 02:07:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:29,369 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 02:07:29,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:29,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603718487] [2022-12-13 02:07:29,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603718487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:29,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:29,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:29,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145097508] [2022-12-13 02:07:29,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:29,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:29,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:29,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:29,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:29,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:29,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:29,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:29,421 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:29,421 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:29,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:29,421 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:29,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:29,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:29,422 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:29,422 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:29,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:29,423 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:29,423 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:29,423 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:29,423 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,423 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:29,423 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:29,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,426 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:29,426 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:29,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:29,426 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,426 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:29,559 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:29,561 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:07:29,561 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:29,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,561 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:29,561 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:29,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2667 [2022-12-13 02:07:29,561 INFO L420 AbstractCegarLoop]: === Iteration 2669 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:29,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:29,561 INFO L85 PathProgramCache]: Analyzing trace with hash 151616691, now seen corresponding path program 1 times [2022-12-13 02:07:29,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:29,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255744972] [2022-12-13 02:07:29,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:29,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:29,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:29,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255744972] [2022-12-13 02:07:29,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255744972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:29,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:29,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:29,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275454894] [2022-12-13 02:07:29,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:29,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:29,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:29,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:29,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:29,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:29,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:29,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:29,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:29,685 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:29,685 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:29,685 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:29,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:29,686 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:29,686 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:29,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:29,687 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:29,687 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:29,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:29,687 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,687 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:29,687 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:29,687 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,690 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:29,690 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:29,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:29,690 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,690 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:29,812 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:29,814 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:29,814 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:29,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:29,814 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:29,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2668 [2022-12-13 02:07:29,814 INFO L420 AbstractCegarLoop]: === Iteration 2670 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:29,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash 208874993, now seen corresponding path program 1 times [2022-12-13 02:07:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:29,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56872644] [2022-12-13 02:07:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:29,875 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 02:07:29,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:29,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56872644] [2022-12-13 02:07:29,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56872644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:29,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:29,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37862052] [2022-12-13 02:07:29,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:29,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:29,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:29,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:29,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:29,876 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:29,876 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:29,876 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:29,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:29,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:29,919 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:29,919 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:29,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:29,920 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:29,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:29,920 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:29,920 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:29,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:29,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:29,921 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,921 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:29,921 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:29,921 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:29,921 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:29,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:29,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,924 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:29,924 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:29,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:29,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:29,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:30,041 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:30,043 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:30,043 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:30,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:30,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:30,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2669 [2022-12-13 02:07:30,043 INFO L420 AbstractCegarLoop]: === Iteration 2671 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash 266133295, now seen corresponding path program 1 times [2022-12-13 02:07:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:30,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812028700] [2022-12-13 02:07:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:30,103 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 02:07:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:30,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812028700] [2022-12-13 02:07:30,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812028700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:30,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:30,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162513165] [2022-12-13 02:07:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:30,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:30,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:30,104 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:30,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:30,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:30,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:30,167 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:30,167 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:30,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:30,167 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:30,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:30,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:30,168 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:30,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:30,169 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,169 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:30,169 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:30,169 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:30,169 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,169 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:30,169 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:30,169 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,172 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:30,172 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:30,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:30,172 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,172 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:30,293 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:30,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:30,295 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:30,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,295 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:30,295 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:30,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2670 [2022-12-13 02:07:30,295 INFO L420 AbstractCegarLoop]: === Iteration 2672 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:30,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash 323391597, now seen corresponding path program 1 times [2022-12-13 02:07:30,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:30,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789717879] [2022-12-13 02:07:30,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:30,369 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 02:07:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:30,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789717879] [2022-12-13 02:07:30,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789717879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:30,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:30,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567694895] [2022-12-13 02:07:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:30,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:30,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:30,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:30,371 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:30,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:30,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:30,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:30,433 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:30,433 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:30,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:30,434 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:30,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:30,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:30,434 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:30,434 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:30,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:30,435 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,435 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:30,435 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:30,435 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:30,436 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,436 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:30,436 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:30,436 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,438 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:30,439 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:30,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:30,439 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,439 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:30,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:30,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:30,574 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:30,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:30,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:30,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2671 [2022-12-13 02:07:30,574 INFO L420 AbstractCegarLoop]: === Iteration 2673 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 380649899, now seen corresponding path program 1 times [2022-12-13 02:07:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:30,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752944546] [2022-12-13 02:07:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:30,640 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 02:07:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:30,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752944546] [2022-12-13 02:07:30,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752944546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:30,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:30,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865256933] [2022-12-13 02:07:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:30,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:30,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:30,640 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:30,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:30,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:30,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:30,693 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:30,693 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:30,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:30,694 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:30,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:30,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:30,694 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:30,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:30,695 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,695 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:30,695 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:30,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:30,695 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,695 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:30,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:30,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,698 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:30,698 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:30,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:30,699 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,699 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:30,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:30,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:30,836 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:30,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:30,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:30,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2672 [2022-12-13 02:07:30,836 INFO L420 AbstractCegarLoop]: === Iteration 2674 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 437908201, now seen corresponding path program 1 times [2022-12-13 02:07:30,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:30,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28553076] [2022-12-13 02:07:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:30,910 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 02:07:30,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:30,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28553076] [2022-12-13 02:07:30,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28553076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:30,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:30,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:30,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574297271] [2022-12-13 02:07:30,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:30,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:30,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:30,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:30,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:30,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:30,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:30,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:30,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:30,978 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:30,979 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:30,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:30,979 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:30,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:30,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:30,980 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:30,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:30,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:30,981 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,981 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:30,981 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:30,981 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:30,981 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,981 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:30,981 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:30,981 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:30,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,984 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:30,984 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:30,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:30,984 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:30,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:31,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:31,121 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:31,121 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:31,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,122 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:31,122 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:31,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2673 [2022-12-13 02:07:31,122 INFO L420 AbstractCegarLoop]: === Iteration 2675 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:31,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash 495166503, now seen corresponding path program 1 times [2022-12-13 02:07:31,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:31,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110947566] [2022-12-13 02:07:31,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:31,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 02:07:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:31,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110947566] [2022-12-13 02:07:31,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110947566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:31,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:31,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:31,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855585317] [2022-12-13 02:07:31,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:31,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:31,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:31,193 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:31,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:31,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:31,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:31,238 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:31,238 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:31,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:31,239 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:31,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:31,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:31,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:31,239 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:31,239 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:31,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:31,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:31,240 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,240 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:31,240 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:31,240 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:31,240 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:31,241 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:31,241 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:31,243 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:31,243 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:31,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:31,244 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:31,244 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:31,363 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:31,365 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:31,365 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:31,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,365 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:31,365 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:31,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2674 [2022-12-13 02:07:31,365 INFO L420 AbstractCegarLoop]: === Iteration 2676 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:31,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:31,365 INFO L85 PathProgramCache]: Analyzing trace with hash 552424805, now seen corresponding path program 1 times [2022-12-13 02:07:31,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:31,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30562564] [2022-12-13 02:07:31,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:31,425 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 02:07:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:31,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30562564] [2022-12-13 02:07:31,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30562564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:31,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:31,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:31,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833934071] [2022-12-13 02:07:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:31,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:31,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:31,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:31,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:31,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:31,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:31,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:31,472 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:31,473 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:31,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:31,473 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:31,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:31,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:31,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:31,474 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:31,474 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:31,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:31,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:31,475 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,475 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:31,476 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:31,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:31,476 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:31,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:31,476 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:31,479 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:31,480 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:31,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:31,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:31,616 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:31,617 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:31,618 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:31,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:31,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:31,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2675 [2022-12-13 02:07:31,618 INFO L420 AbstractCegarLoop]: === Iteration 2677 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 609683107, now seen corresponding path program 1 times [2022-12-13 02:07:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:31,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579065320] [2022-12-13 02:07:31,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:31,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:31,690 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 02:07:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:31,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579065320] [2022-12-13 02:07:31,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579065320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:31,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:31,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290534804] [2022-12-13 02:07:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:31,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:31,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:31,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:31,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:31,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:31,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:31,746 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:31,746 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:31,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:31,747 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:31,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:31,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:31,747 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:31,747 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:31,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:31,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:31,748 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,748 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:31,748 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:31,748 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:31,748 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,748 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:31,748 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:31,748 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:31,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:31,751 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:31,751 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:31,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:31,751 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:31,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:31,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:31,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:31,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:31,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:31,889 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:31,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2676 [2022-12-13 02:07:31,889 INFO L420 AbstractCegarLoop]: === Iteration 2678 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:31,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:31,889 INFO L85 PathProgramCache]: Analyzing trace with hash 666941409, now seen corresponding path program 1 times [2022-12-13 02:07:31,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131614928] [2022-12-13 02:07:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:31,947 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 02:07:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:31,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131614928] [2022-12-13 02:07:31,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131614928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:31,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:31,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875452131] [2022-12-13 02:07:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:31,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:31,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:31,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:31,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:31,948 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:31,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:31,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:31,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:31,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:31,999 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:31,999 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:31,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:31,999 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:31,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:32,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:32,000 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:32,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:32,001 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,001 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:32,001 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:32,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:32,001 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,001 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:32,001 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:32,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,004 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:32,004 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:32,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:32,004 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,004 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:32,122 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:32,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:32,123 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:32,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:32,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:32,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2677 [2022-12-13 02:07:32,123 INFO L420 AbstractCegarLoop]: === Iteration 2679 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:32,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 724199711, now seen corresponding path program 1 times [2022-12-13 02:07:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731516969] [2022-12-13 02:07:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:32,183 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 02:07:32,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731516969] [2022-12-13 02:07:32,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731516969] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:32,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:32,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523503663] [2022-12-13 02:07:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:32,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:32,184 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:32,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:32,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:32,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:32,234 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:32,234 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:32,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:32,235 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:32,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:32,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:32,235 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:32,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:32,236 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,236 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:32,236 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:32,236 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:32,236 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:32,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:32,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,239 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:32,239 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:32,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:32,240 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,240 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:32,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:32,357 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:32,357 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:32,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:32,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:32,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2678 [2022-12-13 02:07:32,358 INFO L420 AbstractCegarLoop]: === Iteration 2680 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 781458013, now seen corresponding path program 1 times [2022-12-13 02:07:32,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:32,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671866485] [2022-12-13 02:07:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:32,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:32,429 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 02:07:32,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671866485] [2022-12-13 02:07:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671866485] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:32,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:32,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765174230] [2022-12-13 02:07:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:32,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:32,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:32,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:32,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:32,430 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:32,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:32,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:32,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:32,474 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:32,474 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:32,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:32,475 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:32,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:32,475 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:32,475 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:32,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:32,476 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,476 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:32,476 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:32,476 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:32,476 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:32,476 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:32,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,479 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:32,479 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:32,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:32,480 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,480 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:32,596 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:32,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:32,597 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:32,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:32,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:32,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2679 [2022-12-13 02:07:32,597 INFO L420 AbstractCegarLoop]: === Iteration 2681 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:32,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash 838716315, now seen corresponding path program 1 times [2022-12-13 02:07:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:32,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665138056] [2022-12-13 02:07:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:32,656 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 02:07:32,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:32,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665138056] [2022-12-13 02:07:32,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665138056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:32,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:32,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659125371] [2022-12-13 02:07:32,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:32,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:32,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:32,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:32,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:32,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:32,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:32,708 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:32,708 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:32,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:32,709 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:32,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:32,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:32,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:32,709 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:32,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:32,710 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,710 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:32,710 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:32,710 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:32,710 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,710 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:32,710 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:32,711 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,713 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:32,713 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:32,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:32,713 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,714 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:32,829 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:32,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:32,831 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:32,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:32,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:32,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2680 [2022-12-13 02:07:32,831 INFO L420 AbstractCegarLoop]: === Iteration 2682 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash 895974617, now seen corresponding path program 1 times [2022-12-13 02:07:32,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:32,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057237546] [2022-12-13 02:07:32,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:32,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:32,888 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 02:07:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:32,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057237546] [2022-12-13 02:07:32,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057237546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:32,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:32,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:32,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141329228] [2022-12-13 02:07:32,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:32,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:32,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:32,889 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:32,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:32,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:32,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:32,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:32,940 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:32,940 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:32,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:32,941 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:32,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:32,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:32,941 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:32,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:32,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:32,942 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:32,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:32,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:32,942 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:32,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:32,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:32,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,945 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:32,945 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:32,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:32,945 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:33,062 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:33,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:33,063 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:33,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:33,063 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:33,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2681 [2022-12-13 02:07:33,063 INFO L420 AbstractCegarLoop]: === Iteration 2683 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:33,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash 953232919, now seen corresponding path program 1 times [2022-12-13 02:07:33,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:33,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711502059] [2022-12-13 02:07:33,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:33,131 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 02:07:33,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:33,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711502059] [2022-12-13 02:07:33,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711502059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:33,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:33,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730161915] [2022-12-13 02:07:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:33,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:33,132 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:33,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:33,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:33,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:33,184 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:33,184 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:33,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:33,185 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:33,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:33,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:33,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:33,185 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:33,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:33,186 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:33,186 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:33,186 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:33,186 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,186 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:33,187 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:33,187 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,189 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:33,189 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:33,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:33,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,190 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:33,305 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:33,306 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:33,306 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:33,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:33,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:33,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2682 [2022-12-13 02:07:33,306 INFO L420 AbstractCegarLoop]: === Iteration 2684 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:33,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1010491221, now seen corresponding path program 1 times [2022-12-13 02:07:33,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:33,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650493163] [2022-12-13 02:07:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:33,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 02:07:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:33,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650493163] [2022-12-13 02:07:33,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650493163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:33,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:33,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:33,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417174584] [2022-12-13 02:07:33,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:33,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:33,365 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:33,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:33,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:33,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:33,415 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:33,415 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:33,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:33,416 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:33,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:33,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:33,416 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:33,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:33,417 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,417 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:33,417 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:33,417 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:33,418 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:33,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:33,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,420 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:33,420 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:33,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:33,421 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,421 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:33,539 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:33,540 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:33,540 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:33,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:33,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:33,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2683 [2022-12-13 02:07:33,541 INFO L420 AbstractCegarLoop]: === Iteration 2685 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1067749523, now seen corresponding path program 1 times [2022-12-13 02:07:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:33,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469740709] [2022-12-13 02:07:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:33,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:33,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 02:07:33,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:33,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469740709] [2022-12-13 02:07:33,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469740709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:33,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:33,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:33,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308872294] [2022-12-13 02:07:33,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:33,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:33,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:33,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:33,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:33,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:33,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:33,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:33,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:33,642 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:33,642 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:33,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:33,643 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:33,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:33,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:33,643 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:33,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:33,644 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:33,644 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:33,644 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:33,644 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,645 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:33,645 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:33,645 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,647 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:33,647 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:33,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:33,648 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:33,805 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:33,806 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 162 [2022-12-13 02:07:33,806 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:33,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,806 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:33,806 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:33,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2684 [2022-12-13 02:07:33,806 INFO L420 AbstractCegarLoop]: === Iteration 2686 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:33,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1125007825, now seen corresponding path program 1 times [2022-12-13 02:07:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:33,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734291989] [2022-12-13 02:07:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:33,870 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 02:07:33,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:33,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734291989] [2022-12-13 02:07:33,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734291989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:33,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:33,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:33,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312674331] [2022-12-13 02:07:33,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:33,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:33,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:33,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:33,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:33,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:33,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:33,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:33,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:33,915 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:33,915 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:33,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:33,916 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:33,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:33,916 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:33,916 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:33,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:33,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:33,917 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,917 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:33,917 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:33,917 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:33,917 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,918 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:33,918 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:33,918 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:33,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:33,922 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:33,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:33,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:33,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:34,049 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:34,051 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:34,051 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:34,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,051 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:34,051 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2685 [2022-12-13 02:07:34,051 INFO L420 AbstractCegarLoop]: === Iteration 2687 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1182266127, now seen corresponding path program 1 times [2022-12-13 02:07:34,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:34,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134331181] [2022-12-13 02:07:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:34,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:34,112 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 02:07:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:34,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134331181] [2022-12-13 02:07:34,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134331181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:34,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:34,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:34,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207984566] [2022-12-13 02:07:34,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:34,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:34,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:34,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:34,113 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:34,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:34,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:34,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:34,168 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:34,169 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:34,169 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:34,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:34,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:34,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:34,170 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:34,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:34,170 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,171 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:34,171 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:34,171 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:34,171 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,171 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:34,171 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:34,171 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,174 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:34,174 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:34,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:34,174 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,174 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:34,312 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:34,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:34,314 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:34,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,314 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:34,314 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:34,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2686 [2022-12-13 02:07:34,314 INFO L420 AbstractCegarLoop]: === Iteration 2688 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:34,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1239524429, now seen corresponding path program 1 times [2022-12-13 02:07:34,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:34,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705297551] [2022-12-13 02:07:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:34,374 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 02:07:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:34,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705297551] [2022-12-13 02:07:34,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705297551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:34,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:34,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103054513] [2022-12-13 02:07:34,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:34,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:34,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:34,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:34,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:34,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:34,426 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:34,426 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:34,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:34,427 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:34,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:34,427 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:34,428 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:34,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:34,428 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,428 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:34,429 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:34,429 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:34,429 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:34,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:34,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,432 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:34,432 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:34,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:34,432 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,432 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:34,563 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:34,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:07:34,565 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:34,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:34,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:34,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2687 [2022-12-13 02:07:34,565 INFO L420 AbstractCegarLoop]: === Iteration 2689 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1296782731, now seen corresponding path program 1 times [2022-12-13 02:07:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:34,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825939219] [2022-12-13 02:07:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:34,647 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 02:07:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:34,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825939219] [2022-12-13 02:07:34,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825939219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:34,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:34,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:34,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091536713] [2022-12-13 02:07:34,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:34,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:34,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:34,648 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:34,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:34,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:34,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:34,701 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:34,701 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:34,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:34,702 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:34,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:34,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:34,702 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:34,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:34,703 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,703 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:34,703 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:34,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:34,703 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,704 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:34,704 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:34,704 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,706 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:34,706 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:34,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:34,707 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,707 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:34,840 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:34,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:34,842 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,842 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:34,842 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:34,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2688 [2022-12-13 02:07:34,842 INFO L420 AbstractCegarLoop]: === Iteration 2690 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:34,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1354041033, now seen corresponding path program 1 times [2022-12-13 02:07:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:34,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419696862] [2022-12-13 02:07:34,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:34,915 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 02:07:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:34,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419696862] [2022-12-13 02:07:34,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419696862] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:34,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:34,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744977857] [2022-12-13 02:07:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:34,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:34,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:34,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:34,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:34,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:34,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:34,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:34,979 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:34,979 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:34,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:34,980 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:34,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:34,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:34,981 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:34,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:34,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:34,982 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:34,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:34,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:34,982 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:34,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:34,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:34,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,987 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:34,987 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:34,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:34,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:34,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:35,123 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:35,126 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 144 [2022-12-13 02:07:35,126 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:35,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:35,126 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:35,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2689 [2022-12-13 02:07:35,126 INFO L420 AbstractCegarLoop]: === Iteration 2691 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:35,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:35,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1411299335, now seen corresponding path program 1 times [2022-12-13 02:07:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:35,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514634348] [2022-12-13 02:07:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:35,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:35,219 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 02:07:35,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:35,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514634348] [2022-12-13 02:07:35,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514634348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:35,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:35,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201524141] [2022-12-13 02:07:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:35,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:35,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:35,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:35,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:35,221 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:35,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:35,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:35,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:35,273 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:35,273 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:35,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:35,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:35,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:35,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:35,274 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:35,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:35,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:35,275 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:35,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:35,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:35,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:35,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:35,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:35,278 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:35,279 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:35,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:35,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:35,420 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:35,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 146 [2022-12-13 02:07:35,422 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:35,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,422 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:35,422 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:35,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2690 [2022-12-13 02:07:35,423 INFO L420 AbstractCegarLoop]: === Iteration 2692 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:35,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1468557637, now seen corresponding path program 1 times [2022-12-13 02:07:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:35,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308607199] [2022-12-13 02:07:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:35,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:35,485 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 02:07:35,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:35,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308607199] [2022-12-13 02:07:35,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308607199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:35,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:35,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:35,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635056989] [2022-12-13 02:07:35,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:35,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:35,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:35,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:35,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:35,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:35,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:35,544 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:35,544 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:35,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:35,545 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:35,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:35,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:35,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:35,545 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:35,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:35,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:35,546 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:35,546 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:35,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:35,546 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:35,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:35,547 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:35,549 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:35,549 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:35,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:35,550 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:35,550 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:35,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:35,674 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:07:35,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:35,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,675 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:35,675 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:35,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2691 [2022-12-13 02:07:35,675 INFO L420 AbstractCegarLoop]: === Iteration 2693 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:35,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1525815939, now seen corresponding path program 1 times [2022-12-13 02:07:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:35,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306370449] [2022-12-13 02:07:35,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:35,751 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 02:07:35,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:35,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306370449] [2022-12-13 02:07:35,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306370449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:35,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:35,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:35,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583314961] [2022-12-13 02:07:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:35,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:35,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:35,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:35,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:35,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:35,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:35,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:35,813 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:35,813 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:35,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:35,813 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:35,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:35,814 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:35,814 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:35,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:35,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:35,815 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,815 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:35,815 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:35,815 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:35,815 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:35,815 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:35,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:35,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:35,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:35,818 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:35,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:35,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:35,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:35,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:35,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:07:35,960 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:35,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:35,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:35,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:35,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2692 [2022-12-13 02:07:35,961 INFO L420 AbstractCegarLoop]: === Iteration 2694 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:35,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1583074241, now seen corresponding path program 1 times [2022-12-13 02:07:35,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:35,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651276417] [2022-12-13 02:07:35,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:35,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:36,033 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 02:07:36,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:36,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651276417] [2022-12-13 02:07:36,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651276417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:36,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:36,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:36,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800310251] [2022-12-13 02:07:36,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:36,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:36,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:36,034 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:36,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:36,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:36,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:36,088 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:36,088 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:36,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:36,088 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:36,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:36,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:36,089 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:36,089 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:36,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:36,090 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,090 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:36,090 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:36,090 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:36,090 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,091 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:36,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:36,091 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,094 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:36,094 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:36,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:36,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:36,232 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:36,233 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:36,233 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:36,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,233 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:36,233 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:36,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2693 [2022-12-13 02:07:36,233 INFO L420 AbstractCegarLoop]: === Iteration 2695 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:36,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1640332543, now seen corresponding path program 1 times [2022-12-13 02:07:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:36,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870759208] [2022-12-13 02:07:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:36,293 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 02:07:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:36,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870759208] [2022-12-13 02:07:36,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870759208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:36,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:36,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:36,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231661912] [2022-12-13 02:07:36,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:36,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:36,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:36,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:36,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:36,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:36,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:36,337 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:36,337 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:36,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:36,338 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:36,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:36,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:36,338 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:36,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:36,339 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,339 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:36,339 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:36,339 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:36,339 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:36,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:36,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,342 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:36,342 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:36,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:36,342 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,342 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:36,463 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:36,464 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:36,464 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:36,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:36,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:36,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2694 [2022-12-13 02:07:36,465 INFO L420 AbstractCegarLoop]: === Iteration 2696 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:36,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1697590845, now seen corresponding path program 1 times [2022-12-13 02:07:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:36,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405153469] [2022-12-13 02:07:36,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:36,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:36,526 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 02:07:36,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:36,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405153469] [2022-12-13 02:07:36,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405153469] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:36,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:36,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:36,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187642318] [2022-12-13 02:07:36,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:36,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:36,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:36,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:36,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:36,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:36,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:36,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:36,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:36,570 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:36,570 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:36,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:36,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:36,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:36,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:36,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:36,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:36,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:36,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:36,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:36,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:36,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:36,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,575 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:36,575 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:36,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:36,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:36,690 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:36,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:36,691 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:36,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:36,691 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:36,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2695 [2022-12-13 02:07:36,691 INFO L420 AbstractCegarLoop]: === Iteration 2697 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1754849147, now seen corresponding path program 1 times [2022-12-13 02:07:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:36,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499898663] [2022-12-13 02:07:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:36,778 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 02:07:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:36,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499898663] [2022-12-13 02:07:36,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499898663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:36,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:36,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116435312] [2022-12-13 02:07:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:36,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:36,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:36,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:36,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:36,779 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:36,780 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,780 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:36,780 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:36,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:36,830 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:36,830 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:36,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:36,831 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:36,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:36,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:36,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:36,831 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:36,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:36,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:36,832 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,832 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:36,832 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:36,832 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:36,832 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,833 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:36,833 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:36,833 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:36,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,835 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:36,835 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:36,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:36,836 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:36,836 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:36,952 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:36,953 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:36,953 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:36,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:36,953 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:36,953 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:36,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2696 [2022-12-13 02:07:36,954 INFO L420 AbstractCegarLoop]: === Iteration 2698 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:36,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1812107449, now seen corresponding path program 1 times [2022-12-13 02:07:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:36,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304800799] [2022-12-13 02:07:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:37,015 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 02:07:37,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:37,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304800799] [2022-12-13 02:07:37,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304800799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:37,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:37,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:37,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765703979] [2022-12-13 02:07:37,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:37,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:37,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:37,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:37,016 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:37,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:37,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:37,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:37,066 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:37,066 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:37,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:37,066 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:37,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:37,067 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:37,067 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:37,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:37,068 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:37,068 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:37,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:37,068 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,068 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:37,068 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:37,068 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,071 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:37,071 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:37,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:37,071 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,071 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:37,188 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:37,189 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:37,189 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:37,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:37,189 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:37,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2697 [2022-12-13 02:07:37,190 INFO L420 AbstractCegarLoop]: === Iteration 2699 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1869365751, now seen corresponding path program 1 times [2022-12-13 02:07:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:37,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541349137] [2022-12-13 02:07:37,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:37,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:37,260 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 02:07:37,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:37,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541349137] [2022-12-13 02:07:37,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541349137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:37,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:37,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125818664] [2022-12-13 02:07:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:37,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:37,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:37,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:37,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:37,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:37,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:37,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:37,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:37,311 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:37,312 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:37,312 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:37,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:37,313 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:37,313 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:37,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:37,313 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,314 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:37,314 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:37,314 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:37,314 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:37,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:37,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,317 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:37,317 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:37,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:37,317 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,317 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:37,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:37,435 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:37,435 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:37,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,435 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:37,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:37,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2698 [2022-12-13 02:07:37,435 INFO L420 AbstractCegarLoop]: === Iteration 2700 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1926624053, now seen corresponding path program 1 times [2022-12-13 02:07:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968191831] [2022-12-13 02:07:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:37,496 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 02:07:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968191831] [2022-12-13 02:07:37,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968191831] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:37,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:37,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:37,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790445449] [2022-12-13 02:07:37,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:37,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:37,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:37,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:37,497 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:37,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:37,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:37,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:37,540 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:37,540 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:37,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:37,541 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:37,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:37,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:37,541 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:37,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:37,542 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:37,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:37,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:37,542 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:37,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:37,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,545 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:37,545 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:37,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:37,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:37,661 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:37,662 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:37,662 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:37,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,662 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:37,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:37,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2699 [2022-12-13 02:07:37,662 INFO L420 AbstractCegarLoop]: === Iteration 2701 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1983882355, now seen corresponding path program 1 times [2022-12-13 02:07:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:37,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611635421] [2022-12-13 02:07:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:37,724 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 02:07:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:37,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611635421] [2022-12-13 02:07:37,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611635421] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:37,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:37,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169739976] [2022-12-13 02:07:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:37,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:37,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:37,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:37,725 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:37,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:37,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:37,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:37,767 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:37,767 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:37,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:37,768 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:37,768 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:37,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:37,769 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:37,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:37,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:37,769 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,769 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:37,769 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:37,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:37,770 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,770 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:37,770 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:37,770 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:37,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,772 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:37,772 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:37,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:37,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:37,773 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:37,893 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:37,894 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:37,894 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:37,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,895 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:37,895 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:37,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2700 [2022-12-13 02:07:37,895 INFO L420 AbstractCegarLoop]: === Iteration 2702 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:37,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2041140657, now seen corresponding path program 1 times [2022-12-13 02:07:37,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:37,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003848820] [2022-12-13 02:07:37,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:37,976 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 02:07:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:37,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003848820] [2022-12-13 02:07:37,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003848820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:37,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:37,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:37,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235787755] [2022-12-13 02:07:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:37,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:37,977 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:37,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:37,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:37,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:37,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:38,030 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:38,030 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:38,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:38,031 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:38,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:38,031 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:38,032 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:38,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:38,033 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:38,033 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:38,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:38,033 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,033 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:38,033 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:38,033 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,036 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:38,036 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:38,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:38,036 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,036 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:38,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:38,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:38,155 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:38,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:38,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:38,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2701 [2022-12-13 02:07:38,155 INFO L420 AbstractCegarLoop]: === Iteration 2703 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:38,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2098398959, now seen corresponding path program 1 times [2022-12-13 02:07:38,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:38,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029228759] [2022-12-13 02:07:38,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:38,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:38,227 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 02:07:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029228759] [2022-12-13 02:07:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029228759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:38,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:38,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:38,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216343825] [2022-12-13 02:07:38,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:38,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:38,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:38,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:38,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:38,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:38,273 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:38,273 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:38,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:38,274 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:38,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:38,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:38,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:38,274 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:38,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:38,275 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,275 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:38,275 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:38,276 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:38,276 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:38,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:38,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,278 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:38,278 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:38,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:38,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:38,402 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:38,403 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:38,403 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:38,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,403 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:38,403 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:38,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2702 [2022-12-13 02:07:38,403 INFO L420 AbstractCegarLoop]: === Iteration 2704 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2139310035, now seen corresponding path program 1 times [2022-12-13 02:07:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:38,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207500280] [2022-12-13 02:07:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:38,464 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 02:07:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:38,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207500280] [2022-12-13 02:07:38,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207500280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:38,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:38,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479599886] [2022-12-13 02:07:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:38,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:38,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:38,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:38,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:38,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:38,507 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:38,507 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:38,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:38,508 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:38,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:38,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:38,508 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:38,508 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:38,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:38,509 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,509 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:38,509 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:38,509 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:38,509 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,509 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:38,509 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:38,509 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,512 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:38,512 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:38,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:38,512 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,512 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:38,627 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:38,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:38,628 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:38,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:38,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:38,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2703 [2022-12-13 02:07:38,628 INFO L420 AbstractCegarLoop]: === Iteration 2705 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:38,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2082051733, now seen corresponding path program 1 times [2022-12-13 02:07:38,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:38,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133437392] [2022-12-13 02:07:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:38,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:38,690 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 02:07:38,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:38,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133437392] [2022-12-13 02:07:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133437392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:38,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347228538] [2022-12-13 02:07:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:38,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:38,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:38,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:38,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:38,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:38,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:38,735 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:38,735 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:38,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:38,735 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:38,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:38,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:38,736 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:38,736 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:38,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:38,737 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,737 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:38,737 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:38,737 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:38,737 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:38,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:38,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,740 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:38,740 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:38,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:38,740 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,740 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:38,862 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:38,864 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:38,864 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:38,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:38,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:38,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2704 [2022-12-13 02:07:38,864 INFO L420 AbstractCegarLoop]: === Iteration 2706 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2024793431, now seen corresponding path program 1 times [2022-12-13 02:07:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:38,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873234887] [2022-12-13 02:07:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:38,934 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 02:07:38,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:38,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873234887] [2022-12-13 02:07:38,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873234887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:38,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:38,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421580463] [2022-12-13 02:07:38,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:38,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:38,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:38,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:38,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:38,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:38,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:38,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:38,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:38,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:38,988 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:38,988 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:38,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 515 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:38,989 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:38,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:38,989 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:38,989 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:38,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:38,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:38,990 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,990 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:38,991 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:38,991 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:38,991 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:38,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:38,991 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:38,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,995 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:38,995 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:38,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:38,995 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:38,995 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:39,124 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:39,125 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:39,125 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:39,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:39,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:39,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2705 [2022-12-13 02:07:39,126 INFO L420 AbstractCegarLoop]: === Iteration 2707 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:39,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:39,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1967535129, now seen corresponding path program 1 times [2022-12-13 02:07:39,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:39,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579870854] [2022-12-13 02:07:39,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:39,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:39,188 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 02:07:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:39,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579870854] [2022-12-13 02:07:39,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579870854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:39,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:39,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:39,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256837695] [2022-12-13 02:07:39,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:39,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:39,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:39,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:39,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:39,189 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:39,189 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,189 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:39,189 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:39,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:39,250 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:39,250 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:39,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:39,251 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:39,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:39,251 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:39,251 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:39,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:39,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:39,252 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,252 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:39,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:39,253 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:39,253 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,253 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:39,253 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:39,253 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:39,255 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:39,256 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:39,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:39,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:39,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:39,390 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:39,391 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:39,392 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:39,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:39,392 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:39,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2706 [2022-12-13 02:07:39,392 INFO L420 AbstractCegarLoop]: === Iteration 2708 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1910276827, now seen corresponding path program 1 times [2022-12-13 02:07:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647998217] [2022-12-13 02:07:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:39,482 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 02:07:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:39,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647998217] [2022-12-13 02:07:39,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647998217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:39,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:39,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442767808] [2022-12-13 02:07:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:39,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:39,483 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:39,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:39,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:39,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:39,536 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:39,536 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:39,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:39,536 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:39,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:39,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:39,537 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:39,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:39,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:39,538 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:39,538 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:39,538 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:39,538 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,539 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:39,539 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:39,539 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:39,542 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:39,542 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:39,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:39,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:39,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:39,675 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:39,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:39,677 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:39,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,678 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:39,678 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:39,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2707 [2022-12-13 02:07:39,678 INFO L420 AbstractCegarLoop]: === Iteration 2709 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:39,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1853018525, now seen corresponding path program 1 times [2022-12-13 02:07:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:39,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563494016] [2022-12-13 02:07:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:39,754 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 02:07:39,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563494016] [2022-12-13 02:07:39,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563494016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:39,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:39,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627487409] [2022-12-13 02:07:39,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:39,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:39,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:39,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:39,755 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:39,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:39,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:39,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:39,808 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:39,808 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:39,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:39,809 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:39,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:39,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:39,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:39,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:39,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:39,810 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:39,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:39,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:39,811 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,811 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:39,811 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:39,811 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:39,811 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,811 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:39,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:39,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:39,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:39,814 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:39,814 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:39,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:39,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:39,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:39,949 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:39,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:39,951 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:39,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:39,952 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:39,952 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:39,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2708 [2022-12-13 02:07:39,952 INFO L420 AbstractCegarLoop]: === Iteration 2710 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1795760223, now seen corresponding path program 1 times [2022-12-13 02:07:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284029332] [2022-12-13 02:07:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:40,025 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 02:07:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:40,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284029332] [2022-12-13 02:07:40,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284029332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:40,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:40,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:40,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45443181] [2022-12-13 02:07:40,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:40,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:40,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:40,026 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:40,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:40,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:40,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:40,090 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:40,090 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:40,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:40,091 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:40,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:40,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:40,092 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:40,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:40,093 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:40,093 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:40,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:40,094 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:40,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:40,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:40,098 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:40,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:40,098 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,098 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:40,234 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:40,236 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:40,236 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:40,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,236 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:40,236 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2709 [2022-12-13 02:07:40,236 INFO L420 AbstractCegarLoop]: === Iteration 2711 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:40,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:40,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1738501921, now seen corresponding path program 1 times [2022-12-13 02:07:40,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:40,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287144700] [2022-12-13 02:07:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:40,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:40,302 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 02:07:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:40,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287144700] [2022-12-13 02:07:40,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287144700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:40,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:40,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:40,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754600680] [2022-12-13 02:07:40,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:40,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:40,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:40,303 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:40,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:40,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:40,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:40,365 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:40,365 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:40,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:40,366 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:40,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:40,366 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:40,366 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:40,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:40,367 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,367 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:40,368 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:40,368 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:40,368 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:40,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:40,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,372 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:40,372 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:40,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:40,372 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,372 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:40,504 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:40,506 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:07:40,506 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:40,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,506 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:40,506 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:40,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2710 [2022-12-13 02:07:40,507 INFO L420 AbstractCegarLoop]: === Iteration 2712 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1681243619, now seen corresponding path program 1 times [2022-12-13 02:07:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:40,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750655442] [2022-12-13 02:07:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:40,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:40,586 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 02:07:40,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:40,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750655442] [2022-12-13 02:07:40,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750655442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:40,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:40,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:40,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155376281] [2022-12-13 02:07:40,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:40,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:40,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:40,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:40,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:40,587 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:40,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:40,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:40,632 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:40,633 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:40,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:40,633 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:40,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:40,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:40,634 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:40,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:40,634 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,634 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:40,635 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:40,635 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:40,635 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,635 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:40,635 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:40,635 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,638 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:40,638 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:40,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:40,638 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,638 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:40,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:40,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:40,755 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:40,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,755 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:40,755 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:40,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2711 [2022-12-13 02:07:40,755 INFO L420 AbstractCegarLoop]: === Iteration 2713 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1623985317, now seen corresponding path program 1 times [2022-12-13 02:07:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:40,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337805483] [2022-12-13 02:07:40,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:40,816 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 02:07:40,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:40,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337805483] [2022-12-13 02:07:40,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337805483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:40,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:40,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265999657] [2022-12-13 02:07:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:40,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:40,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:40,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:40,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:40,817 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:40,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:40,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:40,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:40,871 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:40,871 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:40,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:40,871 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:40,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:40,872 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:40,872 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:40,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:40,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:40,873 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,873 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:40,873 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:40,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:40,873 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,873 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:40,873 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:40,873 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:40,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,876 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:40,876 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:40,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:40,876 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:40,876 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:40,995 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:40,996 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:40,996 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:40,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:40,997 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:40,997 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:40,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2712 [2022-12-13 02:07:40,997 INFO L420 AbstractCegarLoop]: === Iteration 2714 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:40,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1566727015, now seen corresponding path program 1 times [2022-12-13 02:07:40,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:40,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811547049] [2022-12-13 02:07:40,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:40,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:41,058 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 02:07:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811547049] [2022-12-13 02:07:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811547049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:41,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664941699] [2022-12-13 02:07:41,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:41,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:41,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:41,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:41,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:41,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:41,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:41,102 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:41,103 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:41,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:41,103 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:41,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:41,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:41,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:41,104 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:41,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:41,105 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:41,105 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:41,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:41,105 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,105 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:41,105 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:41,105 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,108 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:41,108 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:41,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:41,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:41,226 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:41,227 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:41,227 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:41,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,227 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:41,227 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:41,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2713 [2022-12-13 02:07:41,227 INFO L420 AbstractCegarLoop]: === Iteration 2715 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1509468713, now seen corresponding path program 1 times [2022-12-13 02:07:41,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:41,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529453266] [2022-12-13 02:07:41,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:41,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:41,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:41,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529453266] [2022-12-13 02:07:41,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529453266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:41,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:41,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:41,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341253128] [2022-12-13 02:07:41,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:41,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:41,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:41,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:41,289 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:41,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:41,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:41,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:41,338 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:41,338 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:41,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:41,338 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:41,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:41,339 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:41,339 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:41,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:41,340 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:41,340 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:41,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:41,340 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,340 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:41,340 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:41,340 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,343 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:41,343 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:41,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:41,343 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,343 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:41,460 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:41,461 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:41,461 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:41,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,462 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:41,462 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:41,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2714 [2022-12-13 02:07:41,462 INFO L420 AbstractCegarLoop]: === Iteration 2716 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:41,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1452210411, now seen corresponding path program 1 times [2022-12-13 02:07:41,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:41,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011486675] [2022-12-13 02:07:41,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:41,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:41,523 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 02:07:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:41,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011486675] [2022-12-13 02:07:41,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011486675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:41,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:41,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:41,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853009698] [2022-12-13 02:07:41,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:41,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:41,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:41,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:41,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:41,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:41,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:41,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:41,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:41,567 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:41,568 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:41,568 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:41,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:41,569 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:41,569 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:41,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:41,570 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,570 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:41,570 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:41,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:41,570 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:41,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:41,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,573 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:41,573 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:41,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:41,573 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,573 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:41,690 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:41,691 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:41,691 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:41,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,691 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:41,692 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:41,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2715 [2022-12-13 02:07:41,692 INFO L420 AbstractCegarLoop]: === Iteration 2717 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:41,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1394952109, now seen corresponding path program 1 times [2022-12-13 02:07:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:41,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339083852] [2022-12-13 02:07:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:41,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:41,752 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 02:07:41,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:41,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339083852] [2022-12-13 02:07:41,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339083852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:41,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:41,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969915344] [2022-12-13 02:07:41,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:41,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:41,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:41,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:41,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:41,796 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:41,796 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:41,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:41,797 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:41,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:41,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:41,797 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:41,797 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:41,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:41,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:41,798 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,798 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:41,798 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:41,798 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:41,798 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,799 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:41,799 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:41,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:41,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,801 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:41,801 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:41,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:41,802 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:41,802 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:41,919 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:41,921 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:41,921 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:41,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,921 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:41,921 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:41,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2716 [2022-12-13 02:07:41,921 INFO L420 AbstractCegarLoop]: === Iteration 2718 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:41,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1337693807, now seen corresponding path program 1 times [2022-12-13 02:07:41,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:41,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015794075] [2022-12-13 02:07:41,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:41,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:41,983 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 02:07:41,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:41,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015794075] [2022-12-13 02:07:41,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015794075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:41,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:41,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:41,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330859542] [2022-12-13 02:07:41,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:41,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:41,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:41,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:41,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:41,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:41,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:41,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:41,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:41,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:42,034 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:42,035 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:42,035 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:42,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:42,036 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:42,036 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:42,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:42,037 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,037 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:42,037 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:42,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:42,037 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,037 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:42,037 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:42,037 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,040 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:42,040 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:42,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 185 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:42,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:42,201 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:42,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-13 02:07:42,202 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:42,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:42,203 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2717 [2022-12-13 02:07:42,203 INFO L420 AbstractCegarLoop]: === Iteration 2719 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1280435505, now seen corresponding path program 1 times [2022-12-13 02:07:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:42,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727815711] [2022-12-13 02:07:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:42,278 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 02:07:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:42,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727815711] [2022-12-13 02:07:42,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727815711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:42,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:42,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003180741] [2022-12-13 02:07:42,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:42,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:42,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:42,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:42,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:42,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:42,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:42,340 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:42,340 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:42,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 488 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:42,341 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:42,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:42,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:42,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:42,342 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:42,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:42,343 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,343 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:42,343 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:42,343 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:42,343 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,343 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:42,343 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:42,343 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,346 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:42,346 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:42,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:42,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:42,466 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:42,468 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:42,468 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:42,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,468 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:42,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:42,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2718 [2022-12-13 02:07:42,468 INFO L420 AbstractCegarLoop]: === Iteration 2720 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1223177203, now seen corresponding path program 1 times [2022-12-13 02:07:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:42,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12384206] [2022-12-13 02:07:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:42,532 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 02:07:42,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:42,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12384206] [2022-12-13 02:07:42,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12384206] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:42,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:42,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:42,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044956793] [2022-12-13 02:07:42,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:42,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:42,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:42,533 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:42,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:42,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:42,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:42,576 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:42,577 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:42,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:42,577 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:42,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:42,578 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:42,578 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:42,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:42,579 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,579 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:42,579 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:42,579 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:42,579 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,579 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:42,579 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:42,579 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,582 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:42,582 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:42,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:42,582 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,582 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:42,703 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:42,704 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:42,705 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:42,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:42,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2719 [2022-12-13 02:07:42,705 INFO L420 AbstractCegarLoop]: === Iteration 2721 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1165918901, now seen corresponding path program 1 times [2022-12-13 02:07:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:42,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175422200] [2022-12-13 02:07:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:42,765 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 02:07:42,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:42,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175422200] [2022-12-13 02:07:42,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175422200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:42,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:42,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500800275] [2022-12-13 02:07:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:42,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:42,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:42,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:42,766 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:42,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:42,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:42,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:42,815 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:42,815 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:42,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:42,816 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:42,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:42,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:42,816 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:42,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:42,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:42,817 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:42,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:42,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:42,818 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:42,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:42,818 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:42,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,820 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:42,820 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:42,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:42,821 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:42,821 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:42,936 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:42,937 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:42,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:42,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,937 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:42,938 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:42,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2720 [2022-12-13 02:07:42,938 INFO L420 AbstractCegarLoop]: === Iteration 2722 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1108660599, now seen corresponding path program 1 times [2022-12-13 02:07:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:42,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028282278] [2022-12-13 02:07:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:42,996 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 02:07:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:42,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028282278] [2022-12-13 02:07:42,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028282278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:42,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:42,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:42,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799418053] [2022-12-13 02:07:42,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:42,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:42,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:42,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:42,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:42,997 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:42,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:42,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:42,998 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:42,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:43,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:43,043 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:43,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:43,044 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:43,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:43,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:43,045 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:43,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:43,045 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:43,046 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:43,046 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:43,046 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,046 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:43,046 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:43,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,049 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:43,049 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:43,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:43,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:43,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:43,183 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:43,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:43,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:43,183 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:43,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:43,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2721 [2022-12-13 02:07:43,183 INFO L420 AbstractCegarLoop]: === Iteration 2723 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:43,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:43,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1051402297, now seen corresponding path program 1 times [2022-12-13 02:07:43,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:43,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028577578] [2022-12-13 02:07:43,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:43,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:43,262 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 02:07:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028577578] [2022-12-13 02:07:43,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028577578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:43,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:43,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:43,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339956558] [2022-12-13 02:07:43,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:43,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:43,263 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:43,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:43,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:43,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:43,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:43,315 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:43,315 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:43,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:43,316 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:43,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:43,316 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:43,316 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:43,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:43,317 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,317 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:43,317 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:43,317 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:43,317 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:43,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:43,318 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,320 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:43,320 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:43,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:43,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:43,452 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:43,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:07:43,453 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:43,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:43,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:43,454 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:43,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2722 [2022-12-13 02:07:43,454 INFO L420 AbstractCegarLoop]: === Iteration 2724 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:43,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash -994143995, now seen corresponding path program 1 times [2022-12-13 02:07:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:43,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522727848] [2022-12-13 02:07:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:43,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:43,523 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 02:07:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:43,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522727848] [2022-12-13 02:07:43,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522727848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:43,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:43,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:43,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533529720] [2022-12-13 02:07:43,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:43,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:43,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:43,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:43,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:43,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:43,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:43,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:43,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:43,591 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:43,591 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:43,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:43,592 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:43,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:43,592 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:43,592 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:43,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:43,593 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,593 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:43,593 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:43,593 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:43,593 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:43,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:43,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,596 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:43,596 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:43,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:43,597 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,597 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:43,731 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:43,733 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:43,733 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:43,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:43,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:43,733 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:43,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2723 [2022-12-13 02:07:43,734 INFO L420 AbstractCegarLoop]: === Iteration 2725 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:43,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:43,734 INFO L85 PathProgramCache]: Analyzing trace with hash -936885693, now seen corresponding path program 1 times [2022-12-13 02:07:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:43,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417403883] [2022-12-13 02:07:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:43,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:43,803 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 02:07:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:43,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417403883] [2022-12-13 02:07:43,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417403883] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:43,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:43,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:43,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526699274] [2022-12-13 02:07:43,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:43,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:43,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:43,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:43,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:43,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:43,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:43,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:43,859 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:43,860 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:43,860 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:43,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:43,861 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:43,861 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:43,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:43,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:43,862 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,862 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:43,862 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:43,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:43,862 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,862 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:43,862 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:43,863 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,865 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:43,865 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:43,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:43,866 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:43,866 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:44,001 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:44,003 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:44,003 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:44,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:44,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:44,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2724 [2022-12-13 02:07:44,003 INFO L420 AbstractCegarLoop]: === Iteration 2726 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -879627391, now seen corresponding path program 1 times [2022-12-13 02:07:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742901930] [2022-12-13 02:07:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:44,086 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 02:07:44,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:44,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742901930] [2022-12-13 02:07:44,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742901930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:44,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:44,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:44,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288220818] [2022-12-13 02:07:44,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:44,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:44,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:44,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:44,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:44,087 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:44,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:44,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:44,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:44,149 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:44,149 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:44,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:44,150 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:44,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:44,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:44,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:44,151 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:44,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:44,152 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,152 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:44,152 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:44,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:44,152 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,152 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:44,152 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:44,152 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,155 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:44,155 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:44,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:44,155 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,155 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:44,290 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:44,292 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:44,292 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:44,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,292 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:44,292 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:44,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2725 [2022-12-13 02:07:44,293 INFO L420 AbstractCegarLoop]: === Iteration 2727 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:44,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:44,293 INFO L85 PathProgramCache]: Analyzing trace with hash -822369089, now seen corresponding path program 1 times [2022-12-13 02:07:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:44,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60466520] [2022-12-13 02:07:44,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:44,372 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 02:07:44,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:44,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60466520] [2022-12-13 02:07:44,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60466520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:44,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:44,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:44,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809820399] [2022-12-13 02:07:44,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:44,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:44,373 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:44,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:44,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:44,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:44,429 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:44,429 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:44,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:44,430 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:44,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:44,431 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:44,431 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:44,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:44,432 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,432 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:44,432 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:44,432 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:44,432 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,433 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:44,433 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:44,433 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,436 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:44,437 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:44,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:44,437 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,437 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:44,571 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:44,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:44,574 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:44,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:44,574 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:44,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2726 [2022-12-13 02:07:44,574 INFO L420 AbstractCegarLoop]: === Iteration 2728 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash -765110787, now seen corresponding path program 1 times [2022-12-13 02:07:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:44,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388323698] [2022-12-13 02:07:44,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:44,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:44,651 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 02:07:44,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:44,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388323698] [2022-12-13 02:07:44,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388323698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:44,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:44,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:44,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906986735] [2022-12-13 02:07:44,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:44,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:44,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:44,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:44,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:44,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:44,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:44,705 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:44,705 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:44,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:44,705 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:44,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:44,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:44,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:44,706 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:44,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:44,707 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:44,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:44,708 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:44,708 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:44,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:44,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,711 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:44,711 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:44,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:44,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:44,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:44,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:07:44,836 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:44,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,837 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:44,837 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:44,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2727 [2022-12-13 02:07:44,837 INFO L420 AbstractCegarLoop]: === Iteration 2729 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:44,837 INFO L85 PathProgramCache]: Analyzing trace with hash -707852485, now seen corresponding path program 1 times [2022-12-13 02:07:44,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:44,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671708448] [2022-12-13 02:07:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:44,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:44,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671708448] [2022-12-13 02:07:44,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671708448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:44,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:44,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:44,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199656650] [2022-12-13 02:07:44,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:44,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:44,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:44,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:44,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:44,908 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:44,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:44,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:44,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:44,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:44,961 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:44,961 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:44,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:44,962 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:44,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:44,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:44,962 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:44,962 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:44,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:44,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:44,963 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,963 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:44,963 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:44,963 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:44,964 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,964 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:44,964 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:44,964 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:44,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,966 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:44,966 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:44,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 200 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:44,967 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:44,967 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:45,084 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:45,085 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:45,085 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:45,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:45,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:45,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2728 [2022-12-13 02:07:45,086 INFO L420 AbstractCegarLoop]: === Iteration 2730 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:45,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:45,086 INFO L85 PathProgramCache]: Analyzing trace with hash -650594183, now seen corresponding path program 1 times [2022-12-13 02:07:45,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:45,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064382081] [2022-12-13 02:07:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:45,160 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 02:07:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:45,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064382081] [2022-12-13 02:07:45,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064382081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:45,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:45,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953484311] [2022-12-13 02:07:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:45,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:45,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:45,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:45,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:45,161 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:45,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:45,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:45,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:45,206 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:45,206 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:45,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:45,207 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:45,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:45,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:45,207 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:45,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:45,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:45,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:45,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:45,208 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:45,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:45,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:45,211 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:45,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:45,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:45,329 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:45,330 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:45,330 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:45,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,330 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:45,330 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:45,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2729 [2022-12-13 02:07:45,330 INFO L420 AbstractCegarLoop]: === Iteration 2731 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:45,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:45,330 INFO L85 PathProgramCache]: Analyzing trace with hash -593335881, now seen corresponding path program 1 times [2022-12-13 02:07:45,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:45,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700913668] [2022-12-13 02:07:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:45,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:45,389 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 02:07:45,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:45,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700913668] [2022-12-13 02:07:45,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700913668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:45,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:45,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62989316] [2022-12-13 02:07:45,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:45,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:45,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:45,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:45,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:45,390 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:45,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:45,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:45,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:45,440 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:45,440 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:45,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:45,441 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:45,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:45,441 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:45,442 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:45,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:45,442 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:45,443 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:45,443 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:45,443 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,443 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:45,443 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:45,443 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,445 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:45,446 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:45,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:45,446 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,446 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:45,563 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:45,565 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:45,565 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:45,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,565 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:45,565 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:45,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2730 [2022-12-13 02:07:45,565 INFO L420 AbstractCegarLoop]: === Iteration 2732 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:45,565 INFO L85 PathProgramCache]: Analyzing trace with hash -536077579, now seen corresponding path program 1 times [2022-12-13 02:07:45,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:45,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834074386] [2022-12-13 02:07:45,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:45,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:45,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:45,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834074386] [2022-12-13 02:07:45,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834074386] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:45,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:45,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142828249] [2022-12-13 02:07:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:45,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:45,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:45,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:45,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:45,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:45,670 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:45,670 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:45,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:45,671 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:45,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:45,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:45,671 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:45,671 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:45,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:45,672 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,672 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:45,672 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:45,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:45,673 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:45,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:45,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,675 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:45,675 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:45,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:45,676 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,676 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:45,793 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:45,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:45,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:45,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:45,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:45,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2731 [2022-12-13 02:07:45,794 INFO L420 AbstractCegarLoop]: === Iteration 2733 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:45,795 INFO L85 PathProgramCache]: Analyzing trace with hash -478819277, now seen corresponding path program 1 times [2022-12-13 02:07:45,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:45,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561532507] [2022-12-13 02:07:45,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:45,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:45,856 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 02:07:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:45,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561532507] [2022-12-13 02:07:45,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561532507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:45,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:45,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443422734] [2022-12-13 02:07:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:45,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:45,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:45,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:45,857 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:45,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:45,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:45,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:45,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:45,900 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:45,900 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:45,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:45,901 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:45,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:45,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:45,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:45,901 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:45,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:45,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:45,902 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:45,902 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:45,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:45,903 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,903 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:45,903 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:45,903 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:45,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,905 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:45,906 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:45,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:45,906 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:45,906 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:46,036 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:46,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:46,038 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:46,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,038 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:46,038 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:46,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2732 [2022-12-13 02:07:46,038 INFO L420 AbstractCegarLoop]: === Iteration 2734 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:46,038 INFO L85 PathProgramCache]: Analyzing trace with hash -421560975, now seen corresponding path program 1 times [2022-12-13 02:07:46,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:46,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632686046] [2022-12-13 02:07:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:46,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:46,106 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 02:07:46,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:46,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632686046] [2022-12-13 02:07:46,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632686046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:46,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:46,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:46,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898538646] [2022-12-13 02:07:46,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:46,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:46,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:46,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:46,107 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:46,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:46,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:46,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:46,170 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:46,170 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:46,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:46,171 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:46,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:46,171 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:46,172 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:46,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:46,172 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,172 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:46,173 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:46,173 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:46,173 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,173 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:46,173 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:46,173 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,176 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:46,176 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:46,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:46,176 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,176 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:46,310 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:46,311 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:07:46,311 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:46,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:46,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:46,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2733 [2022-12-13 02:07:46,312 INFO L420 AbstractCegarLoop]: === Iteration 2735 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash -364302673, now seen corresponding path program 1 times [2022-12-13 02:07:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:46,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430530012] [2022-12-13 02:07:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:46,384 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 02:07:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430530012] [2022-12-13 02:07:46,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430530012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:46,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:46,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327066612] [2022-12-13 02:07:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:46,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:46,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:46,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:46,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:46,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:46,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:46,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:46,450 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:46,450 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:46,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:46,451 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:46,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:46,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:46,452 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:46,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:46,453 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:46,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:46,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:46,453 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,453 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:46,453 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:46,453 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:46,456 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:46,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:46,591 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:46,592 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:46,592 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,593 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:46,593 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:46,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2734 [2022-12-13 02:07:46,593 INFO L420 AbstractCegarLoop]: === Iteration 2736 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:46,593 INFO L85 PathProgramCache]: Analyzing trace with hash -307044371, now seen corresponding path program 1 times [2022-12-13 02:07:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120708586] [2022-12-13 02:07:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:46,662 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 02:07:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:46,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120708586] [2022-12-13 02:07:46,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120708586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:46,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:46,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508695424] [2022-12-13 02:07:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:46,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:46,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:46,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:46,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:46,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:46,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:46,719 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:46,719 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:46,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:46,720 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:46,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:46,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:46,720 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:46,720 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:46,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:46,721 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:46,721 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:46,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:46,721 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:46,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:46,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,724 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:46,724 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:46,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:46,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:46,845 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:46,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:46,846 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:46,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:46,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:46,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2735 [2022-12-13 02:07:46,847 INFO L420 AbstractCegarLoop]: === Iteration 2737 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:46,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:46,847 INFO L85 PathProgramCache]: Analyzing trace with hash -249786069, now seen corresponding path program 1 times [2022-12-13 02:07:46,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:46,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657560344] [2022-12-13 02:07:46,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:46,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:46,905 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 02:07:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:46,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657560344] [2022-12-13 02:07:46,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657560344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:46,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:46,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743761379] [2022-12-13 02:07:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:46,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:46,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:46,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:46,906 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:46,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:46,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:46,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:46,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:46,951 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:46,951 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:46,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:46,952 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:46,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:46,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:46,952 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:46,952 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:46,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:46,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:46,953 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,953 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:46,953 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:46,953 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:46,954 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,954 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:46,954 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:46,954 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:46,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,956 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:46,956 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:46,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:46,957 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:46,957 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:47,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:47,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:47,075 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:47,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:47,075 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2736 [2022-12-13 02:07:47,075 INFO L420 AbstractCegarLoop]: === Iteration 2738 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash -192527767, now seen corresponding path program 1 times [2022-12-13 02:07:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:47,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528557070] [2022-12-13 02:07:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:47,135 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 02:07:47,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:47,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528557070] [2022-12-13 02:07:47,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528557070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:47,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:47,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:47,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847090618] [2022-12-13 02:07:47,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:47,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:47,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:47,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:47,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:47,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:47,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:47,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:47,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:47,186 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:47,186 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:47,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:47,187 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:47,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:47,187 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:47,187 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:47,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:47,188 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:47,188 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:47,188 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:47,188 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,189 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:47,189 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:47,189 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,191 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:47,191 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:47,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:47,191 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,192 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:47,308 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:47,309 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:47,309 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:47,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:47,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:47,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2737 [2022-12-13 02:07:47,309 INFO L420 AbstractCegarLoop]: === Iteration 2739 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash -135269465, now seen corresponding path program 1 times [2022-12-13 02:07:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:47,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923635850] [2022-12-13 02:07:47,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:07:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923635850] [2022-12-13 02:07:47,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923635850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:47,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:47,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733018514] [2022-12-13 02:07:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:47,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:47,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:47,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:47,378 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:47,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:47,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:47,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:47,422 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:47,422 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:47,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:47,423 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:47,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:47,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:47,423 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:47,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:47,424 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,424 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:47,424 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:47,424 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:47,424 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:47,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:47,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,427 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:47,427 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:47,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:47,427 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,427 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:47,544 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:47,545 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:47,545 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:47,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:47,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:47,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2738 [2022-12-13 02:07:47,545 INFO L420 AbstractCegarLoop]: === Iteration 2740 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash -78011163, now seen corresponding path program 1 times [2022-12-13 02:07:47,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:47,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217891462] [2022-12-13 02:07:47,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:47,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:47,606 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 02:07:47,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:47,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217891462] [2022-12-13 02:07:47,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217891462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:47,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:47,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650945429] [2022-12-13 02:07:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:47,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:47,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:47,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:47,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:47,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:47,657 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:47,657 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:47,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:47,658 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:47,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:47,658 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:47,659 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:47,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:47,659 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,659 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:47,660 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:47,660 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:47,660 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,660 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:47,660 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:47,660 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,663 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:47,663 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:47,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:47,663 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,663 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:47,781 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:47,782 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:47,782 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:47,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,782 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:47,782 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:47,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2739 [2022-12-13 02:07:47,783 INFO L420 AbstractCegarLoop]: === Iteration 2741 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:47,783 INFO L85 PathProgramCache]: Analyzing trace with hash -20752861, now seen corresponding path program 1 times [2022-12-13 02:07:47,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:47,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384453079] [2022-12-13 02:07:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:47,855 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 02:07:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:47,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384453079] [2022-12-13 02:07:47,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384453079] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:47,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:47,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51878094] [2022-12-13 02:07:47,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:47,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:47,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:47,856 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:47,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:47,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:47,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:47,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:47,899 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:47,900 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:47,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:47,900 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:47,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:47,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:47,901 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:47,901 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:47,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:47,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:47,902 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,902 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:47,902 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:47,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:47,902 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:47,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:47,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:47,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,905 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:47,905 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:47,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:47,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:47,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:48,035 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:48,037 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:07:48,037 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:48,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,037 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:48,037 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:48,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2740 [2022-12-13 02:07:48,037 INFO L420 AbstractCegarLoop]: === Iteration 2742 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 36505441, now seen corresponding path program 1 times [2022-12-13 02:07:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:48,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633865892] [2022-12-13 02:07:48,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:48,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:48,097 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 02:07:48,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:48,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633865892] [2022-12-13 02:07:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633865892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:48,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:48,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137665476] [2022-12-13 02:07:48,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:48,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:48,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:48,098 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:48,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:48,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:48,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:48,146 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:48,146 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:48,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:48,147 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:48,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:48,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:48,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:48,147 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:48,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:48,148 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:48,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:48,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:48,148 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,149 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:48,149 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:48,149 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,151 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:48,151 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:48,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:48,152 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:48,273 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:48,274 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:07:48,274 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:48,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,275 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:48,275 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:48,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2741 [2022-12-13 02:07:48,275 INFO L420 AbstractCegarLoop]: === Iteration 2743 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash 93763743, now seen corresponding path program 1 times [2022-12-13 02:07:48,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:48,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308705890] [2022-12-13 02:07:48,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:48,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:48,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 02:07:48,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:48,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308705890] [2022-12-13 02:07:48,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308705890] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:48,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:48,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:48,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883748070] [2022-12-13 02:07:48,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:48,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:48,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:48,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:48,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:48,347 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:48,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:48,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:48,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:48,401 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:48,401 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:48,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:48,401 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:48,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:48,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:48,402 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:48,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:48,403 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,403 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:48,403 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:48,403 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:48,403 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,403 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:48,403 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:48,403 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,406 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:48,406 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:48,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:48,406 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,407 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:48,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:48,526 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:48,526 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:48,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:48,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:48,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2742 [2022-12-13 02:07:48,527 INFO L420 AbstractCegarLoop]: === Iteration 2744 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 151022045, now seen corresponding path program 1 times [2022-12-13 02:07:48,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:48,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959382575] [2022-12-13 02:07:48,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:48,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:48,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 02:07:48,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:48,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959382575] [2022-12-13 02:07:48,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959382575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:48,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:48,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:48,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962562019] [2022-12-13 02:07:48,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:48,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:48,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:48,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:48,599 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:48,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:48,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:48,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:48,654 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:48,654 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:48,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:48,655 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:48,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:48,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:48,656 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:48,656 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:48,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:48,657 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,657 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:48,657 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:48,657 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:48,657 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,657 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:48,657 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:48,657 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,660 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:48,661 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:48,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:48,661 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:48,796 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:48,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:07:48,799 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:48,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,799 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:48,799 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:48,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2743 [2022-12-13 02:07:48,799 INFO L420 AbstractCegarLoop]: === Iteration 2745 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 208280347, now seen corresponding path program 1 times [2022-12-13 02:07:48,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:48,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968758448] [2022-12-13 02:07:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:48,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:48,880 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 02:07:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:48,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968758448] [2022-12-13 02:07:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968758448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:48,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:48,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356793955] [2022-12-13 02:07:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:48,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:48,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:48,881 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:48,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:48,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:48,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:48,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:48,943 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:48,943 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:48,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:48,944 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:48,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:48,945 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:48,945 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:48,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:48,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:48,946 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,946 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:48,946 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:48,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:48,946 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:48,947 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:48,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:48,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,950 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:48,950 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:48,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:48,951 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:48,951 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:49,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:49,081 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:07:49,081 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:49,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,081 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:49,081 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:49,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2744 [2022-12-13 02:07:49,081 INFO L420 AbstractCegarLoop]: === Iteration 2746 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash 265538649, now seen corresponding path program 1 times [2022-12-13 02:07:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:49,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232300083] [2022-12-13 02:07:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:49,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:49,140 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 02:07:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:49,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232300083] [2022-12-13 02:07:49,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232300083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:49,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:49,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631241832] [2022-12-13 02:07:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:49,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:49,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:49,141 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:49,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:49,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:49,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:49,199 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:49,199 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:49,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:49,199 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:49,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:49,200 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:49,200 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:49,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:49,201 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,201 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:49,201 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:49,201 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:49,201 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,201 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:49,201 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:49,201 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,204 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:49,204 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:49,204 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,204 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:49,321 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:49,322 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:49,323 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:49,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,323 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:49,323 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:49,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2745 [2022-12-13 02:07:49,323 INFO L420 AbstractCegarLoop]: === Iteration 2747 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:49,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:49,323 INFO L85 PathProgramCache]: Analyzing trace with hash 322796951, now seen corresponding path program 1 times [2022-12-13 02:07:49,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:49,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141908745] [2022-12-13 02:07:49,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:49,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:49,384 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 02:07:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:49,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141908745] [2022-12-13 02:07:49,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141908745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:49,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:49,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:49,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882281804] [2022-12-13 02:07:49,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:49,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:49,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:49,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:49,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:49,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:49,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:49,428 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:49,428 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:49,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:49,429 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:49,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:49,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:49,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:49,429 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:49,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:49,430 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,430 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:49,430 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:49,430 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:49,430 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,431 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:49,431 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:49,431 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,433 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:49,433 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:49,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:49,434 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,434 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:49,553 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:49,554 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:49,554 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:49,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,555 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:49,555 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:49,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2746 [2022-12-13 02:07:49,555 INFO L420 AbstractCegarLoop]: === Iteration 2748 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash 380055253, now seen corresponding path program 1 times [2022-12-13 02:07:49,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:49,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022517556] [2022-12-13 02:07:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:49,618 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 02:07:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022517556] [2022-12-13 02:07:49,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022517556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:49,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:49,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786455239] [2022-12-13 02:07:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:49,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:49,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:49,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:49,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:49,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:49,662 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:49,663 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:49,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:49,663 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:49,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:49,664 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:49,664 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:49,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:49,665 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:49,665 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:49,665 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:49,665 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:49,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:49,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,668 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:49,668 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:49,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:49,668 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,668 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:49,786 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:49,788 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:49,788 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:49,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,788 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:49,788 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:49,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2747 [2022-12-13 02:07:49,788 INFO L420 AbstractCegarLoop]: === Iteration 2749 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 437313555, now seen corresponding path program 1 times [2022-12-13 02:07:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:49,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213286839] [2022-12-13 02:07:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:49,847 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 02:07:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:49,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213286839] [2022-12-13 02:07:49,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213286839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:49,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:49,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:49,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431708017] [2022-12-13 02:07:49,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:49,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:49,848 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:49,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:49,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:49,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:49,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:49,892 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:49,892 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:49,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:49,892 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:49,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:49,893 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:49,893 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:49,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:49,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:49,894 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:49,894 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:49,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:49,894 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,894 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:49,894 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:49,894 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:49,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,897 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:49,897 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:49,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:49,897 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:49,897 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:50,018 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:50,019 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:07:50,019 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:50,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:50,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:50,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2748 [2022-12-13 02:07:50,019 INFO L420 AbstractCegarLoop]: === Iteration 2750 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash 494571857, now seen corresponding path program 1 times [2022-12-13 02:07:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232279026] [2022-12-13 02:07:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:50,082 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 02:07:50,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:50,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232279026] [2022-12-13 02:07:50,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232279026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:50,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:50,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:50,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67091235] [2022-12-13 02:07:50,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:50,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:50,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:50,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:50,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:50,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:50,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:50,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:50,127 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:50,128 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:50,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:50,128 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:50,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:50,129 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:50,129 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:50,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:50,129 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,130 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:50,130 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:50,130 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:50,130 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:50,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:50,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,133 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:50,133 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:50,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:50,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:50,251 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:50,252 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:50,253 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:50,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,253 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:50,253 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:50,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2749 [2022-12-13 02:07:50,253 INFO L420 AbstractCegarLoop]: === Iteration 2751 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 551830159, now seen corresponding path program 1 times [2022-12-13 02:07:50,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:50,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404106384] [2022-12-13 02:07:50,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:50,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:50,316 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 02:07:50,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:50,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404106384] [2022-12-13 02:07:50,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404106384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:50,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:50,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51188005] [2022-12-13 02:07:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:50,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:50,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:50,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:50,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:50,317 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:50,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:50,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:50,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:50,361 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:50,361 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:50,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:50,362 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:50,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:50,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:50,362 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:50,362 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:50,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:50,363 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,363 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:50,363 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:50,363 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:50,363 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,363 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:50,363 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:50,364 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,366 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:50,366 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:50,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:50,367 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,367 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:50,484 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:50,486 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:50,486 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:50,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,486 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:50,486 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2750 [2022-12-13 02:07:50,486 INFO L420 AbstractCegarLoop]: === Iteration 2752 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash 609088461, now seen corresponding path program 1 times [2022-12-13 02:07:50,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026046442] [2022-12-13 02:07:50,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:50,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:50,561 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 02:07:50,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026046442] [2022-12-13 02:07:50,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026046442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:50,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:50,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:50,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082456418] [2022-12-13 02:07:50,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:50,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:50,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:50,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:50,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:50,562 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:50,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:50,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:50,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:50,610 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:50,611 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:50,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:50,611 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:50,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:50,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:50,612 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:50,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:50,613 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,613 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:50,613 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:50,613 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:50,613 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:50,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:50,613 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,616 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:50,616 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:50,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:50,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:50,738 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:50,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:50,740 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:50,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:50,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:50,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2751 [2022-12-13 02:07:50,740 INFO L420 AbstractCegarLoop]: === Iteration 2753 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 666346763, now seen corresponding path program 1 times [2022-12-13 02:07:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659004808] [2022-12-13 02:07:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:50,804 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 02:07:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:50,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659004808] [2022-12-13 02:07:50,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659004808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:50,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:50,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:50,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803284015] [2022-12-13 02:07:50,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:50,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:50,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:50,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:50,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:50,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:50,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:50,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:50,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:50,855 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:50,855 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:50,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:50,856 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:50,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:50,856 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:50,856 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:50,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:50,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:50,857 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,857 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:50,857 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:50,857 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:50,857 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,857 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:50,858 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:50,858 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:50,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,860 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:50,860 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:50,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:50,860 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:50,861 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:50,990 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:50,992 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:07:50,992 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:50,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:50,992 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:50,992 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:50,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2752 [2022-12-13 02:07:50,992 INFO L420 AbstractCegarLoop]: === Iteration 2754 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash 723605065, now seen corresponding path program 1 times [2022-12-13 02:07:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600159714] [2022-12-13 02:07:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:51,054 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 02:07:51,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:51,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600159714] [2022-12-13 02:07:51,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600159714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:51,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:51,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:51,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146065468] [2022-12-13 02:07:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:51,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:51,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:51,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:51,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:51,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:51,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:51,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:51,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:51,111 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:51,111 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:51,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:51,112 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:51,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:51,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:51,112 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:51,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:51,113 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,113 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:51,113 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:51,114 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:51,114 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,114 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:51,114 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:51,114 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,116 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:51,117 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:51,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:51,117 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,117 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:51,243 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:51,244 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:07:51,244 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:51,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,244 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:51,245 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:51,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2753 [2022-12-13 02:07:51,245 INFO L420 AbstractCegarLoop]: === Iteration 2755 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:51,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 780863367, now seen corresponding path program 1 times [2022-12-13 02:07:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:51,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47167417] [2022-12-13 02:07:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:51,307 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 02:07:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:51,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47167417] [2022-12-13 02:07:51,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47167417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:51,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:51,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:51,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940406712] [2022-12-13 02:07:51,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:51,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:51,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:51,308 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:51,308 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:51,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:51,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:51,352 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:51,353 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:51,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:51,353 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:51,353 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:51,354 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:51,354 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:51,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:51,354 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,354 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:51,355 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:51,355 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:51,355 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:51,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:51,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,358 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:51,358 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:51,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:51,358 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,358 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:51,476 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:51,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:51,478 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:51,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:51,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:51,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2754 [2022-12-13 02:07:51,478 INFO L420 AbstractCegarLoop]: === Iteration 2756 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:51,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash 838121669, now seen corresponding path program 1 times [2022-12-13 02:07:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:51,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483525332] [2022-12-13 02:07:51,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:51,543 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 02:07:51,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:51,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483525332] [2022-12-13 02:07:51,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483525332] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:51,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:51,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:51,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349184215] [2022-12-13 02:07:51,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:51,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:51,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:51,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:51,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:51,544 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:51,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:51,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:51,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:51,595 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:51,596 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:51,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:51,596 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:51,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:51,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:51,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:51,597 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:51,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:51,597 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,598 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:51,598 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:51,598 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:51,598 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,598 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:51,598 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:51,598 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,601 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:51,601 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:51,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:51,601 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,601 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:51,719 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:51,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:51,720 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:51,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,720 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:51,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:51,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2755 [2022-12-13 02:07:51,721 INFO L420 AbstractCegarLoop]: === Iteration 2757 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 895379971, now seen corresponding path program 1 times [2022-12-13 02:07:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:51,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625041566] [2022-12-13 02:07:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:51,782 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 02:07:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625041566] [2022-12-13 02:07:51,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625041566] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:51,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:51,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:51,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878909275] [2022-12-13 02:07:51,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:51,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:51,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:51,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:51,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:51,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:51,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:51,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:51,844 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:51,845 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:51,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:51,845 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:51,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:51,846 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:51,846 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:51,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:51,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:51,847 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,847 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:51,847 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:51,847 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:51,847 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,847 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:51,847 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:51,847 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:51,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,850 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:51,850 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:51,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:51,850 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:51,850 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:51,969 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:51,970 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:51,971 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:51,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:51,971 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:51,971 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2756 [2022-12-13 02:07:51,971 INFO L420 AbstractCegarLoop]: === Iteration 2758 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 952638273, now seen corresponding path program 1 times [2022-12-13 02:07:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:51,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342095642] [2022-12-13 02:07:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:52,044 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 02:07:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:52,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342095642] [2022-12-13 02:07:52,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342095642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:52,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:52,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252897634] [2022-12-13 02:07:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:52,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:52,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:52,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:52,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:52,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:52,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:52,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:52,091 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:52,091 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:52,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:52,092 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:52,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:52,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:52,093 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:52,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:52,093 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:52,094 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:52,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:52,094 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:52,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:52,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:52,097 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:52,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:52,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:52,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:52,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:07:52,229 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:52,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:52,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:52,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2757 [2022-12-13 02:07:52,230 INFO L420 AbstractCegarLoop]: === Iteration 2759 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1009896575, now seen corresponding path program 1 times [2022-12-13 02:07:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:52,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280739205] [2022-12-13 02:07:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:52,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:52,314 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 02:07:52,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:52,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280739205] [2022-12-13 02:07:52,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280739205] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:52,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:52,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848470124] [2022-12-13 02:07:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:52,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:52,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:52,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:52,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:52,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:52,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:52,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:52,381 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:52,381 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:52,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:52,382 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:52,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:52,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:52,383 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:52,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:52,384 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,384 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:52,384 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:52,384 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:52,384 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,384 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:52,384 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:52,384 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,387 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:52,387 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:52,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:52,387 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,387 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:52,525 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:52,527 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:07:52,527 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:52,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,527 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:52,527 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:52,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2758 [2022-12-13 02:07:52,528 INFO L420 AbstractCegarLoop]: === Iteration 2760 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:52,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:52,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1067154877, now seen corresponding path program 1 times [2022-12-13 02:07:52,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:52,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106272961] [2022-12-13 02:07:52,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:52,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:52,624 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 02:07:52,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:52,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106272961] [2022-12-13 02:07:52,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106272961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:52,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:52,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:52,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593149801] [2022-12-13 02:07:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:52,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:52,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:52,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:52,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:52,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:52,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:52,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:52,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:52,691 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:52,691 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:52,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:52,692 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:52,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:52,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:52,692 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:52,692 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:52,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:52,693 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:52,694 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:52,694 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:52,694 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,694 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:52,694 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:52,694 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,697 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:52,697 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:52,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:52,697 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,697 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:52,831 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:52,833 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:07:52,833 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,833 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:52,833 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:52,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2759 [2022-12-13 02:07:52,834 INFO L420 AbstractCegarLoop]: === Iteration 2761 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:52,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1124413179, now seen corresponding path program 1 times [2022-12-13 02:07:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:52,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743866154] [2022-12-13 02:07:52,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:52,915 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 02:07:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:52,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743866154] [2022-12-13 02:07:52,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743866154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:52,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:52,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376506960] [2022-12-13 02:07:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:52,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:52,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:52,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:52,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:52,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:52,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:52,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:52,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:52,976 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:52,976 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:52,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:52,977 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:52,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:52,977 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:52,977 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:52,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:52,978 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,978 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:52,978 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:52,978 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:52,978 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,979 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:52,979 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:52,979 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:52,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,981 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:52,981 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:52,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:52,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:52,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:53,121 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:53,123 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-13 02:07:53,123 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,123 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:53,123 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:53,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2760 [2022-12-13 02:07:53,124 INFO L420 AbstractCegarLoop]: === Iteration 2762 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1181671481, now seen corresponding path program 1 times [2022-12-13 02:07:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:53,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656102499] [2022-12-13 02:07:53,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:53,194 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 02:07:53,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:53,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656102499] [2022-12-13 02:07:53,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656102499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:53,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:53,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249972468] [2022-12-13 02:07:53,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:53,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:53,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:53,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:53,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:53,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:53,249 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:53,249 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:53,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:53,250 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:53,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:53,250 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:53,251 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:53,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:53,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:53,251 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,251 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:53,252 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:53,252 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:53,252 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,252 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:53,252 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:53,252 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:53,254 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:53,255 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:53,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:53,255 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:53,255 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:53,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:53,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:53,393 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:53,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:53,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2761 [2022-12-13 02:07:53,393 INFO L420 AbstractCegarLoop]: === Iteration 2763 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1238929783, now seen corresponding path program 1 times [2022-12-13 02:07:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:53,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612593334] [2022-12-13 02:07:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:53,475 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 02:07:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:53,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612593334] [2022-12-13 02:07:53,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612593334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:53,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:53,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:53,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445134090] [2022-12-13 02:07:53,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:53,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:53,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:53,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:53,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:53,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:53,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:53,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:53,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:53,537 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:53,538 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:53,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:53,538 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:53,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:53,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:53,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:53,539 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:53,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:53,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:53,540 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:53,540 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:53,540 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:53,540 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:53,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:53,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:53,543 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:53,543 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:53,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:53,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:53,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:53,678 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:53,680 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:07:53,680 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:53,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:53,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:53,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2762 [2022-12-13 02:07:53,680 INFO L420 AbstractCegarLoop]: === Iteration 2764 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:53,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1296188085, now seen corresponding path program 1 times [2022-12-13 02:07:53,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:53,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001913546] [2022-12-13 02:07:53,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:53,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:53,755 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 02:07:53,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:53,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001913546] [2022-12-13 02:07:53,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001913546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:53,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:53,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673921348] [2022-12-13 02:07:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:53,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:53,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:53,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:53,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:53,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:53,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:53,810 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:53,810 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:53,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:53,811 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:53,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:53,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:53,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:53,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:53,812 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:53,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:53,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:53,813 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:53,813 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:53,813 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:53,813 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:53,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:53,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:53,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:53,818 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:53,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:53,818 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:53,818 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:53,946 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:53,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:07:53,947 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:53,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:53,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:53,948 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:53,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2763 [2022-12-13 02:07:53,948 INFO L420 AbstractCegarLoop]: === Iteration 2765 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1353446387, now seen corresponding path program 1 times [2022-12-13 02:07:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29672176] [2022-12-13 02:07:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:53,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:54,010 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 02:07:54,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:54,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29672176] [2022-12-13 02:07:54,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29672176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:54,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:54,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:54,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123297330] [2022-12-13 02:07:54,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:54,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:54,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:54,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:54,011 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:54,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:54,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:54,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:54,056 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:54,056 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:54,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:54,056 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:54,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:54,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:54,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:54,057 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:54,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:54,058 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,058 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:54,058 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:54,058 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:54,058 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,058 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:54,058 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:54,058 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,061 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:54,061 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:54,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:54,061 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,061 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:54,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:54,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:54,182 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:54,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:54,182 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:54,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2764 [2022-12-13 02:07:54,182 INFO L420 AbstractCegarLoop]: === Iteration 2766 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1410704689, now seen corresponding path program 1 times [2022-12-13 02:07:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:54,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826299388] [2022-12-13 02:07:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:54,254 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 02:07:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:54,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826299388] [2022-12-13 02:07:54,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826299388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:54,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:54,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501890006] [2022-12-13 02:07:54,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:54,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:54,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:54,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:54,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:54,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:54,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:54,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:54,300 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:54,301 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:54,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:54,301 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:54,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:54,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:54,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:54,302 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:54,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:54,303 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,303 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:54,303 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:54,303 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:54,303 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:54,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:54,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,306 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:54,306 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:54,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:54,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:54,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:54,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:54,426 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:54,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:54,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2765 [2022-12-13 02:07:54,427 INFO L420 AbstractCegarLoop]: === Iteration 2767 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1467962991, now seen corresponding path program 1 times [2022-12-13 02:07:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:54,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664718847] [2022-12-13 02:07:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:54,488 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 02:07:54,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664718847] [2022-12-13 02:07:54,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664718847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:54,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697657783] [2022-12-13 02:07:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:54,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:54,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:54,489 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:54,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:54,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:54,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:54,540 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:54,540 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:54,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:54,541 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:54,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:54,541 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:54,541 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:54,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:54,542 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,542 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:54,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:54,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:54,543 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,543 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:54,543 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:54,543 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,545 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:54,546 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:54,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:54,546 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,546 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:54,669 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:54,671 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:07:54,671 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:54,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,671 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:54,671 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:54,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2766 [2022-12-13 02:07:54,671 INFO L420 AbstractCegarLoop]: === Iteration 2768 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:54,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1525221293, now seen corresponding path program 1 times [2022-12-13 02:07:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:54,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672424554] [2022-12-13 02:07:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:54,748 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 02:07:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:54,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672424554] [2022-12-13 02:07:54,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672424554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:54,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:54,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348132051] [2022-12-13 02:07:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:54,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:54,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:54,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:54,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:54,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:54,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:54,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:54,800 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:54,800 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:54,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:54,800 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:54,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:54,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:54,801 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:54,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:54,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:54,802 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,802 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:54,802 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:54,802 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:54,802 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,802 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:54,802 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:54,802 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:54,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,805 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:54,805 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:54,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:54,805 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:54,805 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:54,929 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:54,931 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:07:54,931 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:54,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:54,931 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:54,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2767 [2022-12-13 02:07:54,931 INFO L420 AbstractCegarLoop]: === Iteration 2769 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1582479595, now seen corresponding path program 1 times [2022-12-13 02:07:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:54,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000620071] [2022-12-13 02:07:54,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:54,998 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 02:07:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:54,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000620071] [2022-12-13 02:07:54,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000620071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:54,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:54,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059936661] [2022-12-13 02:07:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:54,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:54,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:54,999 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:54,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:54,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:54,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:55,043 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:55,043 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:55,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:55,044 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:55,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:55,044 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:55,044 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:55,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:55,045 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,045 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:55,045 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:55,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:55,045 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:55,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:55,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,049 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:55,049 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:55,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 186 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:55,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:55,173 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:55,174 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 129 [2022-12-13 02:07:55,174 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:55,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:55,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:55,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2768 [2022-12-13 02:07:55,175 INFO L420 AbstractCegarLoop]: === Iteration 2770 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1639737897, now seen corresponding path program 1 times [2022-12-13 02:07:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:55,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278805850] [2022-12-13 02:07:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:55,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 02:07:55,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:55,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278805850] [2022-12-13 02:07:55,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278805850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:55,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:55,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705303809] [2022-12-13 02:07:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:55,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:55,241 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:55,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:55,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:55,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:55,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:55,285 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:55,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:55,285 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:55,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:55,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:55,286 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:55,286 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:55,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:55,287 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,287 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:55,287 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:55,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:55,287 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,287 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:55,287 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:55,287 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,290 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:55,290 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:55,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:55,290 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,290 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:55,409 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:55,410 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:55,410 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:55,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,410 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:55,410 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:55,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2769 [2022-12-13 02:07:55,410 INFO L420 AbstractCegarLoop]: === Iteration 2771 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:55,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1696996199, now seen corresponding path program 1 times [2022-12-13 02:07:55,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:55,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911739109] [2022-12-13 02:07:55,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:55,469 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 02:07:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911739109] [2022-12-13 02:07:55,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911739109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:55,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:55,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772276364] [2022-12-13 02:07:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:55,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:55,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:55,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:55,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:55,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:55,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:55,521 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:55,521 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:55,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:55,522 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:55,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:55,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:55,522 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:55,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:55,523 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,523 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:55,523 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:55,523 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:55,523 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,524 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:55,524 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:55,524 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,526 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:55,526 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:55,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:55,527 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,527 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:55,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:55,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:07:55,646 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:55,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,646 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:55,646 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:55,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2770 [2022-12-13 02:07:55,647 INFO L420 AbstractCegarLoop]: === Iteration 2772 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:55,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1754254501, now seen corresponding path program 1 times [2022-12-13 02:07:55,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:55,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271134072] [2022-12-13 02:07:55,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:55,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:55,706 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 02:07:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:55,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271134072] [2022-12-13 02:07:55,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271134072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:55,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:55,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869096883] [2022-12-13 02:07:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:55,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:55,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:55,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:55,707 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:55,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:55,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:55,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:55,759 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:55,759 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:55,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:55,760 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:55,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:55,760 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:55,760 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:55,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:55,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:55,761 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,761 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:55,761 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:55,761 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:55,761 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,762 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:55,762 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:55,762 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:55,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,764 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:55,764 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:55,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:55,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:55,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:55,901 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:55,902 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:55,903 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:55,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,903 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:55,903 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:55,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2771 [2022-12-13 02:07:55,903 INFO L420 AbstractCegarLoop]: === Iteration 2773 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1811512803, now seen corresponding path program 1 times [2022-12-13 02:07:55,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:55,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191942496] [2022-12-13 02:07:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:55,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:55,973 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 02:07:55,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:55,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191942496] [2022-12-13 02:07:55,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191942496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:55,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:55,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144449222] [2022-12-13 02:07:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:55,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:55,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:55,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:55,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:55,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:55,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:56,028 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:56,028 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:56,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:56,028 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:56,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:56,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:56,029 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:56,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:56,030 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,030 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:56,030 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:56,030 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:56,030 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:56,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:56,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,033 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:56,033 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:56,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:56,033 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,034 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:56,181 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:56,182 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 02:07:56,182 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:56,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:56,182 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:56,183 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:56,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2772 [2022-12-13 02:07:56,183 INFO L420 AbstractCegarLoop]: === Iteration 2774 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1868771105, now seen corresponding path program 1 times [2022-12-13 02:07:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:56,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886447825] [2022-12-13 02:07:56,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:56,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:56,254 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 02:07:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:56,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886447825] [2022-12-13 02:07:56,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886447825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:56,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:56,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:56,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771294753] [2022-12-13 02:07:56,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:56,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:56,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:56,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:56,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:56,255 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:56,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:56,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:56,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:56,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:56,309 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:56,309 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:56,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:56,310 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:56,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:56,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:56,311 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:56,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:56,312 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:56,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:56,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:56,312 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:56,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:56,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,315 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:56,315 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:56,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:56,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:56,451 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:56,453 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:56,453 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:56,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:56,453 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:56,453 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:56,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2773 [2022-12-13 02:07:56,453 INFO L420 AbstractCegarLoop]: === Iteration 2775 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:56,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:56,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1926029407, now seen corresponding path program 1 times [2022-12-13 02:07:56,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:56,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326203761] [2022-12-13 02:07:56,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:56,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:56,523 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 02:07:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:56,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326203761] [2022-12-13 02:07:56,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326203761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:56,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:56,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384496288] [2022-12-13 02:07:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:56,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:56,524 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:56,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:56,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:56,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:56,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:56,578 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:56,578 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:56,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:56,579 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:56,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:56,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:56,580 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:56,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:56,581 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,581 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:56,581 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:56,581 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:56,581 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,581 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:56,581 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:56,581 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,584 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:56,584 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:56,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:56,584 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,584 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:56,720 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:56,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:56,722 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:56,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:56,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:56,722 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:56,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2774 [2022-12-13 02:07:56,722 INFO L420 AbstractCegarLoop]: === Iteration 2776 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:56,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:56,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1983287709, now seen corresponding path program 1 times [2022-12-13 02:07:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:56,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614781334] [2022-12-13 02:07:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:56,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:56,793 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 02:07:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:56,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614781334] [2022-12-13 02:07:56,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614781334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:56,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:56,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757017411] [2022-12-13 02:07:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:56,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:56,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:56,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:56,794 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:56,794 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:56,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:56,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:56,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:56,858 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:56,858 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:56,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:56,859 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:56,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:56,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:56,860 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:56,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:56,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:56,861 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:56,861 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:56,861 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:56,861 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,861 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:56,861 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:56,861 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:56,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,864 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:56,864 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:56,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:56,864 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:56,864 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:57,000 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:57,002 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:07:57,002 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:57,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,002 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:57,002 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:57,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2775 [2022-12-13 02:07:57,002 INFO L420 AbstractCegarLoop]: === Iteration 2777 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:57,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:57,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2040546011, now seen corresponding path program 1 times [2022-12-13 02:07:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:57,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11642188] [2022-12-13 02:07:57,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:57,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:57,090 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 02:07:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:57,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11642188] [2022-12-13 02:07:57,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11642188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:57,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:57,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599220705] [2022-12-13 02:07:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:57,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:57,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:57,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:57,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:57,092 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:57,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:57,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:57,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:57,145 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:57,145 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:57,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:57,146 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:57,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:57,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:57,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:57,147 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:57,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:57,148 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,148 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:57,148 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:57,148 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:57,148 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,148 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:57,148 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:57,148 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,151 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:57,151 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:57,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:57,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,152 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:57,283 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:57,285 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:07:57,285 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:57,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,285 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:57,285 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:57,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2776 [2022-12-13 02:07:57,285 INFO L420 AbstractCegarLoop]: === Iteration 2778 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:57,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:57,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2097804313, now seen corresponding path program 1 times [2022-12-13 02:07:57,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:57,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506240236] [2022-12-13 02:07:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:57,361 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 02:07:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:57,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506240236] [2022-12-13 02:07:57,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506240236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:57,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:57,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:57,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101883216] [2022-12-13 02:07:57,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:57,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:57,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:57,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:57,362 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:57,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:57,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:57,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:57,416 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:57,416 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:57,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:57,417 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:57,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:57,418 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:57,418 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:57,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:57,419 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,419 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:57,419 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:57,419 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:57,419 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,419 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:57,419 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:57,420 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,422 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:57,423 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:57,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:57,423 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,423 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:57,545 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:57,546 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:07:57,546 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:57,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,546 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:57,547 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:57,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2777 [2022-12-13 02:07:57,547 INFO L420 AbstractCegarLoop]: === Iteration 2779 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:57,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:57,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2139904681, now seen corresponding path program 1 times [2022-12-13 02:07:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:57,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327359546] [2022-12-13 02:07:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:57,624 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 02:07:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:57,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327359546] [2022-12-13 02:07:57,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327359546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:57,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:57,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:57,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027978657] [2022-12-13 02:07:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:57,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:57,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:57,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:57,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:57,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:57,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:57,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:57,668 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:57,668 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:57,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:57,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:57,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:57,669 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:57,669 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:57,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:57,670 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,670 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:57,670 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:57,670 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:57,670 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:57,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:57,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,673 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:57,673 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:57,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:57,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:57,791 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:57,792 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:57,792 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:57,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,792 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:57,792 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:57,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2778 [2022-12-13 02:07:57,792 INFO L420 AbstractCegarLoop]: === Iteration 2780 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2082646379, now seen corresponding path program 1 times [2022-12-13 02:07:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:57,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976657925] [2022-12-13 02:07:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:57,851 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 02:07:57,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:57,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976657925] [2022-12-13 02:07:57,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976657925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:57,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:57,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:57,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458339440] [2022-12-13 02:07:57,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:57,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:57,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:57,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:57,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:57,852 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:57,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:57,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:57,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:57,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:57,895 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:57,895 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:57,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:57,895 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:57,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:57,896 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:57,896 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:57,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:57,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:57,896 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:57,897 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:57,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:57,897 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,897 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:57,897 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:57,897 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:57,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,899 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:57,899 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:57,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:57,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:58,014 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:58,015 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:07:58,015 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:58,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,015 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:58,015 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:58,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2779 [2022-12-13 02:07:58,015 INFO L420 AbstractCegarLoop]: === Iteration 2781 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2025388077, now seen corresponding path program 1 times [2022-12-13 02:07:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734234985] [2022-12-13 02:07:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,074 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 02:07:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:58,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734234985] [2022-12-13 02:07:58,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734234985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:58,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:58,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871630950] [2022-12-13 02:07:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:58,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:58,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:58,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:58,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:58,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:58,118 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:58,119 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:58,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:58,119 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:58,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:58,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:58,120 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:58,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:58,120 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,120 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:58,121 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:58,121 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:58,121 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:58,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:58,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,123 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:58,123 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:58,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:58,124 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,124 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:58,239 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:58,241 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-13 02:07:58,241 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:58,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:58,241 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:58,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2780 [2022-12-13 02:07:58,241 INFO L420 AbstractCegarLoop]: === Iteration 2782 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1968129775, now seen corresponding path program 1 times [2022-12-13 02:07:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:58,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888762792] [2022-12-13 02:07:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:58,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,300 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 02:07:58,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:58,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888762792] [2022-12-13 02:07:58,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888762792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:58,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:58,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088601252] [2022-12-13 02:07:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:58,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:58,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:58,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:58,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:58,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:58,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:58,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:58,344 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:58,344 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:58,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:58,344 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:58,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:58,345 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:58,345 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:58,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:58,346 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,346 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:58,346 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:58,346 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:58,346 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,346 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:58,346 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:58,346 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,349 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:58,349 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:58,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:58,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:58,464 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:58,465 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:58,465 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:58,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,465 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:58,465 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:58,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2781 [2022-12-13 02:07:58,465 INFO L420 AbstractCegarLoop]: === Iteration 2783 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:58,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1910871473, now seen corresponding path program 1 times [2022-12-13 02:07:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:58,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595600894] [2022-12-13 02:07:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,525 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 02:07:58,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:58,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595600894] [2022-12-13 02:07:58,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595600894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:58,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:58,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365577085] [2022-12-13 02:07:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:58,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:58,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:58,526 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:58,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:58,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:58,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:58,570 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:58,570 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:58,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:58,570 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:58,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:58,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:58,571 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:58,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:58,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,572 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:58,572 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:58,572 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:58,572 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:58,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:58,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,575 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:58,575 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:58,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:58,575 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,575 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:58,692 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:58,693 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:07:58,694 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:58,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,694 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:58,694 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:58,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2782 [2022-12-13 02:07:58,694 INFO L420 AbstractCegarLoop]: === Iteration 2784 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:58,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1853613171, now seen corresponding path program 1 times [2022-12-13 02:07:58,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:58,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913200710] [2022-12-13 02:07:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,753 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 02:07:58,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:58,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913200710] [2022-12-13 02:07:58,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913200710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:58,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:58,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464999740] [2022-12-13 02:07:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:58,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:58,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:58,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:58,754 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:58,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:58,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:58,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:58,815 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:58,815 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:58,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:58,816 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:58,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:58,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:58,816 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:58,816 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:58,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:58,817 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:58,817 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:58,817 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:58,817 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:58,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:58,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:58,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,820 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:58,820 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:58,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:58,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:58,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:58,935 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:58,936 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 02:07:58,936 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:58,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,936 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:58,936 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:58,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2783 [2022-12-13 02:07:58,936 INFO L420 AbstractCegarLoop]: === Iteration 2785 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1796354869, now seen corresponding path program 1 times [2022-12-13 02:07:58,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:58,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741222463] [2022-12-13 02:07:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:58,995 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 02:07:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:58,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741222463] [2022-12-13 02:07:58,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741222463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:58,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:58,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488345645] [2022-12-13 02:07:58,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:58,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:58,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:58,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:58,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:58,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:58,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:58,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:58,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:59,046 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:59,046 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:59,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 512 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:59,046 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:59,046 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:59,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:59,047 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:59,047 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:59,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:59,048 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:59,048 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:59,048 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:59,048 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,048 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:59,048 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:59,048 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,051 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:59,051 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:59,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:59,051 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,051 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:59,177 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:59,179 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 131 [2022-12-13 02:07:59,179 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:59,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,179 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:59,179 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:59,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2784 [2022-12-13 02:07:59,179 INFO L420 AbstractCegarLoop]: === Iteration 2786 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1739096567, now seen corresponding path program 1 times [2022-12-13 02:07:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414649736] [2022-12-13 02:07:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:59,247 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 02:07:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:59,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414649736] [2022-12-13 02:07:59,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414649736] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:59,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:59,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635063553] [2022-12-13 02:07:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:59,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:59,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:59,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:59,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:59,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:59,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:59,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:59,299 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:59,299 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:59,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 516 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:59,299 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:59,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:59,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:59,300 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:59,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:59,301 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,301 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:59,301 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:59,301 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:59,301 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:59,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:59,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,304 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:59,304 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:59,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 196 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:59,304 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,304 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:59,422 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:59,423 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:07:59,424 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:59,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:59,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:59,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2785 [2022-12-13 02:07:59,424 INFO L420 AbstractCegarLoop]: === Iteration 2787 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:59,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1681838265, now seen corresponding path program 1 times [2022-12-13 02:07:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:59,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604047294] [2022-12-13 02:07:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:59,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:59,485 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 02:07:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:59,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604047294] [2022-12-13 02:07:59,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604047294] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:59,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:59,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:59,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330019878] [2022-12-13 02:07:59,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:59,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:59,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:59,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:59,486 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:59,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:59,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:59,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:59,535 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:59,535 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:07:59,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:59,536 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:59,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:59,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:59,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:59,536 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:59,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:59,537 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,537 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:59,537 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:59,537 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:59,537 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,537 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:59,538 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:59,538 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,540 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:59,540 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:07:59,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:59,540 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,540 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:59,660 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:59,661 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:07:59,661 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:59,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:59,661 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:59,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2786 [2022-12-13 02:07:59,661 INFO L420 AbstractCegarLoop]: === Iteration 2788 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1624579963, now seen corresponding path program 1 times [2022-12-13 02:07:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:59,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134833796] [2022-12-13 02:07:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:59,722 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 02:07:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:59,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134833796] [2022-12-13 02:07:59,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134833796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:59,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:59,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19985555] [2022-12-13 02:07:59,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:59,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:59,723 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:59,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:59,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:59,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:07:59,773 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:07:59,773 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:07:59,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:07:59,773 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:07:59,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:07:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:07:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:07:59,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:07:59,774 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:07:59,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:07:59,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:07:59,775 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:07:59,775 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:07:59,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:07:59,775 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:07:59,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:07:59,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:07:59,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,778 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:07:59,778 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:07:59,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:07:59,778 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:07:59,778 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:07:59,892 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:07:59,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 118 [2022-12-13 02:07:59,893 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:07:59,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:07:59,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:07:59,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2787 [2022-12-13 02:07:59,894 INFO L420 AbstractCegarLoop]: === Iteration 2789 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:07:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:07:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1567321661, now seen corresponding path program 1 times [2022-12-13 02:07:59,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:07:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079750490] [2022-12-13 02:07:59,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:07:59,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:07:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:07:59,952 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 02:07:59,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:07:59,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079750490] [2022-12-13 02:07:59,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079750490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:07:59,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:07:59,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:07:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173732076] [2022-12-13 02:07:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:07:59,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:07:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:07:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:07:59,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:07:59,953 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:07:59,953 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:07:59,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:07:59,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:07:59,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:00,014 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:00,015 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:00,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 495 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:00,016 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:00,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:00,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:00,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:00,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:00,016 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:00,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:00,017 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:00,017 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:00,017 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:00,017 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,017 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:00,017 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:00,018 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,020 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:00,020 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:00,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:00,021 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,021 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:00,155 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:00,156 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:08:00,156 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:00,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,156 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:00,156 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:00,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2788 [2022-12-13 02:08:00,156 INFO L420 AbstractCegarLoop]: === Iteration 2790 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1510063359, now seen corresponding path program 1 times [2022-12-13 02:08:00,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:00,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33168534] [2022-12-13 02:08:00,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:00,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:00,236 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 02:08:00,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:00,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33168534] [2022-12-13 02:08:00,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33168534] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:00,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:00,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470608988] [2022-12-13 02:08:00,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:00,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:00,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:00,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:00,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:00,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:00,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:00,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:00,287 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:00,287 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:00,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:00,288 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:00,288 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:00,288 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:00,288 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:00,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:00,289 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,289 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:00,290 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:00,290 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:00,290 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:00,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:00,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,294 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:00,294 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:00,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:00,294 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,295 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:00,416 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:00,417 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:08:00,418 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:00,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,418 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:00,418 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:00,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2789 [2022-12-13 02:08:00,418 INFO L420 AbstractCegarLoop]: === Iteration 2791 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:00,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1452805057, now seen corresponding path program 1 times [2022-12-13 02:08:00,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:00,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471105864] [2022-12-13 02:08:00,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:00,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:00,480 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 02:08:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:00,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471105864] [2022-12-13 02:08:00,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471105864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:00,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:00,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080083803] [2022-12-13 02:08:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:00,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:00,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:00,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:00,481 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:00,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:00,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:00,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:00,524 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:00,525 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:00,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:00,525 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:00,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:00,526 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:00,526 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:00,526 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,527 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:00,527 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:00,527 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:00,527 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,527 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:00,527 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:00,527 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,530 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:00,530 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:00,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:00,530 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,530 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:00,647 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:00,649 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:00,649 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:00,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,649 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:00,649 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:00,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2790 [2022-12-13 02:08:00,649 INFO L420 AbstractCegarLoop]: === Iteration 2792 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:00,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1395546755, now seen corresponding path program 1 times [2022-12-13 02:08:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:00,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939487982] [2022-12-13 02:08:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:00,708 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 02:08:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:00,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939487982] [2022-12-13 02:08:00,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939487982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:00,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:00,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805249552] [2022-12-13 02:08:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:00,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:00,709 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:00,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:00,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:00,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:00,752 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:00,753 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:00,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:00,753 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:00,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:00,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:00,753 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:00,754 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:00,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:00,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:00,754 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,754 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:00,754 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:00,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:00,755 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,755 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:00,755 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:00,755 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:00,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,757 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:00,757 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:00,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:00,758 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:00,758 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:00,875 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:00,877 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:00,878 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:00,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:00,878 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:00,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2791 [2022-12-13 02:08:00,878 INFO L420 AbstractCegarLoop]: === Iteration 2793 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1338288453, now seen corresponding path program 1 times [2022-12-13 02:08:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:00,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109453111] [2022-12-13 02:08:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:00,948 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 02:08:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:00,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109453111] [2022-12-13 02:08:00,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109453111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:00,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:00,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404956437] [2022-12-13 02:08:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:00,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:00,950 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:00,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:00,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:00,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:01,002 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:01,002 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:01,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:01,003 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:01,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:01,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:01,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:01,003 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:01,003 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:01,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:01,004 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,004 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:01,004 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:01,004 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:01,004 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,005 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:01,005 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:01,005 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,007 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:01,007 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:01,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:01,008 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,008 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:01,141 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:01,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:08:01,142 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:01,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:01,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:01,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2792 [2022-12-13 02:08:01,143 INFO L420 AbstractCegarLoop]: === Iteration 2794 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:01,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:01,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1281030151, now seen corresponding path program 1 times [2022-12-13 02:08:01,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:01,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455006957] [2022-12-13 02:08:01,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:01,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:01,212 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 02:08:01,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:01,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455006957] [2022-12-13 02:08:01,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455006957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:01,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:01,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:01,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865202023] [2022-12-13 02:08:01,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:01,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:01,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:01,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:01,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:01,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:01,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:01,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:01,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:01,267 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:01,267 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:01,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:01,268 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:01,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:01,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:01,269 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:01,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:01,270 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:01,270 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:01,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:01,270 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,270 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:01,270 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:01,270 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,274 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:01,274 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:01,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:01,274 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:01,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:01,411 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:08:01,411 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:01,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,411 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:01,411 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:01,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2793 [2022-12-13 02:08:01,412 INFO L420 AbstractCegarLoop]: === Iteration 2795 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:01,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1223771849, now seen corresponding path program 1 times [2022-12-13 02:08:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:01,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834511591] [2022-12-13 02:08:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:01,499 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 02:08:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:01,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834511591] [2022-12-13 02:08:01,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834511591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:01,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:01,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:01,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259892203] [2022-12-13 02:08:01,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:01,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:01,501 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:01,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:01,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:01,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:01,560 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:01,560 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:01,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:01,560 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:01,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:01,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:01,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:01,561 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:01,561 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:01,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:01,562 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,562 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:01,562 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:01,562 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:01,562 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,562 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:01,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:01,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,565 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:01,565 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:01,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:01,565 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,565 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:01,700 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:01,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:08:01,702 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:01,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:01,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:01,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2794 [2022-12-13 02:08:01,702 INFO L420 AbstractCegarLoop]: === Iteration 2796 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1166513547, now seen corresponding path program 1 times [2022-12-13 02:08:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:01,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910733785] [2022-12-13 02:08:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:01,769 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 02:08:01,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:01,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910733785] [2022-12-13 02:08:01,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910733785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:01,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:01,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:01,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104565771] [2022-12-13 02:08:01,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:01,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:01,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:01,770 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:01,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:01,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:01,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:01,814 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:01,814 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:01,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:01,815 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:01,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:01,815 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:01,815 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:01,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:01,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:01,816 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,816 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:01,816 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:01,816 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:01,817 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,817 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:01,817 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:01,817 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:01,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,819 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:01,820 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:01,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:01,820 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:01,820 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:01,939 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:01,941 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:01,941 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:01,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:01,941 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:01,941 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:01,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2795 [2022-12-13 02:08:01,941 INFO L420 AbstractCegarLoop]: === Iteration 2797 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:01,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1109255245, now seen corresponding path program 1 times [2022-12-13 02:08:01,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:01,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73210574] [2022-12-13 02:08:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:02,004 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 02:08:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73210574] [2022-12-13 02:08:02,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73210574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:02,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:02,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367190082] [2022-12-13 02:08:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:02,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:02,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:02,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:02,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:02,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:02,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:02,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:02,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:02,049 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:02,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:02,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:02,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:02,050 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:02,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:02,051 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,051 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:02,051 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:02,051 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:02,051 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:02,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:02,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,054 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:02,054 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:02,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:02,055 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,055 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:02,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:02,173 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:02,173 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:02,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,173 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:02,173 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:02,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2796 [2022-12-13 02:08:02,173 INFO L420 AbstractCegarLoop]: === Iteration 2798 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1051996943, now seen corresponding path program 1 times [2022-12-13 02:08:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:02,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093209664] [2022-12-13 02:08:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:02,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093209664] [2022-12-13 02:08:02,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093209664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:02,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:02,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627621489] [2022-12-13 02:08:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:02,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:02,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:02,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:02,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:02,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:02,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:02,285 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:02,286 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:02,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:02,286 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:02,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:02,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:02,287 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:02,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:02,288 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,288 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:02,288 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:02,288 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:02,288 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:02,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:02,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,291 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:02,291 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:02,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:02,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:02,408 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:02,409 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:08:02,409 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:02,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:02,409 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:02,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2797 [2022-12-13 02:08:02,409 INFO L420 AbstractCegarLoop]: === Iteration 2799 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -994738641, now seen corresponding path program 1 times [2022-12-13 02:08:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:02,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267513613] [2022-12-13 02:08:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:02,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:02,470 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 02:08:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:02,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267513613] [2022-12-13 02:08:02,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267513613] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:02,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:02,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155586449] [2022-12-13 02:08:02,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:02,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:02,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:02,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:02,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:02,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:02,471 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:02,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:02,517 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:02,517 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:02,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:02,517 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:02,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:02,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:02,518 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:02,518 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:02,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:02,519 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,519 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:02,519 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:02,519 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:02,519 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,519 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:02,519 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:02,519 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,522 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:02,522 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:02,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:02,522 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,522 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:02,641 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:02,642 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:02,642 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:02,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,642 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:02,642 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:02,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2798 [2022-12-13 02:08:02,642 INFO L420 AbstractCegarLoop]: === Iteration 2800 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:02,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash -937480339, now seen corresponding path program 1 times [2022-12-13 02:08:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:02,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540222834] [2022-12-13 02:08:02,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:02,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:02,710 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 02:08:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:02,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540222834] [2022-12-13 02:08:02,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540222834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:02,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:02,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5162839] [2022-12-13 02:08:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:02,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:02,711 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:02,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:02,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:02,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:02,762 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:02,762 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:02,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:02,763 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:02,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:02,763 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:02,763 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:02,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:02,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:02,764 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:02,764 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:02,765 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:02,765 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:02,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:02,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:02,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,780 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:02,780 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:02,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:02,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:02,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:02,898 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:02,899 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 134 [2022-12-13 02:08:02,899 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:02,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,899 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:02,899 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:02,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2799 [2022-12-13 02:08:02,899 INFO L420 AbstractCegarLoop]: === Iteration 2801 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -880222037, now seen corresponding path program 1 times [2022-12-13 02:08:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:02,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265449538] [2022-12-13 02:08:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:02,960 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 02:08:02,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:02,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265449538] [2022-12-13 02:08:02,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265449538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:02,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:02,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625923747] [2022-12-13 02:08:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:02,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:02,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:02,961 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:02,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:02,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:02,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:02,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:03,005 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:03,005 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:03,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:03,005 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:03,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:03,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:03,006 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:03,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:03,007 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,007 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:03,007 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:03,007 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:03,007 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,007 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:03,007 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:03,007 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,010 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:03,010 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:03,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:03,010 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,010 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:03,128 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:03,129 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:03,129 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:03,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:03,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:03,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2800 [2022-12-13 02:08:03,129 INFO L420 AbstractCegarLoop]: === Iteration 2802 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:03,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:03,130 INFO L85 PathProgramCache]: Analyzing trace with hash -822963735, now seen corresponding path program 1 times [2022-12-13 02:08:03,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:03,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189260385] [2022-12-13 02:08:03,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:03,196 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 02:08:03,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:03,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189260385] [2022-12-13 02:08:03,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189260385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:03,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:03,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179296019] [2022-12-13 02:08:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:03,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:03,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:03,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:03,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:03,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:03,260 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:03,260 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:03,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:03,261 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:03,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:03,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:03,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:03,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:03,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:03,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:03,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:03,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:03,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:03,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:03,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:03,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:03,266 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,266 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:03,388 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:03,389 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:08:03,389 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:03,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:03,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2801 [2022-12-13 02:08:03,389 INFO L420 AbstractCegarLoop]: === Iteration 2803 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:03,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:03,389 INFO L85 PathProgramCache]: Analyzing trace with hash -765705433, now seen corresponding path program 1 times [2022-12-13 02:08:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:03,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242358017] [2022-12-13 02:08:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:03,452 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 02:08:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:03,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242358017] [2022-12-13 02:08:03,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242358017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:03,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:03,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465768099] [2022-12-13 02:08:03,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:03,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:03,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:03,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:03,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:03,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:03,496 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:03,496 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:03,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:03,497 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:03,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:03,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:03,497 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:03,497 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:03,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:03,498 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,498 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:03,498 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:03,498 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:03,498 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:03,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:03,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,501 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:03,501 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:03,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:03,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:03,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:03,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:03,620 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:03,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:03,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:03,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2802 [2022-12-13 02:08:03,620 INFO L420 AbstractCegarLoop]: === Iteration 2804 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:03,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:03,621 INFO L85 PathProgramCache]: Analyzing trace with hash -708447131, now seen corresponding path program 1 times [2022-12-13 02:08:03,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:03,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895401899] [2022-12-13 02:08:03,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:03,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:03,681 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 02:08:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:03,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895401899] [2022-12-13 02:08:03,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895401899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:03,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:03,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532036356] [2022-12-13 02:08:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:03,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:03,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:03,682 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:03,682 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,682 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:03,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:03,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:03,725 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:03,725 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:03,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:03,726 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:03,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:03,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:03,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:03,726 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:03,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:03,727 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:03,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:03,728 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:03,728 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,728 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:03,728 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:03,728 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,730 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:03,730 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:03,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:03,731 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,731 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:03,849 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:03,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:03,850 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:03,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:03,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:03,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2803 [2022-12-13 02:08:03,850 INFO L420 AbstractCegarLoop]: === Iteration 2805 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:03,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash -651188829, now seen corresponding path program 1 times [2022-12-13 02:08:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:03,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602894599] [2022-12-13 02:08:03,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:03,912 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 02:08:03,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:03,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602894599] [2022-12-13 02:08:03,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602894599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:03,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:03,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115924447] [2022-12-13 02:08:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:03,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:03,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:03,913 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:03,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:03,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:03,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:03,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:03,957 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:03,957 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:03,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:03,957 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:03,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:03,958 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:03,958 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:03,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:03,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:03,959 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:03,959 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:03,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:03,959 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,959 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:03,959 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:03,959 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:03,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,962 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:03,962 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:03,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:03,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:03,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:04,080 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:04,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:04,082 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:04,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:04,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:04,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2804 [2022-12-13 02:08:04,082 INFO L420 AbstractCegarLoop]: === Iteration 2806 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:04,082 INFO L85 PathProgramCache]: Analyzing trace with hash -593930527, now seen corresponding path program 1 times [2022-12-13 02:08:04,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:04,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287229288] [2022-12-13 02:08:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:04,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:04,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:04,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287229288] [2022-12-13 02:08:04,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287229288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:04,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:04,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:04,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8332837] [2022-12-13 02:08:04,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:04,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:04,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:04,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:04,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:04,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:04,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:04,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:04,206 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:04,206 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:04,206 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:04,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:04,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:04,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:04,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:04,207 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:04,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:04,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:04,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:04,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:04,208 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:04,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:04,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:04,211 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:04,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:04,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:04,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:04,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:04,332 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:04,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:04,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:04,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2805 [2022-12-13 02:08:04,332 INFO L420 AbstractCegarLoop]: === Iteration 2807 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash -536672225, now seen corresponding path program 1 times [2022-12-13 02:08:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:04,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575519609] [2022-12-13 02:08:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:04,397 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 02:08:04,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575519609] [2022-12-13 02:08:04,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575519609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:04,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:04,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612017204] [2022-12-13 02:08:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:04,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:04,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:04,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:04,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:04,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:04,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:04,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:04,451 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:04,451 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:04,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:04,452 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:04,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:04,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:04,452 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:04,452 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:04,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:04,453 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,453 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:04,453 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:04,453 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:04,454 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,454 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:04,454 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:04,454 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,456 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:04,457 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:04,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:04,457 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,457 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:04,579 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:04,581 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:08:04,581 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:04,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:04,581 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:04,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2806 [2022-12-13 02:08:04,581 INFO L420 AbstractCegarLoop]: === Iteration 2808 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -479413923, now seen corresponding path program 1 times [2022-12-13 02:08:04,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:04,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165210403] [2022-12-13 02:08:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:04,644 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 02:08:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:04,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165210403] [2022-12-13 02:08:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165210403] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694304913] [2022-12-13 02:08:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:04,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:04,645 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:04,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:04,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:04,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:04,695 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:04,695 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:04,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:04,696 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:04,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:04,697 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:04,697 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:04,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:04,697 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:04,698 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:04,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:04,698 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,698 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:04,698 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:04,698 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,701 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:04,701 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:04,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:04,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:04,822 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:04,824 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 126 [2022-12-13 02:08:04,824 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:04,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,824 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:04,824 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:04,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2807 [2022-12-13 02:08:04,824 INFO L420 AbstractCegarLoop]: === Iteration 2809 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash -422155621, now seen corresponding path program 1 times [2022-12-13 02:08:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:04,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148057465] [2022-12-13 02:08:04,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:04,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:04,886 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 02:08:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:04,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148057465] [2022-12-13 02:08:04,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148057465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:04,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:04,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383391374] [2022-12-13 02:08:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:04,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:04,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:04,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:04,887 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:04,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:04,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:04,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:04,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:04,940 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:04,940 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:04,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:04,940 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:04,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:04,941 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:04,941 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:04,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:04,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:04,942 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,942 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:04,942 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:04,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:04,942 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:04,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:04,942 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:04,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,945 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:04,945 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:04,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:04,945 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:04,946 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:05,073 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:05,075 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:08:05,075 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:05,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,075 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:05,076 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:05,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2808 [2022-12-13 02:08:05,076 INFO L420 AbstractCegarLoop]: === Iteration 2810 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:05,076 INFO L85 PathProgramCache]: Analyzing trace with hash -364897319, now seen corresponding path program 1 times [2022-12-13 02:08:05,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:05,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206296587] [2022-12-13 02:08:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:05,155 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 02:08:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206296587] [2022-12-13 02:08:05,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206296587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:05,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:05,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029314610] [2022-12-13 02:08:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:05,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:05,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:05,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:05,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:05,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:05,218 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:05,218 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:05,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 511 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:05,219 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:05,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:05,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:05,220 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:05,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:05,221 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,221 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:05,221 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:05,221 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:05,221 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,222 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:05,222 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:05,222 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,225 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:05,225 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:05,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:05,226 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,226 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:05,356 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:05,358 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 137 [2022-12-13 02:08:05,358 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:05,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,358 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:05,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:05,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2809 [2022-12-13 02:08:05,359 INFO L420 AbstractCegarLoop]: === Iteration 2811 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:05,359 INFO L85 PathProgramCache]: Analyzing trace with hash -307639017, now seen corresponding path program 1 times [2022-12-13 02:08:05,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:05,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671791377] [2022-12-13 02:08:05,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:05,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:05,449 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 02:08:05,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:05,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671791377] [2022-12-13 02:08:05,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671791377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:05,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:05,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630008009] [2022-12-13 02:08:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:05,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:05,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:05,450 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:05,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:05,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:05,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:05,497 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:05,497 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:05,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:05,497 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:05,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:05,498 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:05,498 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:05,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:05,499 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,499 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:05,499 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:05,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:05,499 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:05,499 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:05,499 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,502 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:05,502 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:05,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:05,502 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,502 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:05,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:05,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:08:05,620 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:05,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:05,621 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:05,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2810 [2022-12-13 02:08:05,621 INFO L420 AbstractCegarLoop]: === Iteration 2812 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:05,621 INFO L85 PathProgramCache]: Analyzing trace with hash -250380715, now seen corresponding path program 1 times [2022-12-13 02:08:05,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:05,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105138044] [2022-12-13 02:08:05,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:05,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:05,680 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 02:08:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:05,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105138044] [2022-12-13 02:08:05,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105138044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:05,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:05,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:05,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390896758] [2022-12-13 02:08:05,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:05,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:05,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:05,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:05,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:05,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:05,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:05,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:05,724 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:05,725 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:05,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:05,725 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:05,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:05,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:05,726 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:05,726 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:05,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:05,727 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,727 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:05,727 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:05,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:05,727 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,727 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:05,727 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:05,727 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,730 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:05,730 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:05,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:05,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:05,848 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:05,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:05,850 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:05,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,850 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:05,850 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:05,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2811 [2022-12-13 02:08:05,850 INFO L420 AbstractCegarLoop]: === Iteration 2813 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:05,850 INFO L85 PathProgramCache]: Analyzing trace with hash -193122413, now seen corresponding path program 1 times [2022-12-13 02:08:05,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:05,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928659328] [2022-12-13 02:08:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:05,916 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 02:08:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928659328] [2022-12-13 02:08:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928659328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:05,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:05,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:05,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949442509] [2022-12-13 02:08:05,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:05,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:05,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:05,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:05,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:05,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:05,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:05,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:05,967 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:05,967 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:05,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:05,968 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:05,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:05,968 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:05,968 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:05,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:05,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:05,969 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,969 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:05,969 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:05,969 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:05,969 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,970 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:05,970 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:05,970 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:05,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,972 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:05,972 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:05,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:05,973 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:05,973 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:06,097 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:06,099 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-13 02:08:06,099 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:06,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,099 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:06,099 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:06,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2812 [2022-12-13 02:08:06,099 INFO L420 AbstractCegarLoop]: === Iteration 2814 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:06,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:06,099 INFO L85 PathProgramCache]: Analyzing trace with hash -135864111, now seen corresponding path program 1 times [2022-12-13 02:08:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:06,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964497000] [2022-12-13 02:08:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:06,162 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 02:08:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:06,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964497000] [2022-12-13 02:08:06,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964497000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:06,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:06,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153679728] [2022-12-13 02:08:06,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:06,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:06,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:06,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:06,163 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:06,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:06,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:06,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:06,206 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:06,206 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:06,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:06,207 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:06,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:06,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:06,207 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:06,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:06,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:06,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:06,209 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:06,209 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,209 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:06,209 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:06,209 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,211 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:06,211 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:06,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:06,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,212 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:06,330 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:06,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:06,332 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:06,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,332 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:06,332 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:06,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2813 [2022-12-13 02:08:06,332 INFO L420 AbstractCegarLoop]: === Iteration 2815 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -78605809, now seen corresponding path program 1 times [2022-12-13 02:08:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:06,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363658996] [2022-12-13 02:08:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:06,395 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 02:08:06,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363658996] [2022-12-13 02:08:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363658996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:06,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:06,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494319104] [2022-12-13 02:08:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:06,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:06,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:06,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:06,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:06,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:06,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:06,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:06,447 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:06,447 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:06,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:06,448 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:06,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:06,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:06,448 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:06,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:06,449 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:06,449 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:06,450 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:06,450 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:06,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:06,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,452 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:06,452 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:06,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:06,453 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,453 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:06,572 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:06,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:06,575 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:06,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:06,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:06,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2814 [2022-12-13 02:08:06,576 INFO L420 AbstractCegarLoop]: === Iteration 2816 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash -21347507, now seen corresponding path program 1 times [2022-12-13 02:08:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:06,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156158684] [2022-12-13 02:08:06,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:06,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:06,646 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 02:08:06,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:06,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156158684] [2022-12-13 02:08:06,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156158684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:06,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:06,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:06,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446735730] [2022-12-13 02:08:06,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:06,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:06,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:06,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:06,647 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:06,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:06,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:06,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:06,705 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:06,705 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:06,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:06,705 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:06,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:06,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:06,706 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:06,706 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:06,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:06,707 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,707 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:06,707 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:06,707 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:06,707 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,707 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:06,707 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:06,707 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,724 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:06,724 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:06,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:06,725 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,725 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:06,867 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:06,868 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 02:08:06,868 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:06,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,868 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:06,869 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:06,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2815 [2022-12-13 02:08:06,869 INFO L420 AbstractCegarLoop]: === Iteration 2817 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:06,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:06,869 INFO L85 PathProgramCache]: Analyzing trace with hash 35910795, now seen corresponding path program 1 times [2022-12-13 02:08:06,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:06,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59843412] [2022-12-13 02:08:06,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:06,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:06,932 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 02:08:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:06,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59843412] [2022-12-13 02:08:06,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59843412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:06,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:06,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:06,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713209626] [2022-12-13 02:08:06,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:06,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:06,933 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:06,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:06,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:06,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:06,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:06,990 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:06,991 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:06,991 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:06,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:06,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:06,992 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:06,992 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:06,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:06,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:06,993 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,993 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:06,993 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:06,993 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:06,993 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:06,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:06,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:06,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,996 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:06,996 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:06,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:06,996 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:06,996 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:07,126 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:07,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-13 02:08:07,129 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:07,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,129 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:07,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:07,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2816 [2022-12-13 02:08:07,129 INFO L420 AbstractCegarLoop]: === Iteration 2818 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:07,129 INFO L85 PathProgramCache]: Analyzing trace with hash 93169097, now seen corresponding path program 1 times [2022-12-13 02:08:07,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:07,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066501517] [2022-12-13 02:08:07,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:07,200 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 02:08:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:07,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066501517] [2022-12-13 02:08:07,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066501517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:07,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:07,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9790809] [2022-12-13 02:08:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:07,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:07,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:07,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:07,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:07,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:07,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:07,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:07,245 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:07,245 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:07,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:07,246 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:07,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:07,246 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:07,246 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:07,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:07,247 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,247 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:07,247 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:07,247 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:07,247 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,247 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:07,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:07,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,250 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:07,250 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:07,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:07,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,251 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:07,374 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:07,375 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:08:07,375 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:07,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:07,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:07,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2817 [2022-12-13 02:08:07,375 INFO L420 AbstractCegarLoop]: === Iteration 2819 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash 150427399, now seen corresponding path program 1 times [2022-12-13 02:08:07,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:07,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681449306] [2022-12-13 02:08:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:07,438 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 02:08:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:07,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681449306] [2022-12-13 02:08:07,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681449306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:07,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:07,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701744957] [2022-12-13 02:08:07,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:07,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:07,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:07,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:07,439 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:07,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:07,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:07,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:07,495 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:07,495 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:07,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:07,496 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:07,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:07,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:07,496 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:07,497 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:07,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:07,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:07,497 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,498 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:07,498 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:07,498 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:07,500 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:07,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:07,501 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,501 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:07,619 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:07,620 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:07,620 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:07,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,620 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:07,620 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:07,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2818 [2022-12-13 02:08:07,620 INFO L420 AbstractCegarLoop]: === Iteration 2820 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 207685701, now seen corresponding path program 1 times [2022-12-13 02:08:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:07,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520249596] [2022-12-13 02:08:07,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:07,686 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 02:08:07,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:07,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520249596] [2022-12-13 02:08:07,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520249596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:07,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:07,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:07,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990980342] [2022-12-13 02:08:07,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:07,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:07,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:07,687 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:07,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:07,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:07,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:07,737 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:07,738 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:07,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:07,738 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:07,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:07,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:07,739 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:07,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:07,739 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,740 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:07,740 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:07,740 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:07,740 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,740 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:07,740 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:07,740 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,743 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:07,743 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:07,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:07,743 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,743 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:07,861 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:07,862 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:07,862 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:07,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,862 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:07,862 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:07,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2819 [2022-12-13 02:08:07,862 INFO L420 AbstractCegarLoop]: === Iteration 2821 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 264944003, now seen corresponding path program 1 times [2022-12-13 02:08:07,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:07,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944064554] [2022-12-13 02:08:07,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:07,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:07,924 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 02:08:07,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:07,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944064554] [2022-12-13 02:08:07,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944064554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:07,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:07,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:07,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007770039] [2022-12-13 02:08:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:07,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:07,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:07,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:07,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:07,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:07,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:07,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:07,983 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:07,983 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:07,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:07,984 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:07,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:07,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:07,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:07,985 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:07,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:07,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:07,986 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,986 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:07,986 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:07,986 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:07,986 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:07,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:07,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,991 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:07,991 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:07,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:07,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:07,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:08,127 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:08,128 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:08:08,128 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:08,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,128 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:08,129 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:08,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2820 [2022-12-13 02:08:08,129 INFO L420 AbstractCegarLoop]: === Iteration 2822 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:08,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash 322202305, now seen corresponding path program 1 times [2022-12-13 02:08:08,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:08,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522044158] [2022-12-13 02:08:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:08,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:08,208 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 02:08:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:08,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522044158] [2022-12-13 02:08:08,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522044158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:08,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:08,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365460771] [2022-12-13 02:08:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:08,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:08,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:08,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:08,210 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,210 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:08,210 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:08,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:08,261 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:08,261 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:08,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:08,262 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:08,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:08,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:08,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:08,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:08,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:08,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:08,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:08,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:08,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:08,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:08,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:08,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:08,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:08,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:08,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:08,266 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:08,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:08,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:08,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:08,400 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:08,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:08:08,401 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:08,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:08,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:08,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2821 [2022-12-13 02:08:08,401 INFO L420 AbstractCegarLoop]: === Iteration 2823 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:08,401 INFO L85 PathProgramCache]: Analyzing trace with hash 379460607, now seen corresponding path program 1 times [2022-12-13 02:08:08,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:08,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990476500] [2022-12-13 02:08:08,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:08,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:08,478 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 02:08:08,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:08,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990476500] [2022-12-13 02:08:08,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990476500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:08,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:08,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218069620] [2022-12-13 02:08:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:08,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:08,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:08,479 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:08,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:08,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:08,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:08,541 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:08,542 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:08,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:08,542 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:08,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:08,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:08,543 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:08,543 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:08,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:08,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:08,544 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,544 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:08,544 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:08,544 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:08,544 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,544 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:08,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:08,544 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:08,547 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:08,547 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:08,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:08,548 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:08,548 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:08,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:08,683 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:08:08,683 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:08,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,684 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:08,684 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:08,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2822 [2022-12-13 02:08:08,684 INFO L420 AbstractCegarLoop]: === Iteration 2824 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash 436718909, now seen corresponding path program 1 times [2022-12-13 02:08:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:08,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343714788] [2022-12-13 02:08:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:08,755 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 02:08:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:08,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343714788] [2022-12-13 02:08:08,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343714788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:08,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256708875] [2022-12-13 02:08:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:08,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:08,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:08,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:08,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:08,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:08,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:08,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:08,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:08,811 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:08,811 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:08,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:08,811 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:08,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:08,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:08,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:08,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:08,812 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:08,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:08,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:08,813 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,813 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:08,814 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:08,814 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:08,814 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:08,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:08,814 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:08,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:08,818 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:08,818 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:08,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 197 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:08,819 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:08,819 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:08,954 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:08,956 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:08:08,956 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:08,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:08,956 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:08,956 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:08,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2823 [2022-12-13 02:08:08,956 INFO L420 AbstractCegarLoop]: === Iteration 2825 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:08,957 INFO L85 PathProgramCache]: Analyzing trace with hash 493977211, now seen corresponding path program 1 times [2022-12-13 02:08:08,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:08,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626354561] [2022-12-13 02:08:08,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:08,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:09,026 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 02:08:09,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:09,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626354561] [2022-12-13 02:08:09,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626354561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:09,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:09,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173928998] [2022-12-13 02:08:09,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:09,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:09,027 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:09,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:09,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:09,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:09,091 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:09,091 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:09,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:09,092 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:09,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:09,093 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:09,093 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:09,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:09,094 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,094 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:09,094 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:09,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:09,094 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:09,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:09,094 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,097 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:09,097 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:09,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:09,097 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,097 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:09,235 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:09,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:08:09,237 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:09,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:09,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:09,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2824 [2022-12-13 02:08:09,238 INFO L420 AbstractCegarLoop]: === Iteration 2826 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 551235513, now seen corresponding path program 1 times [2022-12-13 02:08:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:09,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641941914] [2022-12-13 02:08:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:09,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:09,321 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 02:08:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:09,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641941914] [2022-12-13 02:08:09,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641941914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:09,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:09,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:09,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018502472] [2022-12-13 02:08:09,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:09,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:09,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:09,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:09,322 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:09,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:09,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:09,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:09,372 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:09,372 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:09,372 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:09,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:09,373 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:09,373 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:09,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:09,374 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,374 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:09,374 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:09,374 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:09,375 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,375 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:09,375 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:09,375 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,378 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:09,378 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:09,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:09,379 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,379 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:09,511 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:09,513 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-13 02:08:09,513 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:09,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,513 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:09,513 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:09,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2825 [2022-12-13 02:08:09,513 INFO L420 AbstractCegarLoop]: === Iteration 2827 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:09,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash 608493815, now seen corresponding path program 1 times [2022-12-13 02:08:09,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:09,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109012292] [2022-12-13 02:08:09,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:09,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:09,610 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 02:08:09,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:09,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109012292] [2022-12-13 02:08:09,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109012292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:09,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:09,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:09,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450616718] [2022-12-13 02:08:09,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:09,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:09,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:09,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:09,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:09,611 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:09,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:09,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:09,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:09,667 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:09,667 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:09,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:09,668 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:09,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:09,668 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:09,668 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:09,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:09,669 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,669 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:09,669 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:09,669 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:09,669 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,670 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:09,670 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:09,670 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,672 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:09,672 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:09,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:09,673 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,673 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:09,795 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:09,796 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:08:09,796 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,796 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:09,796 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:09,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2826 [2022-12-13 02:08:09,797 INFO L420 AbstractCegarLoop]: === Iteration 2828 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 665752117, now seen corresponding path program 1 times [2022-12-13 02:08:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:09,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365803525] [2022-12-13 02:08:09,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:09,857 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 02:08:09,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:09,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365803525] [2022-12-13 02:08:09,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365803525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:09,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:09,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331946499] [2022-12-13 02:08:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:09,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:09,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:09,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:09,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:09,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:09,908 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:09,908 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:09,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:09,909 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:09,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:09,909 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:09,909 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:09,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:09,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:09,910 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,910 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:09,910 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:09,910 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:09,910 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:09,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:09,911 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:09,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,913 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:09,913 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:09,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:09,913 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:09,914 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:10,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:10,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:10,033 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:10,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:10,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:10,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2827 [2022-12-13 02:08:10,033 INFO L420 AbstractCegarLoop]: === Iteration 2829 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash 723010419, now seen corresponding path program 1 times [2022-12-13 02:08:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:10,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583121045] [2022-12-13 02:08:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:10,095 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 02:08:10,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:10,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583121045] [2022-12-13 02:08:10,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583121045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:10,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:10,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:10,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886448892] [2022-12-13 02:08:10,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:10,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:10,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:10,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:10,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:10,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:10,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:10,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:10,140 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:10,140 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:10,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:10,140 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:10,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:10,141 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:10,141 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:10,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:10,142 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,142 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:10,142 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:10,142 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:10,142 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,142 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:10,142 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:10,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,145 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:10,145 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:10,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:10,145 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,145 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:10,264 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:10,265 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:10,265 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:10,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,266 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:10,266 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:10,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2828 [2022-12-13 02:08:10,266 INFO L420 AbstractCegarLoop]: === Iteration 2830 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:10,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash 780268721, now seen corresponding path program 1 times [2022-12-13 02:08:10,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:10,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465501110] [2022-12-13 02:08:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:10,326 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 02:08:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:10,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465501110] [2022-12-13 02:08:10,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465501110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:10,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:10,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:10,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681676142] [2022-12-13 02:08:10,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:10,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:10,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:10,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:10,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:10,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:10,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:10,377 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:10,377 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:10,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:10,378 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:10,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:10,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:10,378 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:10,378 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:10,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:10,379 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:10,379 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:10,379 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:10,379 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,380 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:10,380 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:10,380 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,382 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:10,382 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:10,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:10,383 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,383 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:10,501 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:10,502 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:10,502 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:10,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,502 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:10,502 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:10,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2829 [2022-12-13 02:08:10,502 INFO L420 AbstractCegarLoop]: === Iteration 2831 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:10,502 INFO L85 PathProgramCache]: Analyzing trace with hash 837527023, now seen corresponding path program 1 times [2022-12-13 02:08:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:10,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036145970] [2022-12-13 02:08:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:10,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:10,564 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 02:08:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:10,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036145970] [2022-12-13 02:08:10,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036145970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:10,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:10,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939538758] [2022-12-13 02:08:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:10,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:10,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:10,565 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:10,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:10,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:10,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:10,615 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:10,616 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:10,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:10,616 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:10,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:10,617 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:10,617 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:10,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:10,618 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,618 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:10,618 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:10,618 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:10,618 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,618 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:10,618 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:10,618 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,621 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:10,621 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:10,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:10,621 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,621 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:10,739 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:10,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:10,740 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:10,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:10,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:10,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2830 [2022-12-13 02:08:10,741 INFO L420 AbstractCegarLoop]: === Iteration 2832 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:10,741 INFO L85 PathProgramCache]: Analyzing trace with hash 894785325, now seen corresponding path program 1 times [2022-12-13 02:08:10,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:10,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437263582] [2022-12-13 02:08:10,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:10,803 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 02:08:10,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:10,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437263582] [2022-12-13 02:08:10,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437263582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:10,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:10,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716142091] [2022-12-13 02:08:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:10,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:10,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:10,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:10,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:10,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:10,857 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:10,857 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:10,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 509 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:10,858 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:10,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:10,858 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:10,858 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:10,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:10,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:10,859 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,859 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:10,859 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:10,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:10,859 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,859 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:10,859 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:10,860 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:10,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,862 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:10,862 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:10,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:10,862 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:10,862 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:10,986 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:10,987 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:08:10,987 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:10,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:10,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:10,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:10,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2831 [2022-12-13 02:08:10,988 INFO L420 AbstractCegarLoop]: === Iteration 2833 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:10,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:10,988 INFO L85 PathProgramCache]: Analyzing trace with hash 952043627, now seen corresponding path program 1 times [2022-12-13 02:08:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:10,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169957465] [2022-12-13 02:08:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:11,048 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 02:08:11,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:11,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169957465] [2022-12-13 02:08:11,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169957465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:11,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:11,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:11,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416626963] [2022-12-13 02:08:11,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:11,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:11,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:11,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:11,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:11,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:11,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:11,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:11,099 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:11,100 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:11,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:11,100 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:11,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:11,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:11,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:11,101 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:11,101 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:11,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:11,102 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,102 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:11,102 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:11,102 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:11,102 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,102 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:11,102 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:11,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,105 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:11,105 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:11,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:11,105 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,105 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:11,227 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:11,229 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:08:11,229 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:11,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,229 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:11,229 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:11,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2832 [2022-12-13 02:08:11,229 INFO L420 AbstractCegarLoop]: === Iteration 2834 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:11,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1009301929, now seen corresponding path program 1 times [2022-12-13 02:08:11,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:11,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597938540] [2022-12-13 02:08:11,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:11,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:11,293 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 02:08:11,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:11,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597938540] [2022-12-13 02:08:11,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597938540] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:11,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:11,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:11,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211931206] [2022-12-13 02:08:11,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:11,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:11,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:11,294 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:11,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:11,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:11,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:11,348 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:11,348 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:11,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:11,348 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:11,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:11,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:11,349 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:11,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:11,350 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:11,350 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:11,350 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:11,350 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:11,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:11,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,353 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:11,353 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:11,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:11,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:11,474 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:11,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:11,475 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:11,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,475 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:11,476 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:11,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2833 [2022-12-13 02:08:11,476 INFO L420 AbstractCegarLoop]: === Iteration 2835 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:11,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:11,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1066560231, now seen corresponding path program 1 times [2022-12-13 02:08:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:11,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100727997] [2022-12-13 02:08:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:11,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:11,545 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 02:08:11,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:11,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100727997] [2022-12-13 02:08:11,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100727997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:11,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:11,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438920308] [2022-12-13 02:08:11,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:11,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:11,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:11,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:11,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:11,546 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:11,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:11,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:11,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:11,593 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:11,593 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:11,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:11,594 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:11,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:11,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:11,594 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:11,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:11,595 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,595 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:11,595 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:11,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:11,595 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,595 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:11,595 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:11,595 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,598 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:11,598 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:11,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,599 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:11,718 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:11,719 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:11,719 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:11,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,719 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:11,719 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2834 [2022-12-13 02:08:11,719 INFO L420 AbstractCegarLoop]: === Iteration 2836 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1123818533, now seen corresponding path program 1 times [2022-12-13 02:08:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:11,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477660310] [2022-12-13 02:08:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:11,780 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 02:08:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:11,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477660310] [2022-12-13 02:08:11,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477660310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:11,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:11,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338486946] [2022-12-13 02:08:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:11,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:11,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:11,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:11,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:11,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:11,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:11,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:11,832 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:11,832 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:11,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:11,833 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:11,833 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:11,833 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:11,833 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:11,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:11,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:11,834 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,834 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:11,834 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:11,834 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:11,834 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,835 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:11,835 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:11,835 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:11,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,837 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:11,837 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:11,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:11,838 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:11,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:11,956 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:11,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:11,957 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:11,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:11,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:11,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:11,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2835 [2022-12-13 02:08:11,957 INFO L420 AbstractCegarLoop]: === Iteration 2837 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:11,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:11,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1181076835, now seen corresponding path program 1 times [2022-12-13 02:08:11,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:11,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455753903] [2022-12-13 02:08:11,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:11,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:12,017 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 02:08:12,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:12,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455753903] [2022-12-13 02:08:12,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455753903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:12,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:12,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:12,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046119832] [2022-12-13 02:08:12,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:12,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:12,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:12,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:12,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:12,018 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:12,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:12,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:12,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:12,062 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:12,062 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:12,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:12,063 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:12,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:12,063 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:12,063 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:12,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:12,064 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,064 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:12,064 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:12,065 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:12,065 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:12,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:12,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,067 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:12,067 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:12,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:12,068 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,068 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:12,200 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:12,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-13 02:08:12,201 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:12,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:12,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:12,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2836 [2022-12-13 02:08:12,202 INFO L420 AbstractCegarLoop]: === Iteration 2838 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:12,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:12,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1238335137, now seen corresponding path program 1 times [2022-12-13 02:08:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:12,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421324042] [2022-12-13 02:08:12,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:12,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:12,264 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 02:08:12,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:12,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421324042] [2022-12-13 02:08:12,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421324042] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:12,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:12,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238693105] [2022-12-13 02:08:12,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:12,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:12,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:12,265 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:12,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:12,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:12,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:12,308 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:12,308 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:12,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:12,309 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:12,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:12,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:12,309 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:12,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:12,310 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,310 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:12,310 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:12,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:12,310 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:12,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:12,311 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,313 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:12,313 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:12,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:12,314 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,314 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:12,431 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:12,432 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:12,432 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:12,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,432 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:12,432 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:12,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2837 [2022-12-13 02:08:12,432 INFO L420 AbstractCegarLoop]: === Iteration 2839 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1295593439, now seen corresponding path program 1 times [2022-12-13 02:08:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:12,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696600036] [2022-12-13 02:08:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:12,491 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 02:08:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:12,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696600036] [2022-12-13 02:08:12,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696600036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:12,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:12,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005590095] [2022-12-13 02:08:12,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:12,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:12,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:12,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:12,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:12,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:12,543 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:12,544 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:12,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 491 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:12,544 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:12,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:12,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:12,545 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:12,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:12,545 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,546 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:12,546 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:12,546 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:12,546 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,546 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:12,546 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:12,546 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,549 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:12,549 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:12,549 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,549 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:12,668 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:12,670 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:12,670 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:12,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,670 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:12,670 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:12,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2838 [2022-12-13 02:08:12,670 INFO L420 AbstractCegarLoop]: === Iteration 2840 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:12,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:12,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1352851741, now seen corresponding path program 1 times [2022-12-13 02:08:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:12,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454984937] [2022-12-13 02:08:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:12,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:12,729 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 02:08:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:12,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454984937] [2022-12-13 02:08:12,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454984937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:12,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:12,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146615517] [2022-12-13 02:08:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:12,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:12,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:12,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:12,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:12,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:12,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:12,773 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:12,774 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:12,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:12,774 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:12,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:12,775 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:12,775 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:12,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:12,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:12,775 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,775 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:12,776 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:12,776 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:12,776 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,776 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:12,776 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:12,776 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:12,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,778 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:12,779 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:12,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:12,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:12,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:12,897 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:12,898 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:12,898 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:12,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,898 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:12,898 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:12,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2839 [2022-12-13 02:08:12,898 INFO L420 AbstractCegarLoop]: === Iteration 2841 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1410110043, now seen corresponding path program 1 times [2022-12-13 02:08:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667600308] [2022-12-13 02:08:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:12,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:12,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667600308] [2022-12-13 02:08:12,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667600308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:12,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:12,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547056086] [2022-12-13 02:08:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:12,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:12,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:12,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:12,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:12,962 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:12,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:12,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:12,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:12,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:13,016 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:13,016 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:13,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:13,017 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:13,017 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:13,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:13,018 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:13,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:13,019 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,019 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:13,019 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:13,019 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:13,019 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:13,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:13,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,023 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:13,023 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:13,024 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,024 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:13,159 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:13,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:08:13,162 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:13,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,162 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:13,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:13,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2840 [2022-12-13 02:08:13,162 INFO L420 AbstractCegarLoop]: === Iteration 2842 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:13,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1467368345, now seen corresponding path program 1 times [2022-12-13 02:08:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:13,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524183017] [2022-12-13 02:08:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:13,235 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 02:08:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:13,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524183017] [2022-12-13 02:08:13,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524183017] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:13,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:13,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856461779] [2022-12-13 02:08:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:13,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:13,236 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:13,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:13,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:13,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:13,289 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:13,290 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:13,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:13,290 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:13,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:13,291 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:13,291 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:13,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:13,292 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:13,293 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:13,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:13,293 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:13,293 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:13,293 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,296 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:13,296 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:13,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:13,297 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,297 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:13,425 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:13,426 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:08:13,426 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:13,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:13,426 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:13,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2841 [2022-12-13 02:08:13,427 INFO L420 AbstractCegarLoop]: === Iteration 2843 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:13,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:13,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1524626647, now seen corresponding path program 1 times [2022-12-13 02:08:13,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:13,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386536712] [2022-12-13 02:08:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:13,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:13,510 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 02:08:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:13,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386536712] [2022-12-13 02:08:13,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386536712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:13,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:13,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:13,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036956] [2022-12-13 02:08:13,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:13,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:13,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:13,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:13,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:13,511 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:13,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:13,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:13,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:13,556 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:13,556 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:13,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:13,557 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:13,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:13,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:13,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:13,557 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:13,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:13,558 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,558 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:13,558 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:13,558 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:13,558 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:13,559 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:13,559 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,561 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:13,561 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:13,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:13,562 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,562 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:13,681 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:13,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:13,682 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:13,683 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2842 [2022-12-13 02:08:13,683 INFO L420 AbstractCegarLoop]: === Iteration 2844 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1581884949, now seen corresponding path program 1 times [2022-12-13 02:08:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:13,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733547513] [2022-12-13 02:08:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:13,743 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 02:08:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:13,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733547513] [2022-12-13 02:08:13,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733547513] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:13,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:13,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251395947] [2022-12-13 02:08:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:13,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:13,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:13,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:13,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:13,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:13,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:13,788 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:13,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:13,789 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:13,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:13,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:13,789 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:13,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:13,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:13,790 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:13,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:13,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:13,790 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:13,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:13,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:13,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,793 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:13,793 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:13,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:13,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:13,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:13,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:13,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:13,913 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:13,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,913 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:13,913 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:13,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2843 [2022-12-13 02:08:13,913 INFO L420 AbstractCegarLoop]: === Iteration 2845 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1639143251, now seen corresponding path program 1 times [2022-12-13 02:08:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082505344] [2022-12-13 02:08:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:13,975 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 02:08:13,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:13,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082505344] [2022-12-13 02:08:13,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082505344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:13,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:13,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:13,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559846879] [2022-12-13 02:08:13,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:13,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:13,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:13,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:13,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:13,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:13,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:13,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:13,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:14,025 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:14,025 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:14,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:14,026 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:14,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:14,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:14,026 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:14,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:14,027 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:14,027 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:14,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:14,027 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:14,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:14,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,030 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:14,030 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:14,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:14,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:14,148 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:14,149 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:14,149 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:14,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:14,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:14,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2844 [2022-12-13 02:08:14,150 INFO L420 AbstractCegarLoop]: === Iteration 2846 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:14,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1696401553, now seen corresponding path program 1 times [2022-12-13 02:08:14,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:14,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733284985] [2022-12-13 02:08:14,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:14,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:14,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:14,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733284985] [2022-12-13 02:08:14,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733284985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:14,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:14,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:14,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437068917] [2022-12-13 02:08:14,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:14,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:14,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:14,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:14,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:14,211 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:14,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:14,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:14,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:14,262 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:14,262 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:14,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:14,263 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:14,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:14,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:14,263 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:14,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:14,264 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,264 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:14,264 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:14,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:14,264 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:14,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:14,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,267 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:14,267 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:14,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:14,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:14,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:14,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:14,387 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:14,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:14,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:14,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2845 [2022-12-13 02:08:14,387 INFO L420 AbstractCegarLoop]: === Iteration 2847 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1753659855, now seen corresponding path program 1 times [2022-12-13 02:08:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:14,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281002115] [2022-12-13 02:08:14,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:14,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:14,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281002115] [2022-12-13 02:08:14,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281002115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:14,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:14,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:14,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589600091] [2022-12-13 02:08:14,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:14,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:14,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:14,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:14,451 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:14,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:14,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:14,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:14,495 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:14,495 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:14,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:14,495 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:14,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:14,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:14,496 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:14,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:14,497 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,497 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:14,497 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:14,497 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:14,497 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,497 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:14,497 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:14,497 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,500 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:14,500 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:14,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:14,500 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,500 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:14,638 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:14,639 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 02:08:14,639 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:14,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:14,639 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:14,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2846 [2022-12-13 02:08:14,639 INFO L420 AbstractCegarLoop]: === Iteration 2848 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:14,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1810918157, now seen corresponding path program 1 times [2022-12-13 02:08:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:14,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245541094] [2022-12-13 02:08:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:14,720 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 02:08:14,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:14,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245541094] [2022-12-13 02:08:14,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245541094] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:14,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:14,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:14,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114486584] [2022-12-13 02:08:14,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:14,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:14,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:14,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:14,721 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:14,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:14,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:14,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:14,766 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:14,766 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:14,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:14,766 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:14,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:14,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:14,767 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:14,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:14,768 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,768 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:14,768 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:14,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:14,768 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:14,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:14,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,771 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:14,771 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:14,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:14,771 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:14,771 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:14,888 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:14,889 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:08:14,889 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:14,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,889 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:14,890 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:14,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2847 [2022-12-13 02:08:14,890 INFO L420 AbstractCegarLoop]: === Iteration 2849 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:14,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1868176459, now seen corresponding path program 1 times [2022-12-13 02:08:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:14,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786231674] [2022-12-13 02:08:14,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:14,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:14,951 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 02:08:14,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:14,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786231674] [2022-12-13 02:08:14,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786231674] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:14,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:14,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:14,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718601721] [2022-12-13 02:08:14,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:14,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:14,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:14,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:14,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:14,952 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:14,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:14,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:14,952 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:14,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:14,996 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:14,996 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:14,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:14,997 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:14,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:14,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:14,997 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:14,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:14,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:14,998 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:14,998 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:14,998 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:14,998 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,998 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:14,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:14,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:14,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,001 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:15,001 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:15,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 199 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:15,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:15,119 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:15,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:15,120 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:15,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,121 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:15,121 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:15,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2848 [2022-12-13 02:08:15,121 INFO L420 AbstractCegarLoop]: === Iteration 2850 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:15,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1925434761, now seen corresponding path program 1 times [2022-12-13 02:08:15,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:15,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415666020] [2022-12-13 02:08:15,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:15,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:15,186 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 02:08:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:15,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415666020] [2022-12-13 02:08:15,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415666020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:15,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:15,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:15,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602986615] [2022-12-13 02:08:15,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:15,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:15,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:15,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:15,187 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:15,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:15,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:15,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:15,243 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:15,243 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:15,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:15,243 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:15,243 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:15,244 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:15,244 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:15,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:15,245 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,245 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:15,245 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:15,245 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:15,245 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,245 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:15,245 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:15,245 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,248 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:15,248 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:15,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:15,248 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,248 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:15,371 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:15,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 02:08:15,373 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:15,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:15,373 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:15,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2849 [2022-12-13 02:08:15,373 INFO L420 AbstractCegarLoop]: === Iteration 2851 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:15,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:15,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1982693063, now seen corresponding path program 1 times [2022-12-13 02:08:15,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:15,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114790998] [2022-12-13 02:08:15,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:15,435 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 02:08:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:15,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114790998] [2022-12-13 02:08:15,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114790998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:15,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:15,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345967124] [2022-12-13 02:08:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:15,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:15,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:15,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:15,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:15,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:15,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:15,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:15,485 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:15,485 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:15,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:15,485 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:15,485 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:15,486 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:15,486 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:15,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:15,487 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,487 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:15,487 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:15,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:15,487 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:15,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:15,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,490 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:15,490 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:15,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:15,490 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,490 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:15,608 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:15,610 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:15,610 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:15,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,610 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:15,610 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:15,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2850 [2022-12-13 02:08:15,610 INFO L420 AbstractCegarLoop]: === Iteration 2852 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:15,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2039951365, now seen corresponding path program 1 times [2022-12-13 02:08:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:15,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541672706] [2022-12-13 02:08:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:15,672 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 02:08:15,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:15,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541672706] [2022-12-13 02:08:15,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541672706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:15,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:15,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:15,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821849445] [2022-12-13 02:08:15,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:15,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:15,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:15,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:15,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:15,673 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:15,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:15,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:15,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:15,716 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:15,717 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:15,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:15,717 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:15,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:15,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:15,718 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:15,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:15,718 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,718 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:15,719 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:15,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:15,719 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,719 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:15,719 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:15,719 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,722 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:15,722 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:15,722 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,722 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:15,839 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:15,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:15,841 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:15,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:15,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:15,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2851 [2022-12-13 02:08:15,841 INFO L420 AbstractCegarLoop]: === Iteration 2853 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:15,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2097209667, now seen corresponding path program 1 times [2022-12-13 02:08:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:15,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646063951] [2022-12-13 02:08:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:15,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:15,904 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 02:08:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:15,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646063951] [2022-12-13 02:08:15,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646063951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:15,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:15,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563666995] [2022-12-13 02:08:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:15,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:15,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:15,905 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:15,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:15,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:15,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:15,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:15,969 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:15,970 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:15,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:15,970 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:15,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:15,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:15,971 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:15,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:15,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:15,972 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,972 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:15,972 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:15,972 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:15,972 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,972 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:15,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:15,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:15,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,975 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:15,975 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:15,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:15,976 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:15,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:16,114 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:16,115 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:08:16,116 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:16,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:16,116 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:16,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2852 [2022-12-13 02:08:16,116 INFO L420 AbstractCegarLoop]: === Iteration 2854 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:16,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2140499327, now seen corresponding path program 1 times [2022-12-13 02:08:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:16,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7116187] [2022-12-13 02:08:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:16,197 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 02:08:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:16,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7116187] [2022-12-13 02:08:16,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7116187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:16,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:16,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972256920] [2022-12-13 02:08:16,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:16,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:16,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:16,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:16,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:16,199 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:16,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:16,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:16,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:16,261 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:16,261 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:16,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:16,262 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:16,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:16,262 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:16,262 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:16,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:16,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:16,263 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,263 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:16,263 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:16,263 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:16,263 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,264 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:16,264 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:16,264 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:16,266 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:16,266 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:16,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:16,267 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:16,267 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:16,400 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:16,401 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-13 02:08:16,401 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:16,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:16,401 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:16,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2853 [2022-12-13 02:08:16,401 INFO L420 AbstractCegarLoop]: === Iteration 2855 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2083241025, now seen corresponding path program 1 times [2022-12-13 02:08:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:16,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212401590] [2022-12-13 02:08:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:16,474 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 02:08:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:16,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212401590] [2022-12-13 02:08:16,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212401590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:16,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:16,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808989835] [2022-12-13 02:08:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:16,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:16,476 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:16,476 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:16,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:16,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:16,539 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:16,539 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:16,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 503 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:16,540 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:16,540 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:16,540 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:16,541 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:16,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:16,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:16,541 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,541 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:16,542 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:16,542 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:16,542 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:16,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:16,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:16,545 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:16,545 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:16,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:16,545 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:16,545 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:16,680 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:16,682 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-13 02:08:16,682 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:16,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,682 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:16,682 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:16,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2854 [2022-12-13 02:08:16,683 INFO L420 AbstractCegarLoop]: === Iteration 2856 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:16,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2025982723, now seen corresponding path program 1 times [2022-12-13 02:08:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:16,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813133190] [2022-12-13 02:08:16,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:16,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:16,761 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 02:08:16,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:16,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813133190] [2022-12-13 02:08:16,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813133190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:16,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:16,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:16,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312594528] [2022-12-13 02:08:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:16,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:16,763 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:16,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:16,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:16,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:16,809 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:16,810 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:16,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:16,810 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:16,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:16,811 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:16,811 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:16,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:16,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:16,811 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,812 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:16,812 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:16,812 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:16,812 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,812 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:16,812 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:16,812 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:16,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:16,815 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:16,815 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:16,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:16,815 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:16,815 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:16,933 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:16,935 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:16,935 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:16,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,935 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:16,935 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:16,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2855 [2022-12-13 02:08:16,935 INFO L420 AbstractCegarLoop]: === Iteration 2857 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1968724421, now seen corresponding path program 1 times [2022-12-13 02:08:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:16,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111507522] [2022-12-13 02:08:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:16,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:16,996 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 02:08:16,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:16,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111507522] [2022-12-13 02:08:16,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111507522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:16,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:16,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:16,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032250594] [2022-12-13 02:08:16,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:16,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:16,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:16,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:16,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:16,996 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:16,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:16,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:16,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:16,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:17,049 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:17,049 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:17,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:17,050 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:17,050 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:17,050 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:17,051 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:17,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:17,052 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,052 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:17,052 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:17,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:17,052 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,052 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:17,052 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:17,052 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,056 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:17,056 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:17,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:17,056 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,057 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:17,194 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:17,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 02:08:17,195 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:17,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:17,196 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:17,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2856 [2022-12-13 02:08:17,196 INFO L420 AbstractCegarLoop]: === Iteration 2858 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1911466119, now seen corresponding path program 1 times [2022-12-13 02:08:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:17,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132761412] [2022-12-13 02:08:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:17,274 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 02:08:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:17,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132761412] [2022-12-13 02:08:17,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132761412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:17,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:17,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195226353] [2022-12-13 02:08:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:17,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:17,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:17,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:17,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:17,275 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:17,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:17,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:17,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:17,328 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:17,328 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:17,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:17,329 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:17,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:17,330 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:17,330 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:17,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:17,331 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:17,331 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:17,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:17,331 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,331 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:17,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:17,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,335 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:17,335 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:17,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:17,335 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,335 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:17,483 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:17,485 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 154 [2022-12-13 02:08:17,485 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:17,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:17,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:17,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2857 [2022-12-13 02:08:17,486 INFO L420 AbstractCegarLoop]: === Iteration 2859 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:17,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1854207817, now seen corresponding path program 1 times [2022-12-13 02:08:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:17,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085607618] [2022-12-13 02:08:17,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:17,552 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 02:08:17,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:17,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085607618] [2022-12-13 02:08:17,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085607618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:17,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:17,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750101654] [2022-12-13 02:08:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:17,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:17,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:17,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:17,553 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:17,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:17,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:17,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:17,603 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:17,603 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:17,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:17,603 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:17,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:17,604 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:17,604 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:17,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:17,605 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:17,605 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:17,605 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:17,605 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:17,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:17,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,608 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:17,608 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:17,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:17,608 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,608 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:17,726 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:17,728 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:17,728 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:17,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,728 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:17,728 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:17,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2858 [2022-12-13 02:08:17,728 INFO L420 AbstractCegarLoop]: === Iteration 2860 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:17,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1796949515, now seen corresponding path program 1 times [2022-12-13 02:08:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:17,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334520236] [2022-12-13 02:08:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:17,791 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 02:08:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:17,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334520236] [2022-12-13 02:08:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334520236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:17,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:17,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771991889] [2022-12-13 02:08:17,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:17,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:17,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:17,792 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:17,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:17,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:17,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:17,835 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:17,835 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:17,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:17,836 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:17,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:17,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:17,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:17,837 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:17,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:17,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:17,837 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,837 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:17,837 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:17,838 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:17,838 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,838 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:17,838 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:17,838 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:17,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,840 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:17,841 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:17,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:17,841 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:17,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:17,959 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:17,961 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:17,961 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:17,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:17,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:17,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:17,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2859 [2022-12-13 02:08:17,961 INFO L420 AbstractCegarLoop]: === Iteration 2861 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:17,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1739691213, now seen corresponding path program 1 times [2022-12-13 02:08:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:17,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018997178] [2022-12-13 02:08:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:17,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:18,023 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 02:08:18,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:18,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018997178] [2022-12-13 02:08:18,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018997178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:18,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:18,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465863297] [2022-12-13 02:08:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:18,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:18,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:18,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:18,024 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:18,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:18,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:18,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:18,068 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:18,068 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:18,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:18,068 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:18,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:18,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:18,069 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:18,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:18,070 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,070 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:18,070 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:18,070 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:18,070 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,070 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:18,070 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:18,070 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,073 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:18,073 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:18,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:18,073 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,073 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:18,193 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:18,195 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:18,195 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:18,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,195 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:18,195 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:18,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2860 [2022-12-13 02:08:18,195 INFO L420 AbstractCegarLoop]: === Iteration 2862 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:18,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1682432911, now seen corresponding path program 1 times [2022-12-13 02:08:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:18,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855669895] [2022-12-13 02:08:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:18,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:18,256 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 02:08:18,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:18,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855669895] [2022-12-13 02:08:18,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855669895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:18,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:18,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789463632] [2022-12-13 02:08:18,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:18,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:18,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:18,257 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:18,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:18,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:18,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:18,309 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:18,309 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:18,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:18,310 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:18,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:18,311 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:18,311 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:18,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:18,311 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:18,312 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:18,312 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:18,312 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,312 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:18,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:18,312 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,315 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:18,315 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:18,315 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,315 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:18,434 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:18,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:18,436 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:18,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:18,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:18,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2861 [2022-12-13 02:08:18,436 INFO L420 AbstractCegarLoop]: === Iteration 2863 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:18,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1625174609, now seen corresponding path program 1 times [2022-12-13 02:08:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:18,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018508430] [2022-12-13 02:08:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:18,501 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 02:08:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:18,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018508430] [2022-12-13 02:08:18,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018508430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:18,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:18,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323793521] [2022-12-13 02:08:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:18,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:18,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:18,502 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:18,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:18,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:18,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:18,547 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:18,547 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:18,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:18,547 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:18,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:18,548 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:18,548 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:18,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:18,549 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,549 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:18,549 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:18,549 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:18,549 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,549 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:18,549 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:18,549 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,552 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:18,552 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:18,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:18,552 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,552 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:18,672 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:18,673 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:18,673 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:18,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,673 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:18,673 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:18,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2862 [2022-12-13 02:08:18,673 INFO L420 AbstractCegarLoop]: === Iteration 2864 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:18,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1567916307, now seen corresponding path program 1 times [2022-12-13 02:08:18,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:18,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283429993] [2022-12-13 02:08:18,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:18,743 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 02:08:18,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:18,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283429993] [2022-12-13 02:08:18,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283429993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:18,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:18,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:18,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310976119] [2022-12-13 02:08:18,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:18,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:18,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:18,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:18,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:18,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:18,788 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:18,788 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:18,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:18,789 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:18,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:18,789 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:18,789 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:18,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:18,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:18,790 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,790 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:18,790 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:18,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:18,790 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:18,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:18,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:18,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,793 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:18,793 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:18,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:18,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:18,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:18,911 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:18,912 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:18,912 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:18,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:18,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2863 [2022-12-13 02:08:18,912 INFO L420 AbstractCegarLoop]: === Iteration 2865 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1510658005, now seen corresponding path program 1 times [2022-12-13 02:08:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101660953] [2022-12-13 02:08:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:18,973 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 02:08:18,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:18,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101660953] [2022-12-13 02:08:18,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101660953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:18,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:18,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:18,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861613644] [2022-12-13 02:08:18,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:18,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:18,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:18,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:18,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:18,974 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:18,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:18,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:18,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:18,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:19,025 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:19,025 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:19,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:19,026 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:19,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:19,026 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:19,026 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:19,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:19,027 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,027 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:19,027 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:19,027 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:19,028 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:19,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:19,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,030 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:19,030 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:19,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:19,031 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,031 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:19,150 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:19,151 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:19,151 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:19,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,152 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:19,152 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:19,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2864 [2022-12-13 02:08:19,152 INFO L420 AbstractCegarLoop]: === Iteration 2866 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:19,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:19,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1453399703, now seen corresponding path program 1 times [2022-12-13 02:08:19,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:19,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694003225] [2022-12-13 02:08:19,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:19,216 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 02:08:19,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:19,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694003225] [2022-12-13 02:08:19,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694003225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:19,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:19,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:19,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326933057] [2022-12-13 02:08:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:19,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:19,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:19,217 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:19,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:19,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:19,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:19,263 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:19,263 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:19,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 499 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:19,264 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:19,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:19,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:19,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:19,264 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:19,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:19,265 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:19,265 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:19,265 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:19,265 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,266 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:19,266 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:19,266 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,268 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:19,268 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:19,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:19,269 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,269 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:19,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:19,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 127 [2022-12-13 02:08:19,393 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:19,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:19,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:19,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2865 [2022-12-13 02:08:19,393 INFO L420 AbstractCegarLoop]: === Iteration 2867 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:19,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1396141401, now seen corresponding path program 1 times [2022-12-13 02:08:19,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:19,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880854911] [2022-12-13 02:08:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:19,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:19,453 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 02:08:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:19,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880854911] [2022-12-13 02:08:19,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880854911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:19,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:19,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002966736] [2022-12-13 02:08:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:19,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:19,454 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:19,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:19,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:19,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:19,498 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:19,498 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:19,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 506 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:19,499 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:19,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:19,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:19,499 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:19,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:19,500 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,500 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:19,500 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:19,500 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:19,500 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,500 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:19,501 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:19,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,503 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:19,503 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:19,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:19,504 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,504 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:19,623 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:19,625 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:19,625 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:19,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,625 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:19,625 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:19,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2866 [2022-12-13 02:08:19,625 INFO L420 AbstractCegarLoop]: === Iteration 2868 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:19,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1338883099, now seen corresponding path program 1 times [2022-12-13 02:08:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:19,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487819134] [2022-12-13 02:08:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:19,688 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 02:08:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:19,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487819134] [2022-12-13 02:08:19,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487819134] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:19,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:19,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:19,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965226752] [2022-12-13 02:08:19,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:19,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:19,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:19,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:19,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:19,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:19,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:19,732 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:19,733 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:19,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:19,733 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:19,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:19,734 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:19,734 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:19,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:19,735 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,735 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:19,735 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:19,735 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:19,735 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,735 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:19,735 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:19,735 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,738 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:19,738 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:19,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:19,738 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,738 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:19,857 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:19,859 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:19,859 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:19,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,859 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:19,859 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:19,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2867 [2022-12-13 02:08:19,859 INFO L420 AbstractCegarLoop]: === Iteration 2869 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:19,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1281624797, now seen corresponding path program 1 times [2022-12-13 02:08:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:19,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845537204] [2022-12-13 02:08:19,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:19,935 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 02:08:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:19,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845537204] [2022-12-13 02:08:19,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845537204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:19,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:19,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742650131] [2022-12-13 02:08:19,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:19,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:19,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:19,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:19,936 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:19,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:19,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:19,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:19,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:19,980 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:19,980 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:19,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:19,980 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:19,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:19,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:19,981 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:19,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:19,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:19,982 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,982 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:19,982 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:19,982 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:19,982 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,982 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:19,982 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:19,982 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:19,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,985 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:19,985 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:19,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:19,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:19,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:20,106 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:20,107 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:20,107 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:20,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:20,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:20,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2868 [2022-12-13 02:08:20,107 INFO L420 AbstractCegarLoop]: === Iteration 2870 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:20,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1224366495, now seen corresponding path program 1 times [2022-12-13 02:08:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:20,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424884991] [2022-12-13 02:08:20,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:20,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:20,169 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 02:08:20,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:20,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424884991] [2022-12-13 02:08:20,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424884991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:20,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:20,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608018238] [2022-12-13 02:08:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:20,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:20,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:20,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:20,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:20,170 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:20,170 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:20,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:20,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:20,214 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:20,214 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:20,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:20,215 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:20,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:20,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:20,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:20,215 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:20,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:20,216 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,216 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:20,216 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:20,216 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:20,216 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:20,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:20,217 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,219 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:20,219 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:20,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:20,220 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:20,339 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:20,340 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:20,340 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:20,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,340 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:20,340 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:20,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2869 [2022-12-13 02:08:20,340 INFO L420 AbstractCegarLoop]: === Iteration 2871 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:20,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1167108193, now seen corresponding path program 1 times [2022-12-13 02:08:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:20,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483822851] [2022-12-13 02:08:20,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:20,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:20,404 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 02:08:20,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483822851] [2022-12-13 02:08:20,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483822851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:20,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:20,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634893102] [2022-12-13 02:08:20,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:20,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:20,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:20,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:20,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:20,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:20,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:20,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:20,449 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:20,449 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:20,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:20,450 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:20,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:20,450 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:20,450 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:20,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:20,451 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,451 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:20,451 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:20,452 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:20,452 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,452 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:20,452 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:20,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,454 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:20,455 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:20,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:20,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:20,573 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:20,575 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:20,575 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:20,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,575 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:20,575 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:20,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2870 [2022-12-13 02:08:20,575 INFO L420 AbstractCegarLoop]: === Iteration 2872 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:20,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1109849891, now seen corresponding path program 1 times [2022-12-13 02:08:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:20,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327976187] [2022-12-13 02:08:20,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:20,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:20,638 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 02:08:20,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:20,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327976187] [2022-12-13 02:08:20,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327976187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:20,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:20,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208337543] [2022-12-13 02:08:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:20,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:20,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:20,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:20,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:20,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:20,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:20,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:20,683 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:20,684 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:20,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 504 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:20,684 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:20,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:20,685 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:20,685 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:20,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:20,685 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,686 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:20,686 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:20,686 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:20,686 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:20,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:20,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,689 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:20,689 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:20,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:20,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:20,808 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:20,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:20,809 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:20,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,809 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:20,809 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:20,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2871 [2022-12-13 02:08:20,810 INFO L420 AbstractCegarLoop]: === Iteration 2873 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1052591589, now seen corresponding path program 1 times [2022-12-13 02:08:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216646675] [2022-12-13 02:08:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:20,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:20,872 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 02:08:20,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:20,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216646675] [2022-12-13 02:08:20,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216646675] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:20,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:20,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137339042] [2022-12-13 02:08:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:20,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:20,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:20,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:20,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:20,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:20,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:20,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:20,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:20,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:20,918 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:20,918 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:20,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:20,919 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:20,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:20,919 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:20,919 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:20,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:20,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:20,920 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,920 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:20,920 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:20,920 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:20,920 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:20,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:20,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:20,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,923 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:20,923 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:20,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:20,924 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:20,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:21,052 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:21,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-13 02:08:21,053 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:21,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:21,053 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:21,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2872 [2022-12-13 02:08:21,053 INFO L420 AbstractCegarLoop]: === Iteration 2874 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:21,054 INFO L85 PathProgramCache]: Analyzing trace with hash -995333287, now seen corresponding path program 1 times [2022-12-13 02:08:21,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:21,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550127947] [2022-12-13 02:08:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:21,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:21,148 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 02:08:21,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:21,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550127947] [2022-12-13 02:08:21,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550127947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:21,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:21,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:21,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452804142] [2022-12-13 02:08:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:21,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:21,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:21,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:21,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:21,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:21,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:21,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:21,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:21,205 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:21,205 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:21,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 496 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:21,206 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:21,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:21,206 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:21,206 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:21,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:21,208 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,208 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:21,208 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:21,208 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:21,208 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,208 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:21,208 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:21,208 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,212 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:21,212 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:21,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:21,212 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:21,354 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:21,355 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 147 [2022-12-13 02:08:21,355 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:21,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,355 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:21,355 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:21,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2873 [2022-12-13 02:08:21,356 INFO L420 AbstractCegarLoop]: === Iteration 2875 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -938074985, now seen corresponding path program 1 times [2022-12-13 02:08:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:21,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318615842] [2022-12-13 02:08:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:21,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:21,432 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 02:08:21,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:21,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318615842] [2022-12-13 02:08:21,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318615842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:21,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:21,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:21,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873102703] [2022-12-13 02:08:21,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:21,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:21,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:21,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:21,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:21,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:21,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:21,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:21,486 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:21,486 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:21,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:21,487 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:21,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:21,487 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:21,487 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:21,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:21,488 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,489 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:21,489 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:21,489 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:21,489 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,489 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:21,489 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:21,489 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,492 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:21,493 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:21,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:21,493 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,493 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:21,627 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:21,630 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-13 02:08:21,630 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:21,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,630 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:21,630 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:21,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2874 [2022-12-13 02:08:21,630 INFO L420 AbstractCegarLoop]: === Iteration 2876 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:21,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -880816683, now seen corresponding path program 1 times [2022-12-13 02:08:21,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:21,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833809686] [2022-12-13 02:08:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:21,699 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 02:08:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:21,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833809686] [2022-12-13 02:08:21,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833809686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:21,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:21,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225439192] [2022-12-13 02:08:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:21,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:21,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:21,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:21,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:21,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:21,744 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:21,744 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:21,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:21,745 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:21,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:21,745 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:21,745 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:21,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:21,746 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:21,746 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:21,747 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:21,747 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,747 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:21,747 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:21,747 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,749 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:21,749 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:21,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:21,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:21,869 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:21,870 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:21,870 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:21,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,871 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:21,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:21,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2875 [2022-12-13 02:08:21,871 INFO L420 AbstractCegarLoop]: === Iteration 2877 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -823558381, now seen corresponding path program 1 times [2022-12-13 02:08:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:21,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782457522] [2022-12-13 02:08:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:21,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:21,931 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 02:08:21,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:21,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782457522] [2022-12-13 02:08:21,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782457522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:21,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:21,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454860383] [2022-12-13 02:08:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:21,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:21,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:21,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:21,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:21,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:21,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:21,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:21,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:21,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:21,977 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:21,978 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:21,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 505 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:21,978 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:21,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:21,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:21,979 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:21,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:21,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:21,979 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,980 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:21,980 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:21,980 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:21,980 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,980 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:21,980 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:21,980 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:21,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,983 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:21,983 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:21,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:21,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:21,983 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:22,102 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:22,103 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:22,103 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:22,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:22,104 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:22,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2876 [2022-12-13 02:08:22,104 INFO L420 AbstractCegarLoop]: === Iteration 2878 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -766300079, now seen corresponding path program 1 times [2022-12-13 02:08:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:22,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287378656] [2022-12-13 02:08:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:22,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:22,165 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 02:08:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:22,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287378656] [2022-12-13 02:08:22,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287378656] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:22,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:22,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:22,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272889301] [2022-12-13 02:08:22,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:22,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:22,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:22,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:22,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:22,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:22,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:22,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:22,210 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:22,211 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:22,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 508 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:22,211 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:22,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:22,212 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:22,212 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:22,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:22,212 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:22,213 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:22,213 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:22,213 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,213 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:22,213 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:22,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,216 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:22,216 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:22,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 195 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:22,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:22,335 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:22,337 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:22,337 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:22,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,337 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:22,338 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2877 [2022-12-13 02:08:22,338 INFO L420 AbstractCegarLoop]: === Iteration 2879 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:22,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash -709041777, now seen corresponding path program 1 times [2022-12-13 02:08:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:22,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901013446] [2022-12-13 02:08:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:22,425 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 02:08:22,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:22,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901013446] [2022-12-13 02:08:22,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901013446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:22,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:22,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653435351] [2022-12-13 02:08:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:22,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:22,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:22,426 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:22,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:22,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:22,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:22,472 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:22,472 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:22,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:22,473 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:22,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:22,473 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:22,473 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:22,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:22,474 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:22,474 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:22,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:22,475 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,475 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:22,475 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:22,475 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,477 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:22,478 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:22,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:22,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:22,595 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:22,597 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:22,597 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:22,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,597 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:22,597 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:22,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2878 [2022-12-13 02:08:22,598 INFO L420 AbstractCegarLoop]: === Iteration 2880 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:22,598 INFO L85 PathProgramCache]: Analyzing trace with hash -651783475, now seen corresponding path program 1 times [2022-12-13 02:08:22,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:22,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601390393] [2022-12-13 02:08:22,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:22,661 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 02:08:22,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:22,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601390393] [2022-12-13 02:08:22,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601390393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:22,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:22,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314219536] [2022-12-13 02:08:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:22,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:22,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:22,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:22,662 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:22,662 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,662 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:22,662 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:22,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:22,713 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:22,713 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:22,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:22,714 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:22,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:22,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:22,715 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:22,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:22,715 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,715 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:22,716 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:22,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:22,716 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,716 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:22,716 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:22,716 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,719 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:22,719 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:22,719 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,719 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:22,837 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:22,838 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:22,838 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:22,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:22,838 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:22,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2879 [2022-12-13 02:08:22,839 INFO L420 AbstractCegarLoop]: === Iteration 2881 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash -594525173, now seen corresponding path program 1 times [2022-12-13 02:08:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495238494] [2022-12-13 02:08:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:22,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:22,900 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 02:08:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495238494] [2022-12-13 02:08:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495238494] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:22,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:22,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224570960] [2022-12-13 02:08:22,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:22,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:22,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:22,901 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:22,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:22,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:22,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:22,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:22,958 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:22,958 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:22,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:22,958 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:22,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:22,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:22,959 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:22,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:22,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:22,960 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:22,960 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:22,960 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:22,960 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,960 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:22,960 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:22,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:22,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,963 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:22,963 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:22,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:22,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:23,083 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:23,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 02:08:23,084 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:23,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:23,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:23,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2880 [2022-12-13 02:08:23,085 INFO L420 AbstractCegarLoop]: === Iteration 2882 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:23,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -537266871, now seen corresponding path program 1 times [2022-12-13 02:08:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:23,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181408698] [2022-12-13 02:08:23,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:23,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 02:08:23,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:23,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181408698] [2022-12-13 02:08:23,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181408698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:23,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:23,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:23,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165137961] [2022-12-13 02:08:23,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:23,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:23,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:23,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:23,147 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:23,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:23,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:23,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:23,191 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:23,191 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:23,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:23,191 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:23,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:23,192 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:23,192 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:23,193 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,193 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:23,193 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:23,193 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:23,193 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,193 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:23,193 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:23,193 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,196 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:23,196 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 194 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:23,196 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,196 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:23,316 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:23,318 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:23,318 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:23,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,318 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:23,318 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:23,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2881 [2022-12-13 02:08:23,318 INFO L420 AbstractCegarLoop]: === Iteration 2883 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash -480008569, now seen corresponding path program 1 times [2022-12-13 02:08:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:23,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508423762] [2022-12-13 02:08:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:23,384 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 02:08:23,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:23,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508423762] [2022-12-13 02:08:23,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508423762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:23,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:23,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950856264] [2022-12-13 02:08:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:23,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:23,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:23,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:23,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:23,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:23,437 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:23,437 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:23,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 507 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:23,437 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:23,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:23,438 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:23,438 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:23,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:23,439 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,439 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:23,439 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:23,439 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:23,439 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,439 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:23,439 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:23,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,442 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:23,442 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:23,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:23,442 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,442 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:23,562 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:23,564 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125 [2022-12-13 02:08:23,564 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:23,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:23,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:23,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2882 [2022-12-13 02:08:23,564 INFO L420 AbstractCegarLoop]: === Iteration 2884 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:23,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:23,564 INFO L85 PathProgramCache]: Analyzing trace with hash -422750267, now seen corresponding path program 1 times [2022-12-13 02:08:23,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:23,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232419680] [2022-12-13 02:08:23,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:23,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:23,624 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 02:08:23,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:23,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232419680] [2022-12-13 02:08:23,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232419680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:23,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:23,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:23,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062764774] [2022-12-13 02:08:23,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:23,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:23,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:23,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:23,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:23,625 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:23,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:23,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:23,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:23,680 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:23,680 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:23,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:23,681 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:23,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:23,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:23,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:23,681 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:23,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:23,682 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,682 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:23,682 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:23,682 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:23,682 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,683 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:23,683 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:23,683 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,685 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:23,685 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:23,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:23,686 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,686 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:23,803 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:23,804 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:23,804 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:23,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:23,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:23,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2883 [2022-12-13 02:08:23,805 INFO L420 AbstractCegarLoop]: === Iteration 2885 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:23,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:23,805 INFO L85 PathProgramCache]: Analyzing trace with hash -365491965, now seen corresponding path program 1 times [2022-12-13 02:08:23,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:23,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365570230] [2022-12-13 02:08:23,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:23,866 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 02:08:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365570230] [2022-12-13 02:08:23,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365570230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35911665] [2022-12-13 02:08:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:23,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:23,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:23,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:23,866 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:23,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:23,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:23,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:23,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:23,917 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:23,917 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:23,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 494 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:23,918 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:23,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:23,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:23,918 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:23,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:23,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:23,919 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,919 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:23,919 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:23,919 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:23,919 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,919 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:23,919 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:23,920 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:23,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,922 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:23,922 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:23,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 190 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:23,922 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:23,923 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:24,041 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:24,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:24,042 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:24,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:24,043 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:24,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2884 [2022-12-13 02:08:24,043 INFO L420 AbstractCegarLoop]: === Iteration 2886 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:24,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash -308233663, now seen corresponding path program 1 times [2022-12-13 02:08:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:24,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424512171] [2022-12-13 02:08:24,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:24,104 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 02:08:24,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:24,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424512171] [2022-12-13 02:08:24,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424512171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:24,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:24,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556067799] [2022-12-13 02:08:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:24,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:24,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:24,105 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:24,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:24,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:24,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:24,157 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:24,157 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:24,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 493 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:24,158 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:24,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:24,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:24,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:24,158 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:24,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:24,159 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,159 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:24,159 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:24,159 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:24,159 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,159 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:24,159 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:24,160 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,162 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:24,162 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-13 02:08:24,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 193 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:24,162 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,162 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:24,280 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:24,282 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 123 [2022-12-13 02:08:24,282 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:24,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:24,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:24,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2885 [2022-12-13 02:08:24,282 INFO L420 AbstractCegarLoop]: === Iteration 2887 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:24,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:24,282 INFO L85 PathProgramCache]: Analyzing trace with hash -250975361, now seen corresponding path program 1 times [2022-12-13 02:08:24,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:24,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970857554] [2022-12-13 02:08:24,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:24,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:24,342 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 02:08:24,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:24,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970857554] [2022-12-13 02:08:24,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970857554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:24,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:24,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515157324] [2022-12-13 02:08:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:24,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:24,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:24,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:24,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:24,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:24,393 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:24,394 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:24,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 502 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:24,394 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:24,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:24,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:24,395 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:24,395 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:24,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:24,396 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,396 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:24,396 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:24,396 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:24,396 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,396 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:24,396 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:24,396 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,399 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:24,399 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:24,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:24,399 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,399 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:24,516 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:24,518 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-13 02:08:24,518 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:24,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:24,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:24,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2886 [2022-12-13 02:08:24,518 INFO L420 AbstractCegarLoop]: === Iteration 2888 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -193717059, now seen corresponding path program 1 times [2022-12-13 02:08:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:24,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439423036] [2022-12-13 02:08:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:24,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:24,581 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 02:08:24,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:24,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439423036] [2022-12-13 02:08:24,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439423036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:24,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:24,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:24,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45386144] [2022-12-13 02:08:24,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:24,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:24,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:24,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:24,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:24,582 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:24,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:24,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:24,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:24,634 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:24,634 INFO L131 PetriNetUnfolder]: For 194/194 co-relation queries the response was YES. [2022-12-13 02:08:24,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 490 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:24,634 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:24,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:24,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:24,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:24,635 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:24,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:24,636 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:24,637 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:24,637 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:24,637 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:24,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:24,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,640 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:24,640 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:24,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:24,640 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,640 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 02:08:24,757 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 02:08:24,758 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-13 02:08:24,758 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 186 flow [2022-12-13 02:08:24,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,758 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 02:08:24,758 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 02:08:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2887 [2022-12-13 02:08:24,758 INFO L420 AbstractCegarLoop]: === Iteration 2889 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 02:08:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 02:08:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -136458757, now seen corresponding path program 1 times [2022-12-13 02:08:24,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 02:08:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010341724] [2022-12-13 02:08:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 02:08:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 02:08:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 02:08:24,819 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 02:08:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 02:08:24,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010341724] [2022-12-13 02:08:24,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010341724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 02:08:24,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 02:08:24,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 02:08:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830761391] [2022-12-13 02:08:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 02:08:24,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 02:08:24,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 02:08:24,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 02:08:24,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 02:08:24,820 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-13 02:08:24,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 02:08:24,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 02:08:24,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-13 02:08:24,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 02:08:24,863 INFO L130 PetriNetUnfolder]: 65/143 cut-off events. [2022-12-13 02:08:24,863 INFO L131 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-12-13 02:08:24,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 143 events. 65/143 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 498 event pairs, 8 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 538. Up to 104 conditions per place. [2022-12-13 02:08:24,863 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 28 selfloop transitions, 8 changer transitions 5/42 dead transitions. [2022-12-13 02:08:24,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 02:08:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 02:08:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 02:08:24,864 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-13 02:08:24,864 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 186 flow. Second operand 5 states and 43 transitions. [2022-12-13 02:08:24,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 329 flow [2022-12-13 02:08:24,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 42 transitions, 289 flow, removed 13 selfloop flow, removed 4 redundant places. [2022-12-13 02:08:24,865 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,865 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2022-12-13 02:08:24,865 INFO L295 CegarLoopForPetriNet]: 20 programPoint places, 14 predicate places. [2022-12-13 02:08:24,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 02:08:24,865 INFO L89 Accepts]: Start accepts. Operand has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,865 INFO L95 Accepts]: Finished accepts. [2022-12-13 02:08:24,865 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 02:08:24,865 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 27 transitions, 187 flow [2022-12-13 02:08:24,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,881 INFO L130 PetriNetUnfolder]: 10/57 cut-off events. [2022-12-13 02:08:24,881 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-13 02:08:24,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 57 events. 10/57 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 189 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 148. Up to 14 conditions per place. [2022-12-13 02:08:24,882 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 27 transitions, 187 flow [2022-12-13 02:08:24,882 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 Received shutdown request... [2022-12-13 02:08:24,887 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 02:08:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2888 [2022-12-13 02:08:24,887 WARN L619 AbstractCegarLoop]: Verification canceled: while QuantifierPusher was running 1 iterations on subformula. [2022-12-13 02:08:24,892 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 02:08:24,893 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 02:08:24,894 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:08:24,897 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 02:08:24,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 02:08:24,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:08:24 BasicIcfg [2022-12-13 02:08:24,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 02:08:24,899 INFO L158 Benchmark]: Toolchain (without parser) took 716662.60ms. Allocated memory was 175.1MB in the beginning and 761.3MB in the end (delta: 586.2MB). Free memory was 152.2MB in the beginning and 482.1MB in the end (delta: -330.0MB). Peak memory consumption was 257.8MB. Max. memory is 8.0GB. [2022-12-13 02:08:24,899 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 02:08:24,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.17ms. Allocated memory is still 175.1MB. Free memory was 151.8MB in the beginning and 140.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 02:08:24,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.54ms. Allocated memory is still 175.1MB. Free memory was 140.7MB in the beginning and 139.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 02:08:24,899 INFO L158 Benchmark]: Boogie Preprocessor took 28.88ms. Allocated memory is still 175.1MB. Free memory was 139.2MB in the beginning and 137.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 02:08:24,899 INFO L158 Benchmark]: RCFGBuilder took 361.30ms. Allocated memory is still 175.1MB. Free memory was 137.7MB in the beginning and 123.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 02:08:24,899 INFO L158 Benchmark]: TraceAbstraction took 716007.08ms. Allocated memory was 175.1MB in the beginning and 761.3MB in the end (delta: 586.2MB). Free memory was 122.4MB in the beginning and 482.1MB in the end (delta: -359.7MB). Peak memory consumption was 227.4MB. Max. memory is 8.0GB. [2022-12-13 02:08:24,900 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.17ms. Allocated memory is still 175.1MB. Free memory was 151.8MB in the beginning and 140.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.54ms. Allocated memory is still 175.1MB. Free memory was 140.7MB in the beginning and 139.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.88ms. Allocated memory is still 175.1MB. Free memory was 139.2MB in the beginning and 137.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 361.30ms. Allocated memory is still 175.1MB. Free memory was 137.7MB in the beginning and 123.5MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 716007.08ms. Allocated memory was 175.1MB in the beginning and 761.3MB in the end (delta: 586.2MB). Free memory was 122.4MB in the beginning and 482.1MB in the end (delta: -359.7MB). Peak memory consumption was 227.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.0s, 73 PlacesBefore, 20 PlacesAfterwards, 72 TransitionsBefore, 15 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 19 ConcurrentYvCompositions, 4 ChoiceCompositions, 57 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 260, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 262, independent: 260, independent conditional: 0, independent unconditional: 260, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 262, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 262, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 262, unknown conditional: 0, unknown unconditional: 262] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 411, Positive conditional cache size: 0, Positive unconditional cache size: 411, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 26 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 29, 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: 29, independent: 29, independent conditional: 12, independent unconditional: 17, 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: 29, independent: 29, independent conditional: 12, independent unconditional: 17, 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: 10, independent: 10, independent conditional: 5, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 29, independent: 19, independent conditional: 7, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 10, Positive conditional cache size: 5, Positive unconditional cache size: 5, 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: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 5, Positive unconditional cache size: 7, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 7, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 54 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): 14, Positive cache size: 14, Positive conditional cache size: 7, Positive unconditional cache size: 7, 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, 22 PlacesBefore, 21 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 16, Positive conditional cache size: 9, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 21 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 11, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 21 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 20, Positive conditional cache size: 13, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 24 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 26, Positive conditional cache size: 19, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 28 PlacesBefore, 27 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 29, Positive conditional cache size: 22, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 24, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 64 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): 31, Positive cache size: 31, Positive conditional cache size: 24, Positive unconditional cache size: 7, 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, 30 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 33, Positive conditional cache size: 26, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 28, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 30 PlacesBefore, 29 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 66 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 37, Positive conditional cache size: 30, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 32 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 27 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 33, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 42, Positive cache size: 42, Positive conditional cache size: 35, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 44, Positive conditional cache size: 37, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 46, Positive cache size: 46, Positive conditional cache size: 39, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 41, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 50, Positive conditional cache size: 43, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 52, Positive conditional cache size: 45, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 54, Positive conditional cache size: 47, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 56, Positive conditional cache size: 49, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 58, Positive conditional cache size: 51, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 60, Positive conditional cache size: 53, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 55, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 64, Positive conditional cache size: 57, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 66, Positive conditional cache size: 59, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 68, Positive conditional cache size: 61, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 70, Positive conditional cache size: 63, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 72, Positive conditional cache size: 65, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 74, Positive conditional cache size: 67, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 76, Positive conditional cache size: 69, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 78, Positive conditional cache size: 71, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 80, Positive conditional cache size: 73, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 82, Positive conditional cache size: 75, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 84, Positive conditional cache size: 77, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 86, Positive conditional cache size: 79, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 88, Positive conditional cache size: 81, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 90, Positive conditional cache size: 83, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 92, Positive conditional cache size: 85, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 94, Positive conditional cache size: 87, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 96, Positive conditional cache size: 89, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 98, Positive conditional cache size: 91, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 100, Positive conditional cache size: 93, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 102, Positive conditional cache size: 95, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 104, Positive conditional cache size: 97, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 106, Positive conditional cache size: 99, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 108, Positive conditional cache size: 101, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 110, Positive conditional cache size: 103, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 105, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 114, Positive conditional cache size: 107, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 116, Positive conditional cache size: 109, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 118, Positive cache size: 118, Positive conditional cache size: 111, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 120, Positive conditional cache size: 113, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 122, Positive conditional cache size: 115, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 124, Positive conditional cache size: 117, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 126, Positive conditional cache size: 119, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 128, Positive conditional cache size: 121, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 130, Positive conditional cache size: 123, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 132, Positive conditional cache size: 125, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 134, Positive conditional cache size: 127, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 136, Positive conditional cache size: 129, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 138, Positive conditional cache size: 131, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 140, Positive conditional cache size: 133, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 142, Positive conditional cache size: 135, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 144, Positive conditional cache size: 137, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 146, Positive conditional cache size: 139, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 148, Positive conditional cache size: 141, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 150, Positive cache size: 150, Positive conditional cache size: 143, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 152, Positive conditional cache size: 145, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 154, Positive conditional cache size: 147, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 156, Positive conditional cache size: 149, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 158, Positive conditional cache size: 151, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 160, Positive conditional cache size: 153, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 162, Positive conditional cache size: 155, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 164, Positive conditional cache size: 157, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 166, Positive conditional cache size: 159, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 168, Positive conditional cache size: 161, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 170, Positive conditional cache size: 163, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 172, Positive conditional cache size: 165, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 174, Positive conditional cache size: 167, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 176, Positive conditional cache size: 169, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 178, Positive conditional cache size: 171, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 180, Positive conditional cache size: 173, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 182, Positive conditional cache size: 175, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 184, Positive conditional cache size: 177, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 186, Positive conditional cache size: 179, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 188, Positive conditional cache size: 181, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 190, Positive conditional cache size: 183, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 192, Positive conditional cache size: 185, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 194, Positive conditional cache size: 187, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 196, Positive conditional cache size: 189, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 198, Positive cache size: 198, Positive conditional cache size: 191, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 200, Positive conditional cache size: 193, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 202, Positive conditional cache size: 195, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 204, Positive conditional cache size: 197, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 206, Positive conditional cache size: 199, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 208, Positive conditional cache size: 201, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 210, Positive conditional cache size: 203, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 212, Positive conditional cache size: 205, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 214, Positive conditional cache size: 207, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 216, Positive conditional cache size: 209, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 218, Positive conditional cache size: 211, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 220, Positive cache size: 220, Positive conditional cache size: 213, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 222, Positive conditional cache size: 215, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 224, Positive conditional cache size: 217, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 226, Positive conditional cache size: 219, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 228, Positive cache size: 228, Positive conditional cache size: 221, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 230, Positive conditional cache size: 223, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 232, Positive conditional cache size: 225, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 234, Positive conditional cache size: 227, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 236, Positive conditional cache size: 229, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 238, Positive conditional cache size: 231, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 240, Positive conditional cache size: 233, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 242, Positive conditional cache size: 235, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 244, Positive cache size: 244, Positive conditional cache size: 237, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 246, Positive conditional cache size: 239, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 248, Positive conditional cache size: 241, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 250, Positive conditional cache size: 243, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 252, Positive cache size: 252, Positive conditional cache size: 245, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 254, Positive cache size: 254, Positive conditional cache size: 247, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 256, Positive conditional cache size: 249, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 258, Positive conditional cache size: 251, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 260, Positive conditional cache size: 253, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 262, Positive conditional cache size: 255, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 264, Positive conditional cache size: 257, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 266, Positive conditional cache size: 259, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 268, Positive conditional cache size: 261, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 270, Positive conditional cache size: 263, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 272, Positive conditional cache size: 265, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 274, Positive conditional cache size: 267, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 276, Positive cache size: 276, Positive conditional cache size: 269, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 278, Positive conditional cache size: 271, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 280, Positive cache size: 280, Positive conditional cache size: 273, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 282, Positive conditional cache size: 275, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 284, Positive conditional cache size: 277, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 286, Positive conditional cache size: 279, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 288, Positive cache size: 288, Positive conditional cache size: 281, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 290, Positive conditional cache size: 283, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 292, Positive conditional cache size: 285, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 294, Positive cache size: 294, Positive conditional cache size: 287, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 296, Positive conditional cache size: 289, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 298, Positive cache size: 298, Positive conditional cache size: 291, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 300, Positive cache size: 300, Positive conditional cache size: 293, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 302, Positive conditional cache size: 295, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 304, Positive cache size: 304, Positive conditional cache size: 297, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 306, Positive conditional cache size: 299, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 308, Positive conditional cache size: 301, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 310, Positive cache size: 310, Positive conditional cache size: 303, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 312, Positive cache size: 312, Positive conditional cache size: 305, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 314, Positive conditional cache size: 307, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 316, Positive conditional cache size: 309, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 318, Positive conditional cache size: 311, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 320, Positive cache size: 320, Positive conditional cache size: 313, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks [2022-12-13 02:08:24,926 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 Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 322, Positive conditional cache size: 315, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 324, Positive cache size: 324, Positive conditional cache size: 317, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 319, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 328, Positive cache size: 328, Positive conditional cache size: 321, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 330, Positive conditional cache size: 323, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 332, Positive conditional cache size: 325, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 334, Positive conditional cache size: 327, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 336, Positive cache size: 336, Positive conditional cache size: 329, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 338, Positive conditional cache size: 331, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 340, Positive conditional cache size: 333, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 342, Positive conditional cache size: 335, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 344, Positive cache size: 344, Positive conditional cache size: 337, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 346, Positive cache size: 346, Positive conditional cache size: 339, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 348, Positive conditional cache size: 341, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 350, Positive conditional cache size: 343, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 352, Positive cache size: 352, Positive conditional cache size: 345, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 354, Positive cache size: 354, Positive conditional cache size: 347, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 356, Positive conditional cache size: 349, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 358, Positive conditional cache size: 351, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 360, Positive cache size: 360, Positive conditional cache size: 353, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 362, Positive conditional cache size: 355, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 364, Positive conditional cache size: 357, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 366, Positive conditional cache size: 359, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 368, Positive conditional cache size: 361, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 370, Positive conditional cache size: 363, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 372, Positive conditional cache size: 365, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 374, Positive cache size: 374, Positive conditional cache size: 367, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 376, Positive cache size: 376, Positive conditional cache size: 369, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 378, Positive conditional cache size: 371, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 380, Positive cache size: 380, Positive conditional cache size: 373, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 382, Positive cache size: 382, Positive conditional cache size: 375, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 384, Positive conditional cache size: 377, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 386, Positive cache size: 386, Positive conditional cache size: 379, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 388, Positive conditional cache size: 381, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 390, Positive cache size: 390, Positive conditional cache size: 383, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 392, Positive conditional cache size: 385, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 394, Positive conditional cache size: 387, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 396, Positive cache size: 396, Positive conditional cache size: 389, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 398, Positive conditional cache size: 391, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 400, Positive cache size: 400, Positive conditional cache size: 393, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 402, Positive conditional cache size: 395, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 404, Positive conditional cache size: 397, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 406, Positive conditional cache size: 399, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 408, Positive conditional cache size: 401, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 410, Positive cache size: 410, Positive conditional cache size: 403, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 412, Positive conditional cache size: 405, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 414, Positive cache size: 414, Positive conditional cache size: 407, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 416, Positive cache size: 416, Positive conditional cache size: 409, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 418, Positive conditional cache size: 411, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 420, Positive conditional cache size: 413, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 422, Positive cache size: 422, Positive conditional cache size: 415, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 424, Positive conditional cache size: 417, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 426, Positive cache size: 426, Positive conditional cache size: 419, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 428, Positive cache size: 428, Positive conditional cache size: 421, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 430, Positive conditional cache size: 423, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 432, Positive cache size: 432, Positive conditional cache size: 425, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 434, Positive conditional cache size: 427, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 436, Positive cache size: 436, Positive conditional cache size: 429, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 438, Positive conditional cache size: 431, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 440, Positive cache size: 440, Positive conditional cache size: 433, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 442, Positive conditional cache size: 435, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 444, Positive cache size: 444, Positive conditional cache size: 437, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 446, Positive cache size: 446, Positive conditional cache size: 439, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 448, Positive conditional cache size: 441, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 450, Positive conditional cache size: 443, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 452, Positive conditional cache size: 445, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 454, Positive cache size: 454, Positive conditional cache size: 447, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 456, Positive conditional cache size: 449, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 458, Positive cache size: 458, Positive conditional cache size: 451, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 460, Positive cache size: 460, Positive conditional cache size: 453, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 462, Positive conditional cache size: 455, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 464, Positive conditional cache size: 457, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 466, Positive conditional cache size: 459, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 468, Positive cache size: 468, Positive conditional cache size: 461, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 470, Positive cache size: 470, Positive conditional cache size: 463, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 472, Positive cache size: 472, Positive conditional cache size: 465, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 474, Positive cache size: 474, Positive conditional cache size: 467, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 476, Positive cache size: 476, Positive conditional cache size: 469, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 478, Positive conditional cache size: 471, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 480, Positive conditional cache size: 473, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 482, Positive conditional cache size: 475, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 484, Positive conditional cache size: 477, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 486, Positive cache size: 486, Positive conditional cache size: 479, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 488, Positive cache size: 488, Positive conditional cache size: 481, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 490, Positive cache size: 490, Positive conditional cache size: 483, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 492, Positive cache size: 492, Positive conditional cache size: 485, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 494, Positive cache size: 494, Positive conditional cache size: 487, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 496, Positive cache size: 496, Positive conditional cache size: 489, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 491, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 500, Positive conditional cache size: 493, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 502, Positive cache size: 502, Positive conditional cache size: 495, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 504, Positive cache size: 504, Positive conditional cache size: 497, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 506, Positive cache size: 506, Positive conditional cache size: 499, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 508, Positive conditional cache size: 501, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 510, Positive cache size: 510, Positive conditional cache size: 503, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 512, Positive cache size: 512, Positive conditional cache size: 505, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 514, Positive cache size: 514, Positive conditional cache size: 507, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 516, Positive cache size: 516, Positive conditional cache size: 509, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 518, Positive cache size: 518, Positive conditional cache size: 511, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 520, Positive cache size: 520, Positive conditional cache size: 513, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 522, Positive cache size: 522, Positive conditional cache size: 515, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 524, Positive cache size: 524, Positive conditional cache size: 517, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 526, Positive cache size: 526, Positive conditional cache size: 519, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 528, Positive cache size: 528, Positive conditional cache size: 521, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 530, Positive cache size: 530, Positive conditional cache size: 523, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 532, Positive cache size: 532, Positive conditional cache size: 525, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 534, Positive cache size: 534, Positive conditional cache size: 527, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 536, Positive conditional cache size: 529, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 538, Positive cache size: 538, Positive conditional cache size: 531, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 540, Positive cache size: 540, Positive conditional cache size: 533, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 542, Positive cache size: 542, Positive conditional cache size: 535, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 544, Positive conditional cache size: 537, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 546, Positive cache size: 546, Positive conditional cache size: 539, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 548, Positive cache size: 548, Positive conditional cache size: 541, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 550, Positive cache size: 550, Positive conditional cache size: 543, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 552, Positive cache size: 552, Positive conditional cache size: 545, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 554, Positive cache size: 554, Positive conditional cache size: 547, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 556, Positive conditional cache size: 549, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 558, Positive cache size: 558, Positive conditional cache size: 551, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 560, Positive cache size: 560, Positive conditional cache size: 553, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 562, Positive cache size: 562, Positive conditional cache size: 555, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 564, Positive cache size: 564, Positive conditional cache size: 557, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 566, Positive cache size: 566, Positive conditional cache size: 559, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 568, Positive cache size: 568, Positive conditional cache size: 561, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 570, Positive cache size: 570, Positive conditional cache size: 563, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 572, Positive cache size: 572, Positive conditional cache size: 565, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 574, Positive cache size: 574, Positive conditional cache size: 567, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 576, Positive cache size: 576, Positive conditional cache size: 569, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 578, Positive cache size: 578, Positive conditional cache size: 571, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 580, Positive cache size: 580, Positive conditional cache size: 573, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 582, Positive cache size: 582, Positive conditional cache size: 575, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 584, Positive cache size: 584, Positive conditional cache size: 577, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 586, Positive cache size: 586, Positive conditional cache size: 579, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 588, Positive cache size: 588, Positive conditional cache size: 581, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 590, Positive cache size: 590, Positive conditional cache size: 583, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 592, Positive cache size: 592, Positive conditional cache size: 585, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 594, Positive cache size: 594, Positive conditional cache size: 587, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 596, Positive cache size: 596, Positive conditional cache size: 589, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 598, Positive cache size: 598, Positive conditional cache size: 591, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 600, Positive cache size: 600, Positive conditional cache size: 593, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 602, Positive cache size: 602, Positive conditional cache size: 595, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 604, Positive cache size: 604, Positive conditional cache size: 597, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 606, Positive cache size: 606, Positive conditional cache size: 599, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 608, Positive cache size: 608, Positive conditional cache size: 601, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 610, Positive cache size: 610, Positive conditional cache size: 603, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 612, Positive conditional cache size: 605, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 614, Positive cache size: 614, Positive conditional cache size: 607, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 616, Positive cache size: 616, Positive conditional cache size: 609, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 618, Positive conditional cache size: 611, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 620, Positive cache size: 620, Positive conditional cache size: 613, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 622, Positive cache size: 622, Positive conditional cache size: 615, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 624, Positive cache size: 624, Positive conditional cache size: 617, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 626, Positive cache size: 626, Positive conditional cache size: 619, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 628, Positive cache size: 628, Positive conditional cache size: 621, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 630, Positive cache size: 630, Positive conditional cache size: 623, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 632, Positive cache size: 632, Positive conditional cache size: 625, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 634, Positive cache size: 634, Positive conditional cache size: 627, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 636, Positive cache size: 636, Positive conditional cache size: 629, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 638, Positive conditional cache size: 631, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 640, Positive cache size: 640, Positive conditional cache size: 633, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 642, Positive cache size: 642, Positive conditional cache size: 635, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 644, Positive cache size: 644, Positive conditional cache size: 637, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 646, Positive cache size: 646, Positive conditional cache size: 639, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 648, Positive cache size: 648, Positive conditional cache size: 641, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 650, Positive conditional cache size: 643, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 652, Positive cache size: 652, Positive conditional cache size: 645, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 654, Positive cache size: 654, Positive conditional cache size: 647, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 656, Positive cache size: 656, Positive conditional cache size: 649, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 658, Positive conditional cache size: 651, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 660, Positive cache size: 660, Positive conditional cache size: 653, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 662, Positive cache size: 662, Positive conditional cache size: 655, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 664, Positive cache size: 664, Positive conditional cache size: 657, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 666, Positive cache size: 666, Positive conditional cache size: 659, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 668, Positive conditional cache size: 661, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 670, Positive cache size: 670, Positive conditional cache size: 663, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 672, Positive cache size: 672, Positive conditional cache size: 665, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 674, Positive cache size: 674, Positive conditional cache size: 667, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 676, Positive cache size: 676, Positive conditional cache size: 669, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 678, Positive cache size: 678, Positive conditional cache size: 671, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 680, Positive cache size: 680, Positive conditional cache size: 673, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 682, Positive cache size: 682, Positive conditional cache size: 675, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 684, Positive cache size: 684, Positive conditional cache size: 677, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 686, Positive cache size: 686, Positive conditional cache size: 679, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 688, Positive conditional cache size: 681, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 690, Positive conditional cache size: 683, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 692, Positive cache size: 692, Positive conditional cache size: 685, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 694, Positive cache size: 694, Positive conditional cache size: 687, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 696, Positive cache size: 696, Positive conditional cache size: 689, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 698, Positive cache size: 698, Positive conditional cache size: 691, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 700, Positive cache size: 700, Positive conditional cache size: 693, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 702, Positive cache size: 702, Positive conditional cache size: 695, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 704, Positive cache size: 704, Positive conditional cache size: 697, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 706, Positive cache size: 706, Positive conditional cache size: 699, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 708, Positive cache size: 708, Positive conditional cache size: 701, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 710, Positive cache size: 710, Positive conditional cache size: 703, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 712, Positive conditional cache size: 705, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 714, Positive cache size: 714, Positive conditional cache size: 707, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 716, Positive conditional cache size: 709, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 718, Positive cache size: 718, Positive conditional cache size: 711, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 720, Positive cache size: 720, Positive conditional cache size: 713, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 722, Positive cache size: 722, Positive conditional cache size: 715, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 724, Positive cache size: 724, Positive conditional cache size: 717, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 726, Positive cache size: 726, Positive conditional cache size: 719, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 728, Positive cache size: 728, Positive conditional cache size: 721, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 730, Positive cache size: 730, Positive conditional cache size: 723, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 732, Positive cache size: 732, Positive conditional cache size: 725, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 734, Positive conditional cache size: 727, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 736, Positive cache size: 736, Positive conditional cache size: 729, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 738, Positive cache size: 738, Positive conditional cache size: 731, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 740, Positive cache size: 740, Positive conditional cache size: 733, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 742, Positive cache size: 742, Positive conditional cache size: 735, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 744, Positive cache size: 744, Positive conditional cache size: 737, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 746, Positive cache size: 746, Positive conditional cache size: 739, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 748, Positive cache size: 748, Positive conditional cache size: 741, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 750, Positive cache size: 750, Positive conditional cache size: 743, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 752, Positive cache size: 752, Positive conditional cache size: 745, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 754, Positive cache size: 754, Positive conditional cache size: 747, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 756, Positive cache size: 756, Positive conditional cache size: 749, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 758, Positive cache size: 758, Positive conditional cache size: 751, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 760, Positive cache size: 760, Positive conditional cache size: 753, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 762, Positive cache size: 762, Positive conditional cache size: 755, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 764, Positive conditional cache size: 757, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 766, Positive cache size: 766, Positive conditional cache size: 759, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 768, Positive cache size: 768, Positive conditional cache size: 761, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 770, Positive cache size: 770, Positive conditional cache size: 763, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 772, Positive cache size: 772, Positive conditional cache size: 765, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 774, Positive cache size: 774, Positive conditional cache size: 767, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 776, Positive conditional cache size: 769, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 778, Positive cache size: 778, Positive conditional cache size: 771, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 780, Positive conditional cache size: 773, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 782, Positive cache size: 782, Positive conditional cache size: 775, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 784, Positive conditional cache size: 777, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 786, Positive cache size: 786, Positive conditional cache size: 779, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 788, Positive cache size: 788, Positive conditional cache size: 781, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 790, Positive cache size: 790, Positive conditional cache size: 783, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 792, Positive cache size: 792, Positive conditional cache size: 785, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 794, Positive cache size: 794, Positive conditional cache size: 787, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 796, Positive cache size: 796, Positive conditional cache size: 789, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 798, Positive cache size: 798, Positive conditional cache size: 791, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 800, Positive cache size: 800, Positive conditional cache size: 793, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 802, Positive cache size: 802, Positive conditional cache size: 795, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 804, Positive cache size: 804, Positive conditional cache size: 797, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 806, Positive cache size: 806, Positive conditional cache size: 799, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 808, Positive cache size: 808, Positive conditional cache size: 801, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 810, Positive cache size: 810, Positive conditional cache size: 803, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 812, Positive cache size: 812, Positive conditional cache size: 805, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 814, Positive cache size: 814, Positive conditional cache size: 807, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 816, Positive cache size: 816, Positive conditional cache size: 809, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 818, Positive cache size: 818, Positive conditional cache size: 811, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 820, Positive cache size: 820, Positive conditional cache size: 813, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 822, Positive cache size: 822, Positive conditional cache size: 815, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 824, Positive cache size: 824, Positive conditional cache size: 817, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 826, Positive cache size: 826, Positive conditional cache size: 819, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 828, Positive cache size: 828, Positive conditional cache size: 821, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 830, Positive cache size: 830, Positive conditional cache size: 823, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 832, Positive cache size: 832, Positive conditional cache size: 825, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 834, Positive cache size: 834, Positive conditional cache size: 827, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 836, Positive cache size: 836, Positive conditional cache size: 829, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 838, Positive conditional cache size: 831, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 840, Positive cache size: 840, Positive conditional cache size: 833, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 842, Positive cache size: 842, Positive conditional cache size: 835, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 844, Positive cache size: 844, Positive conditional cache size: 837, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 846, Positive cache size: 846, Positive conditional cache size: 839, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 848, Positive cache size: 848, Positive conditional cache size: 841, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 850, Positive cache size: 850, Positive conditional cache size: 843, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 852, Positive cache size: 852, Positive conditional cache size: 845, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 854, Positive cache size: 854, Positive conditional cache size: 847, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 856, Positive cache size: 856, Positive conditional cache size: 849, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 858, Positive cache size: 858, Positive conditional cache size: 851, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 860, Positive cache size: 860, Positive conditional cache size: 853, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 862, Positive cache size: 862, Positive conditional cache size: 855, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 864, Positive cache size: 864, Positive conditional cache size: 857, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 866, Positive conditional cache size: 859, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 868, Positive cache size: 868, Positive conditional cache size: 861, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 870, Positive cache size: 870, Positive conditional cache size: 863, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 872, Positive cache size: 872, Positive conditional cache size: 865, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 874, Positive cache size: 874, Positive conditional cache size: 867, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 876, Positive cache size: 876, Positive conditional cache size: 869, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 878, Positive cache size: 878, Positive conditional cache size: 871, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 880, Positive cache size: 880, Positive conditional cache size: 873, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 882, Positive cache size: 882, Positive conditional cache size: 875, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 884, Positive cache size: 884, Positive conditional cache size: 877, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 886, Positive cache size: 886, Positive conditional cache size: 879, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 888, Positive conditional cache size: 881, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 890, Positive cache size: 890, Positive conditional cache size: 883, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 892, Positive cache size: 892, Positive conditional cache size: 885, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 894, Positive cache size: 894, Positive conditional cache size: 887, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 896, Positive cache size: 896, Positive conditional cache size: 889, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 898, Positive cache size: 898, Positive conditional cache size: 891, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 900, Positive cache size: 900, Positive conditional cache size: 893, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 902, Positive conditional cache size: 895, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 904, Positive cache size: 904, Positive conditional cache size: 897, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 906, Positive cache size: 906, Positive conditional cache size: 899, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 908, Positive cache size: 908, Positive conditional cache size: 901, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 910, Positive conditional cache size: 903, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 912, Positive cache size: 912, Positive conditional cache size: 905, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 914, Positive cache size: 914, Positive conditional cache size: 907, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 916, Positive cache size: 916, Positive conditional cache size: 909, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 918, Positive cache size: 918, Positive conditional cache size: 911, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 920, Positive cache size: 920, Positive conditional cache size: 913, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 922, Positive cache size: 922, Positive conditional cache size: 915, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 924, Positive cache size: 924, Positive conditional cache size: 917, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 926, Positive cache size: 926, Positive conditional cache size: 919, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 928, Positive cache size: 928, Positive conditional cache size: 921, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 930, Positive cache size: 930, Positive conditional cache size: 923, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 932, Positive cache size: 932, Positive conditional cache size: 925, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 934, Positive cache size: 934, Positive conditional cache size: 927, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 936, Positive cache size: 936, Positive conditional cache size: 929, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 938, Positive cache size: 938, Positive conditional cache size: 931, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 940, Positive cache size: 940, Positive conditional cache size: 933, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 942, Positive cache size: 942, Positive conditional cache size: 935, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 944, Positive conditional cache size: 937, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 946, Positive cache size: 946, Positive conditional cache size: 939, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 948, Positive cache size: 948, Positive conditional cache size: 941, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 950, Positive cache size: 950, Positive conditional cache size: 943, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 952, Positive cache size: 952, Positive conditional cache size: 945, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 954, Positive cache size: 954, Positive conditional cache size: 947, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 956, Positive cache size: 956, Positive conditional cache size: 949, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 958, Positive cache size: 958, Positive conditional cache size: 951, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 960, Positive cache size: 960, Positive conditional cache size: 953, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 962, Positive cache size: 962, Positive conditional cache size: 955, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 964, Positive cache size: 964, Positive conditional cache size: 957, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 966, Positive cache size: 966, Positive conditional cache size: 959, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 968, Positive cache size: 968, Positive conditional cache size: 961, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 970, Positive cache size: 970, Positive conditional cache size: 963, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 972, Positive cache size: 972, Positive conditional cache size: 965, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 974, Positive cache size: 974, Positive conditional cache size: 967, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 976, Positive cache size: 976, Positive conditional cache size: 969, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 978, Positive cache size: 978, Positive conditional cache size: 971, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 980, Positive cache size: 980, Positive conditional cache size: 973, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 982, Positive cache size: 982, Positive conditional cache size: 975, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 984, Positive cache size: 984, Positive conditional cache size: 977, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 986, Positive cache size: 986, Positive conditional cache size: 979, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 988, Positive cache size: 988, Positive conditional cache size: 981, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 990, Positive cache size: 990, Positive conditional cache size: 983, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 992, Positive cache size: 992, Positive conditional cache size: 985, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 994, Positive cache size: 994, Positive conditional cache size: 987, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 996, Positive cache size: 996, Positive conditional cache size: 989, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 998, Positive conditional cache size: 991, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1000, Positive cache size: 1000, Positive conditional cache size: 993, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1002, Positive cache size: 1002, Positive conditional cache size: 995, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1004, Positive cache size: 1004, Positive conditional cache size: 997, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1006, Positive cache size: 1006, Positive conditional cache size: 999, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1008, Positive cache size: 1008, Positive conditional cache size: 1001, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1010, Positive cache size: 1010, Positive conditional cache size: 1003, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1012, Positive cache size: 1012, Positive conditional cache size: 1005, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1014, Positive cache size: 1014, Positive conditional cache size: 1007, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1016, Positive cache size: 1016, Positive conditional cache size: 1009, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1018, Positive cache size: 1018, Positive conditional cache size: 1011, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1020, Positive cache size: 1020, Positive conditional cache size: 1013, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1022, Positive cache size: 1022, Positive conditional cache size: 1015, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1024, Positive cache size: 1024, Positive conditional cache size: 1017, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1026, Positive cache size: 1026, Positive conditional cache size: 1019, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1028, Positive cache size: 1028, Positive conditional cache size: 1021, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1030, Positive cache size: 1030, Positive conditional cache size: 1023, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1032, Positive cache size: 1032, Positive conditional cache size: 1025, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1034, Positive cache size: 1034, Positive conditional cache size: 1027, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1036, Positive cache size: 1036, Positive conditional cache size: 1029, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1038, Positive cache size: 1038, Positive conditional cache size: 1031, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1040, Positive cache size: 1040, Positive conditional cache size: 1033, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1042, Positive cache size: 1042, Positive conditional cache size: 1035, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1044, Positive cache size: 1044, Positive conditional cache size: 1037, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1046, Positive cache size: 1046, Positive conditional cache size: 1039, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1048, Positive cache size: 1048, Positive conditional cache size: 1041, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1050, Positive cache size: 1050, Positive conditional cache size: 1043, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1052, Positive cache size: 1052, Positive conditional cache size: 1045, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 1054, Positive conditional cache size: 1047, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1056, Positive cache size: 1056, Positive conditional cache size: 1049, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1058, Positive cache size: 1058, Positive conditional cache size: 1051, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1060, Positive cache size: 1060, Positive conditional cache size: 1053, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1062, Positive cache size: 1062, Positive conditional cache size: 1055, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1064, Positive cache size: 1064, Positive conditional cache size: 1057, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1066, Positive conditional cache size: 1059, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1068, Positive cache size: 1068, Positive conditional cache size: 1061, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1070, Positive cache size: 1070, Positive conditional cache size: 1063, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1072, Positive cache size: 1072, Positive conditional cache size: 1065, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1074, Positive cache size: 1074, Positive conditional cache size: 1067, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1076, Positive conditional cache size: 1069, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1078, Positive conditional cache size: 1071, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 1080, Positive conditional cache size: 1073, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1082, Positive cache size: 1082, Positive conditional cache size: 1075, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1084, Positive cache size: 1084, Positive conditional cache size: 1077, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1086, Positive cache size: 1086, Positive conditional cache size: 1079, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1088, Positive cache size: 1088, Positive conditional cache size: 1081, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1090, Positive cache size: 1090, Positive conditional cache size: 1083, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1092, Positive cache size: 1092, Positive conditional cache size: 1085, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1094, Positive cache size: 1094, Positive conditional cache size: 1087, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1096, Positive cache size: 1096, Positive conditional cache size: 1089, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1098, Positive cache size: 1098, Positive conditional cache size: 1091, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1100, Positive cache size: 1100, Positive conditional cache size: 1093, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1102, Positive cache size: 1102, Positive conditional cache size: 1095, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1104, Positive cache size: 1104, Positive conditional cache size: 1097, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1106, Positive cache size: 1106, Positive conditional cache size: 1099, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1108, Positive cache size: 1108, Positive conditional cache size: 1101, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1110, Positive cache size: 1110, Positive conditional cache size: 1103, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1112, Positive cache size: 1112, Positive conditional cache size: 1105, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 1114, Positive conditional cache size: 1107, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1116, Positive cache size: 1116, Positive conditional cache size: 1109, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1118, Positive cache size: 1118, Positive conditional cache size: 1111, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1120, Positive cache size: 1120, Positive conditional cache size: 1113, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1122, Positive cache size: 1122, Positive conditional cache size: 1115, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1124, Positive cache size: 1124, Positive conditional cache size: 1117, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1126, Positive cache size: 1126, Positive conditional cache size: 1119, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1128, Positive cache size: 1128, Positive conditional cache size: 1121, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1130, Positive cache size: 1130, Positive conditional cache size: 1123, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1132, Positive conditional cache size: 1125, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1134, Positive cache size: 1134, Positive conditional cache size: 1127, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1136, Positive cache size: 1136, Positive conditional cache size: 1129, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1138, Positive cache size: 1138, Positive conditional cache size: 1131, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1140, Positive cache size: 1140, Positive conditional cache size: 1133, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1142, Positive cache size: 1142, Positive conditional cache size: 1135, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1144, Positive cache size: 1144, Positive conditional cache size: 1137, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1146, Positive cache size: 1146, Positive conditional cache size: 1139, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1148, Positive cache size: 1148, Positive conditional cache size: 1141, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1150, Positive cache size: 1150, Positive conditional cache size: 1143, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1152, Positive cache size: 1152, Positive conditional cache size: 1145, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1154, Positive cache size: 1154, Positive conditional cache size: 1147, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1156, Positive cache size: 1156, Positive conditional cache size: 1149, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1158, Positive cache size: 1158, Positive conditional cache size: 1151, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1160, Positive cache size: 1160, Positive conditional cache size: 1153, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1162, Positive cache size: 1162, Positive conditional cache size: 1155, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1164, Positive cache size: 1164, Positive conditional cache size: 1157, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1166, Positive cache size: 1166, Positive conditional cache size: 1159, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1168, Positive cache size: 1168, Positive conditional cache size: 1161, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1170, Positive cache size: 1170, Positive conditional cache size: 1163, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1172, Positive cache size: 1172, Positive conditional cache size: 1165, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1174, Positive cache size: 1174, Positive conditional cache size: 1167, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1176, Positive cache size: 1176, Positive conditional cache size: 1169, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1178, Positive cache size: 1178, Positive conditional cache size: 1171, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1180, Positive cache size: 1180, Positive conditional cache size: 1173, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1182, Positive conditional cache size: 1175, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1184, Positive cache size: 1184, Positive conditional cache size: 1177, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1186, Positive conditional cache size: 1179, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1188, Positive cache size: 1188, Positive conditional cache size: 1181, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1190, Positive conditional cache size: 1183, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1192, Positive cache size: 1192, Positive conditional cache size: 1185, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1194, Positive conditional cache size: 1187, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1196, Positive cache size: 1196, Positive conditional cache size: 1189, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1198, Positive cache size: 1198, Positive conditional cache size: 1191, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1200, Positive cache size: 1200, Positive conditional cache size: 1193, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1202, Positive cache size: 1202, Positive conditional cache size: 1195, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1204, Positive conditional cache size: 1197, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1206, Positive cache size: 1206, Positive conditional cache size: 1199, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1208, Positive cache size: 1208, Positive conditional cache size: 1201, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1210, Positive cache size: 1210, Positive conditional cache size: 1203, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1212, Positive conditional cache size: 1205, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1214, Positive cache size: 1214, Positive conditional cache size: 1207, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1216, Positive cache size: 1216, Positive conditional cache size: 1209, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1218, Positive cache size: 1218, Positive conditional cache size: 1211, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1220, Positive conditional cache size: 1213, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1222, Positive cache size: 1222, Positive conditional cache size: 1215, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1224, Positive cache size: 1224, Positive conditional cache size: 1217, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1226, Positive cache size: 1226, Positive conditional cache size: 1219, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1228, Positive cache size: 1228, Positive conditional cache size: 1221, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1230, Positive cache size: 1230, Positive conditional cache size: 1223, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1232, Positive conditional cache size: 1225, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1234, Positive conditional cache size: 1227, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1236, Positive cache size: 1236, Positive conditional cache size: 1229, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1238, Positive cache size: 1238, Positive conditional cache size: 1231, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1240, Positive cache size: 1240, Positive conditional cache size: 1233, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1242, Positive cache size: 1242, Positive conditional cache size: 1235, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1244, Positive cache size: 1244, Positive conditional cache size: 1237, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1246, Positive cache size: 1246, Positive conditional cache size: 1239, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1248, Positive cache size: 1248, Positive conditional cache size: 1241, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1250, Positive cache size: 1250, Positive conditional cache size: 1243, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1252, Positive cache size: 1252, Positive conditional cache size: 1245, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1254, Positive cache size: 1254, Positive conditional cache size: 1247, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1256, Positive cache size: 1256, Positive conditional cache size: 1249, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1258, Positive cache size: 1258, Positive conditional cache size: 1251, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1260, Positive cache size: 1260, Positive conditional cache size: 1253, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1262, Positive cache size: 1262, Positive conditional cache size: 1255, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1264, Positive cache size: 1264, Positive conditional cache size: 1257, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1266, Positive cache size: 1266, Positive conditional cache size: 1259, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1268, Positive cache size: 1268, Positive conditional cache size: 1261, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1270, Positive cache size: 1270, Positive conditional cache size: 1263, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1272, Positive cache size: 1272, Positive conditional cache size: 1265, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1274, Positive cache size: 1274, Positive conditional cache size: 1267, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1276, Positive cache size: 1276, Positive conditional cache size: 1269, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1278, Positive cache size: 1278, Positive conditional cache size: 1271, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1280, Positive conditional cache size: 1273, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1282, Positive cache size: 1282, Positive conditional cache size: 1275, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1284, Positive cache size: 1284, Positive conditional cache size: 1277, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1286, Positive cache size: 1286, Positive conditional cache size: 1279, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1288, Positive cache size: 1288, Positive conditional cache size: 1281, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1290, Positive cache size: 1290, Positive conditional cache size: 1283, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1292, Positive cache size: 1292, Positive conditional cache size: 1285, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1294, Positive cache size: 1294, Positive conditional cache size: 1287, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1296, Positive cache size: 1296, Positive conditional cache size: 1289, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1298, Positive cache size: 1298, Positive conditional cache size: 1291, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1300, Positive cache size: 1300, Positive conditional cache size: 1293, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1302, Positive cache size: 1302, Positive conditional cache size: 1295, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1304, Positive cache size: 1304, Positive conditional cache size: 1297, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1306, Positive conditional cache size: 1299, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1308, Positive cache size: 1308, Positive conditional cache size: 1301, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1310, Positive cache size: 1310, Positive conditional cache size: 1303, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1312, Positive conditional cache size: 1305, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1314, Positive conditional cache size: 1307, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1316, Positive cache size: 1316, Positive conditional cache size: 1309, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1318, Positive cache size: 1318, Positive conditional cache size: 1311, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1320, Positive cache size: 1320, Positive conditional cache size: 1313, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1322, Positive cache size: 1322, Positive conditional cache size: 1315, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1324, Positive conditional cache size: 1317, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1326, Positive cache size: 1326, Positive conditional cache size: 1319, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1328, Positive cache size: 1328, Positive conditional cache size: 1321, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1330, Positive conditional cache size: 1323, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1332, Positive cache size: 1332, Positive conditional cache size: 1325, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1334, Positive cache size: 1334, Positive conditional cache size: 1327, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1336, Positive conditional cache size: 1329, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1338, Positive conditional cache size: 1331, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1340, Positive conditional cache size: 1333, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1342, Positive cache size: 1342, Positive conditional cache size: 1335, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1344, Positive cache size: 1344, Positive conditional cache size: 1337, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1346, Positive cache size: 1346, Positive conditional cache size: 1339, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1348, Positive cache size: 1348, Positive conditional cache size: 1341, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1350, Positive cache size: 1350, Positive conditional cache size: 1343, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1352, Positive cache size: 1352, Positive conditional cache size: 1345, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1354, Positive cache size: 1354, Positive conditional cache size: 1347, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1356, Positive cache size: 1356, Positive conditional cache size: 1349, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1358, Positive cache size: 1358, Positive conditional cache size: 1351, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1360, Positive cache size: 1360, Positive conditional cache size: 1353, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1362, Positive cache size: 1362, Positive conditional cache size: 1355, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1364, Positive cache size: 1364, Positive conditional cache size: 1357, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1366, Positive cache size: 1366, Positive conditional cache size: 1359, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1368, Positive cache size: 1368, Positive conditional cache size: 1361, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1370, Positive cache size: 1370, Positive conditional cache size: 1363, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1372, Positive cache size: 1372, Positive conditional cache size: 1365, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1374, Positive cache size: 1374, Positive conditional cache size: 1367, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1376, Positive cache size: 1376, Positive conditional cache size: 1369, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1378, Positive cache size: 1378, Positive conditional cache size: 1371, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1380, Positive cache size: 1380, Positive conditional cache size: 1373, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1382, Positive conditional cache size: 1375, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1384, Positive cache size: 1384, Positive conditional cache size: 1377, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1386, Positive cache size: 1386, Positive conditional cache size: 1379, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1388, Positive cache size: 1388, Positive conditional cache size: 1381, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1390, Positive cache size: 1390, Positive conditional cache size: 1383, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1392, Positive cache size: 1392, Positive conditional cache size: 1385, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1394, Positive cache size: 1394, Positive conditional cache size: 1387, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1396, Positive cache size: 1396, Positive conditional cache size: 1389, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1398, Positive cache size: 1398, Positive conditional cache size: 1391, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1400, Positive cache size: 1400, Positive conditional cache size: 1393, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1402, Positive cache size: 1402, Positive conditional cache size: 1395, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1404, Positive cache size: 1404, Positive conditional cache size: 1397, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1406, Positive cache size: 1406, Positive conditional cache size: 1399, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1408, Positive cache size: 1408, Positive conditional cache size: 1401, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1410, Positive cache size: 1410, Positive conditional cache size: 1403, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1412, Positive cache size: 1412, Positive conditional cache size: 1405, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1414, Positive cache size: 1414, Positive conditional cache size: 1407, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1416, Positive cache size: 1416, Positive conditional cache size: 1409, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1418, Positive cache size: 1418, Positive conditional cache size: 1411, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1420, Positive cache size: 1420, Positive conditional cache size: 1413, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1422, Positive conditional cache size: 1415, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1424, Positive cache size: 1424, Positive conditional cache size: 1417, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1426, Positive cache size: 1426, Positive conditional cache size: 1419, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1428, Positive cache size: 1428, Positive conditional cache size: 1421, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1430, Positive cache size: 1430, Positive conditional cache size: 1423, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1432, Positive conditional cache size: 1425, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1434, Positive cache size: 1434, Positive conditional cache size: 1427, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1436, Positive cache size: 1436, Positive conditional cache size: 1429, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1438, Positive cache size: 1438, Positive conditional cache size: 1431, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1440, Positive cache size: 1440, Positive conditional cache size: 1433, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1442, Positive cache size: 1442, Positive conditional cache size: 1435, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1444, Positive cache size: 1444, Positive conditional cache size: 1437, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1446, Positive cache size: 1446, Positive conditional cache size: 1439, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1448, Positive cache size: 1448, Positive conditional cache size: 1441, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1450, Positive cache size: 1450, Positive conditional cache size: 1443, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1452, Positive cache size: 1452, Positive conditional cache size: 1445, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1454, Positive cache size: 1454, Positive conditional cache size: 1447, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1456, Positive cache size: 1456, Positive conditional cache size: 1449, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1458, Positive cache size: 1458, Positive conditional cache size: 1451, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1460, Positive cache size: 1460, Positive conditional cache size: 1453, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1462, Positive cache size: 1462, Positive conditional cache size: 1455, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1464, Positive cache size: 1464, Positive conditional cache size: 1457, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1466, Positive cache size: 1466, Positive conditional cache size: 1459, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1468, Positive cache size: 1468, Positive conditional cache size: 1461, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1470, Positive cache size: 1470, Positive conditional cache size: 1463, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1472, Positive cache size: 1472, Positive conditional cache size: 1465, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1474, Positive cache size: 1474, Positive conditional cache size: 1467, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1476, Positive cache size: 1476, Positive conditional cache size: 1469, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1478, Positive cache size: 1478, Positive conditional cache size: 1471, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1480, Positive cache size: 1480, Positive conditional cache size: 1473, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1482, Positive cache size: 1482, Positive conditional cache size: 1475, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1484, Positive cache size: 1484, Positive conditional cache size: 1477, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1486, Positive cache size: 1486, Positive conditional cache size: 1479, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1488, Positive cache size: 1488, Positive conditional cache size: 1481, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1490, Positive cache size: 1490, Positive conditional cache size: 1483, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1492, Positive cache size: 1492, Positive conditional cache size: 1485, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1494, Positive cache size: 1494, Positive conditional cache size: 1487, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1496, Positive cache size: 1496, Positive conditional cache size: 1489, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1498, Positive cache size: 1498, Positive conditional cache size: 1491, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1500, Positive cache size: 1500, Positive conditional cache size: 1493, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1502, Positive cache size: 1502, Positive conditional cache size: 1495, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1504, Positive cache size: 1504, Positive conditional cache size: 1497, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1506, Positive cache size: 1506, Positive conditional cache size: 1499, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1508, Positive cache size: 1508, Positive conditional cache size: 1501, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1510, Positive cache size: 1510, Positive conditional cache size: 1503, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1512, Positive cache size: 1512, Positive conditional cache size: 1505, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1514, Positive cache size: 1514, Positive conditional cache size: 1507, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1516, Positive cache size: 1516, Positive conditional cache size: 1509, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1518, Positive cache size: 1518, Positive conditional cache size: 1511, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1520, Positive cache size: 1520, Positive conditional cache size: 1513, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1522, Positive cache size: 1522, Positive conditional cache size: 1515, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1524, Positive cache size: 1524, Positive conditional cache size: 1517, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1526, Positive cache size: 1526, Positive conditional cache size: 1519, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1528, Positive cache size: 1528, Positive conditional cache size: 1521, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1530, Positive cache size: 1530, Positive conditional cache size: 1523, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1532, Positive cache size: 1532, Positive conditional cache size: 1525, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1534, Positive cache size: 1534, Positive conditional cache size: 1527, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1536, Positive cache size: 1536, Positive conditional cache size: 1529, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1538, Positive cache size: 1538, Positive conditional cache size: 1531, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1540, Positive cache size: 1540, Positive conditional cache size: 1533, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1542, Positive cache size: 1542, Positive conditional cache size: 1535, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1544, Positive cache size: 1544, Positive conditional cache size: 1537, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1546, Positive cache size: 1546, Positive conditional cache size: 1539, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 1541, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1550, Positive cache size: 1550, Positive conditional cache size: 1543, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1552, Positive cache size: 1552, Positive conditional cache size: 1545, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1554, Positive cache size: 1554, Positive conditional cache size: 1547, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1556, Positive cache size: 1556, Positive conditional cache size: 1549, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1558, Positive cache size: 1558, Positive conditional cache size: 1551, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1560, Positive cache size: 1560, Positive conditional cache size: 1553, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1562, Positive cache size: 1562, Positive conditional cache size: 1555, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1564, Positive cache size: 1564, Positive conditional cache size: 1557, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1566, Positive cache size: 1566, Positive conditional cache size: 1559, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1568, Positive cache size: 1568, Positive conditional cache size: 1561, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1570, Positive cache size: 1570, Positive conditional cache size: 1563, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1572, Positive conditional cache size: 1565, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1574, Positive cache size: 1574, Positive conditional cache size: 1567, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1576, Positive cache size: 1576, Positive conditional cache size: 1569, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1578, Positive cache size: 1578, Positive conditional cache size: 1571, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1580, Positive cache size: 1580, Positive conditional cache size: 1573, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1582, Positive cache size: 1582, Positive conditional cache size: 1575, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1584, Positive cache size: 1584, Positive conditional cache size: 1577, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1586, Positive cache size: 1586, Positive conditional cache size: 1579, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1588, Positive cache size: 1588, Positive conditional cache size: 1581, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1590, Positive cache size: 1590, Positive conditional cache size: 1583, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1592, Positive cache size: 1592, Positive conditional cache size: 1585, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1594, Positive cache size: 1594, Positive conditional cache size: 1587, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1596, Positive conditional cache size: 1589, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1598, Positive cache size: 1598, Positive conditional cache size: 1591, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1600, Positive cache size: 1600, Positive conditional cache size: 1593, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1602, Positive cache size: 1602, Positive conditional cache size: 1595, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1604, Positive cache size: 1604, Positive conditional cache size: 1597, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1606, Positive cache size: 1606, Positive conditional cache size: 1599, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1608, Positive cache size: 1608, Positive conditional cache size: 1601, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1610, Positive cache size: 1610, Positive conditional cache size: 1603, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1612, Positive cache size: 1612, Positive conditional cache size: 1605, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1614, Positive cache size: 1614, Positive conditional cache size: 1607, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1616, Positive cache size: 1616, Positive conditional cache size: 1609, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1618, Positive cache size: 1618, Positive conditional cache size: 1611, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1620, Positive cache size: 1620, Positive conditional cache size: 1613, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1622, Positive cache size: 1622, Positive conditional cache size: 1615, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1624, Positive cache size: 1624, Positive conditional cache size: 1617, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1626, Positive cache size: 1626, Positive conditional cache size: 1619, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1628, Positive cache size: 1628, Positive conditional cache size: 1621, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1630, Positive cache size: 1630, Positive conditional cache size: 1623, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1632, Positive cache size: 1632, Positive conditional cache size: 1625, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1634, Positive cache size: 1634, Positive conditional cache size: 1627, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1636, Positive cache size: 1636, Positive conditional cache size: 1629, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1638, Positive cache size: 1638, Positive conditional cache size: 1631, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1640, Positive cache size: 1640, Positive conditional cache size: 1633, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1642, Positive cache size: 1642, Positive conditional cache size: 1635, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1644, Positive cache size: 1644, Positive conditional cache size: 1637, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1646, Positive cache size: 1646, Positive conditional cache size: 1639, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1648, Positive cache size: 1648, Positive conditional cache size: 1641, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1650, Positive cache size: 1650, Positive conditional cache size: 1643, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1652, Positive cache size: 1652, Positive conditional cache size: 1645, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1654, Positive cache size: 1654, Positive conditional cache size: 1647, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1656, Positive cache size: 1656, Positive conditional cache size: 1649, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1658, Positive cache size: 1658, Positive conditional cache size: 1651, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1660, Positive cache size: 1660, Positive conditional cache size: 1653, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1662, Positive cache size: 1662, Positive conditional cache size: 1655, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1664, Positive cache size: 1664, Positive conditional cache size: 1657, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1666, Positive cache size: 1666, Positive conditional cache size: 1659, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1668, Positive cache size: 1668, Positive conditional cache size: 1661, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1670, Positive cache size: 1670, Positive conditional cache size: 1663, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1672, Positive cache size: 1672, Positive conditional cache size: 1665, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1674, Positive cache size: 1674, Positive conditional cache size: 1667, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1676, Positive cache size: 1676, Positive conditional cache size: 1669, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1678, Positive cache size: 1678, Positive conditional cache size: 1671, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1680, Positive cache size: 1680, Positive conditional cache size: 1673, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1682, Positive cache size: 1682, Positive conditional cache size: 1675, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1684, Positive cache size: 1684, Positive conditional cache size: 1677, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1686, Positive cache size: 1686, Positive conditional cache size: 1679, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1688, Positive cache size: 1688, Positive conditional cache size: 1681, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1690, Positive cache size: 1690, Positive conditional cache size: 1683, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1692, Positive cache size: 1692, Positive conditional cache size: 1685, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1694, Positive cache size: 1694, Positive conditional cache size: 1687, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1696, Positive conditional cache size: 1689, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1698, Positive cache size: 1698, Positive conditional cache size: 1691, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1700, Positive cache size: 1700, Positive conditional cache size: 1693, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1702, Positive cache size: 1702, Positive conditional cache size: 1695, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1704, Positive cache size: 1704, Positive conditional cache size: 1697, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1706, Positive cache size: 1706, Positive conditional cache size: 1699, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1708, Positive cache size: 1708, Positive conditional cache size: 1701, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1710, Positive cache size: 1710, Positive conditional cache size: 1703, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1712, Positive cache size: 1712, Positive conditional cache size: 1705, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1714, Positive cache size: 1714, Positive conditional cache size: 1707, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1716, Positive cache size: 1716, Positive conditional cache size: 1709, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1718, Positive cache size: 1718, Positive conditional cache size: 1711, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1720, Positive cache size: 1720, Positive conditional cache size: 1713, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1722, Positive cache size: 1722, Positive conditional cache size: 1715, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1724, Positive cache size: 1724, Positive conditional cache size: 1717, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1726, Positive cache size: 1726, Positive conditional cache size: 1719, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1728, Positive cache size: 1728, Positive conditional cache size: 1721, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1730, Positive cache size: 1730, Positive conditional cache size: 1723, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1732, Positive cache size: 1732, Positive conditional cache size: 1725, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1734, Positive cache size: 1734, Positive conditional cache size: 1727, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1736, Positive cache size: 1736, Positive conditional cache size: 1729, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1738, Positive cache size: 1738, Positive conditional cache size: 1731, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1740, Positive cache size: 1740, Positive conditional cache size: 1733, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1742, Positive cache size: 1742, Positive conditional cache size: 1735, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1744, Positive cache size: 1744, Positive conditional cache size: 1737, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1746, Positive cache size: 1746, Positive conditional cache size: 1739, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1748, Positive cache size: 1748, Positive conditional cache size: 1741, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1750, Positive cache size: 1750, Positive conditional cache size: 1743, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1752, Positive cache size: 1752, Positive conditional cache size: 1745, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1754, Positive cache size: 1754, Positive conditional cache size: 1747, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1756, Positive cache size: 1756, Positive conditional cache size: 1749, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1758, Positive cache size: 1758, Positive conditional cache size: 1751, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1760, Positive cache size: 1760, Positive conditional cache size: 1753, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1762, Positive cache size: 1762, Positive conditional cache size: 1755, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1764, Positive cache size: 1764, Positive conditional cache size: 1757, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1766, Positive cache size: 1766, Positive conditional cache size: 1759, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1768, Positive cache size: 1768, Positive conditional cache size: 1761, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1770, Positive cache size: 1770, Positive conditional cache size: 1763, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1772, Positive cache size: 1772, Positive conditional cache size: 1765, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1774, Positive cache size: 1774, Positive conditional cache size: 1767, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1776, Positive cache size: 1776, Positive conditional cache size: 1769, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1778, Positive cache size: 1778, Positive conditional cache size: 1771, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1780, Positive cache size: 1780, Positive conditional cache size: 1773, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1782, Positive cache size: 1782, Positive conditional cache size: 1775, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1784, Positive cache size: 1784, Positive conditional cache size: 1777, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1786, Positive cache size: 1786, Positive conditional cache size: 1779, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1788, Positive cache size: 1788, Positive conditional cache size: 1781, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1790, Positive cache size: 1790, Positive conditional cache size: 1783, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1792, Positive cache size: 1792, Positive conditional cache size: 1785, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1794, Positive cache size: 1794, Positive conditional cache size: 1787, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1796, Positive cache size: 1796, Positive conditional cache size: 1789, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1798, Positive cache size: 1798, Positive conditional cache size: 1791, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1800, Positive cache size: 1800, Positive conditional cache size: 1793, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1802, Positive cache size: 1802, Positive conditional cache size: 1795, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1804, Positive cache size: 1804, Positive conditional cache size: 1797, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1806, Positive cache size: 1806, Positive conditional cache size: 1799, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1808, Positive cache size: 1808, Positive conditional cache size: 1801, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1810, Positive cache size: 1810, Positive conditional cache size: 1803, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1812, Positive cache size: 1812, Positive conditional cache size: 1805, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1814, Positive cache size: 1814, Positive conditional cache size: 1807, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1816, Positive conditional cache size: 1809, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1818, Positive cache size: 1818, Positive conditional cache size: 1811, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1820, Positive cache size: 1820, Positive conditional cache size: 1813, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1822, Positive cache size: 1822, Positive conditional cache size: 1815, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1824, Positive cache size: 1824, Positive conditional cache size: 1817, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1826, Positive cache size: 1826, Positive conditional cache size: 1819, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1828, Positive cache size: 1828, Positive conditional cache size: 1821, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1830, Positive cache size: 1830, Positive conditional cache size: 1823, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1832, Positive cache size: 1832, Positive conditional cache size: 1825, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1834, Positive cache size: 1834, Positive conditional cache size: 1827, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1836, Positive conditional cache size: 1829, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1838, Positive cache size: 1838, Positive conditional cache size: 1831, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1840, Positive cache size: 1840, Positive conditional cache size: 1833, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1842, Positive cache size: 1842, Positive conditional cache size: 1835, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1844, Positive cache size: 1844, Positive conditional cache size: 1837, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1846, Positive cache size: 1846, Positive conditional cache size: 1839, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1848, Positive cache size: 1848, Positive conditional cache size: 1841, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1850, Positive cache size: 1850, Positive conditional cache size: 1843, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1852, Positive cache size: 1852, Positive conditional cache size: 1845, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1854, Positive cache size: 1854, Positive conditional cache size: 1847, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1856, Positive conditional cache size: 1849, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1858, Positive cache size: 1858, Positive conditional cache size: 1851, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1860, Positive cache size: 1860, Positive conditional cache size: 1853, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1862, Positive cache size: 1862, Positive conditional cache size: 1855, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1864, Positive cache size: 1864, Positive conditional cache size: 1857, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1866, Positive cache size: 1866, Positive conditional cache size: 1859, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1868, Positive conditional cache size: 1861, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1870, Positive cache size: 1870, Positive conditional cache size: 1863, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1872, Positive cache size: 1872, Positive conditional cache size: 1865, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1874, Positive cache size: 1874, Positive conditional cache size: 1867, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1876, Positive cache size: 1876, Positive conditional cache size: 1869, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1878, Positive cache size: 1878, Positive conditional cache size: 1871, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1880, Positive cache size: 1880, Positive conditional cache size: 1873, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1882, Positive cache size: 1882, Positive conditional cache size: 1875, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1884, Positive cache size: 1884, Positive conditional cache size: 1877, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1886, Positive cache size: 1886, Positive conditional cache size: 1879, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1888, Positive cache size: 1888, Positive conditional cache size: 1881, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1890, Positive cache size: 1890, Positive conditional cache size: 1883, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1892, Positive cache size: 1892, Positive conditional cache size: 1885, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1894, Positive cache size: 1894, Positive conditional cache size: 1887, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1896, Positive cache size: 1896, Positive conditional cache size: 1889, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1898, Positive cache size: 1898, Positive conditional cache size: 1891, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1900, Positive cache size: 1900, Positive conditional cache size: 1893, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1902, Positive cache size: 1902, Positive conditional cache size: 1895, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1904, Positive cache size: 1904, Positive conditional cache size: 1897, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1906, Positive conditional cache size: 1899, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1908, Positive cache size: 1908, Positive conditional cache size: 1901, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1910, Positive cache size: 1910, Positive conditional cache size: 1903, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1912, Positive cache size: 1912, Positive conditional cache size: 1905, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1914, Positive cache size: 1914, Positive conditional cache size: 1907, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1916, Positive cache size: 1916, Positive conditional cache size: 1909, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1918, Positive cache size: 1918, Positive conditional cache size: 1911, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1920, Positive cache size: 1920, Positive conditional cache size: 1913, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1922, Positive cache size: 1922, Positive conditional cache size: 1915, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1924, Positive cache size: 1924, Positive conditional cache size: 1917, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1926, Positive cache size: 1926, Positive conditional cache size: 1919, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1928, Positive cache size: 1928, Positive conditional cache size: 1921, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1930, Positive cache size: 1930, Positive conditional cache size: 1923, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1932, Positive cache size: 1932, Positive conditional cache size: 1925, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1934, Positive cache size: 1934, Positive conditional cache size: 1927, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1936, Positive cache size: 1936, Positive conditional cache size: 1929, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1938, Positive cache size: 1938, Positive conditional cache size: 1931, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1940, Positive cache size: 1940, Positive conditional cache size: 1933, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1942, Positive cache size: 1942, Positive conditional cache size: 1935, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1944, Positive cache size: 1944, Positive conditional cache size: 1937, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1946, Positive cache size: 1946, Positive conditional cache size: 1939, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1948, Positive cache size: 1948, Positive conditional cache size: 1941, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1950, Positive cache size: 1950, Positive conditional cache size: 1943, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1952, Positive cache size: 1952, Positive conditional cache size: 1945, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1954, Positive cache size: 1954, Positive conditional cache size: 1947, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1956, Positive conditional cache size: 1949, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1958, Positive cache size: 1958, Positive conditional cache size: 1951, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1960, Positive cache size: 1960, Positive conditional cache size: 1953, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1962, Positive cache size: 1962, Positive conditional cache size: 1955, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1964, Positive cache size: 1964, Positive conditional cache size: 1957, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1966, Positive cache size: 1966, Positive conditional cache size: 1959, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1968, Positive cache size: 1968, Positive conditional cache size: 1961, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1970, Positive cache size: 1970, Positive conditional cache size: 1963, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1972, Positive cache size: 1972, Positive conditional cache size: 1965, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1974, Positive cache size: 1974, Positive conditional cache size: 1967, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1976, Positive cache size: 1976, Positive conditional cache size: 1969, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1978, Positive conditional cache size: 1971, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1980, Positive cache size: 1980, Positive conditional cache size: 1973, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1982, Positive cache size: 1982, Positive conditional cache size: 1975, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1984, Positive cache size: 1984, Positive conditional cache size: 1977, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1986, Positive cache size: 1986, Positive conditional cache size: 1979, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1988, Positive cache size: 1988, Positive conditional cache size: 1981, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1990, Positive cache size: 1990, Positive conditional cache size: 1983, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1992, Positive cache size: 1992, Positive conditional cache size: 1985, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1994, Positive cache size: 1994, Positive conditional cache size: 1987, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1996, Positive cache size: 1996, Positive conditional cache size: 1989, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1998, Positive cache size: 1998, Positive conditional cache size: 1991, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2000, Positive cache size: 2000, Positive conditional cache size: 1993, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2002, Positive cache size: 2002, Positive conditional cache size: 1995, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2004, Positive cache size: 2004, Positive conditional cache size: 1997, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2006, Positive cache size: 2006, Positive conditional cache size: 1999, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2008, Positive cache size: 2008, Positive conditional cache size: 2001, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2010, Positive cache size: 2010, Positive conditional cache size: 2003, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2012, Positive cache size: 2012, Positive conditional cache size: 2005, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2014, Positive cache size: 2014, Positive conditional cache size: 2007, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2016, Positive cache size: 2016, Positive conditional cache size: 2009, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2018, Positive cache size: 2018, Positive conditional cache size: 2011, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2020, Positive cache size: 2020, Positive conditional cache size: 2013, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2022, Positive cache size: 2022, Positive conditional cache size: 2015, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2024, Positive cache size: 2024, Positive conditional cache size: 2017, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 2026, Positive conditional cache size: 2019, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2028, Positive cache size: 2028, Positive conditional cache size: 2021, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 2030, Positive conditional cache size: 2023, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2032, Positive cache size: 2032, Positive conditional cache size: 2025, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 2034, Positive conditional cache size: 2027, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2036, Positive cache size: 2036, Positive conditional cache size: 2029, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2038, Positive cache size: 2038, Positive conditional cache size: 2031, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2040, Positive cache size: 2040, Positive conditional cache size: 2033, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2042, Positive cache size: 2042, Positive conditional cache size: 2035, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2044, Positive cache size: 2044, Positive conditional cache size: 2037, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2046, Positive cache size: 2046, Positive conditional cache size: 2039, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2048, Positive cache size: 2048, Positive conditional cache size: 2041, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2050, Positive cache size: 2050, Positive conditional cache size: 2043, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2052, Positive cache size: 2052, Positive conditional cache size: 2045, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2054, Positive cache size: 2054, Positive conditional cache size: 2047, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2056, Positive cache size: 2056, Positive conditional cache size: 2049, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2058, Positive cache size: 2058, Positive conditional cache size: 2051, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2060, Positive cache size: 2060, Positive conditional cache size: 2053, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2062, Positive cache size: 2062, Positive conditional cache size: 2055, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2064, Positive cache size: 2064, Positive conditional cache size: 2057, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2066, Positive cache size: 2066, Positive conditional cache size: 2059, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2068, Positive cache size: 2068, Positive conditional cache size: 2061, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2070, Positive cache size: 2070, Positive conditional cache size: 2063, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2072, Positive cache size: 2072, Positive conditional cache size: 2065, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2074, Positive cache size: 2074, Positive conditional cache size: 2067, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2076, Positive cache size: 2076, Positive conditional cache size: 2069, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2078, Positive cache size: 2078, Positive conditional cache size: 2071, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2080, Positive cache size: 2080, Positive conditional cache size: 2073, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2082, Positive cache size: 2082, Positive conditional cache size: 2075, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 2084, Positive conditional cache size: 2077, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2086, Positive cache size: 2086, Positive conditional cache size: 2079, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2088, Positive cache size: 2088, Positive conditional cache size: 2081, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2090, Positive cache size: 2090, Positive conditional cache size: 2083, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2092, Positive cache size: 2092, Positive conditional cache size: 2085, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2094, Positive cache size: 2094, Positive conditional cache size: 2087, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2096, Positive cache size: 2096, Positive conditional cache size: 2089, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2098, Positive cache size: 2098, Positive conditional cache size: 2091, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2100, Positive cache size: 2100, Positive conditional cache size: 2093, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2102, Positive cache size: 2102, Positive conditional cache size: 2095, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2104, Positive cache size: 2104, Positive conditional cache size: 2097, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2106, Positive cache size: 2106, Positive conditional cache size: 2099, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2108, Positive cache size: 2108, Positive conditional cache size: 2101, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2110, Positive cache size: 2110, Positive conditional cache size: 2103, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2112, Positive cache size: 2112, Positive conditional cache size: 2105, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2114, Positive cache size: 2114, Positive conditional cache size: 2107, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2116, Positive cache size: 2116, Positive conditional cache size: 2109, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2118, Positive cache size: 2118, Positive conditional cache size: 2111, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2120, Positive cache size: 2120, Positive conditional cache size: 2113, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2122, Positive cache size: 2122, Positive conditional cache size: 2115, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2124, Positive cache size: 2124, Positive conditional cache size: 2117, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2126, Positive cache size: 2126, Positive conditional cache size: 2119, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2128, Positive cache size: 2128, Positive conditional cache size: 2121, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2130, Positive cache size: 2130, Positive conditional cache size: 2123, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2132, Positive cache size: 2132, Positive conditional cache size: 2125, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2134, Positive cache size: 2134, Positive conditional cache size: 2127, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2136, Positive cache size: 2136, Positive conditional cache size: 2129, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2138, Positive cache size: 2138, Positive conditional cache size: 2131, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2140, Positive cache size: 2140, Positive conditional cache size: 2133, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2142, Positive cache size: 2142, Positive conditional cache size: 2135, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2144, Positive cache size: 2144, Positive conditional cache size: 2137, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2146, Positive cache size: 2146, Positive conditional cache size: 2139, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2148, Positive cache size: 2148, Positive conditional cache size: 2141, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2150, Positive cache size: 2150, Positive conditional cache size: 2143, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2152, Positive cache size: 2152, Positive conditional cache size: 2145, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2154, Positive cache size: 2154, Positive conditional cache size: 2147, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2156, Positive cache size: 2156, Positive conditional cache size: 2149, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2158, Positive cache size: 2158, Positive conditional cache size: 2151, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2160, Positive cache size: 2160, Positive conditional cache size: 2153, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2162, Positive cache size: 2162, Positive conditional cache size: 2155, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2164, Positive cache size: 2164, Positive conditional cache size: 2157, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2166, Positive cache size: 2166, Positive conditional cache size: 2159, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2168, Positive cache size: 2168, Positive conditional cache size: 2161, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2170, Positive cache size: 2170, Positive conditional cache size: 2163, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2172, Positive cache size: 2172, Positive conditional cache size: 2165, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2174, Positive cache size: 2174, Positive conditional cache size: 2167, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2176, Positive cache size: 2176, Positive conditional cache size: 2169, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2178, Positive cache size: 2178, Positive conditional cache size: 2171, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2180, Positive cache size: 2180, Positive conditional cache size: 2173, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2182, Positive cache size: 2182, Positive conditional cache size: 2175, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2184, Positive cache size: 2184, Positive conditional cache size: 2177, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2186, Positive cache size: 2186, Positive conditional cache size: 2179, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2188, Positive cache size: 2188, Positive conditional cache size: 2181, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2190, Positive cache size: 2190, Positive conditional cache size: 2183, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2192, Positive cache size: 2192, Positive conditional cache size: 2185, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2194, Positive cache size: 2194, Positive conditional cache size: 2187, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2196, Positive cache size: 2196, Positive conditional cache size: 2189, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2198, Positive cache size: 2198, Positive conditional cache size: 2191, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2200, Positive cache size: 2200, Positive conditional cache size: 2193, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2202, Positive cache size: 2202, Positive conditional cache size: 2195, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2204, Positive cache size: 2204, Positive conditional cache size: 2197, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2206, Positive cache size: 2206, Positive conditional cache size: 2199, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2208, Positive cache size: 2208, Positive conditional cache size: 2201, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2210, Positive cache size: 2210, Positive conditional cache size: 2203, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2212, Positive cache size: 2212, Positive conditional cache size: 2205, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2214, Positive cache size: 2214, Positive conditional cache size: 2207, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2216, Positive cache size: 2216, Positive conditional cache size: 2209, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2218, Positive cache size: 2218, Positive conditional cache size: 2211, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2220, Positive cache size: 2220, Positive conditional cache size: 2213, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2222, Positive cache size: 2222, Positive conditional cache size: 2215, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2224, Positive cache size: 2224, Positive conditional cache size: 2217, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2226, Positive cache size: 2226, Positive conditional cache size: 2219, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2228, Positive cache size: 2228, Positive conditional cache size: 2221, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2230, Positive cache size: 2230, Positive conditional cache size: 2223, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2232, Positive cache size: 2232, Positive conditional cache size: 2225, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2234, Positive cache size: 2234, Positive conditional cache size: 2227, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2236, Positive cache size: 2236, Positive conditional cache size: 2229, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2238, Positive cache size: 2238, Positive conditional cache size: 2231, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2240, Positive cache size: 2240, Positive conditional cache size: 2233, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2242, Positive cache size: 2242, Positive conditional cache size: 2235, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2244, Positive cache size: 2244, Positive conditional cache size: 2237, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2246, Positive cache size: 2246, Positive conditional cache size: 2239, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2248, Positive cache size: 2248, Positive conditional cache size: 2241, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2250, Positive cache size: 2250, Positive conditional cache size: 2243, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2252, Positive cache size: 2252, Positive conditional cache size: 2245, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2254, Positive cache size: 2254, Positive conditional cache size: 2247, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2256, Positive cache size: 2256, Positive conditional cache size: 2249, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2258, Positive cache size: 2258, Positive conditional cache size: 2251, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2260, Positive cache size: 2260, Positive conditional cache size: 2253, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2262, Positive cache size: 2262, Positive conditional cache size: 2255, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2264, Positive cache size: 2264, Positive conditional cache size: 2257, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2266, Positive cache size: 2266, Positive conditional cache size: 2259, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2268, Positive cache size: 2268, Positive conditional cache size: 2261, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2270, Positive cache size: 2270, Positive conditional cache size: 2263, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2272, Positive cache size: 2272, Positive conditional cache size: 2265, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2274, Positive cache size: 2274, Positive conditional cache size: 2267, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2276, Positive cache size: 2276, Positive conditional cache size: 2269, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2278, Positive cache size: 2278, Positive conditional cache size: 2271, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2280, Positive cache size: 2280, Positive conditional cache size: 2273, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2282, Positive cache size: 2282, Positive conditional cache size: 2275, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2284, Positive cache size: 2284, Positive conditional cache size: 2277, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2286, Positive cache size: 2286, Positive conditional cache size: 2279, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2288, Positive cache size: 2288, Positive conditional cache size: 2281, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2290, Positive cache size: 2290, Positive conditional cache size: 2283, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2292, Positive cache size: 2292, Positive conditional cache size: 2285, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2294, Positive cache size: 2294, Positive conditional cache size: 2287, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2296, Positive cache size: 2296, Positive conditional cache size: 2289, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2298, Positive cache size: 2298, Positive conditional cache size: 2291, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2300, Positive cache size: 2300, Positive conditional cache size: 2293, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2302, Positive cache size: 2302, Positive conditional cache size: 2295, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2304, Positive cache size: 2304, Positive conditional cache size: 2297, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2306, Positive cache size: 2306, Positive conditional cache size: 2299, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2308, Positive cache size: 2308, Positive conditional cache size: 2301, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2310, Positive cache size: 2310, Positive conditional cache size: 2303, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2312, Positive cache size: 2312, Positive conditional cache size: 2305, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2314, Positive cache size: 2314, Positive conditional cache size: 2307, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2316, Positive cache size: 2316, Positive conditional cache size: 2309, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2318, Positive cache size: 2318, Positive conditional cache size: 2311, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2320, Positive cache size: 2320, Positive conditional cache size: 2313, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2322, Positive cache size: 2322, Positive conditional cache size: 2315, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2324, Positive cache size: 2324, Positive conditional cache size: 2317, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2326, Positive cache size: 2326, Positive conditional cache size: 2319, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2328, Positive cache size: 2328, Positive conditional cache size: 2321, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2330, Positive cache size: 2330, Positive conditional cache size: 2323, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2332, Positive cache size: 2332, Positive conditional cache size: 2325, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2334, Positive cache size: 2334, Positive conditional cache size: 2327, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2336, Positive cache size: 2336, Positive conditional cache size: 2329, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2338, Positive cache size: 2338, Positive conditional cache size: 2331, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2340, Positive cache size: 2340, Positive conditional cache size: 2333, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2342, Positive cache size: 2342, Positive conditional cache size: 2335, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2344, Positive cache size: 2344, Positive conditional cache size: 2337, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2346, Positive cache size: 2346, Positive conditional cache size: 2339, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2348, Positive cache size: 2348, Positive conditional cache size: 2341, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2350, Positive cache size: 2350, Positive conditional cache size: 2343, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2352, Positive cache size: 2352, Positive conditional cache size: 2345, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2354, Positive cache size: 2354, Positive conditional cache size: 2347, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2356, Positive cache size: 2356, Positive conditional cache size: 2349, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2358, Positive cache size: 2358, Positive conditional cache size: 2351, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2360, Positive cache size: 2360, Positive conditional cache size: 2353, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2362, Positive cache size: 2362, Positive conditional cache size: 2355, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2364, Positive cache size: 2364, Positive conditional cache size: 2357, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2366, Positive cache size: 2366, Positive conditional cache size: 2359, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2368, Positive conditional cache size: 2361, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2370, Positive cache size: 2370, Positive conditional cache size: 2363, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2372, Positive cache size: 2372, Positive conditional cache size: 2365, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2374, Positive cache size: 2374, Positive conditional cache size: 2367, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2376, Positive cache size: 2376, Positive conditional cache size: 2369, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2378, Positive cache size: 2378, Positive conditional cache size: 2371, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2380, Positive cache size: 2380, Positive conditional cache size: 2373, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2382, Positive cache size: 2382, Positive conditional cache size: 2375, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2384, Positive cache size: 2384, Positive conditional cache size: 2377, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2386, Positive cache size: 2386, Positive conditional cache size: 2379, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2388, Positive conditional cache size: 2381, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2390, Positive cache size: 2390, Positive conditional cache size: 2383, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2392, Positive cache size: 2392, Positive conditional cache size: 2385, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2394, Positive cache size: 2394, Positive conditional cache size: 2387, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2396, Positive cache size: 2396, Positive conditional cache size: 2389, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2398, Positive cache size: 2398, Positive conditional cache size: 2391, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2400, Positive cache size: 2400, Positive conditional cache size: 2393, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2402, Positive cache size: 2402, Positive conditional cache size: 2395, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2404, Positive cache size: 2404, Positive conditional cache size: 2397, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2406, Positive cache size: 2406, Positive conditional cache size: 2399, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2408, Positive cache size: 2408, Positive conditional cache size: 2401, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2410, Positive cache size: 2410, Positive conditional cache size: 2403, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2412, Positive cache size: 2412, Positive conditional cache size: 2405, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2414, Positive cache size: 2414, Positive conditional cache size: 2407, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2416, Positive cache size: 2416, Positive conditional cache size: 2409, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2418, Positive cache size: 2418, Positive conditional cache size: 2411, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2420, Positive cache size: 2420, Positive conditional cache size: 2413, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2422, Positive cache size: 2422, Positive conditional cache size: 2415, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2424, Positive cache size: 2424, Positive conditional cache size: 2417, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2426, Positive cache size: 2426, Positive conditional cache size: 2419, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2428, Positive cache size: 2428, Positive conditional cache size: 2421, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2430, Positive cache size: 2430, Positive conditional cache size: 2423, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2432, Positive cache size: 2432, Positive conditional cache size: 2425, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2434, Positive cache size: 2434, Positive conditional cache size: 2427, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2436, Positive cache size: 2436, Positive conditional cache size: 2429, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2438, Positive cache size: 2438, Positive conditional cache size: 2431, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2440, Positive cache size: 2440, Positive conditional cache size: 2433, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2442, Positive cache size: 2442, Positive conditional cache size: 2435, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2444, Positive cache size: 2444, Positive conditional cache size: 2437, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2446, Positive cache size: 2446, Positive conditional cache size: 2439, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2448, Positive cache size: 2448, Positive conditional cache size: 2441, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2450, Positive cache size: 2450, Positive conditional cache size: 2443, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2452, Positive cache size: 2452, Positive conditional cache size: 2445, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2454, Positive cache size: 2454, Positive conditional cache size: 2447, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2456, Positive cache size: 2456, Positive conditional cache size: 2449, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2458, Positive cache size: 2458, Positive conditional cache size: 2451, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2460, Positive cache size: 2460, Positive conditional cache size: 2453, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2462, Positive cache size: 2462, Positive conditional cache size: 2455, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2464, Positive cache size: 2464, Positive conditional cache size: 2457, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2466, Positive cache size: 2466, Positive conditional cache size: 2459, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2468, Positive cache size: 2468, Positive conditional cache size: 2461, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2470, Positive cache size: 2470, Positive conditional cache size: 2463, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2472, Positive cache size: 2472, Positive conditional cache size: 2465, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2474, Positive cache size: 2474, Positive conditional cache size: 2467, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2476, Positive cache size: 2476, Positive conditional cache size: 2469, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2478, Positive cache size: 2478, Positive conditional cache size: 2471, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2480, Positive cache size: 2480, Positive conditional cache size: 2473, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2482, Positive cache size: 2482, Positive conditional cache size: 2475, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2484, Positive cache size: 2484, Positive conditional cache size: 2477, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2486, Positive cache size: 2486, Positive conditional cache size: 2479, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2488, Positive cache size: 2488, Positive conditional cache size: 2481, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2490, Positive cache size: 2490, Positive conditional cache size: 2483, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2492, Positive cache size: 2492, Positive conditional cache size: 2485, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2494, Positive cache size: 2494, Positive conditional cache size: 2487, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2496, Positive cache size: 2496, Positive conditional cache size: 2489, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2498, Positive cache size: 2498, Positive conditional cache size: 2491, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2500, Positive cache size: 2500, Positive conditional cache size: 2493, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2502, Positive cache size: 2502, Positive conditional cache size: 2495, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2504, Positive cache size: 2504, Positive conditional cache size: 2497, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2506, Positive cache size: 2506, Positive conditional cache size: 2499, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2508, Positive cache size: 2508, Positive conditional cache size: 2501, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2510, Positive cache size: 2510, Positive conditional cache size: 2503, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2512, Positive cache size: 2512, Positive conditional cache size: 2505, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2514, Positive cache size: 2514, Positive conditional cache size: 2507, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2516, Positive cache size: 2516, Positive conditional cache size: 2509, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2518, Positive cache size: 2518, Positive conditional cache size: 2511, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2520, Positive cache size: 2520, Positive conditional cache size: 2513, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2522, Positive cache size: 2522, Positive conditional cache size: 2515, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2524, Positive cache size: 2524, Positive conditional cache size: 2517, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2526, Positive cache size: 2526, Positive conditional cache size: 2519, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2528, Positive cache size: 2528, Positive conditional cache size: 2521, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2530, Positive cache size: 2530, Positive conditional cache size: 2523, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2532, Positive conditional cache size: 2525, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2534, Positive cache size: 2534, Positive conditional cache size: 2527, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2536, Positive cache size: 2536, Positive conditional cache size: 2529, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2538, Positive cache size: 2538, Positive conditional cache size: 2531, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2540, Positive cache size: 2540, Positive conditional cache size: 2533, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2542, Positive cache size: 2542, Positive conditional cache size: 2535, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2544, Positive cache size: 2544, Positive conditional cache size: 2537, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2546, Positive cache size: 2546, Positive conditional cache size: 2539, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2548, Positive cache size: 2548, Positive conditional cache size: 2541, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2550, Positive cache size: 2550, Positive conditional cache size: 2543, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2552, Positive cache size: 2552, Positive conditional cache size: 2545, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2554, Positive cache size: 2554, Positive conditional cache size: 2547, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2556, Positive cache size: 2556, Positive conditional cache size: 2549, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2558, Positive cache size: 2558, Positive conditional cache size: 2551, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2560, Positive cache size: 2560, Positive conditional cache size: 2553, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2562, Positive cache size: 2562, Positive conditional cache size: 2555, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2564, Positive cache size: 2564, Positive conditional cache size: 2557, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2566, Positive cache size: 2566, Positive conditional cache size: 2559, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2568, Positive cache size: 2568, Positive conditional cache size: 2561, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2570, Positive cache size: 2570, Positive conditional cache size: 2563, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2572, Positive cache size: 2572, Positive conditional cache size: 2565, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2574, Positive cache size: 2574, Positive conditional cache size: 2567, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2576, Positive cache size: 2576, Positive conditional cache size: 2569, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2578, Positive cache size: 2578, Positive conditional cache size: 2571, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2580, Positive cache size: 2580, Positive conditional cache size: 2573, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2582, Positive cache size: 2582, Positive conditional cache size: 2575, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2584, Positive cache size: 2584, Positive conditional cache size: 2577, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2586, Positive cache size: 2586, Positive conditional cache size: 2579, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2588, Positive conditional cache size: 2581, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2590, Positive cache size: 2590, Positive conditional cache size: 2583, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2592, Positive cache size: 2592, Positive conditional cache size: 2585, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2594, Positive cache size: 2594, Positive conditional cache size: 2587, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2596, Positive cache size: 2596, Positive conditional cache size: 2589, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2598, Positive cache size: 2598, Positive conditional cache size: 2591, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2600, Positive cache size: 2600, Positive conditional cache size: 2593, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2602, Positive cache size: 2602, Positive conditional cache size: 2595, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2604, Positive cache size: 2604, Positive conditional cache size: 2597, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2606, Positive cache size: 2606, Positive conditional cache size: 2599, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2608, Positive cache size: 2608, Positive conditional cache size: 2601, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2610, Positive cache size: 2610, Positive conditional cache size: 2603, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2612, Positive cache size: 2612, Positive conditional cache size: 2605, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2614, Positive cache size: 2614, Positive conditional cache size: 2607, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2616, Positive cache size: 2616, Positive conditional cache size: 2609, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2618, Positive cache size: 2618, Positive conditional cache size: 2611, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2620, Positive cache size: 2620, Positive conditional cache size: 2613, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2622, Positive cache size: 2622, Positive conditional cache size: 2615, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2624, Positive cache size: 2624, Positive conditional cache size: 2617, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2626, Positive cache size: 2626, Positive conditional cache size: 2619, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2628, Positive cache size: 2628, Positive conditional cache size: 2621, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2630, Positive cache size: 2630, Positive conditional cache size: 2623, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2632, Positive cache size: 2632, Positive conditional cache size: 2625, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2634, Positive cache size: 2634, Positive conditional cache size: 2627, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2636, Positive cache size: 2636, Positive conditional cache size: 2629, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2638, Positive cache size: 2638, Positive conditional cache size: 2631, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2640, Positive cache size: 2640, Positive conditional cache size: 2633, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2642, Positive cache size: 2642, Positive conditional cache size: 2635, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2644, Positive cache size: 2644, Positive conditional cache size: 2637, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2646, Positive cache size: 2646, Positive conditional cache size: 2639, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2648, Positive cache size: 2648, Positive conditional cache size: 2641, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2650, Positive cache size: 2650, Positive conditional cache size: 2643, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2652, Positive cache size: 2652, Positive conditional cache size: 2645, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2654, Positive cache size: 2654, Positive conditional cache size: 2647, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2656, Positive cache size: 2656, Positive conditional cache size: 2649, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2658, Positive cache size: 2658, Positive conditional cache size: 2651, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2660, Positive cache size: 2660, Positive conditional cache size: 2653, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2662, Positive cache size: 2662, Positive conditional cache size: 2655, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2664, Positive cache size: 2664, Positive conditional cache size: 2657, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2666, Positive cache size: 2666, Positive conditional cache size: 2659, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2668, Positive cache size: 2668, Positive conditional cache size: 2661, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2670, Positive cache size: 2670, Positive conditional cache size: 2663, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2672, Positive cache size: 2672, Positive conditional cache size: 2665, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2674, Positive cache size: 2674, Positive conditional cache size: 2667, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2676, Positive cache size: 2676, Positive conditional cache size: 2669, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2678, Positive cache size: 2678, Positive conditional cache size: 2671, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2680, Positive cache size: 2680, Positive conditional cache size: 2673, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2682, Positive cache size: 2682, Positive conditional cache size: 2675, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2684, Positive cache size: 2684, Positive conditional cache size: 2677, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2686, Positive cache size: 2686, Positive conditional cache size: 2679, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2688, Positive cache size: 2688, Positive conditional cache size: 2681, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2690, Positive cache size: 2690, Positive conditional cache size: 2683, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2692, Positive cache size: 2692, Positive conditional cache size: 2685, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2694, Positive cache size: 2694, Positive conditional cache size: 2687, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2696, Positive cache size: 2696, Positive conditional cache size: 2689, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2698, Positive cache size: 2698, Positive conditional cache size: 2691, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2700, Positive cache size: 2700, Positive conditional cache size: 2693, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2702, Positive cache size: 2702, Positive conditional cache size: 2695, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2704, Positive cache size: 2704, Positive conditional cache size: 2697, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2706, Positive cache size: 2706, Positive conditional cache size: 2699, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2708, Positive cache size: 2708, Positive conditional cache size: 2701, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2710, Positive cache size: 2710, Positive conditional cache size: 2703, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2712, Positive cache size: 2712, Positive conditional cache size: 2705, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2714, Positive cache size: 2714, Positive conditional cache size: 2707, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2716, Positive cache size: 2716, Positive conditional cache size: 2709, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2718, Positive cache size: 2718, Positive conditional cache size: 2711, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2720, Positive cache size: 2720, Positive conditional cache size: 2713, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2722, Positive cache size: 2722, Positive conditional cache size: 2715, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2724, Positive cache size: 2724, Positive conditional cache size: 2717, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2726, Positive cache size: 2726, Positive conditional cache size: 2719, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2728, Positive cache size: 2728, Positive conditional cache size: 2721, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2730, Positive cache size: 2730, Positive conditional cache size: 2723, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2732, Positive cache size: 2732, Positive conditional cache size: 2725, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2734, Positive cache size: 2734, Positive conditional cache size: 2727, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2736, Positive cache size: 2736, Positive conditional cache size: 2729, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2738, Positive cache size: 2738, Positive conditional cache size: 2731, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2740, Positive cache size: 2740, Positive conditional cache size: 2733, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2742, Positive cache size: 2742, Positive conditional cache size: 2735, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2744, Positive cache size: 2744, Positive conditional cache size: 2737, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2746, Positive cache size: 2746, Positive conditional cache size: 2739, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2748, Positive cache size: 2748, Positive conditional cache size: 2741, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2750, Positive cache size: 2750, Positive conditional cache size: 2743, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2752, Positive cache size: 2752, Positive conditional cache size: 2745, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2754, Positive cache size: 2754, Positive conditional cache size: 2747, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2756, Positive cache size: 2756, Positive conditional cache size: 2749, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2758, Positive cache size: 2758, Positive conditional cache size: 2751, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2760, Positive cache size: 2760, Positive conditional cache size: 2753, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2762, Positive cache size: 2762, Positive conditional cache size: 2755, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2764, Positive cache size: 2764, Positive conditional cache size: 2757, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2766, Positive cache size: 2766, Positive conditional cache size: 2759, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2768, Positive cache size: 2768, Positive conditional cache size: 2761, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2770, Positive cache size: 2770, Positive conditional cache size: 2763, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2772, Positive cache size: 2772, Positive conditional cache size: 2765, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2774, Positive cache size: 2774, Positive conditional cache size: 2767, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2776, Positive cache size: 2776, Positive conditional cache size: 2769, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2778, Positive cache size: 2778, Positive conditional cache size: 2771, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2780, Positive cache size: 2780, Positive conditional cache size: 2773, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2782, Positive cache size: 2782, Positive conditional cache size: 2775, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2784, Positive cache size: 2784, Positive conditional cache size: 2777, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2786, Positive cache size: 2786, Positive conditional cache size: 2779, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2788, Positive cache size: 2788, Positive conditional cache size: 2781, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2790, Positive cache size: 2790, Positive conditional cache size: 2783, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2792, Positive cache size: 2792, Positive conditional cache size: 2785, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2794, Positive cache size: 2794, Positive conditional cache size: 2787, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2796, Positive cache size: 2796, Positive conditional cache size: 2789, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2798, Positive cache size: 2798, Positive conditional cache size: 2791, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2800, Positive cache size: 2800, Positive conditional cache size: 2793, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2802, Positive cache size: 2802, Positive conditional cache size: 2795, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2804, Positive cache size: 2804, Positive conditional cache size: 2797, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2806, Positive cache size: 2806, Positive conditional cache size: 2799, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2808, Positive cache size: 2808, Positive conditional cache size: 2801, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2810, Positive cache size: 2810, Positive conditional cache size: 2803, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2812, Positive cache size: 2812, Positive conditional cache size: 2805, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2814, Positive cache size: 2814, Positive conditional cache size: 2807, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2816, Positive cache size: 2816, Positive conditional cache size: 2809, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2818, Positive cache size: 2818, Positive conditional cache size: 2811, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2820, Positive cache size: 2820, Positive conditional cache size: 2813, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2822, Positive cache size: 2822, Positive conditional cache size: 2815, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2824, Positive cache size: 2824, Positive conditional cache size: 2817, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2826, Positive cache size: 2826, Positive conditional cache size: 2819, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2828, Positive cache size: 2828, Positive conditional cache size: 2821, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2830, Positive cache size: 2830, Positive conditional cache size: 2823, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2832, Positive cache size: 2832, Positive conditional cache size: 2825, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2834, Positive cache size: 2834, Positive conditional cache size: 2827, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2836, Positive cache size: 2836, Positive conditional cache size: 2829, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2838, Positive cache size: 2838, Positive conditional cache size: 2831, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2840, Positive cache size: 2840, Positive conditional cache size: 2833, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2842, Positive cache size: 2842, Positive conditional cache size: 2835, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2844, Positive cache size: 2844, Positive conditional cache size: 2837, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2846, Positive cache size: 2846, Positive conditional cache size: 2839, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2848, Positive cache size: 2848, Positive conditional cache size: 2841, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2850, Positive cache size: 2850, Positive conditional cache size: 2843, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2852, Positive cache size: 2852, Positive conditional cache size: 2845, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2854, Positive cache size: 2854, Positive conditional cache size: 2847, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2856, Positive cache size: 2856, Positive conditional cache size: 2849, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2858, Positive cache size: 2858, Positive conditional cache size: 2851, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2860, Positive cache size: 2860, Positive conditional cache size: 2853, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2862, Positive cache size: 2862, Positive conditional cache size: 2855, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2864, Positive cache size: 2864, Positive conditional cache size: 2857, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2866, Positive cache size: 2866, Positive conditional cache size: 2859, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2868, Positive cache size: 2868, Positive conditional cache size: 2861, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2870, Positive cache size: 2870, Positive conditional cache size: 2863, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2872, Positive cache size: 2872, Positive conditional cache size: 2865, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2874, Positive cache size: 2874, Positive conditional cache size: 2867, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2876, Positive cache size: 2876, Positive conditional cache size: 2869, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2878, Positive cache size: 2878, Positive conditional cache size: 2871, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2880, Positive cache size: 2880, Positive conditional cache size: 2873, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2882, Positive cache size: 2882, Positive conditional cache size: 2875, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2884, Positive cache size: 2884, Positive conditional cache size: 2877, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2886, Positive cache size: 2886, Positive conditional cache size: 2879, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2888, Positive cache size: 2888, Positive conditional cache size: 2881, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2890, Positive cache size: 2890, Positive conditional cache size: 2883, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2892, Positive cache size: 2892, Positive conditional cache size: 2885, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2894, Positive cache size: 2894, Positive conditional cache size: 2887, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2896, Positive cache size: 2896, Positive conditional cache size: 2889, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2898, Positive cache size: 2898, Positive conditional cache size: 2891, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2900, Positive cache size: 2900, Positive conditional cache size: 2893, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2902, Positive cache size: 2902, Positive conditional cache size: 2895, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2904, Positive cache size: 2904, Positive conditional cache size: 2897, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2906, Positive cache size: 2906, Positive conditional cache size: 2899, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2908, Positive cache size: 2908, Positive conditional cache size: 2901, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2910, Positive cache size: 2910, Positive conditional cache size: 2903, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2912, Positive cache size: 2912, Positive conditional cache size: 2905, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2914, Positive cache size: 2914, Positive conditional cache size: 2907, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2916, Positive cache size: 2916, Positive conditional cache size: 2909, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2918, Positive cache size: 2918, Positive conditional cache size: 2911, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2920, Positive cache size: 2920, Positive conditional cache size: 2913, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2922, Positive cache size: 2922, Positive conditional cache size: 2915, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2924, Positive cache size: 2924, Positive conditional cache size: 2917, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2926, Positive cache size: 2926, Positive conditional cache size: 2919, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2928, Positive cache size: 2928, Positive conditional cache size: 2921, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2930, Positive cache size: 2930, Positive conditional cache size: 2923, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2932, Positive cache size: 2932, Positive conditional cache size: 2925, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2934, Positive cache size: 2934, Positive conditional cache size: 2927, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2936, Positive cache size: 2936, Positive conditional cache size: 2929, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2938, Positive cache size: 2938, Positive conditional cache size: 2931, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2940, Positive cache size: 2940, Positive conditional cache size: 2933, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2942, Positive cache size: 2942, Positive conditional cache size: 2935, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2944, Positive cache size: 2944, Positive conditional cache size: 2937, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2946, Positive cache size: 2946, Positive conditional cache size: 2939, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2948, Positive cache size: 2948, Positive conditional cache size: 2941, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2950, Positive cache size: 2950, Positive conditional cache size: 2943, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2952, Positive cache size: 2952, Positive conditional cache size: 2945, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2954, Positive cache size: 2954, Positive conditional cache size: 2947, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2956, Positive cache size: 2956, Positive conditional cache size: 2949, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2958, Positive cache size: 2958, Positive conditional cache size: 2951, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2960, Positive cache size: 2960, Positive conditional cache size: 2953, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2962, Positive cache size: 2962, Positive conditional cache size: 2955, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2964, Positive cache size: 2964, Positive conditional cache size: 2957, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2966, Positive cache size: 2966, Positive conditional cache size: 2959, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2968, Positive cache size: 2968, Positive conditional cache size: 2961, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2970, Positive cache size: 2970, Positive conditional cache size: 2963, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2972, Positive cache size: 2972, Positive conditional cache size: 2965, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2974, Positive cache size: 2974, Positive conditional cache size: 2967, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2976, Positive cache size: 2976, Positive conditional cache size: 2969, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2978, Positive cache size: 2978, Positive conditional cache size: 2971, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2980, Positive cache size: 2980, Positive conditional cache size: 2973, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2982, Positive cache size: 2982, Positive conditional cache size: 2975, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2984, Positive cache size: 2984, Positive conditional cache size: 2977, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2986, Positive cache size: 2986, Positive conditional cache size: 2979, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2988, Positive cache size: 2988, Positive conditional cache size: 2981, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2990, Positive cache size: 2990, Positive conditional cache size: 2983, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2992, Positive cache size: 2992, Positive conditional cache size: 2985, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2994, Positive cache size: 2994, Positive conditional cache size: 2987, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2996, Positive cache size: 2996, Positive conditional cache size: 2989, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2998, Positive cache size: 2998, Positive conditional cache size: 2991, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3000, Positive cache size: 3000, Positive conditional cache size: 2993, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3002, Positive cache size: 3002, Positive conditional cache size: 2995, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3004, Positive cache size: 3004, Positive conditional cache size: 2997, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3006, Positive cache size: 3006, Positive conditional cache size: 2999, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3008, Positive cache size: 3008, Positive conditional cache size: 3001, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3010, Positive cache size: 3010, Positive conditional cache size: 3003, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3012, Positive cache size: 3012, Positive conditional cache size: 3005, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3014, Positive cache size: 3014, Positive conditional cache size: 3007, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3016, Positive cache size: 3016, Positive conditional cache size: 3009, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3018, Positive cache size: 3018, Positive conditional cache size: 3011, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3020, Positive cache size: 3020, Positive conditional cache size: 3013, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3022, Positive cache size: 3022, Positive conditional cache size: 3015, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3024, Positive cache size: 3024, Positive conditional cache size: 3017, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3026, Positive cache size: 3026, Positive conditional cache size: 3019, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 3028, Positive conditional cache size: 3021, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3030, Positive cache size: 3030, Positive conditional cache size: 3023, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3032, Positive cache size: 3032, Positive conditional cache size: 3025, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3034, Positive cache size: 3034, Positive conditional cache size: 3027, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3036, Positive cache size: 3036, Positive conditional cache size: 3029, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3038, Positive cache size: 3038, Positive conditional cache size: 3031, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3040, Positive cache size: 3040, Positive conditional cache size: 3033, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3042, Positive cache size: 3042, Positive conditional cache size: 3035, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3044, Positive cache size: 3044, Positive conditional cache size: 3037, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3046, Positive cache size: 3046, Positive conditional cache size: 3039, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3048, Positive cache size: 3048, Positive conditional cache size: 3041, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3050, Positive cache size: 3050, Positive conditional cache size: 3043, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3052, Positive cache size: 3052, Positive conditional cache size: 3045, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3054, Positive cache size: 3054, Positive conditional cache size: 3047, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3056, Positive cache size: 3056, Positive conditional cache size: 3049, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3058, Positive cache size: 3058, Positive conditional cache size: 3051, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3060, Positive cache size: 3060, Positive conditional cache size: 3053, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3062, Positive cache size: 3062, Positive conditional cache size: 3055, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3064, Positive cache size: 3064, Positive conditional cache size: 3057, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3066, Positive cache size: 3066, Positive conditional cache size: 3059, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3068, Positive cache size: 3068, Positive conditional cache size: 3061, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3070, Positive cache size: 3070, Positive conditional cache size: 3063, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3072, Positive cache size: 3072, Positive conditional cache size: 3065, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3074, Positive cache size: 3074, Positive conditional cache size: 3067, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3076, Positive cache size: 3076, Positive conditional cache size: 3069, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3078, Positive cache size: 3078, Positive conditional cache size: 3071, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3080, Positive cache size: 3080, Positive conditional cache size: 3073, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3082, Positive cache size: 3082, Positive conditional cache size: 3075, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3084, Positive cache size: 3084, Positive conditional cache size: 3077, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3086, Positive cache size: 3086, Positive conditional cache size: 3079, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3088, Positive cache size: 3088, Positive conditional cache size: 3081, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3090, Positive cache size: 3090, Positive conditional cache size: 3083, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3092, Positive cache size: 3092, Positive conditional cache size: 3085, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3094, Positive cache size: 3094, Positive conditional cache size: 3087, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3096, Positive cache size: 3096, Positive conditional cache size: 3089, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3098, Positive cache size: 3098, Positive conditional cache size: 3091, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3100, Positive cache size: 3100, Positive conditional cache size: 3093, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3102, Positive cache size: 3102, Positive conditional cache size: 3095, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3104, Positive cache size: 3104, Positive conditional cache size: 3097, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3106, Positive cache size: 3106, Positive conditional cache size: 3099, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3108, Positive cache size: 3108, Positive conditional cache size: 3101, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3110, Positive cache size: 3110, Positive conditional cache size: 3103, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3112, Positive cache size: 3112, Positive conditional cache size: 3105, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3114, Positive cache size: 3114, Positive conditional cache size: 3107, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3116, Positive cache size: 3116, Positive conditional cache size: 3109, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3118, Positive cache size: 3118, Positive conditional cache size: 3111, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3120, Positive cache size: 3120, Positive conditional cache size: 3113, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3122, Positive cache size: 3122, Positive conditional cache size: 3115, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3124, Positive cache size: 3124, Positive conditional cache size: 3117, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3126, Positive cache size: 3126, Positive conditional cache size: 3119, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3128, Positive cache size: 3128, Positive conditional cache size: 3121, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3130, Positive cache size: 3130, Positive conditional cache size: 3123, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3132, Positive cache size: 3132, Positive conditional cache size: 3125, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3134, Positive cache size: 3134, Positive conditional cache size: 3127, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3136, Positive cache size: 3136, Positive conditional cache size: 3129, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3138, Positive cache size: 3138, Positive conditional cache size: 3131, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3140, Positive cache size: 3140, Positive conditional cache size: 3133, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3142, Positive cache size: 3142, Positive conditional cache size: 3135, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3144, Positive cache size: 3144, Positive conditional cache size: 3137, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3146, Positive cache size: 3146, Positive conditional cache size: 3139, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3148, Positive cache size: 3148, Positive conditional cache size: 3141, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3150, Positive cache size: 3150, Positive conditional cache size: 3143, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3152, Positive cache size: 3152, Positive conditional cache size: 3145, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3154, Positive cache size: 3154, Positive conditional cache size: 3147, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3156, Positive cache size: 3156, Positive conditional cache size: 3149, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3158, Positive cache size: 3158, Positive conditional cache size: 3151, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3160, Positive cache size: 3160, Positive conditional cache size: 3153, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3162, Positive cache size: 3162, Positive conditional cache size: 3155, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3164, Positive cache size: 3164, Positive conditional cache size: 3157, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3166, Positive cache size: 3166, Positive conditional cache size: 3159, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3168, Positive cache size: 3168, Positive conditional cache size: 3161, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3170, Positive cache size: 3170, Positive conditional cache size: 3163, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3172, Positive cache size: 3172, Positive conditional cache size: 3165, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3174, Positive cache size: 3174, Positive conditional cache size: 3167, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3176, Positive cache size: 3176, Positive conditional cache size: 3169, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3178, Positive cache size: 3178, Positive conditional cache size: 3171, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3180, Positive cache size: 3180, Positive conditional cache size: 3173, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3182, Positive cache size: 3182, Positive conditional cache size: 3175, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3184, Positive cache size: 3184, Positive conditional cache size: 3177, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3186, Positive cache size: 3186, Positive conditional cache size: 3179, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3188, Positive cache size: 3188, Positive conditional cache size: 3181, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3190, Positive cache size: 3190, Positive conditional cache size: 3183, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3192, Positive cache size: 3192, Positive conditional cache size: 3185, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3194, Positive cache size: 3194, Positive conditional cache size: 3187, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3196, Positive cache size: 3196, Positive conditional cache size: 3189, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3198, Positive cache size: 3198, Positive conditional cache size: 3191, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3200, Positive cache size: 3200, Positive conditional cache size: 3193, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3202, Positive cache size: 3202, Positive conditional cache size: 3195, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3204, Positive cache size: 3204, Positive conditional cache size: 3197, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3206, Positive cache size: 3206, Positive conditional cache size: 3199, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3208, Positive cache size: 3208, Positive conditional cache size: 3201, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3210, Positive cache size: 3210, Positive conditional cache size: 3203, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3212, Positive cache size: 3212, Positive conditional cache size: 3205, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3214, Positive cache size: 3214, Positive conditional cache size: 3207, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3216, Positive cache size: 3216, Positive conditional cache size: 3209, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3218, Positive cache size: 3218, Positive conditional cache size: 3211, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3220, Positive cache size: 3220, Positive conditional cache size: 3213, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3222, Positive cache size: 3222, Positive conditional cache size: 3215, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3224, Positive cache size: 3224, Positive conditional cache size: 3217, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3226, Positive cache size: 3226, Positive conditional cache size: 3219, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3228, Positive cache size: 3228, Positive conditional cache size: 3221, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3230, Positive cache size: 3230, Positive conditional cache size: 3223, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3232, Positive cache size: 3232, Positive conditional cache size: 3225, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3234, Positive cache size: 3234, Positive conditional cache size: 3227, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3236, Positive cache size: 3236, Positive conditional cache size: 3229, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3238, Positive cache size: 3238, Positive conditional cache size: 3231, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3240, Positive cache size: 3240, Positive conditional cache size: 3233, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3242, Positive cache size: 3242, Positive conditional cache size: 3235, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3244, Positive cache size: 3244, Positive conditional cache size: 3237, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3246, Positive cache size: 3246, Positive conditional cache size: 3239, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3248, Positive cache size: 3248, Positive conditional cache size: 3241, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3250, Positive cache size: 3250, Positive conditional cache size: 3243, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3252, Positive cache size: 3252, Positive conditional cache size: 3245, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3254, Positive cache size: 3254, Positive conditional cache size: 3247, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3256, Positive cache size: 3256, Positive conditional cache size: 3249, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3258, Positive cache size: 3258, Positive conditional cache size: 3251, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3260, Positive cache size: 3260, Positive conditional cache size: 3253, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3262, Positive cache size: 3262, Positive conditional cache size: 3255, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3264, Positive cache size: 3264, Positive conditional cache size: 3257, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3266, Positive cache size: 3266, Positive conditional cache size: 3259, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3268, Positive cache size: 3268, Positive conditional cache size: 3261, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3270, Positive cache size: 3270, Positive conditional cache size: 3263, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3272, Positive cache size: 3272, Positive conditional cache size: 3265, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3274, Positive cache size: 3274, Positive conditional cache size: 3267, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3276, Positive cache size: 3276, Positive conditional cache size: 3269, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3278, Positive cache size: 3278, Positive conditional cache size: 3271, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3280, Positive cache size: 3280, Positive conditional cache size: 3273, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3282, Positive cache size: 3282, Positive conditional cache size: 3275, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3284, Positive cache size: 3284, Positive conditional cache size: 3277, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3286, Positive cache size: 3286, Positive conditional cache size: 3279, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3288, Positive cache size: 3288, Positive conditional cache size: 3281, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3290, Positive cache size: 3290, Positive conditional cache size: 3283, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3292, Positive cache size: 3292, Positive conditional cache size: 3285, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3294, Positive cache size: 3294, Positive conditional cache size: 3287, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3296, Positive cache size: 3296, Positive conditional cache size: 3289, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3298, Positive cache size: 3298, Positive conditional cache size: 3291, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3300, Positive cache size: 3300, Positive conditional cache size: 3293, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3302, Positive cache size: 3302, Positive conditional cache size: 3295, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3304, Positive cache size: 3304, Positive conditional cache size: 3297, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3306, Positive cache size: 3306, Positive conditional cache size: 3299, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3308, Positive cache size: 3308, Positive conditional cache size: 3301, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3310, Positive cache size: 3310, Positive conditional cache size: 3303, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3312, Positive cache size: 3312, Positive conditional cache size: 3305, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3314, Positive cache size: 3314, Positive conditional cache size: 3307, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3316, Positive cache size: 3316, Positive conditional cache size: 3309, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3318, Positive cache size: 3318, Positive conditional cache size: 3311, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3320, Positive cache size: 3320, Positive conditional cache size: 3313, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3322, Positive cache size: 3322, Positive conditional cache size: 3315, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3324, Positive cache size: 3324, Positive conditional cache size: 3317, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3326, Positive cache size: 3326, Positive conditional cache size: 3319, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3328, Positive cache size: 3328, Positive conditional cache size: 3321, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3330, Positive cache size: 3330, Positive conditional cache size: 3323, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3332, Positive cache size: 3332, Positive conditional cache size: 3325, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3334, Positive cache size: 3334, Positive conditional cache size: 3327, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3336, Positive cache size: 3336, Positive conditional cache size: 3329, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3338, Positive cache size: 3338, Positive conditional cache size: 3331, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3340, Positive cache size: 3340, Positive conditional cache size: 3333, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3342, Positive cache size: 3342, Positive conditional cache size: 3335, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3344, Positive cache size: 3344, Positive conditional cache size: 3337, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3346, Positive cache size: 3346, Positive conditional cache size: 3339, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3348, Positive cache size: 3348, Positive conditional cache size: 3341, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3350, Positive cache size: 3350, Positive conditional cache size: 3343, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3352, Positive cache size: 3352, Positive conditional cache size: 3345, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3354, Positive cache size: 3354, Positive conditional cache size: 3347, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3356, Positive cache size: 3356, Positive conditional cache size: 3349, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3358, Positive cache size: 3358, Positive conditional cache size: 3351, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3360, Positive cache size: 3360, Positive conditional cache size: 3353, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3362, Positive cache size: 3362, Positive conditional cache size: 3355, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3364, Positive cache size: 3364, Positive conditional cache size: 3357, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3366, Positive cache size: 3366, Positive conditional cache size: 3359, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3368, Positive cache size: 3368, Positive conditional cache size: 3361, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3370, Positive cache size: 3370, Positive conditional cache size: 3363, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3372, Positive cache size: 3372, Positive conditional cache size: 3365, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3374, Positive cache size: 3374, Positive conditional cache size: 3367, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3376, Positive cache size: 3376, Positive conditional cache size: 3369, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3378, Positive cache size: 3378, Positive conditional cache size: 3371, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3380, Positive cache size: 3380, Positive conditional cache size: 3373, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3382, Positive cache size: 3382, Positive conditional cache size: 3375, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3384, Positive cache size: 3384, Positive conditional cache size: 3377, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3386, Positive cache size: 3386, Positive conditional cache size: 3379, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3388, Positive cache size: 3388, Positive conditional cache size: 3381, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3390, Positive cache size: 3390, Positive conditional cache size: 3383, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3392, Positive cache size: 3392, Positive conditional cache size: 3385, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3394, Positive cache size: 3394, Positive conditional cache size: 3387, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3396, Positive cache size: 3396, Positive conditional cache size: 3389, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3398, Positive cache size: 3398, Positive conditional cache size: 3391, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3400, Positive cache size: 3400, Positive conditional cache size: 3393, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3402, Positive cache size: 3402, Positive conditional cache size: 3395, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3404, Positive cache size: 3404, Positive conditional cache size: 3397, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3406, Positive cache size: 3406, Positive conditional cache size: 3399, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3408, Positive cache size: 3408, Positive conditional cache size: 3401, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3410, Positive cache size: 3410, Positive conditional cache size: 3403, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3412, Positive cache size: 3412, Positive conditional cache size: 3405, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3414, Positive cache size: 3414, Positive conditional cache size: 3407, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3416, Positive cache size: 3416, Positive conditional cache size: 3409, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3418, Positive cache size: 3418, Positive conditional cache size: 3411, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3420, Positive cache size: 3420, Positive conditional cache size: 3413, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3422, Positive cache size: 3422, Positive conditional cache size: 3415, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3424, Positive cache size: 3424, Positive conditional cache size: 3417, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3426, Positive cache size: 3426, Positive conditional cache size: 3419, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3428, Positive cache size: 3428, Positive conditional cache size: 3421, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3430, Positive cache size: 3430, Positive conditional cache size: 3423, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3432, Positive cache size: 3432, Positive conditional cache size: 3425, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3434, Positive cache size: 3434, Positive conditional cache size: 3427, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3436, Positive cache size: 3436, Positive conditional cache size: 3429, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3438, Positive cache size: 3438, Positive conditional cache size: 3431, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3440, Positive cache size: 3440, Positive conditional cache size: 3433, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3442, Positive cache size: 3442, Positive conditional cache size: 3435, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3444, Positive cache size: 3444, Positive conditional cache size: 3437, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3446, Positive cache size: 3446, Positive conditional cache size: 3439, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3448, Positive cache size: 3448, Positive conditional cache size: 3441, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3450, Positive cache size: 3450, Positive conditional cache size: 3443, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3452, Positive cache size: 3452, Positive conditional cache size: 3445, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3454, Positive cache size: 3454, Positive conditional cache size: 3447, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3456, Positive cache size: 3456, Positive conditional cache size: 3449, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3458, Positive cache size: 3458, Positive conditional cache size: 3451, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3460, Positive cache size: 3460, Positive conditional cache size: 3453, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3462, Positive cache size: 3462, Positive conditional cache size: 3455, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3464, Positive cache size: 3464, Positive conditional cache size: 3457, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3466, Positive cache size: 3466, Positive conditional cache size: 3459, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3468, Positive cache size: 3468, Positive conditional cache size: 3461, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3470, Positive cache size: 3470, Positive conditional cache size: 3463, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3472, Positive cache size: 3472, Positive conditional cache size: 3465, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3474, Positive cache size: 3474, Positive conditional cache size: 3467, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3476, Positive cache size: 3476, Positive conditional cache size: 3469, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3478, Positive cache size: 3478, Positive conditional cache size: 3471, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3480, Positive cache size: 3480, Positive conditional cache size: 3473, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3482, Positive cache size: 3482, Positive conditional cache size: 3475, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3484, Positive cache size: 3484, Positive conditional cache size: 3477, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3486, Positive cache size: 3486, Positive conditional cache size: 3479, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3488, Positive cache size: 3488, Positive conditional cache size: 3481, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3490, Positive cache size: 3490, Positive conditional cache size: 3483, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3492, Positive cache size: 3492, Positive conditional cache size: 3485, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3494, Positive cache size: 3494, Positive conditional cache size: 3487, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3496, Positive cache size: 3496, Positive conditional cache size: 3489, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3498, Positive cache size: 3498, Positive conditional cache size: 3491, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3500, Positive cache size: 3500, Positive conditional cache size: 3493, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3502, Positive cache size: 3502, Positive conditional cache size: 3495, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3504, Positive cache size: 3504, Positive conditional cache size: 3497, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3506, Positive cache size: 3506, Positive conditional cache size: 3499, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3508, Positive cache size: 3508, Positive conditional cache size: 3501, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3510, Positive cache size: 3510, Positive conditional cache size: 3503, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3512, Positive cache size: 3512, Positive conditional cache size: 3505, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3514, Positive cache size: 3514, Positive conditional cache size: 3507, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3516, Positive cache size: 3516, Positive conditional cache size: 3509, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3518, Positive cache size: 3518, Positive conditional cache size: 3511, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3520, Positive cache size: 3520, Positive conditional cache size: 3513, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3522, Positive cache size: 3522, Positive conditional cache size: 3515, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3524, Positive cache size: 3524, Positive conditional cache size: 3517, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3526, Positive cache size: 3526, Positive conditional cache size: 3519, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3528, Positive cache size: 3528, Positive conditional cache size: 3521, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3530, Positive cache size: 3530, Positive conditional cache size: 3523, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3532, Positive cache size: 3532, Positive conditional cache size: 3525, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3534, Positive cache size: 3534, Positive conditional cache size: 3527, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3536, Positive cache size: 3536, Positive conditional cache size: 3529, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3538, Positive cache size: 3538, Positive conditional cache size: 3531, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3540, Positive cache size: 3540, Positive conditional cache size: 3533, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3542, Positive cache size: 3542, Positive conditional cache size: 3535, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3544, Positive cache size: 3544, Positive conditional cache size: 3537, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3546, Positive cache size: 3546, Positive conditional cache size: 3539, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3548, Positive cache size: 3548, Positive conditional cache size: 3541, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3550, Positive cache size: 3550, Positive conditional cache size: 3543, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3552, Positive cache size: 3552, Positive conditional cache size: 3545, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3554, Positive cache size: 3554, Positive conditional cache size: 3547, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3556, Positive cache size: 3556, Positive conditional cache size: 3549, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3558, Positive cache size: 3558, Positive conditional cache size: 3551, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3560, Positive cache size: 3560, Positive conditional cache size: 3553, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3562, Positive cache size: 3562, Positive conditional cache size: 3555, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3564, Positive cache size: 3564, Positive conditional cache size: 3557, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3566, Positive cache size: 3566, Positive conditional cache size: 3559, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3568, Positive cache size: 3568, Positive conditional cache size: 3561, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3570, Positive cache size: 3570, Positive conditional cache size: 3563, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3572, Positive cache size: 3572, Positive conditional cache size: 3565, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3574, Positive cache size: 3574, Positive conditional cache size: 3567, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3576, Positive cache size: 3576, Positive conditional cache size: 3569, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3578, Positive cache size: 3578, Positive conditional cache size: 3571, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3580, Positive cache size: 3580, Positive conditional cache size: 3573, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3582, Positive cache size: 3582, Positive conditional cache size: 3575, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3584, Positive cache size: 3584, Positive conditional cache size: 3577, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3586, Positive cache size: 3586, Positive conditional cache size: 3579, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3588, Positive cache size: 3588, Positive conditional cache size: 3581, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3590, Positive cache size: 3590, Positive conditional cache size: 3583, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3592, Positive cache size: 3592, Positive conditional cache size: 3585, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3594, Positive cache size: 3594, Positive conditional cache size: 3587, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3596, Positive cache size: 3596, Positive conditional cache size: 3589, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3598, Positive cache size: 3598, Positive conditional cache size: 3591, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3600, Positive cache size: 3600, Positive conditional cache size: 3593, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3602, Positive cache size: 3602, Positive conditional cache size: 3595, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3604, Positive cache size: 3604, Positive conditional cache size: 3597, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3606, Positive cache size: 3606, Positive conditional cache size: 3599, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3608, Positive cache size: 3608, Positive conditional cache size: 3601, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3610, Positive cache size: 3610, Positive conditional cache size: 3603, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3612, Positive cache size: 3612, Positive conditional cache size: 3605, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3614, Positive cache size: 3614, Positive conditional cache size: 3607, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3616, Positive cache size: 3616, Positive conditional cache size: 3609, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3618, Positive cache size: 3618, Positive conditional cache size: 3611, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3620, Positive cache size: 3620, Positive conditional cache size: 3613, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3622, Positive cache size: 3622, Positive conditional cache size: 3615, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3624, Positive cache size: 3624, Positive conditional cache size: 3617, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3626, Positive cache size: 3626, Positive conditional cache size: 3619, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3628, Positive cache size: 3628, Positive conditional cache size: 3621, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3630, Positive cache size: 3630, Positive conditional cache size: 3623, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3632, Positive cache size: 3632, Positive conditional cache size: 3625, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3634, Positive cache size: 3634, Positive conditional cache size: 3627, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3636, Positive cache size: 3636, Positive conditional cache size: 3629, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3638, Positive cache size: 3638, Positive conditional cache size: 3631, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3640, Positive cache size: 3640, Positive conditional cache size: 3633, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3642, Positive cache size: 3642, Positive conditional cache size: 3635, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3644, Positive cache size: 3644, Positive conditional cache size: 3637, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3646, Positive cache size: 3646, Positive conditional cache size: 3639, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3648, Positive cache size: 3648, Positive conditional cache size: 3641, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3650, Positive cache size: 3650, Positive conditional cache size: 3643, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3652, Positive cache size: 3652, Positive conditional cache size: 3645, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3654, Positive cache size: 3654, Positive conditional cache size: 3647, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3656, Positive cache size: 3656, Positive conditional cache size: 3649, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3658, Positive cache size: 3658, Positive conditional cache size: 3651, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3660, Positive cache size: 3660, Positive conditional cache size: 3653, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3662, Positive cache size: 3662, Positive conditional cache size: 3655, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3664, Positive cache size: 3664, Positive conditional cache size: 3657, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3666, Positive cache size: 3666, Positive conditional cache size: 3659, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3668, Positive cache size: 3668, Positive conditional cache size: 3661, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3670, Positive cache size: 3670, Positive conditional cache size: 3663, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3672, Positive cache size: 3672, Positive conditional cache size: 3665, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3674, Positive cache size: 3674, Positive conditional cache size: 3667, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3676, Positive cache size: 3676, Positive conditional cache size: 3669, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3678, Positive cache size: 3678, Positive conditional cache size: 3671, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3680, Positive cache size: 3680, Positive conditional cache size: 3673, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3682, Positive cache size: 3682, Positive conditional cache size: 3675, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3684, Positive cache size: 3684, Positive conditional cache size: 3677, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3686, Positive cache size: 3686, Positive conditional cache size: 3679, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3688, Positive cache size: 3688, Positive conditional cache size: 3681, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3690, Positive cache size: 3690, Positive conditional cache size: 3683, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3692, Positive cache size: 3692, Positive conditional cache size: 3685, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3694, Positive cache size: 3694, Positive conditional cache size: 3687, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3696, Positive cache size: 3696, Positive conditional cache size: 3689, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3698, Positive cache size: 3698, Positive conditional cache size: 3691, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3700, Positive cache size: 3700, Positive conditional cache size: 3693, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3702, Positive cache size: 3702, Positive conditional cache size: 3695, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3704, Positive cache size: 3704, Positive conditional cache size: 3697, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3706, Positive cache size: 3706, Positive conditional cache size: 3699, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3708, Positive cache size: 3708, Positive conditional cache size: 3701, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3710, Positive cache size: 3710, Positive conditional cache size: 3703, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3712, Positive cache size: 3712, Positive conditional cache size: 3705, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3714, Positive cache size: 3714, Positive conditional cache size: 3707, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3716, Positive cache size: 3716, Positive conditional cache size: 3709, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3718, Positive cache size: 3718, Positive conditional cache size: 3711, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3720, Positive cache size: 3720, Positive conditional cache size: 3713, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3722, Positive cache size: 3722, Positive conditional cache size: 3715, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3724, Positive cache size: 3724, Positive conditional cache size: 3717, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3726, Positive cache size: 3726, Positive conditional cache size: 3719, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3728, Positive cache size: 3728, Positive conditional cache size: 3721, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3730, Positive cache size: 3730, Positive conditional cache size: 3723, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3732, Positive cache size: 3732, Positive conditional cache size: 3725, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3734, Positive cache size: 3734, Positive conditional cache size: 3727, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3736, Positive cache size: 3736, Positive conditional cache size: 3729, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3738, Positive cache size: 3738, Positive conditional cache size: 3731, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3740, Positive cache size: 3740, Positive conditional cache size: 3733, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3742, Positive cache size: 3742, Positive conditional cache size: 3735, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3744, Positive cache size: 3744, Positive conditional cache size: 3737, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3746, Positive cache size: 3746, Positive conditional cache size: 3739, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3748, Positive cache size: 3748, Positive conditional cache size: 3741, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3750, Positive cache size: 3750, Positive conditional cache size: 3743, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3752, Positive cache size: 3752, Positive conditional cache size: 3745, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3754, Positive cache size: 3754, Positive conditional cache size: 3747, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3756, Positive cache size: 3756, Positive conditional cache size: 3749, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3758, Positive cache size: 3758, Positive conditional cache size: 3751, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3760, Positive cache size: 3760, Positive conditional cache size: 3753, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3762, Positive cache size: 3762, Positive conditional cache size: 3755, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3764, Positive cache size: 3764, Positive conditional cache size: 3757, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3766, Positive cache size: 3766, Positive conditional cache size: 3759, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3768, Positive cache size: 3768, Positive conditional cache size: 3761, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3770, Positive cache size: 3770, Positive conditional cache size: 3763, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3772, Positive cache size: 3772, Positive conditional cache size: 3765, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3774, Positive cache size: 3774, Positive conditional cache size: 3767, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3776, Positive cache size: 3776, Positive conditional cache size: 3769, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3778, Positive cache size: 3778, Positive conditional cache size: 3771, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3780, Positive cache size: 3780, Positive conditional cache size: 3773, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3782, Positive cache size: 3782, Positive conditional cache size: 3775, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3784, Positive cache size: 3784, Positive conditional cache size: 3777, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3786, Positive cache size: 3786, Positive conditional cache size: 3779, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3788, Positive cache size: 3788, Positive conditional cache size: 3781, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3790, Positive cache size: 3790, Positive conditional cache size: 3783, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3792, Positive cache size: 3792, Positive conditional cache size: 3785, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3794, Positive cache size: 3794, Positive conditional cache size: 3787, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3796, Positive cache size: 3796, Positive conditional cache size: 3789, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3798, Positive cache size: 3798, Positive conditional cache size: 3791, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3800, Positive cache size: 3800, Positive conditional cache size: 3793, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3802, Positive cache size: 3802, Positive conditional cache size: 3795, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3804, Positive cache size: 3804, Positive conditional cache size: 3797, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3806, Positive cache size: 3806, Positive conditional cache size: 3799, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3808, Positive cache size: 3808, Positive conditional cache size: 3801, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3810, Positive cache size: 3810, Positive conditional cache size: 3803, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3812, Positive cache size: 3812, Positive conditional cache size: 3805, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3814, Positive cache size: 3814, Positive conditional cache size: 3807, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3816, Positive cache size: 3816, Positive conditional cache size: 3809, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3818, Positive cache size: 3818, Positive conditional cache size: 3811, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3820, Positive cache size: 3820, Positive conditional cache size: 3813, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3822, Positive cache size: 3822, Positive conditional cache size: 3815, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3824, Positive cache size: 3824, Positive conditional cache size: 3817, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3826, Positive cache size: 3826, Positive conditional cache size: 3819, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3828, Positive cache size: 3828, Positive conditional cache size: 3821, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3830, Positive cache size: 3830, Positive conditional cache size: 3823, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3832, Positive cache size: 3832, Positive conditional cache size: 3825, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3834, Positive cache size: 3834, Positive conditional cache size: 3827, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3836, Positive cache size: 3836, Positive conditional cache size: 3829, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3838, Positive cache size: 3838, Positive conditional cache size: 3831, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3840, Positive cache size: 3840, Positive conditional cache size: 3833, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3842, Positive cache size: 3842, Positive conditional cache size: 3835, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3844, Positive cache size: 3844, Positive conditional cache size: 3837, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3846, Positive cache size: 3846, Positive conditional cache size: 3839, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3848, Positive cache size: 3848, Positive conditional cache size: 3841, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3850, Positive cache size: 3850, Positive conditional cache size: 3843, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3852, Positive cache size: 3852, Positive conditional cache size: 3845, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3854, Positive cache size: 3854, Positive conditional cache size: 3847, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3856, Positive cache size: 3856, Positive conditional cache size: 3849, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3858, Positive cache size: 3858, Positive conditional cache size: 3851, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3860, Positive cache size: 3860, Positive conditional cache size: 3853, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3862, Positive cache size: 3862, Positive conditional cache size: 3855, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3864, Positive cache size: 3864, Positive conditional cache size: 3857, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3866, Positive cache size: 3866, Positive conditional cache size: 3859, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3868, Positive cache size: 3868, Positive conditional cache size: 3861, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3870, Positive cache size: 3870, Positive conditional cache size: 3863, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3872, Positive cache size: 3872, Positive conditional cache size: 3865, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3874, Positive cache size: 3874, Positive conditional cache size: 3867, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3876, Positive cache size: 3876, Positive conditional cache size: 3869, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3878, Positive cache size: 3878, Positive conditional cache size: 3871, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3880, Positive cache size: 3880, Positive conditional cache size: 3873, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3882, Positive cache size: 3882, Positive conditional cache size: 3875, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3884, Positive cache size: 3884, Positive conditional cache size: 3877, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3886, Positive cache size: 3886, Positive conditional cache size: 3879, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3888, Positive cache size: 3888, Positive conditional cache size: 3881, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3890, Positive cache size: 3890, Positive conditional cache size: 3883, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3892, Positive cache size: 3892, Positive conditional cache size: 3885, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3894, Positive cache size: 3894, Positive conditional cache size: 3887, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3896, Positive cache size: 3896, Positive conditional cache size: 3889, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3898, Positive cache size: 3898, Positive conditional cache size: 3891, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3900, Positive cache size: 3900, Positive conditional cache size: 3893, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3902, Positive cache size: 3902, Positive conditional cache size: 3895, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3904, Positive cache size: 3904, Positive conditional cache size: 3897, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3906, Positive cache size: 3906, Positive conditional cache size: 3899, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3908, Positive cache size: 3908, Positive conditional cache size: 3901, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3910, Positive cache size: 3910, Positive conditional cache size: 3903, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3912, Positive cache size: 3912, Positive conditional cache size: 3905, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3914, Positive cache size: 3914, Positive conditional cache size: 3907, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3916, Positive cache size: 3916, Positive conditional cache size: 3909, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3918, Positive cache size: 3918, Positive conditional cache size: 3911, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3920, Positive cache size: 3920, Positive conditional cache size: 3913, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3922, Positive cache size: 3922, Positive conditional cache size: 3915, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3924, Positive cache size: 3924, Positive conditional cache size: 3917, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3926, Positive cache size: 3926, Positive conditional cache size: 3919, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3928, Positive cache size: 3928, Positive conditional cache size: 3921, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3930, Positive cache size: 3930, Positive conditional cache size: 3923, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3932, Positive cache size: 3932, Positive conditional cache size: 3925, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3934, Positive cache size: 3934, Positive conditional cache size: 3927, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3936, Positive cache size: 3936, Positive conditional cache size: 3929, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3938, Positive cache size: 3938, Positive conditional cache size: 3931, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3940, Positive cache size: 3940, Positive conditional cache size: 3933, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3942, Positive cache size: 3942, Positive conditional cache size: 3935, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3944, Positive cache size: 3944, Positive conditional cache size: 3937, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3946, Positive cache size: 3946, Positive conditional cache size: 3939, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3948, Positive cache size: 3948, Positive conditional cache size: 3941, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3950, Positive cache size: 3950, Positive conditional cache size: 3943, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3952, Positive cache size: 3952, Positive conditional cache size: 3945, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3954, Positive cache size: 3954, Positive conditional cache size: 3947, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3956, Positive cache size: 3956, Positive conditional cache size: 3949, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3958, Positive cache size: 3958, Positive conditional cache size: 3951, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3960, Positive cache size: 3960, Positive conditional cache size: 3953, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3962, Positive cache size: 3962, Positive conditional cache size: 3955, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3964, Positive cache size: 3964, Positive conditional cache size: 3957, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3966, Positive cache size: 3966, Positive conditional cache size: 3959, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3968, Positive cache size: 3968, Positive conditional cache size: 3961, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3970, Positive cache size: 3970, Positive conditional cache size: 3963, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3972, Positive cache size: 3972, Positive conditional cache size: 3965, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3974, Positive cache size: 3974, Positive conditional cache size: 3967, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3976, Positive cache size: 3976, Positive conditional cache size: 3969, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3978, Positive cache size: 3978, Positive conditional cache size: 3971, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3980, Positive cache size: 3980, Positive conditional cache size: 3973, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3982, Positive cache size: 3982, Positive conditional cache size: 3975, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3984, Positive cache size: 3984, Positive conditional cache size: 3977, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3986, Positive cache size: 3986, Positive conditional cache size: 3979, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3988, Positive cache size: 3988, Positive conditional cache size: 3981, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3990, Positive cache size: 3990, Positive conditional cache size: 3983, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3992, Positive cache size: 3992, Positive conditional cache size: 3985, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3994, Positive cache size: 3994, Positive conditional cache size: 3987, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3996, Positive cache size: 3996, Positive conditional cache size: 3989, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3998, Positive cache size: 3998, Positive conditional cache size: 3991, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4000, Positive cache size: 4000, Positive conditional cache size: 3993, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4002, Positive cache size: 4002, Positive conditional cache size: 3995, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4004, Positive cache size: 4004, Positive conditional cache size: 3997, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4006, Positive cache size: 4006, Positive conditional cache size: 3999, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4008, Positive cache size: 4008, Positive conditional cache size: 4001, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4010, Positive cache size: 4010, Positive conditional cache size: 4003, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4012, Positive cache size: 4012, Positive conditional cache size: 4005, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4014, Positive cache size: 4014, Positive conditional cache size: 4007, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4016, Positive cache size: 4016, Positive conditional cache size: 4009, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4018, Positive cache size: 4018, Positive conditional cache size: 4011, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4020, Positive cache size: 4020, Positive conditional cache size: 4013, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4022, Positive cache size: 4022, Positive conditional cache size: 4015, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4024, Positive cache size: 4024, Positive conditional cache size: 4017, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4026, Positive cache size: 4026, Positive conditional cache size: 4019, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4028, Positive cache size: 4028, Positive conditional cache size: 4021, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4030, Positive cache size: 4030, Positive conditional cache size: 4023, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4032, Positive cache size: 4032, Positive conditional cache size: 4025, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4034, Positive cache size: 4034, Positive conditional cache size: 4027, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4036, Positive cache size: 4036, Positive conditional cache size: 4029, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4038, Positive cache size: 4038, Positive conditional cache size: 4031, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4040, Positive cache size: 4040, Positive conditional cache size: 4033, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4042, Positive cache size: 4042, Positive conditional cache size: 4035, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4044, Positive cache size: 4044, Positive conditional cache size: 4037, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4046, Positive cache size: 4046, Positive conditional cache size: 4039, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4048, Positive cache size: 4048, Positive conditional cache size: 4041, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4050, Positive cache size: 4050, Positive conditional cache size: 4043, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4052, Positive cache size: 4052, Positive conditional cache size: 4045, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4054, Positive cache size: 4054, Positive conditional cache size: 4047, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4056, Positive cache size: 4056, Positive conditional cache size: 4049, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4058, Positive cache size: 4058, Positive conditional cache size: 4051, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4060, Positive cache size: 4060, Positive conditional cache size: 4053, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4062, Positive cache size: 4062, Positive conditional cache size: 4055, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4064, Positive cache size: 4064, Positive conditional cache size: 4057, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4066, Positive cache size: 4066, Positive conditional cache size: 4059, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4068, Positive cache size: 4068, Positive conditional cache size: 4061, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4070, Positive cache size: 4070, Positive conditional cache size: 4063, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4072, Positive cache size: 4072, Positive conditional cache size: 4065, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4074, Positive cache size: 4074, Positive conditional cache size: 4067, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4076, Positive cache size: 4076, Positive conditional cache size: 4069, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4078, Positive cache size: 4078, Positive conditional cache size: 4071, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4080, Positive cache size: 4080, Positive conditional cache size: 4073, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4082, Positive cache size: 4082, Positive conditional cache size: 4075, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4084, Positive cache size: 4084, Positive conditional cache size: 4077, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4086, Positive cache size: 4086, Positive conditional cache size: 4079, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4088, Positive cache size: 4088, Positive conditional cache size: 4081, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4090, Positive cache size: 4090, Positive conditional cache size: 4083, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4092, Positive cache size: 4092, Positive conditional cache size: 4085, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4094, Positive cache size: 4094, Positive conditional cache size: 4087, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4096, Positive cache size: 4096, Positive conditional cache size: 4089, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4098, Positive cache size: 4098, Positive conditional cache size: 4091, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4100, Positive cache size: 4100, Positive conditional cache size: 4093, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4102, Positive cache size: 4102, Positive conditional cache size: 4095, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4104, Positive cache size: 4104, Positive conditional cache size: 4097, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4106, Positive cache size: 4106, Positive conditional cache size: 4099, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4108, Positive cache size: 4108, Positive conditional cache size: 4101, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4110, Positive cache size: 4110, Positive conditional cache size: 4103, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4112, Positive cache size: 4112, Positive conditional cache size: 4105, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4114, Positive cache size: 4114, Positive conditional cache size: 4107, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4116, Positive cache size: 4116, Positive conditional cache size: 4109, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4118, Positive cache size: 4118, Positive conditional cache size: 4111, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4120, Positive cache size: 4120, Positive conditional cache size: 4113, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4122, Positive cache size: 4122, Positive conditional cache size: 4115, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4124, Positive cache size: 4124, Positive conditional cache size: 4117, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4126, Positive cache size: 4126, Positive conditional cache size: 4119, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4128, Positive cache size: 4128, Positive conditional cache size: 4121, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4130, Positive cache size: 4130, Positive conditional cache size: 4123, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4132, Positive cache size: 4132, Positive conditional cache size: 4125, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4134, Positive cache size: 4134, Positive conditional cache size: 4127, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4136, Positive cache size: 4136, Positive conditional cache size: 4129, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4138, Positive cache size: 4138, Positive conditional cache size: 4131, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4140, Positive cache size: 4140, Positive conditional cache size: 4133, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4142, Positive cache size: 4142, Positive conditional cache size: 4135, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4144, Positive cache size: 4144, Positive conditional cache size: 4137, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4146, Positive cache size: 4146, Positive conditional cache size: 4139, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4148, Positive cache size: 4148, Positive conditional cache size: 4141, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4150, Positive cache size: 4150, Positive conditional cache size: 4143, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4152, Positive cache size: 4152, Positive conditional cache size: 4145, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4154, Positive cache size: 4154, Positive conditional cache size: 4147, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4156, Positive cache size: 4156, Positive conditional cache size: 4149, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4158, Positive cache size: 4158, Positive conditional cache size: 4151, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4160, Positive cache size: 4160, Positive conditional cache size: 4153, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4162, Positive cache size: 4162, Positive conditional cache size: 4155, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4164, Positive cache size: 4164, Positive conditional cache size: 4157, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4166, Positive cache size: 4166, Positive conditional cache size: 4159, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4168, Positive cache size: 4168, Positive conditional cache size: 4161, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4170, Positive cache size: 4170, Positive conditional cache size: 4163, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4172, Positive cache size: 4172, Positive conditional cache size: 4165, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4174, Positive cache size: 4174, Positive conditional cache size: 4167, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4176, Positive cache size: 4176, Positive conditional cache size: 4169, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4178, Positive cache size: 4178, Positive conditional cache size: 4171, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4180, Positive cache size: 4180, Positive conditional cache size: 4173, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4182, Positive cache size: 4182, Positive conditional cache size: 4175, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4184, Positive cache size: 4184, Positive conditional cache size: 4177, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4186, Positive cache size: 4186, Positive conditional cache size: 4179, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4188, Positive cache size: 4188, Positive conditional cache size: 4181, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4190, Positive cache size: 4190, Positive conditional cache size: 4183, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4192, Positive cache size: 4192, Positive conditional cache size: 4185, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4194, Positive cache size: 4194, Positive conditional cache size: 4187, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4196, Positive cache size: 4196, Positive conditional cache size: 4189, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4198, Positive cache size: 4198, Positive conditional cache size: 4191, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4200, Positive cache size: 4200, Positive conditional cache size: 4193, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4202, Positive cache size: 4202, Positive conditional cache size: 4195, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4204, Positive cache size: 4204, Positive conditional cache size: 4197, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4206, Positive cache size: 4206, Positive conditional cache size: 4199, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4208, Positive cache size: 4208, Positive conditional cache size: 4201, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4210, Positive cache size: 4210, Positive conditional cache size: 4203, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4212, Positive cache size: 4212, Positive conditional cache size: 4205, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4214, Positive cache size: 4214, Positive conditional cache size: 4207, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4216, Positive cache size: 4216, Positive conditional cache size: 4209, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4218, Positive cache size: 4218, Positive conditional cache size: 4211, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4220, Positive cache size: 4220, Positive conditional cache size: 4213, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4222, Positive cache size: 4222, Positive conditional cache size: 4215, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4224, Positive cache size: 4224, Positive conditional cache size: 4217, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4226, Positive cache size: 4226, Positive conditional cache size: 4219, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4228, Positive cache size: 4228, Positive conditional cache size: 4221, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4230, Positive cache size: 4230, Positive conditional cache size: 4223, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4232, Positive cache size: 4232, Positive conditional cache size: 4225, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4234, Positive cache size: 4234, Positive conditional cache size: 4227, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4236, Positive cache size: 4236, Positive conditional cache size: 4229, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4238, Positive cache size: 4238, Positive conditional cache size: 4231, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4240, Positive cache size: 4240, Positive conditional cache size: 4233, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4242, Positive cache size: 4242, Positive conditional cache size: 4235, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4244, Positive cache size: 4244, Positive conditional cache size: 4237, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4246, Positive cache size: 4246, Positive conditional cache size: 4239, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4248, Positive cache size: 4248, Positive conditional cache size: 4241, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4250, Positive cache size: 4250, Positive conditional cache size: 4243, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4252, Positive cache size: 4252, Positive conditional cache size: 4245, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4254, Positive cache size: 4254, Positive conditional cache size: 4247, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4256, Positive cache size: 4256, Positive conditional cache size: 4249, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4258, Positive cache size: 4258, Positive conditional cache size: 4251, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4260, Positive cache size: 4260, Positive conditional cache size: 4253, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4262, Positive cache size: 4262, Positive conditional cache size: 4255, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4264, Positive cache size: 4264, Positive conditional cache size: 4257, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4266, Positive cache size: 4266, Positive conditional cache size: 4259, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4268, Positive cache size: 4268, Positive conditional cache size: 4261, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4270, Positive cache size: 4270, Positive conditional cache size: 4263, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4272, Positive cache size: 4272, Positive conditional cache size: 4265, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4274, Positive cache size: 4274, Positive conditional cache size: 4267, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4276, Positive cache size: 4276, Positive conditional cache size: 4269, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4278, Positive cache size: 4278, Positive conditional cache size: 4271, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4280, Positive cache size: 4280, Positive conditional cache size: 4273, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4282, Positive cache size: 4282, Positive conditional cache size: 4275, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4284, Positive cache size: 4284, Positive conditional cache size: 4277, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4286, Positive cache size: 4286, Positive conditional cache size: 4279, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4288, Positive cache size: 4288, Positive conditional cache size: 4281, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4290, Positive cache size: 4290, Positive conditional cache size: 4283, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4292, Positive cache size: 4292, Positive conditional cache size: 4285, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4294, Positive cache size: 4294, Positive conditional cache size: 4287, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4296, Positive cache size: 4296, Positive conditional cache size: 4289, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4298, Positive cache size: 4298, Positive conditional cache size: 4291, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4300, Positive cache size: 4300, Positive conditional cache size: 4293, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4302, Positive cache size: 4302, Positive conditional cache size: 4295, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4304, Positive cache size: 4304, Positive conditional cache size: 4297, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4306, Positive cache size: 4306, Positive conditional cache size: 4299, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4308, Positive cache size: 4308, Positive conditional cache size: 4301, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4310, Positive cache size: 4310, Positive conditional cache size: 4303, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4312, Positive cache size: 4312, Positive conditional cache size: 4305, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4314, Positive cache size: 4314, Positive conditional cache size: 4307, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4316, Positive cache size: 4316, Positive conditional cache size: 4309, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4318, Positive cache size: 4318, Positive conditional cache size: 4311, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4320, Positive cache size: 4320, Positive conditional cache size: 4313, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4322, Positive cache size: 4322, Positive conditional cache size: 4315, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4324, Positive cache size: 4324, Positive conditional cache size: 4317, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4326, Positive cache size: 4326, Positive conditional cache size: 4319, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4328, Positive cache size: 4328, Positive conditional cache size: 4321, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4330, Positive cache size: 4330, Positive conditional cache size: 4323, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4332, Positive cache size: 4332, Positive conditional cache size: 4325, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4334, Positive cache size: 4334, Positive conditional cache size: 4327, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4336, Positive cache size: 4336, Positive conditional cache size: 4329, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4338, Positive cache size: 4338, Positive conditional cache size: 4331, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4340, Positive cache size: 4340, Positive conditional cache size: 4333, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4342, Positive cache size: 4342, Positive conditional cache size: 4335, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4344, Positive cache size: 4344, Positive conditional cache size: 4337, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4346, Positive cache size: 4346, Positive conditional cache size: 4339, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4348, Positive cache size: 4348, Positive conditional cache size: 4341, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4350, Positive cache size: 4350, Positive conditional cache size: 4343, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4352, Positive cache size: 4352, Positive conditional cache size: 4345, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4354, Positive cache size: 4354, Positive conditional cache size: 4347, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4356, Positive cache size: 4356, Positive conditional cache size: 4349, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4358, Positive cache size: 4358, Positive conditional cache size: 4351, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4360, Positive cache size: 4360, Positive conditional cache size: 4353, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4362, Positive cache size: 4362, Positive conditional cache size: 4355, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4364, Positive cache size: 4364, Positive conditional cache size: 4357, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4366, Positive cache size: 4366, Positive conditional cache size: 4359, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4368, Positive cache size: 4368, Positive conditional cache size: 4361, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4370, Positive cache size: 4370, Positive conditional cache size: 4363, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4372, Positive cache size: 4372, Positive conditional cache size: 4365, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4374, Positive cache size: 4374, Positive conditional cache size: 4367, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4376, Positive cache size: 4376, Positive conditional cache size: 4369, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4378, Positive cache size: 4378, Positive conditional cache size: 4371, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4380, Positive cache size: 4380, Positive conditional cache size: 4373, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4382, Positive cache size: 4382, Positive conditional cache size: 4375, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4384, Positive cache size: 4384, Positive conditional cache size: 4377, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4386, Positive cache size: 4386, Positive conditional cache size: 4379, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4388, Positive cache size: 4388, Positive conditional cache size: 4381, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4390, Positive cache size: 4390, Positive conditional cache size: 4383, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4392, Positive cache size: 4392, Positive conditional cache size: 4385, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4394, Positive cache size: 4394, Positive conditional cache size: 4387, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4396, Positive cache size: 4396, Positive conditional cache size: 4389, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4398, Positive cache size: 4398, Positive conditional cache size: 4391, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4400, Positive cache size: 4400, Positive conditional cache size: 4393, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4402, Positive cache size: 4402, Positive conditional cache size: 4395, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4404, Positive cache size: 4404, Positive conditional cache size: 4397, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4406, Positive cache size: 4406, Positive conditional cache size: 4399, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4408, Positive cache size: 4408, Positive conditional cache size: 4401, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4410, Positive cache size: 4410, Positive conditional cache size: 4403, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4412, Positive cache size: 4412, Positive conditional cache size: 4405, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4414, Positive cache size: 4414, Positive conditional cache size: 4407, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4416, Positive cache size: 4416, Positive conditional cache size: 4409, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4418, Positive cache size: 4418, Positive conditional cache size: 4411, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4420, Positive cache size: 4420, Positive conditional cache size: 4413, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4422, Positive cache size: 4422, Positive conditional cache size: 4415, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4424, Positive cache size: 4424, Positive conditional cache size: 4417, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4426, Positive cache size: 4426, Positive conditional cache size: 4419, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4428, Positive cache size: 4428, Positive conditional cache size: 4421, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4430, Positive cache size: 4430, Positive conditional cache size: 4423, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4432, Positive cache size: 4432, Positive conditional cache size: 4425, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4434, Positive cache size: 4434, Positive conditional cache size: 4427, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4436, Positive cache size: 4436, Positive conditional cache size: 4429, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4438, Positive cache size: 4438, Positive conditional cache size: 4431, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4440, Positive cache size: 4440, Positive conditional cache size: 4433, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4442, Positive cache size: 4442, Positive conditional cache size: 4435, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4444, Positive cache size: 4444, Positive conditional cache size: 4437, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4446, Positive cache size: 4446, Positive conditional cache size: 4439, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4448, Positive cache size: 4448, Positive conditional cache size: 4441, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4450, Positive cache size: 4450, Positive conditional cache size: 4443, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4452, Positive cache size: 4452, Positive conditional cache size: 4445, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4454, Positive cache size: 4454, Positive conditional cache size: 4447, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4456, Positive cache size: 4456, Positive conditional cache size: 4449, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4458, Positive cache size: 4458, Positive conditional cache size: 4451, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4460, Positive cache size: 4460, Positive conditional cache size: 4453, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4462, Positive cache size: 4462, Positive conditional cache size: 4455, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4464, Positive cache size: 4464, Positive conditional cache size: 4457, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4466, Positive cache size: 4466, Positive conditional cache size: 4459, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4468, Positive cache size: 4468, Positive conditional cache size: 4461, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4470, Positive cache size: 4470, Positive conditional cache size: 4463, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4472, Positive cache size: 4472, Positive conditional cache size: 4465, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4474, Positive cache size: 4474, Positive conditional cache size: 4467, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4476, Positive cache size: 4476, Positive conditional cache size: 4469, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4478, Positive cache size: 4478, Positive conditional cache size: 4471, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4480, Positive cache size: 4480, Positive conditional cache size: 4473, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4482, Positive cache size: 4482, Positive conditional cache size: 4475, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4484, Positive cache size: 4484, Positive conditional cache size: 4477, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4486, Positive cache size: 4486, Positive conditional cache size: 4479, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4488, Positive cache size: 4488, Positive conditional cache size: 4481, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4490, Positive cache size: 4490, Positive conditional cache size: 4483, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4492, Positive cache size: 4492, Positive conditional cache size: 4485, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4494, Positive cache size: 4494, Positive conditional cache size: 4487, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4496, Positive cache size: 4496, Positive conditional cache size: 4489, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4498, Positive cache size: 4498, Positive conditional cache size: 4491, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4500, Positive cache size: 4500, Positive conditional cache size: 4493, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4502, Positive cache size: 4502, Positive conditional cache size: 4495, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4504, Positive cache size: 4504, Positive conditional cache size: 4497, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4506, Positive cache size: 4506, Positive conditional cache size: 4499, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4508, Positive cache size: 4508, Positive conditional cache size: 4501, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4510, Positive cache size: 4510, Positive conditional cache size: 4503, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4512, Positive cache size: 4512, Positive conditional cache size: 4505, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4514, Positive cache size: 4514, Positive conditional cache size: 4507, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4516, Positive cache size: 4516, Positive conditional cache size: 4509, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4518, Positive cache size: 4518, Positive conditional cache size: 4511, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4520, Positive cache size: 4520, Positive conditional cache size: 4513, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4522, Positive cache size: 4522, Positive conditional cache size: 4515, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4524, Positive cache size: 4524, Positive conditional cache size: 4517, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4526, Positive cache size: 4526, Positive conditional cache size: 4519, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4528, Positive cache size: 4528, Positive conditional cache size: 4521, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4530, Positive cache size: 4530, Positive conditional cache size: 4523, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4532, Positive cache size: 4532, Positive conditional cache size: 4525, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4534, Positive cache size: 4534, Positive conditional cache size: 4527, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4536, Positive cache size: 4536, Positive conditional cache size: 4529, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4538, Positive cache size: 4538, Positive conditional cache size: 4531, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4540, Positive cache size: 4540, Positive conditional cache size: 4533, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4542, Positive cache size: 4542, Positive conditional cache size: 4535, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4544, Positive cache size: 4544, Positive conditional cache size: 4537, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4546, Positive cache size: 4546, Positive conditional cache size: 4539, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4548, Positive cache size: 4548, Positive conditional cache size: 4541, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4550, Positive cache size: 4550, Positive conditional cache size: 4543, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4552, Positive cache size: 4552, Positive conditional cache size: 4545, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4554, Positive cache size: 4554, Positive conditional cache size: 4547, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4556, Positive cache size: 4556, Positive conditional cache size: 4549, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4558, Positive cache size: 4558, Positive conditional cache size: 4551, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4560, Positive cache size: 4560, Positive conditional cache size: 4553, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4562, Positive cache size: 4562, Positive conditional cache size: 4555, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4564, Positive cache size: 4564, Positive conditional cache size: 4557, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4566, Positive cache size: 4566, Positive conditional cache size: 4559, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4568, Positive cache size: 4568, Positive conditional cache size: 4561, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4570, Positive cache size: 4570, Positive conditional cache size: 4563, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4572, Positive cache size: 4572, Positive conditional cache size: 4565, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4574, Positive cache size: 4574, Positive conditional cache size: 4567, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4576, Positive cache size: 4576, Positive conditional cache size: 4569, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4578, Positive cache size: 4578, Positive conditional cache size: 4571, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4580, Positive cache size: 4580, Positive conditional cache size: 4573, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4582, Positive cache size: 4582, Positive conditional cache size: 4575, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4584, Positive cache size: 4584, Positive conditional cache size: 4577, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4586, Positive cache size: 4586, Positive conditional cache size: 4579, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4588, Positive cache size: 4588, Positive conditional cache size: 4581, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4590, Positive cache size: 4590, Positive conditional cache size: 4583, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4592, Positive cache size: 4592, Positive conditional cache size: 4585, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4594, Positive cache size: 4594, Positive conditional cache size: 4587, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4596, Positive cache size: 4596, Positive conditional cache size: 4589, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4598, Positive cache size: 4598, Positive conditional cache size: 4591, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4600, Positive cache size: 4600, Positive conditional cache size: 4593, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4602, Positive cache size: 4602, Positive conditional cache size: 4595, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4604, Positive cache size: 4604, Positive conditional cache size: 4597, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4606, Positive cache size: 4606, Positive conditional cache size: 4599, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4608, Positive cache size: 4608, Positive conditional cache size: 4601, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4610, Positive cache size: 4610, Positive conditional cache size: 4603, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4612, Positive cache size: 4612, Positive conditional cache size: 4605, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4614, Positive cache size: 4614, Positive conditional cache size: 4607, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4616, Positive cache size: 4616, Positive conditional cache size: 4609, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4618, Positive cache size: 4618, Positive conditional cache size: 4611, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4620, Positive cache size: 4620, Positive conditional cache size: 4613, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4622, Positive cache size: 4622, Positive conditional cache size: 4615, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4624, Positive cache size: 4624, Positive conditional cache size: 4617, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4626, Positive cache size: 4626, Positive conditional cache size: 4619, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4628, Positive cache size: 4628, Positive conditional cache size: 4621, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4630, Positive cache size: 4630, Positive conditional cache size: 4623, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4632, Positive cache size: 4632, Positive conditional cache size: 4625, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4634, Positive cache size: 4634, Positive conditional cache size: 4627, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4636, Positive cache size: 4636, Positive conditional cache size: 4629, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4638, Positive cache size: 4638, Positive conditional cache size: 4631, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4640, Positive cache size: 4640, Positive conditional cache size: 4633, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4642, Positive cache size: 4642, Positive conditional cache size: 4635, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4644, Positive cache size: 4644, Positive conditional cache size: 4637, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4646, Positive cache size: 4646, Positive conditional cache size: 4639, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4648, Positive cache size: 4648, Positive conditional cache size: 4641, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4650, Positive cache size: 4650, Positive conditional cache size: 4643, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4652, Positive cache size: 4652, Positive conditional cache size: 4645, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4654, Positive cache size: 4654, Positive conditional cache size: 4647, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4656, Positive cache size: 4656, Positive conditional cache size: 4649, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4658, Positive cache size: 4658, Positive conditional cache size: 4651, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4660, Positive cache size: 4660, Positive conditional cache size: 4653, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4662, Positive cache size: 4662, Positive conditional cache size: 4655, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4664, Positive cache size: 4664, Positive conditional cache size: 4657, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4666, Positive cache size: 4666, Positive conditional cache size: 4659, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4668, Positive cache size: 4668, Positive conditional cache size: 4661, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4670, Positive cache size: 4670, Positive conditional cache size: 4663, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4672, Positive cache size: 4672, Positive conditional cache size: 4665, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4674, Positive cache size: 4674, Positive conditional cache size: 4667, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4676, Positive cache size: 4676, Positive conditional cache size: 4669, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4678, Positive cache size: 4678, Positive conditional cache size: 4671, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4680, Positive cache size: 4680, Positive conditional cache size: 4673, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4682, Positive cache size: 4682, Positive conditional cache size: 4675, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4684, Positive cache size: 4684, Positive conditional cache size: 4677, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4686, Positive cache size: 4686, Positive conditional cache size: 4679, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4688, Positive cache size: 4688, Positive conditional cache size: 4681, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4690, Positive cache size: 4690, Positive conditional cache size: 4683, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4692, Positive cache size: 4692, Positive conditional cache size: 4685, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4694, Positive cache size: 4694, Positive conditional cache size: 4687, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4696, Positive cache size: 4696, Positive conditional cache size: 4689, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4698, Positive cache size: 4698, Positive conditional cache size: 4691, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4700, Positive cache size: 4700, Positive conditional cache size: 4693, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4702, Positive cache size: 4702, Positive conditional cache size: 4695, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4704, Positive cache size: 4704, Positive conditional cache size: 4697, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4706, Positive cache size: 4706, Positive conditional cache size: 4699, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4708, Positive cache size: 4708, Positive conditional cache size: 4701, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4710, Positive cache size: 4710, Positive conditional cache size: 4703, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4712, Positive cache size: 4712, Positive conditional cache size: 4705, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4714, Positive cache size: 4714, Positive conditional cache size: 4707, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4716, Positive cache size: 4716, Positive conditional cache size: 4709, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4718, Positive cache size: 4718, Positive conditional cache size: 4711, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4720, Positive cache size: 4720, Positive conditional cache size: 4713, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4722, Positive cache size: 4722, Positive conditional cache size: 4715, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4724, Positive cache size: 4724, Positive conditional cache size: 4717, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4726, Positive cache size: 4726, Positive conditional cache size: 4719, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4728, Positive cache size: 4728, Positive conditional cache size: 4721, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4730, Positive cache size: 4730, Positive conditional cache size: 4723, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4732, Positive cache size: 4732, Positive conditional cache size: 4725, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4734, Positive cache size: 4734, Positive conditional cache size: 4727, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4736, Positive cache size: 4736, Positive conditional cache size: 4729, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4738, Positive cache size: 4738, Positive conditional cache size: 4731, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4740, Positive cache size: 4740, Positive conditional cache size: 4733, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4742, Positive cache size: 4742, Positive conditional cache size: 4735, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4744, Positive cache size: 4744, Positive conditional cache size: 4737, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4746, Positive cache size: 4746, Positive conditional cache size: 4739, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4748, Positive cache size: 4748, Positive conditional cache size: 4741, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4750, Positive cache size: 4750, Positive conditional cache size: 4743, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4752, Positive cache size: 4752, Positive conditional cache size: 4745, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4754, Positive cache size: 4754, Positive conditional cache size: 4747, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4756, Positive cache size: 4756, Positive conditional cache size: 4749, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4758, Positive cache size: 4758, Positive conditional cache size: 4751, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4760, Positive cache size: 4760, Positive conditional cache size: 4753, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4762, Positive cache size: 4762, Positive conditional cache size: 4755, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4764, Positive cache size: 4764, Positive conditional cache size: 4757, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4766, Positive cache size: 4766, Positive conditional cache size: 4759, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4768, Positive cache size: 4768, Positive conditional cache size: 4761, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4770, Positive cache size: 4770, Positive conditional cache size: 4763, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4772, Positive cache size: 4772, Positive conditional cache size: 4765, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4774, Positive cache size: 4774, Positive conditional cache size: 4767, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4776, Positive cache size: 4776, Positive conditional cache size: 4769, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4778, Positive cache size: 4778, Positive conditional cache size: 4771, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4780, Positive cache size: 4780, Positive conditional cache size: 4773, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4782, Positive cache size: 4782, Positive conditional cache size: 4775, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4784, Positive cache size: 4784, Positive conditional cache size: 4777, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4786, Positive cache size: 4786, Positive conditional cache size: 4779, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4788, Positive cache size: 4788, Positive conditional cache size: 4781, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4790, Positive cache size: 4790, Positive conditional cache size: 4783, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4792, Positive cache size: 4792, Positive conditional cache size: 4785, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4794, Positive cache size: 4794, Positive conditional cache size: 4787, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4796, Positive cache size: 4796, Positive conditional cache size: 4789, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4798, Positive cache size: 4798, Positive conditional cache size: 4791, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4800, Positive cache size: 4800, Positive conditional cache size: 4793, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4802, Positive cache size: 4802, Positive conditional cache size: 4795, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4804, Positive cache size: 4804, Positive conditional cache size: 4797, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4806, Positive cache size: 4806, Positive conditional cache size: 4799, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4808, Positive cache size: 4808, Positive conditional cache size: 4801, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4810, Positive cache size: 4810, Positive conditional cache size: 4803, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4812, Positive cache size: 4812, Positive conditional cache size: 4805, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4814, Positive cache size: 4814, Positive conditional cache size: 4807, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4816, Positive cache size: 4816, Positive conditional cache size: 4809, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4818, Positive cache size: 4818, Positive conditional cache size: 4811, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4820, Positive cache size: 4820, Positive conditional cache size: 4813, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4822, Positive cache size: 4822, Positive conditional cache size: 4815, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4824, Positive cache size: 4824, Positive conditional cache size: 4817, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4826, Positive cache size: 4826, Positive conditional cache size: 4819, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4828, Positive cache size: 4828, Positive conditional cache size: 4821, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4830, Positive cache size: 4830, Positive conditional cache size: 4823, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4832, Positive cache size: 4832, Positive conditional cache size: 4825, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4834, Positive cache size: 4834, Positive conditional cache size: 4827, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4836, Positive cache size: 4836, Positive conditional cache size: 4829, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4838, Positive cache size: 4838, Positive conditional cache size: 4831, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4840, Positive cache size: 4840, Positive conditional cache size: 4833, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4842, Positive cache size: 4842, Positive conditional cache size: 4835, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4844, Positive cache size: 4844, Positive conditional cache size: 4837, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4846, Positive cache size: 4846, Positive conditional cache size: 4839, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4848, Positive cache size: 4848, Positive conditional cache size: 4841, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4850, Positive cache size: 4850, Positive conditional cache size: 4843, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4852, Positive cache size: 4852, Positive conditional cache size: 4845, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4854, Positive cache size: 4854, Positive conditional cache size: 4847, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4856, Positive cache size: 4856, Positive conditional cache size: 4849, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4858, Positive cache size: 4858, Positive conditional cache size: 4851, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4860, Positive cache size: 4860, Positive conditional cache size: 4853, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4862, Positive cache size: 4862, Positive conditional cache size: 4855, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4864, Positive cache size: 4864, Positive conditional cache size: 4857, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4866, Positive cache size: 4866, Positive conditional cache size: 4859, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4868, Positive cache size: 4868, Positive conditional cache size: 4861, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4870, Positive cache size: 4870, Positive conditional cache size: 4863, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4872, Positive cache size: 4872, Positive conditional cache size: 4865, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4874, Positive cache size: 4874, Positive conditional cache size: 4867, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4876, Positive cache size: 4876, Positive conditional cache size: 4869, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4878, Positive cache size: 4878, Positive conditional cache size: 4871, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4880, Positive cache size: 4880, Positive conditional cache size: 4873, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4882, Positive cache size: 4882, Positive conditional cache size: 4875, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4884, Positive cache size: 4884, Positive conditional cache size: 4877, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4886, Positive cache size: 4886, Positive conditional cache size: 4879, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4888, Positive cache size: 4888, Positive conditional cache size: 4881, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4890, Positive cache size: 4890, Positive conditional cache size: 4883, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4892, Positive cache size: 4892, Positive conditional cache size: 4885, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4894, Positive cache size: 4894, Positive conditional cache size: 4887, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4896, Positive cache size: 4896, Positive conditional cache size: 4889, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4898, Positive cache size: 4898, Positive conditional cache size: 4891, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4900, Positive cache size: 4900, Positive conditional cache size: 4893, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4902, Positive cache size: 4902, Positive conditional cache size: 4895, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4904, Positive cache size: 4904, Positive conditional cache size: 4897, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4906, Positive cache size: 4906, Positive conditional cache size: 4899, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4908, Positive cache size: 4908, Positive conditional cache size: 4901, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4910, Positive cache size: 4910, Positive conditional cache size: 4903, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4912, Positive cache size: 4912, Positive conditional cache size: 4905, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4914, Positive cache size: 4914, Positive conditional cache size: 4907, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4916, Positive cache size: 4916, Positive conditional cache size: 4909, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4918, Positive cache size: 4918, Positive conditional cache size: 4911, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4920, Positive cache size: 4920, Positive conditional cache size: 4913, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4922, Positive cache size: 4922, Positive conditional cache size: 4915, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4924, Positive cache size: 4924, Positive conditional cache size: 4917, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4926, Positive cache size: 4926, Positive conditional cache size: 4919, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4928, Positive cache size: 4928, Positive conditional cache size: 4921, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4930, Positive cache size: 4930, Positive conditional cache size: 4923, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4932, Positive cache size: 4932, Positive conditional cache size: 4925, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4934, Positive cache size: 4934, Positive conditional cache size: 4927, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4936, Positive cache size: 4936, Positive conditional cache size: 4929, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4938, Positive cache size: 4938, Positive conditional cache size: 4931, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4940, Positive cache size: 4940, Positive conditional cache size: 4933, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4942, Positive cache size: 4942, Positive conditional cache size: 4935, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4944, Positive cache size: 4944, Positive conditional cache size: 4937, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4946, Positive cache size: 4946, Positive conditional cache size: 4939, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4948, Positive cache size: 4948, Positive conditional cache size: 4941, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4950, Positive cache size: 4950, Positive conditional cache size: 4943, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4952, Positive cache size: 4952, Positive conditional cache size: 4945, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4954, Positive cache size: 4954, Positive conditional cache size: 4947, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4956, Positive cache size: 4956, Positive conditional cache size: 4949, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4958, Positive cache size: 4958, Positive conditional cache size: 4951, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4960, Positive cache size: 4960, Positive conditional cache size: 4953, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4962, Positive cache size: 4962, Positive conditional cache size: 4955, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4964, Positive cache size: 4964, Positive conditional cache size: 4957, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4966, Positive cache size: 4966, Positive conditional cache size: 4959, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4968, Positive cache size: 4968, Positive conditional cache size: 4961, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4970, Positive cache size: 4970, Positive conditional cache size: 4963, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4972, Positive cache size: 4972, Positive conditional cache size: 4965, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4974, Positive cache size: 4974, Positive conditional cache size: 4967, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4976, Positive cache size: 4976, Positive conditional cache size: 4969, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4978, Positive cache size: 4978, Positive conditional cache size: 4971, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4980, Positive cache size: 4980, Positive conditional cache size: 4973, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4982, Positive cache size: 4982, Positive conditional cache size: 4975, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4984, Positive cache size: 4984, Positive conditional cache size: 4977, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4986, Positive cache size: 4986, Positive conditional cache size: 4979, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4988, Positive cache size: 4988, Positive conditional cache size: 4981, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4990, Positive cache size: 4990, Positive conditional cache size: 4983, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4992, Positive cache size: 4992, Positive conditional cache size: 4985, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4994, Positive cache size: 4994, Positive conditional cache size: 4987, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4996, Positive cache size: 4996, Positive conditional cache size: 4989, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4998, Positive cache size: 4998, Positive conditional cache size: 4991, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5000, Positive cache size: 5000, Positive conditional cache size: 4993, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5002, Positive cache size: 5002, Positive conditional cache size: 4995, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5004, Positive cache size: 5004, Positive conditional cache size: 4997, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5006, Positive cache size: 5006, Positive conditional cache size: 4999, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5008, Positive cache size: 5008, Positive conditional cache size: 5001, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5010, Positive cache size: 5010, Positive conditional cache size: 5003, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5012, Positive cache size: 5012, Positive conditional cache size: 5005, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5014, Positive cache size: 5014, Positive conditional cache size: 5007, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5016, Positive cache size: 5016, Positive conditional cache size: 5009, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5018, Positive cache size: 5018, Positive conditional cache size: 5011, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5020, Positive cache size: 5020, Positive conditional cache size: 5013, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5022, Positive cache size: 5022, Positive conditional cache size: 5015, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5024, Positive cache size: 5024, Positive conditional cache size: 5017, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5026, Positive cache size: 5026, Positive conditional cache size: 5019, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5028, Positive cache size: 5028, Positive conditional cache size: 5021, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5030, Positive cache size: 5030, Positive conditional cache size: 5023, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5032, Positive cache size: 5032, Positive conditional cache size: 5025, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5034, Positive cache size: 5034, Positive conditional cache size: 5027, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5036, Positive cache size: 5036, Positive conditional cache size: 5029, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5038, Positive cache size: 5038, Positive conditional cache size: 5031, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5040, Positive cache size: 5040, Positive conditional cache size: 5033, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5042, Positive cache size: 5042, Positive conditional cache size: 5035, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5044, Positive cache size: 5044, Positive conditional cache size: 5037, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5046, Positive cache size: 5046, Positive conditional cache size: 5039, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5048, Positive cache size: 5048, Positive conditional cache size: 5041, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5050, Positive cache size: 5050, Positive conditional cache size: 5043, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5052, Positive cache size: 5052, Positive conditional cache size: 5045, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5054, Positive cache size: 5054, Positive conditional cache size: 5047, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5056, Positive cache size: 5056, Positive conditional cache size: 5049, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5058, Positive cache size: 5058, Positive conditional cache size: 5051, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5060, Positive cache size: 5060, Positive conditional cache size: 5053, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5062, Positive cache size: 5062, Positive conditional cache size: 5055, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5064, Positive cache size: 5064, Positive conditional cache size: 5057, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5066, Positive cache size: 5066, Positive conditional cache size: 5059, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5068, Positive cache size: 5068, Positive conditional cache size: 5061, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5070, Positive cache size: 5070, Positive conditional cache size: 5063, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5072, Positive cache size: 5072, Positive conditional cache size: 5065, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5074, Positive cache size: 5074, Positive conditional cache size: 5067, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5076, Positive cache size: 5076, Positive conditional cache size: 5069, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5078, Positive cache size: 5078, Positive conditional cache size: 5071, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5080, Positive cache size: 5080, Positive conditional cache size: 5073, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5082, Positive cache size: 5082, Positive conditional cache size: 5075, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5084, Positive cache size: 5084, Positive conditional cache size: 5077, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5086, Positive cache size: 5086, Positive conditional cache size: 5079, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5088, Positive cache size: 5088, Positive conditional cache size: 5081, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5090, Positive cache size: 5090, Positive conditional cache size: 5083, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5092, Positive cache size: 5092, Positive conditional cache size: 5085, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5094, Positive cache size: 5094, Positive conditional cache size: 5087, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5096, Positive cache size: 5096, Positive conditional cache size: 5089, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5098, Positive cache size: 5098, Positive conditional cache size: 5091, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5100, Positive cache size: 5100, Positive conditional cache size: 5093, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5102, Positive cache size: 5102, Positive conditional cache size: 5095, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5104, Positive cache size: 5104, Positive conditional cache size: 5097, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5106, Positive cache size: 5106, Positive conditional cache size: 5099, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5108, Positive cache size: 5108, Positive conditional cache size: 5101, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5110, Positive cache size: 5110, Positive conditional cache size: 5103, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5112, Positive cache size: 5112, Positive conditional cache size: 5105, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5114, Positive cache size: 5114, Positive conditional cache size: 5107, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5116, Positive cache size: 5116, Positive conditional cache size: 5109, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5118, Positive cache size: 5118, Positive conditional cache size: 5111, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5120, Positive cache size: 5120, Positive conditional cache size: 5113, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5122, Positive cache size: 5122, Positive conditional cache size: 5115, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5124, Positive cache size: 5124, Positive conditional cache size: 5117, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5126, Positive cache size: 5126, Positive conditional cache size: 5119, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5128, Positive cache size: 5128, Positive conditional cache size: 5121, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5130, Positive cache size: 5130, Positive conditional cache size: 5123, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5132, Positive cache size: 5132, Positive conditional cache size: 5125, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5134, Positive cache size: 5134, Positive conditional cache size: 5127, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5136, Positive cache size: 5136, Positive conditional cache size: 5129, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5138, Positive cache size: 5138, Positive conditional cache size: 5131, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5140, Positive cache size: 5140, Positive conditional cache size: 5133, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5142, Positive cache size: 5142, Positive conditional cache size: 5135, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5144, Positive cache size: 5144, Positive conditional cache size: 5137, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5146, Positive cache size: 5146, Positive conditional cache size: 5139, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5148, Positive cache size: 5148, Positive conditional cache size: 5141, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5150, Positive cache size: 5150, Positive conditional cache size: 5143, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5152, Positive cache size: 5152, Positive conditional cache size: 5145, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5154, Positive cache size: 5154, Positive conditional cache size: 5147, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5156, Positive cache size: 5156, Positive conditional cache size: 5149, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5158, Positive cache size: 5158, Positive conditional cache size: 5151, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5160, Positive cache size: 5160, Positive conditional cache size: 5153, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5162, Positive cache size: 5162, Positive conditional cache size: 5155, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5164, Positive cache size: 5164, Positive conditional cache size: 5157, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5166, Positive cache size: 5166, Positive conditional cache size: 5159, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5168, Positive cache size: 5168, Positive conditional cache size: 5161, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5170, Positive cache size: 5170, Positive conditional cache size: 5163, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5172, Positive cache size: 5172, Positive conditional cache size: 5165, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5174, Positive cache size: 5174, Positive conditional cache size: 5167, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5176, Positive cache size: 5176, Positive conditional cache size: 5169, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5178, Positive cache size: 5178, Positive conditional cache size: 5171, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5180, Positive cache size: 5180, Positive conditional cache size: 5173, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5182, Positive cache size: 5182, Positive conditional cache size: 5175, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5184, Positive cache size: 5184, Positive conditional cache size: 5177, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5186, Positive cache size: 5186, Positive conditional cache size: 5179, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5188, Positive cache size: 5188, Positive conditional cache size: 5181, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5190, Positive cache size: 5190, Positive conditional cache size: 5183, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5192, Positive cache size: 5192, Positive conditional cache size: 5185, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5194, Positive cache size: 5194, Positive conditional cache size: 5187, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5196, Positive cache size: 5196, Positive conditional cache size: 5189, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5198, Positive cache size: 5198, Positive conditional cache size: 5191, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5200, Positive cache size: 5200, Positive conditional cache size: 5193, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5202, Positive cache size: 5202, Positive conditional cache size: 5195, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5204, Positive cache size: 5204, Positive conditional cache size: 5197, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5206, Positive cache size: 5206, Positive conditional cache size: 5199, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5208, Positive cache size: 5208, Positive conditional cache size: 5201, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5210, Positive cache size: 5210, Positive conditional cache size: 5203, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5212, Positive cache size: 5212, Positive conditional cache size: 5205, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5214, Positive cache size: 5214, Positive conditional cache size: 5207, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5216, Positive cache size: 5216, Positive conditional cache size: 5209, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5218, Positive cache size: 5218, Positive conditional cache size: 5211, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5220, Positive cache size: 5220, Positive conditional cache size: 5213, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5222, Positive cache size: 5222, Positive conditional cache size: 5215, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5224, Positive cache size: 5224, Positive conditional cache size: 5217, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5226, Positive cache size: 5226, Positive conditional cache size: 5219, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5228, Positive cache size: 5228, Positive conditional cache size: 5221, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5230, Positive cache size: 5230, Positive conditional cache size: 5223, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5232, Positive cache size: 5232, Positive conditional cache size: 5225, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5234, Positive cache size: 5234, Positive conditional cache size: 5227, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5236, Positive cache size: 5236, Positive conditional cache size: 5229, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5238, Positive cache size: 5238, Positive conditional cache size: 5231, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5240, Positive cache size: 5240, Positive conditional cache size: 5233, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5242, Positive cache size: 5242, Positive conditional cache size: 5235, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5244, Positive cache size: 5244, Positive conditional cache size: 5237, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5246, Positive cache size: 5246, Positive conditional cache size: 5239, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5248, Positive cache size: 5248, Positive conditional cache size: 5241, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5250, Positive cache size: 5250, Positive conditional cache size: 5243, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5252, Positive cache size: 5252, Positive conditional cache size: 5245, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5254, Positive cache size: 5254, Positive conditional cache size: 5247, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5256, Positive cache size: 5256, Positive conditional cache size: 5249, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5258, Positive cache size: 5258, Positive conditional cache size: 5251, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5260, Positive cache size: 5260, Positive conditional cache size: 5253, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5262, Positive cache size: 5262, Positive conditional cache size: 5255, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5264, Positive cache size: 5264, Positive conditional cache size: 5257, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5266, Positive cache size: 5266, Positive conditional cache size: 5259, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5268, Positive cache size: 5268, Positive conditional cache size: 5261, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5270, Positive cache size: 5270, Positive conditional cache size: 5263, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5272, Positive cache size: 5272, Positive conditional cache size: 5265, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5274, Positive cache size: 5274, Positive conditional cache size: 5267, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5276, Positive cache size: 5276, Positive conditional cache size: 5269, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5278, Positive cache size: 5278, Positive conditional cache size: 5271, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5280, Positive cache size: 5280, Positive conditional cache size: 5273, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5282, Positive cache size: 5282, Positive conditional cache size: 5275, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5284, Positive cache size: 5284, Positive conditional cache size: 5277, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5286, Positive cache size: 5286, Positive conditional cache size: 5279, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5288, Positive cache size: 5288, Positive conditional cache size: 5281, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5290, Positive cache size: 5290, Positive conditional cache size: 5283, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5292, Positive cache size: 5292, Positive conditional cache size: 5285, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5294, Positive cache size: 5294, Positive conditional cache size: 5287, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5296, Positive cache size: 5296, Positive conditional cache size: 5289, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5298, Positive cache size: 5298, Positive conditional cache size: 5291, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5300, Positive cache size: 5300, Positive conditional cache size: 5293, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5302, Positive cache size: 5302, Positive conditional cache size: 5295, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5304, Positive cache size: 5304, Positive conditional cache size: 5297, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5306, Positive cache size: 5306, Positive conditional cache size: 5299, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5308, Positive cache size: 5308, Positive conditional cache size: 5301, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5310, Positive cache size: 5310, Positive conditional cache size: 5303, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5312, Positive cache size: 5312, Positive conditional cache size: 5305, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5314, Positive cache size: 5314, Positive conditional cache size: 5307, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5316, Positive cache size: 5316, Positive conditional cache size: 5309, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5318, Positive cache size: 5318, Positive conditional cache size: 5311, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5320, Positive cache size: 5320, Positive conditional cache size: 5313, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5322, Positive cache size: 5322, Positive conditional cache size: 5315, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5324, Positive cache size: 5324, Positive conditional cache size: 5317, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5326, Positive cache size: 5326, Positive conditional cache size: 5319, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5328, Positive cache size: 5328, Positive conditional cache size: 5321, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5330, Positive cache size: 5330, Positive conditional cache size: 5323, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5332, Positive cache size: 5332, Positive conditional cache size: 5325, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5334, Positive cache size: 5334, Positive conditional cache size: 5327, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5336, Positive cache size: 5336, Positive conditional cache size: 5329, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5338, Positive cache size: 5338, Positive conditional cache size: 5331, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5340, Positive cache size: 5340, Positive conditional cache size: 5333, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5342, Positive cache size: 5342, Positive conditional cache size: 5335, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5344, Positive cache size: 5344, Positive conditional cache size: 5337, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5346, Positive cache size: 5346, Positive conditional cache size: 5339, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5348, Positive cache size: 5348, Positive conditional cache size: 5341, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5350, Positive cache size: 5350, Positive conditional cache size: 5343, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5352, Positive cache size: 5352, Positive conditional cache size: 5345, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5354, Positive cache size: 5354, Positive conditional cache size: 5347, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5356, Positive cache size: 5356, Positive conditional cache size: 5349, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5358, Positive cache size: 5358, Positive conditional cache size: 5351, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5360, Positive cache size: 5360, Positive conditional cache size: 5353, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5362, Positive cache size: 5362, Positive conditional cache size: 5355, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5364, Positive cache size: 5364, Positive conditional cache size: 5357, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5366, Positive cache size: 5366, Positive conditional cache size: 5359, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5368, Positive cache size: 5368, Positive conditional cache size: 5361, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5370, Positive cache size: 5370, Positive conditional cache size: 5363, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5372, Positive cache size: 5372, Positive conditional cache size: 5365, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5374, Positive cache size: 5374, Positive conditional cache size: 5367, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5376, Positive cache size: 5376, Positive conditional cache size: 5369, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5378, Positive cache size: 5378, Positive conditional cache size: 5371, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5380, Positive cache size: 5380, Positive conditional cache size: 5373, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5382, Positive cache size: 5382, Positive conditional cache size: 5375, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5384, Positive cache size: 5384, Positive conditional cache size: 5377, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5386, Positive cache size: 5386, Positive conditional cache size: 5379, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5388, Positive cache size: 5388, Positive conditional cache size: 5381, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5390, Positive cache size: 5390, Positive conditional cache size: 5383, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5392, Positive cache size: 5392, Positive conditional cache size: 5385, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5394, Positive cache size: 5394, Positive conditional cache size: 5387, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5396, Positive cache size: 5396, Positive conditional cache size: 5389, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5398, Positive cache size: 5398, Positive conditional cache size: 5391, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5400, Positive cache size: 5400, Positive conditional cache size: 5393, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5402, Positive cache size: 5402, Positive conditional cache size: 5395, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5404, Positive cache size: 5404, Positive conditional cache size: 5397, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5406, Positive cache size: 5406, Positive conditional cache size: 5399, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5408, Positive cache size: 5408, Positive conditional cache size: 5401, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5410, Positive cache size: 5410, Positive conditional cache size: 5403, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5412, Positive cache size: 5412, Positive conditional cache size: 5405, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5414, Positive cache size: 5414, Positive conditional cache size: 5407, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5416, Positive cache size: 5416, Positive conditional cache size: 5409, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5418, Positive cache size: 5418, Positive conditional cache size: 5411, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5420, Positive cache size: 5420, Positive conditional cache size: 5413, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5422, Positive cache size: 5422, Positive conditional cache size: 5415, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5424, Positive cache size: 5424, Positive conditional cache size: 5417, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5426, Positive cache size: 5426, Positive conditional cache size: 5419, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5428, Positive cache size: 5428, Positive conditional cache size: 5421, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5430, Positive cache size: 5430, Positive conditional cache size: 5423, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5432, Positive cache size: 5432, Positive conditional cache size: 5425, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5434, Positive cache size: 5434, Positive conditional cache size: 5427, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5436, Positive cache size: 5436, Positive conditional cache size: 5429, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5438, Positive cache size: 5438, Positive conditional cache size: 5431, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5440, Positive cache size: 5440, Positive conditional cache size: 5433, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5442, Positive cache size: 5442, Positive conditional cache size: 5435, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5444, Positive cache size: 5444, Positive conditional cache size: 5437, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5446, Positive cache size: 5446, Positive conditional cache size: 5439, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5448, Positive cache size: 5448, Positive conditional cache size: 5441, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5450, Positive cache size: 5450, Positive conditional cache size: 5443, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5452, Positive cache size: 5452, Positive conditional cache size: 5445, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5454, Positive cache size: 5454, Positive conditional cache size: 5447, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5456, Positive cache size: 5456, Positive conditional cache size: 5449, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5458, Positive cache size: 5458, Positive conditional cache size: 5451, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5460, Positive cache size: 5460, Positive conditional cache size: 5453, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5462, Positive cache size: 5462, Positive conditional cache size: 5455, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5464, Positive cache size: 5464, Positive conditional cache size: 5457, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5466, Positive cache size: 5466, Positive conditional cache size: 5459, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5468, Positive cache size: 5468, Positive conditional cache size: 5461, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5470, Positive cache size: 5470, Positive conditional cache size: 5463, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5472, Positive cache size: 5472, Positive conditional cache size: 5465, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5474, Positive cache size: 5474, Positive conditional cache size: 5467, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5476, Positive cache size: 5476, Positive conditional cache size: 5469, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5478, Positive cache size: 5478, Positive conditional cache size: 5471, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5480, Positive cache size: 5480, Positive conditional cache size: 5473, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5482, Positive cache size: 5482, Positive conditional cache size: 5475, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5484, Positive cache size: 5484, Positive conditional cache size: 5477, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5486, Positive cache size: 5486, Positive conditional cache size: 5479, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5488, Positive cache size: 5488, Positive conditional cache size: 5481, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5490, Positive cache size: 5490, Positive conditional cache size: 5483, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5492, Positive cache size: 5492, Positive conditional cache size: 5485, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5494, Positive cache size: 5494, Positive conditional cache size: 5487, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5496, Positive cache size: 5496, Positive conditional cache size: 5489, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5498, Positive cache size: 5498, Positive conditional cache size: 5491, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5500, Positive cache size: 5500, Positive conditional cache size: 5493, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5502, Positive cache size: 5502, Positive conditional cache size: 5495, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5504, Positive cache size: 5504, Positive conditional cache size: 5497, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5506, Positive cache size: 5506, Positive conditional cache size: 5499, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5508, Positive cache size: 5508, Positive conditional cache size: 5501, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5510, Positive cache size: 5510, Positive conditional cache size: 5503, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5512, Positive cache size: 5512, Positive conditional cache size: 5505, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5514, Positive cache size: 5514, Positive conditional cache size: 5507, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5516, Positive cache size: 5516, Positive conditional cache size: 5509, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5518, Positive cache size: 5518, Positive conditional cache size: 5511, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5520, Positive cache size: 5520, Positive conditional cache size: 5513, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5522, Positive cache size: 5522, Positive conditional cache size: 5515, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5524, Positive cache size: 5524, Positive conditional cache size: 5517, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5526, Positive cache size: 5526, Positive conditional cache size: 5519, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5528, Positive cache size: 5528, Positive conditional cache size: 5521, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5530, Positive cache size: 5530, Positive conditional cache size: 5523, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5532, Positive cache size: 5532, Positive conditional cache size: 5525, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5534, Positive cache size: 5534, Positive conditional cache size: 5527, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5536, Positive cache size: 5536, Positive conditional cache size: 5529, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5538, Positive cache size: 5538, Positive conditional cache size: 5531, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5540, Positive cache size: 5540, Positive conditional cache size: 5533, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5542, Positive cache size: 5542, Positive conditional cache size: 5535, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5544, Positive cache size: 5544, Positive conditional cache size: 5537, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5546, Positive cache size: 5546, Positive conditional cache size: 5539, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5548, Positive cache size: 5548, Positive conditional cache size: 5541, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5550, Positive cache size: 5550, Positive conditional cache size: 5543, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5552, Positive cache size: 5552, Positive conditional cache size: 5545, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5554, Positive cache size: 5554, Positive conditional cache size: 5547, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5556, Positive cache size: 5556, Positive conditional cache size: 5549, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5558, Positive cache size: 5558, Positive conditional cache size: 5551, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5560, Positive cache size: 5560, Positive conditional cache size: 5553, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5562, Positive cache size: 5562, Positive conditional cache size: 5555, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5564, Positive cache size: 5564, Positive conditional cache size: 5557, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5566, Positive cache size: 5566, Positive conditional cache size: 5559, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5568, Positive cache size: 5568, Positive conditional cache size: 5561, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5570, Positive cache size: 5570, Positive conditional cache size: 5563, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5572, Positive cache size: 5572, Positive conditional cache size: 5565, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5574, Positive cache size: 5574, Positive conditional cache size: 5567, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5576, Positive cache size: 5576, Positive conditional cache size: 5569, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5578, Positive cache size: 5578, Positive conditional cache size: 5571, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5580, Positive cache size: 5580, Positive conditional cache size: 5573, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5582, Positive cache size: 5582, Positive conditional cache size: 5575, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5584, Positive cache size: 5584, Positive conditional cache size: 5577, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5586, Positive cache size: 5586, Positive conditional cache size: 5579, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5588, Positive cache size: 5588, Positive conditional cache size: 5581, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5590, Positive cache size: 5590, Positive conditional cache size: 5583, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5592, Positive cache size: 5592, Positive conditional cache size: 5585, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5594, Positive cache size: 5594, Positive conditional cache size: 5587, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5596, Positive cache size: 5596, Positive conditional cache size: 5589, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5598, Positive cache size: 5598, Positive conditional cache size: 5591, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5600, Positive cache size: 5600, Positive conditional cache size: 5593, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5602, Positive cache size: 5602, Positive conditional cache size: 5595, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5604, Positive cache size: 5604, Positive conditional cache size: 5597, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5606, Positive cache size: 5606, Positive conditional cache size: 5599, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5608, Positive cache size: 5608, Positive conditional cache size: 5601, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5610, Positive cache size: 5610, Positive conditional cache size: 5603, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5612, Positive cache size: 5612, Positive conditional cache size: 5605, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5614, Positive cache size: 5614, Positive conditional cache size: 5607, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5616, Positive cache size: 5616, Positive conditional cache size: 5609, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5618, Positive cache size: 5618, Positive conditional cache size: 5611, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5620, Positive cache size: 5620, Positive conditional cache size: 5613, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5622, Positive cache size: 5622, Positive conditional cache size: 5615, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5624, Positive cache size: 5624, Positive conditional cache size: 5617, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5626, Positive cache size: 5626, Positive conditional cache size: 5619, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5628, Positive cache size: 5628, Positive conditional cache size: 5621, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5630, Positive cache size: 5630, Positive conditional cache size: 5623, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5632, Positive cache size: 5632, Positive conditional cache size: 5625, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5634, Positive cache size: 5634, Positive conditional cache size: 5627, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5636, Positive cache size: 5636, Positive conditional cache size: 5629, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5638, Positive cache size: 5638, Positive conditional cache size: 5631, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5640, Positive cache size: 5640, Positive conditional cache size: 5633, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5642, Positive cache size: 5642, Positive conditional cache size: 5635, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5644, Positive cache size: 5644, Positive conditional cache size: 5637, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5646, Positive cache size: 5646, Positive conditional cache size: 5639, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5648, Positive cache size: 5648, Positive conditional cache size: 5641, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5650, Positive cache size: 5650, Positive conditional cache size: 5643, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5652, Positive cache size: 5652, Positive conditional cache size: 5645, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5654, Positive cache size: 5654, Positive conditional cache size: 5647, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5656, Positive cache size: 5656, Positive conditional cache size: 5649, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5658, Positive cache size: 5658, Positive conditional cache size: 5651, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5660, Positive cache size: 5660, Positive conditional cache size: 5653, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5662, Positive cache size: 5662, Positive conditional cache size: 5655, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5664, Positive cache size: 5664, Positive conditional cache size: 5657, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5666, Positive cache size: 5666, Positive conditional cache size: 5659, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5668, Positive cache size: 5668, Positive conditional cache size: 5661, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5670, Positive cache size: 5670, Positive conditional cache size: 5663, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5672, Positive cache size: 5672, Positive conditional cache size: 5665, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5674, Positive cache size: 5674, Positive conditional cache size: 5667, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5676, Positive cache size: 5676, Positive conditional cache size: 5669, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5678, Positive cache size: 5678, Positive conditional cache size: 5671, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5680, Positive cache size: 5680, Positive conditional cache size: 5673, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5682, Positive cache size: 5682, Positive conditional cache size: 5675, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5684, Positive cache size: 5684, Positive conditional cache size: 5677, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5686, Positive cache size: 5686, Positive conditional cache size: 5679, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5688, Positive cache size: 5688, Positive conditional cache size: 5681, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5690, Positive cache size: 5690, Positive conditional cache size: 5683, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5692, Positive cache size: 5692, Positive conditional cache size: 5685, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5694, Positive cache size: 5694, Positive conditional cache size: 5687, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5696, Positive cache size: 5696, Positive conditional cache size: 5689, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5698, Positive cache size: 5698, Positive conditional cache size: 5691, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5700, Positive cache size: 5700, Positive conditional cache size: 5693, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5702, Positive cache size: 5702, Positive conditional cache size: 5695, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5704, Positive cache size: 5704, Positive conditional cache size: 5697, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5706, Positive cache size: 5706, Positive conditional cache size: 5699, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5708, Positive cache size: 5708, Positive conditional cache size: 5701, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5710, Positive cache size: 5710, Positive conditional cache size: 5703, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5712, Positive cache size: 5712, Positive conditional cache size: 5705, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5714, Positive cache size: 5714, Positive conditional cache size: 5707, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5716, Positive cache size: 5716, Positive conditional cache size: 5709, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5718, Positive cache size: 5718, Positive conditional cache size: 5711, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5720, Positive cache size: 5720, Positive conditional cache size: 5713, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5722, Positive cache size: 5722, Positive conditional cache size: 5715, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5724, Positive cache size: 5724, Positive conditional cache size: 5717, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5726, Positive cache size: 5726, Positive conditional cache size: 5719, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5728, Positive cache size: 5728, Positive conditional cache size: 5721, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5730, Positive cache size: 5730, Positive conditional cache size: 5723, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5732, Positive cache size: 5732, Positive conditional cache size: 5725, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5734, Positive cache size: 5734, Positive conditional cache size: 5727, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5736, Positive cache size: 5736, Positive conditional cache size: 5729, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5738, Positive cache size: 5738, Positive conditional cache size: 5731, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5740, Positive cache size: 5740, Positive conditional cache size: 5733, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5742, Positive cache size: 5742, Positive conditional cache size: 5735, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5744, Positive cache size: 5744, Positive conditional cache size: 5737, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5746, Positive cache size: 5746, Positive conditional cache size: 5739, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5748, Positive cache size: 5748, Positive conditional cache size: 5741, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5750, Positive cache size: 5750, Positive conditional cache size: 5743, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5752, Positive cache size: 5752, Positive conditional cache size: 5745, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5754, Positive cache size: 5754, Positive conditional cache size: 5747, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5756, Positive cache size: 5756, Positive conditional cache size: 5749, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5758, Positive cache size: 5758, Positive conditional cache size: 5751, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5760, Positive cache size: 5760, Positive conditional cache size: 5753, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5762, Positive cache size: 5762, Positive conditional cache size: 5755, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5764, Positive cache size: 5764, Positive conditional cache size: 5757, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5766, Positive cache size: 5766, Positive conditional cache size: 5759, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5768, Positive cache size: 5768, Positive conditional cache size: 5761, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5770, Positive cache size: 5770, Positive conditional cache size: 5763, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5772, Positive cache size: 5772, Positive conditional cache size: 5765, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5774, Positive cache size: 5774, Positive conditional cache size: 5767, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5776, Positive cache size: 5776, Positive conditional cache size: 5769, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5778, Positive cache size: 5778, Positive conditional cache size: 5771, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5780, Positive cache size: 5780, Positive conditional cache size: 5773, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5782, Positive cache size: 5782, Positive conditional cache size: 5775, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5784, Positive cache size: 5784, Positive conditional cache size: 5777, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 33 PlacesBefore, 32 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5786, Positive cache size: 5786, Positive conditional cache size: 5779, Positive unconditional cache size: 7, 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: 0 - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while QuantifierPusher was running 1 iterations on subformula. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while QuantifierPusher was running 1 iterations on subformula. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 97 locations, 3 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: 715.9s, OverallIterations: 2889, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 157.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34698 SdHoareTripleChecker+Valid, 122.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34698 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 101.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 5772 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275100 IncrementalHoareTripleChecker+Invalid, 280872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5772 mSolverCounterUnsat, 10 mSDtfsCounter, 275100 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8677 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8677 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=15, InterpolantAutomatonStates: 14451, 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: 1.5s SsaConstructionTime, 7.3s SatisfiabilityAnalysisTime, 141.1s InterpolantComputationTime, 31785 NumberOfCodeBlocks, 31785 NumberOfCodeBlocksAsserted, 2889 NumberOfCheckSat, 28896 ConstructedInterpolants, 0 QuantifiedInterpolants, 273763 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2889 InterpolantComputations, 2889 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